摘要：
UntitledAccepts: 504Submissions: 1542Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionThere is an int... 阅读全文
posted @ 2015-08-30 18:49
cyd2014
阅读(198)
评论(0)
推荐(0)
摘要：
The mook jongAccepts: 506Submissions: 1281Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionZJiaQ want... 阅读全文
posted @ 2015-08-30 18:47
cyd2014
阅读(140)
评论(0)
推荐(0)
摘要：
Distribution moneyAccepts: 713Submissions: 1881Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionAFA w... 阅读全文
posted @ 2015-08-30 18:46
cyd2014
阅读(196)
评论(0)
推荐(0)
摘要：
1 #include 2 #include 3 #include 4 #include 5 using namespace std; 6 7 int main() 8 { 9 vectoredg[1005];10 int n;11 int u,v;12 i... 阅读全文
posted @ 2015-08-30 18:42
cyd2014
阅读(118)
评论(0)
推荐(0)
摘要：
1 #include 2 #include 3 #include 4 #include 5 using namespace std; 6 int main() 7 { 8 stack s; 9 s.push(1);10 s.push(2);11 s.pus... 阅读全文
posted @ 2015-08-30 18:41
cyd2014
阅读(113)
评论(0)
推荐(0)
摘要：
1 #include 2 #include 3 #include 4 #include 5 using namespace std; 6 7 int main() 8 { 9 queue que;10 while(que.size())11 que.po... 阅读全文
posted @ 2015-08-30 18:40
cyd2014
阅读(130)
评论(0)
推荐(0)
摘要：
1 #include 2 #include 3 #include 4 using namespace std; 5 6 int perm[1005]; 7 //生成1~n的n！种排列 8 void permutation(int n) 9 {10 for(int i=1;i<=n;... 阅读全文
posted @ 2015-08-30 18:39
cyd2014
阅读(134)
评论(0)
推荐(0)
摘要：
1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 using namespace std; 8 9 map a;10 map m;11 12 int main()13 {14 int n... 阅读全文
posted @ 2015-08-30 18:38
cyd2014
阅读(105)
评论(0)
推荐(0)
摘要：
1 #include 2 #include 3 #include 4 using namespace std; 5 6 int main() 7 { 8 int n,z; 9 int i,j,k;10 int a[1005];11 scanf("%d",&n... 阅读全文
posted @ 2015-08-30 18:37
cyd2014
阅读(132)
评论(0)
推荐(0)
摘要：
C. Bear and Pokertime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLimak is an old brown bear. He ... 阅读全文
posted @ 2015-08-30 14:06
cyd2014
阅读(308)
评论(0)
推荐(0)