Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
2
#include <iostream> using namespace std; int main() { int ile=0; scanf("%d",&ile); for(int i=0; i<ile; i++) { int liczba=0; scanf("%d",&liczba); int tab[44]; int wynik=0; for(int n=1; n<=liczba; n++) { if(n<=3) { tab[n]=n; } else { tab[n]=(2*tab[n-2]+3*tab[n-1]+5)%987; } wynik = tab[liczba]; } printf("%d\n",wynik); } }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
member initial list
dsu on tree(264E BLOOD COUSIN RETURNS)
Listas enlazadas - Generar lista con repetidos
code
Sort 0's 1's 2's
D. Traveling Graph
5345
XML parsing with regex
134
OOP
Please log in to post a comment.