| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
非常规版本提交了两个版本,都是超时。本机测试只有0.33和0.09,无奈只好玩个非常规的。
#include<cstdio>
using namespace std;
int a[]={2,7,5,30,169,441,1872,7632,1740,93313,459901,
1358657,2504881};
int main(){
int k;
scanf("%d",&k);
while(k!=0){
printf("%d\n",a[k-1]);scanf("%d",&k);
}
return 0;
}
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator