Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Kolokwium_2011_z12
#include <iostream> using namespace std; int A(int m) { if (m == 0) {return 0;} else if (m == 1) {return 1;} else {return A(m-1)-2*A(m-2)+m;} } int main() { int ile = 0; scanf("%d",&ile); int test = 0; for(int i = 0; i < ile; i++) { scanf("%d",&test); int wynik = A(test); printf("%d\n",wynik); } }
run
|
edit
|
history
|
help
0
Bin Tree build
printAllPathsInMatrix
Ineritance
cppPyGuessTheNum2
Ploshtina na pravoagolnik
diamond
an awesome question of basic graph traversal (786A)
C++ User Input #1
temp_new
BubbleDouble