#include<cstdio>

double t;

int n,i;

int main()

{

 freopen("p1.in","r",stdin);

 freopen("p1.out","w",stdout);

 for(i=scanf("%d",&n);t<=n;t+=1.0/i++);

 printf("%d",i-1);

}

为什么我的笨小猴跟你们的不一样。。。

#include<cstdio>

#include<algorithm>

using namespace std;

char in[110];

int m1=-200,m2=200,i,a[27],t;

int main(){

 freopen("word.in","r",stdin);

 freopen("word.out","w",stdout);

 for(i=0*scanf("%s",in);in[i]!='\0';a[in[i++]-'a']++);

 for(i=0;i<26;m1=max(m1,a[i]),m2=a[i++]?min(m2,a[i-1]):m2);

 for(t=m1-m2,i=2;t%i&&i<=t;i++);

 printf("%s\n%d",i==t?"Lucky Word":"No Answer",i==t?t:0);

}

#include <cstdio>
#define f(a,b) out[a][b]=k
#define A h[k-1]
#define B l[k-1]
#define C h[k]
#define D l[k]
int h[1600],l[1600],out[40][40],k=1,n,_;
int main()
{
freopen("2015magic.in","r",stdin);
freopen("2015magic.out","w",stdout);
scanf("%d",&n);_=n*n;
f(h[1]=1,l[1]=1+n>>1);
for(;++k<=_;A==1?B==n?f(C=A+1,D=B):f(C=n,D=B+1):B==n?f(C=A-1,D=1):out[A-1][B+1]?f(C=A+1,D=B):f(C=A-1,D=B+1));
for(k=0;++k<=n;printf("\n"))
for(_=0;++_<=n;printf("%d ",out[k][_]));
}
估计没人看的懂。。。。。。