上一页 1 ··· 22 23 24 25 26
摘要: 1..int 最大可以表示20亿多一点,也就是十位数,在32位的情况下,而long long 最大可以表示9223372036854775807共19位数 阅读全文
posted @ 2015-11-04 20:06 快点说我帅 阅读(214) 评论(0) 推荐(0)
摘要: Tiling_easy version Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 585 Accepted S... 阅读全文
posted @ 2015-11-04 20:03 快点说我帅 阅读(245) 评论(0) 推荐(0)
摘要: Buy the Ticket Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5566 Accepted Submission... 阅读全文
posted @ 2015-11-04 18:52 快点说我帅 阅读(149) 评论(0) 推荐(0)
摘要: #include#includeusing namespace std;long long dp[38][38];int main(){ for(int i=0;i #include using namespace std; long long h[38]; int main(... 阅读全文
posted @ 2015-11-01 11:14 快点说我帅 阅读(96) 评论(0) 推荐(0)
摘要: How Many Trees? Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1105 Accepted Subm... 阅读全文
posted @ 2015-10-31 21:33 快点说我帅 阅读(119) 评论(0) 推荐(0)
摘要: #include #include #include using namespace std; int main() { int i,n,cas; double f; cin>>cas; while(cas--) { f=0.0; ... 阅读全文
posted @ 2015-10-30 22:39 快点说我帅 阅读(125) 评论(0) 推荐(0)
摘要: #include #include using namespace std; char str[10001]; int main() { while(~scanf("%s",&str)&&str[0]!='0') { int ans=0; for(... 阅读全文
posted @ 2015-10-29 08:13 快点说我帅 阅读(94) 评论(0) 推荐(0)
摘要: #include #include #include #include using namespace std; int f[10001]; int main() { int a,b,n; f[2]=f[1]=1; while(~scanf("%d %d %d",&a,&... 阅读全文
posted @ 2015-10-28 20:42 快点说我帅 阅读(91) 评论(0) 推荐(0)
上一页 1 ··· 22 23 24 25 26