| ||||||||||
| 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 | |||||||||
在服务器上打表,125ms代码~还可以再快的,但懒得改了
#include<stdio.h>
int a[20];
int main()
{
int k,i,temp,n,j;
bool flag;
for (k=1;k<14;k++)
{
n=k;
flag=false;
while(!flag)
{
temp=(n-1)%(2*k);
if (temp>=k&&(n%(k+1)==0||n%(k+1)==1)) flag=true;
else
{
n++;
continue;
}
for (i=1;i<k;i++)
{
temp=(n-1-2*k+i+temp)%(2*k-i);
if (temp<k)
{
flag=false;
break;
}
}
if(!flag) n++;
}
a[k]=n;
}
while(scanf("%d",&k)&&k)
{
printf("%d\n",a[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