摘要:
1 //递归之美^_^ 2 #include 3 int change(int,int); 4 int main() 5 { 6 int m,n; 7 while(~scanf("%d%d",&m,&n) && m+n) 8 printf("%d\n",change(m,0)+change(n,0)); 9 } 10 11 int change... 阅读全文
posted @ 2017-02-02 20:55
Posase
阅读(169)
评论(0)
推荐(0)
摘要:
1 #include 2 int main() 3 { 4 int n,k; 5 while(~scanf("%d%d",&n,&k)) 6 printf("%d\n",n<k?2:(n*2/k+(n*2%k?1:0))); 7 } 阅读全文
posted @ 2017-02-02 16:05
Posase
阅读(117)
评论(0)
推荐(0)
摘要:
1 #include 2 int main() 3 { 4 int n; 5 scanf("%d",&n); 6 while(n--) 7 { 8 int h; 9 scanf("%d",&h); 10 if(h<=10) 11 puts("1"); 12 e... 阅读全文
posted @ 2017-02-02 13:18
Posase
阅读(112)
评论(0)
推荐(0)
摘要:
1 #include 2 char roma[12][5]= {"I","II","III","IV","V","VI","VII","VIII","IX","X","XI","XII"}; 3 char s[5]; 4 void seek(); 5 int check(char*); 6 int main() 7 { 8 int n=1; 9 while( 阅读全文
posted @ 2017-02-02 13:11
Posase
阅读(185)
评论(0)
推荐(0)
摘要:
1 //关于浮点数的比较,相减的差小于精度可以认为近似相等 2 #include 3 #define jd 1e-4 4 int main() 5 { 6 int n; 7 scanf("%d",&n); 8 while(n--) 9 { 10 double a,b,c; 11 scanf("%lf%lf%lf",... 阅读全文
posted @ 2017-02-02 12:46
Posase
阅读(125)
评论(0)
推荐(0)
摘要:
1 #include 2 int main() 3 { 4 int n; 5 scanf("%d",&n); 6 for(int t=0; t<n; ++t) 7 { 8 if(t) 9 puts(""); 10 int m; 11 scanf("%d",&m); 12 ... 阅读全文
posted @ 2017-02-02 12:16
Posase
阅读(175)
评论(0)
推荐(0)
摘要:
1 #include 2 int main() 3 { 4 int n,m; 5 scanf("%d",&n); 6 while(n--) 7 { 8 scanf("%d",&m); 9 printf("%d\n",m); 10 } 11 } 阅读全文
posted @ 2017-02-02 11:46
Posase
阅读(131)
评论(0)
推荐(0)
摘要:
1 #include 2 int main() 3 { 4 int n,b; 5 while(~scanf("%d%d",&n,&b)) 6 printf("%d\n",n/b); 7 } 阅读全文
posted @ 2017-02-02 11:35
Posase
阅读(121)
评论(0)
推荐(0)
摘要:
1 //A~Z是从大到小。。。 2 #include 3 int main() 4 { 5 int n; 6 char a,b; 7 scanf("%d",&n); 8 while(n--) 9 { 10 getchar(); 11 scanf("%c %c",&a,&b); 12 if(a... 阅读全文
posted @ 2017-02-02 00:23
Posase
阅读(170)
评论(0)
推荐(0)
摘要:
1 //这是自己写的代码。。。很蠢,下附一dalao代码,又少,又快。。。。 2 #include 3 int ant(int,int); 4 void ans(int,int); 5 int main() 6 { 7 int n; 8 while(~scanf("%d",&n)) 9 { 10 if(n 3 void ans(int)... 阅读全文
posted @ 2017-02-02 00:01
Posase
阅读(164)
评论(0)
推荐(0)