～～zcy

摘要： DescriptionKostya likes Codeforces contests very much. However, he is very disappointed that his solutions are frequently hacked. That... 阅读全文

posted @ 2018-03-31 20:54 ～～zcy 阅读(147) 评论(0) 推荐(0)

摘要： DescriptionMisha and Vanya have played several table tennis sets. Each set consists of several serves, each serve is won by one of the... 阅读全文

posted @ 2018-03-31 20:32 ～～zcy 阅读(159) 评论(0) 推荐(0)

摘要：对于我们来说求两个数的LCM（最小公倍数）是很容易的事，现在我遇到了一个问题需要大家帮助我来解决这问题，问题是：给你一个数n，然后统计有多少对(a#include #include int main(){ int n,i,j,k,s[1000]; while... 阅读全文

posted @ 2018-03-30 18:03 ～～zcy 阅读(198) 评论(0) 推荐(0)

摘要： 1.输入.123456 输出0.123456#include int main(){ char s[7]; int i,sum=0; float x=0,k=0.1; gets(s); for(i=1;s[i];i++) { ... 阅读全文

posted @ 2018-03-30 16:56 ～～zcy 阅读(340) 评论(0) 推荐(0)

摘要： #include #include #include int main(){ int n,i,k; srand(time(NULL)); n=rand()%101; for(i=1;in) ... 阅读全文

posted @ 2018-03-30 16:42 ～～zcy 阅读(569) 评论(0) 推荐(0)

摘要： There are two circles in the plane (shown in the below picture), there is a common area between the two circles. The problem is easy ... 阅读全文

posted @ 2018-03-29 20:48 ～～zcy 阅读(248) 评论(0) 推荐(0)

摘要：总是runtime 终于对了Sample InputInput46 -3 0 4Output2 1Input3-2 0 2Output2 2 #include using namespace std;#include #include #include int a[... 阅读全文

posted @ 2018-03-29 19:44 ～～zcy 阅读(103) 评论(0) 推荐(0)

摘要： https://my.csdn.net/septembre_注意：1 例如 5 5 5 9 9 9 其中就没有众数而 5 5 5 9 9 9 7就存在众数 5 9#include int main(){ int a[3333],n,i,flag[3333]={... 阅读全文

posted @ 2018-03-29 17:38 ～～zcy 阅读(240) 评论(0) 推荐(0)

摘要： 1.对称博弈Problem DescriptionAfter hh has learned how to play Nim game, he begins to try another coin game which seems much easier.The gam... 阅读全文

posted @ 2018-03-27 20:23 ～～zcy 阅读(135) 评论(0) 推荐(0)

摘要：鞍点Description找出具有m行n列二维数组Array的“鞍点”，即该位置上的元素在该行上最大，在该列上最小，其中1int main(){ int a[11][11],i,j,l=0,k,m,n,max=0,min=0; scanf("%d%d",&... 阅读全文

posted @ 2018-03-27 20:05 ～～zcy 阅读(687) 评论(0) 推荐(0)

更多博文请看https://blog.csdn.net/ZCY19990813