比赛 |
20111108 |
评测结果 |
AAAWWWWWWW |
题目名称 |
分裂 |
最终得分 |
30 |
用户昵称 |
wk_noi |
运行时间 |
0.000 s |
代码语言 |
Pascal |
内存使用 |
0.00 MiB |
提交时间 |
2011-11-08 11:14:10 |
显示代码纯文本
Program mushroom(input);
Type
aa=array[1..10]of int64;
Const
a0:aa=(1,3,3,6,10,20,35,70,126,252);
a1:aa=(462,924,1716,3432,6435,12870,24310,48620,92378,184756);
a2:aa=(352716,705432,1352078,2704156,5200300,10400600,20058300,40116600,77558760,155117520);
a3:aa=(300540195,601080390,1166803110,2333606220,4537567650,9075135300,17672631900,35345263800,68923264410,137846528820);
a4:aa=(269128937220,538257874440,1052049481860,2104098963720,4116715363800,8233430727600,16123801841550,32247603683100,63205303218876,126410606437752);
a5:aa=(247959266474052,495918532948104,973469712824056,1946939425648112,3824345300380220,7648690600760440,15033633249770520,30067266499541040,59132290782430712,118264581564861424);
a6:aa=(232714176627630544,465428353255261088,916312070471295267,1832624140942590534,3609714217008132870,7219428434016265740,0,0,0,0);
Var
n,i,j:longint;
Begin
assign(input,'mushroom.in');
assign(output,'mushroom.out');
reset(input);
rewrite(output);
readln(n);
if n>66 then
begin
writeln('no');
close(input);
close(output);
halt;
end;
i:=n div 10;
j:=n mod 10;
case i of
0:writeln(a0[j]);
1:writeln(a1[j]);
2:writeln(a2[j]);
3:writeln(a3[j]);
4:writeln(a4[j]);
5:writeln(a5[j]);
6:writeln(a6[j]);
7:writeln(0);
end;
close(input);
close(output);
End.