1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
| /*
#include<iostream>
using namespace std;
int f(int n)
{
if(n%2) return n==1?1:n*f(n-2);
return f(n-1);
}
int g(int n)
{
return n?g(n-1)+f(n):0;
}
int main()
{
int n,m;
cin>>n;
while(n--)
{
cin>>m;
cout<<g(m)<<endl;
}
}*/
#include<iostream>
using namespace std;
int main() {
int n,m,r[]= {0,1,2,5,8,23,38,143,248,1193,2138,12533,22928,158063,293198,2320223,4347248,38806673,73266098,727995173,1382724248};
cin>>n;
while(n--) {
cin>>m;
cout<<r[m]<<endl;
}
}
|