lc311309010103的专栏

#include int main() {     int n,m,y;     while(scanf("%d",&y)!=EOF)     {       while(y--)       {       scanf("%d%d",&n,&m);       if(n%(m+1)==0)       printf("Rabbit\n");       else     

不容易系列之(3)—— LELE的RPG难题 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 29436    Accepted Submission(s): 11810 Problem Description 人称“

阿牛的EOF牛肉串 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 20424    Accepted Submission(s): 9583 Problem Description 今年的ACM暑期集训队一共有18人

#include #include int main() { int n,i,t,j; __int64 a[40][40]; memset(a,0,sizeof(a)); a[1][1]=1; for(i=2;i<=36;i++) for(j=1;j<=i;j++) a[i][j]=a[i-1][j]+a[i][j-1]; t=0; wh

#include #include int main() { int n,t; __int64 s; while(scanf("%d",&t)!=EOF) { while(t--) { scanf("%d",&n); s=pow(3,n-1); printf("%I64d\n",s+

Tiling_easy version Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5042    Accepted Submission(s): 3979 Problem Description 有一个大小是 2

#include int main() { int n,i; __int64 a[21]; while(scanf("%d",&n)!=EOF) { a[0]=1; a[1]=2; for(i=2;i<20;i++) a[i]=(i+1)*(a[i-1]+a[i-2]);

#include int main() { int n,i,a[60]; a[0]=1; a[1]=2; a[2]=3; for(i=3;i<56;i++) a[i]=a[i-1]+a[i-3]; while(scanf("%d",&n)!=EOF&&(n!=0)) printf("%d\n",a[n-1]); return 0;

改革春风吹满地 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 18631    Accepted Submission(s): 9544 Problem Description “ 改革春风吹满地, 不会AC没关系

DFS Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5046    Accepted Submission(s): 3112 Problem Description A DFS(digital factorial su

#include __int64 fun(int n) { int i; if(n==1) return 2; return fun(n-1)*3+2; } int main() { int n; while(scanf("%d",&n)!=EOF) printf("%I64d\n",fun(n)); ret

#include int main() { int t,i,n; __int64 a[50]; while(scanf("%d",&t)!=EOF) { while(t--) { scanf("%d",&n); a[1]=3; a[2]=9; for(i=3;i<40

一只小蜜蜂... Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 38156    Accepted Submission(s): 14081 Problem Description 有一只经过训练的蜜蜂只能爬向右侧相邻的

#include int main() { int n,m,i,j,p; while(scanf("%d%d",&n,&m)!=EOF&&(m!=0||n!=0)) { j=0; if(m<0) { m=-m; j=1; } for(i=-m;i<=m;i++)

#include int main() {     int t,n;     __int64 a;     while(scanf("%d",&t)!=EOF)     {     while(t--)     {       scanf("%d",&n);       a=2*n*n-n+1;       printf("%I64d\n",a);       }   

#include int main() {   int t,n;   while(scanf("%d",&t)!=EOF)   {      while(t--)      {                scanf("%d",&n);                int c;                c=n*n%10000;               prin

#include int main() {     int n,m,t;     while(scanf("%d%",&t)!=EOF)     {      while(t--)      {                scanf("%d%d",&n,&m);                printf("%d\n",(n+1)*n/2*(m+1)*m/2);      

#include int main() { int t,n,i,a[40];        while(scanf("%d",&t)!=EOF)     {      while(t--)      {        scanf("%d",&n);        a[0]=0;        a[1]=1;        a[2]=3;        a[3]=5;  

Good Luck in CET-4 Everybody! Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5128    Accepted Submission(s): 3282 Problem Description

An easy problem Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 13687    Accepted Submission(s): 9238 Problem Description we define f

汉诺塔V Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2431    Accepted Submission(s): 1435 Problem Description 用1,2,...,n表示n个盘子，称为1号盘，

#include int main() {     int t,n;     int a[21]={0,1,4,7,6,5,6,3,6,9,0,1,6,3,6,5,6,7,4,9,0};     while(scanf("%d",&t)!=EOF)     {      while(t--)      {        int p=1;        scanf("%d",&n

#include #include int main() {     int n;     double  t,h,h1;     while(scanf("%d",&n)!=EOF)     {       while(n--)       {       scanf("%lf%lf%lf",&h,&t,&h1);       printf("%.1f\n",t/log(h

#include int main() {     int n,i;     int a[60];     while(scanf("%d",&n)!=EOF&&(n!=0))     {       for(i=1;i       {       if(i        a[i]=i;        else        a[i]=a[i-1]+a[i-3];    

#include #include int main() {     int t,n;     while(scanf("%d",&t)!=EOF)     {     while(t--)     {               scanf("%d",&n);               printf("%.0f\n",pow(3,n));//注意%.0f        

#include int main() { int t,n,i; int a[30]={0}; while(scanf("%d",&t)!=EOF) { while(t--) { a[1]=1; a[2]=2; for(i=3;i<20;i++) a[i]=a[i-1]+

#include int a[200010]; int main() { int n,m,s,i; while(scanf("%d",&n)!=EOF&&(n!=0)) { for(i=0,s=0;i<n;i++) { scanf("%d",&a[i]); s=s^a[i]; } if(s==0)

#include int main() {   int n;   while(scanf("%d",&n)!=EOF)   {   if(n%4==2)   printf("yes\n");   else   printf("no\n"); } return 0;    }

#include int main() { int t,n,i,p; while(scanf("%d",&t)!=EOF) { while(t--) { p=1; scanf("%d",&n); for(i=0;i<n;i++) p*=2; pr

#include #include int main() {     int t,n;     int a[30];     while(scanf("%d",&t)!=EOF)     {      while(t--)      {       scanf("%d",&n);       a[n]=pow(2,n-1)*(n+1)/2;       printf("%d

骨牌铺方格 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 28474    Accepted Submission(s): 13807 Problem Description 在2×n的一个长方形方格中,用一个1×