https://blog.youkuaiyun.com/Cwsy_Czh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/Cwsy_C/article/details/89499630https://blog.youkuaiyun.com/Cwsy_C/article/details/89499630Cwsy_CWed, 24 Apr 2019 17:54:50 +0800https://blog.youkuaiyun.com/Cwsy_C/article/details/78682021https://blog.youkuaiyun.com/Cwsy_C/article/details/78682021Cwsy_CThu, 30 Nov 2017 22:49:50 +0800https://blog.youkuaiyun.com/Cwsy_C/article/details/78671419https://blog.youkuaiyun.com/Cwsy_C/article/details/78671419Cwsy_CWed, 29 Nov 2017 23:51:33 +0800https://blog.youkuaiyun.com/Cwsy_C/article/details/78578532https://blog.youkuaiyun.com/Cwsy_C/article/details/78578532Cwsy_CMon, 20 Nov 2017 00:23:31 +0800 void sortNum(int* a, int* b, int* c, int* d); int main() { int N, a, b, c, d, max, min, num; scanf("%d", &N); while(1) { a = N / 1000; b = N % 1000 / 100;]]>https://blog.youkuaiyun.com/Cwsy_C/article/details/78376416https://blog.youkuaiyun.com/Cwsy_C/article/details/78376416Cwsy_CSat, 28 Oct 2017 15:43:08 +0800https://blog.youkuaiyun.com/Cwsy_C/article/details/78369101https://blog.youkuaiyun.com/Cwsy_C/article/details/78369101Cwsy_CFri, 27 Oct 2017 21:00:38 +0800https://blog.youkuaiyun.com/Cwsy_C/article/details/78359128https://blog.youkuaiyun.com/Cwsy_C/article/details/78359128Cwsy_CThu, 26 Oct 2017 21:45:50 +0800https://blog.youkuaiyun.com/Cwsy_C/article/details/78357252https://blog.youkuaiyun.com/Cwsy_C/article/details/78357252Cwsy_CThu, 26 Oct 2017 18:32:05 +08000）个整数，在不允许使用另外数组的前提下，将每个整数循环向右移M（M>=0）个位置，即将A中的数据由（A0 A1……AN-1）变换为（AN-M …… AN-1 A0 A1……AN-M-1）（最后M个数循环移至最前面的M个位置）。如果需要考虑程序移动数据的次数尽量少，要如何设计移动的方法？输入格式：每个输入包含一个测试用例，第1行输入N ( 1<=N<=100)、M（M>=0）]]>https://blog.youkuaiyun.com/Cwsy_C/article/details/78355792https://blog.youkuaiyun.com/Cwsy_C/article/details/78355792Cwsy_CThu, 26 Oct 2017 16:49:19 +08001有 dn 是偶数。“素数对猜想”认为“存在无穷多对相邻且差为2的素数”。现给定任意正整数N (< 105)，请计算不超过N的满足猜想的素数对的个数。输入格式：每个测试输入包含1个测试用例，给出正整数N。输出格式：每个测试用例的输出占一行，不超过N的满足猜想的素数对的个数。输入样例： 20]]>https://blog.youkuaiyun.com/Cwsy_C/article/details/78348294https://blog.youkuaiyun.com/Cwsy_C/article/details/78348294Cwsy_CWed, 25 Oct 2017 23:52:40 +0800int main() { int a[10]; int i=0,j=0,m=0,n=0,s=0; scanf("%]]>https://blog.youkuaiyun.com/Cwsy_C/article/details/78347555https://blog.youkuaiyun.com/Cwsy_C/article/details/78347555Cwsy_CWed, 25 Oct 2017 22:20:31 +0800https://blog.youkuaiyun.com/Cwsy_C/article/details/78335257https://blog.youkuaiyun.com/Cwsy_C/article/details/78335257Cwsy_CTue, 24 Oct 2017 21:50:09 +0800https://blog.youkuaiyun.com/Cwsy_C/article/details/78331822https://blog.youkuaiyun.com/Cwsy_C/article/details/78331822Cwsy_CTue, 24 Oct 2017 17:09:30 +0800https://blog.youkuaiyun.com/Cwsy_C/article/details/78323525https://blog.youkuaiyun.com/Cwsy_C/article/details/78323525Cwsy_CMon, 23 Oct 2017 21:20:37 +0800https://blog.youkuaiyun.com/Cwsy_C/article/details/78320088https://blog.youkuaiyun.com/Cwsy_C/article/details/78320088Cwsy_CMon, 23 Oct 2017 16:23:03 +08000)，请编写程序统计每种不同的个位数字出现的次数。例如：给定N = 100311，则有2个0，3个1，和1个3。输入格式：每个输入包含1个测试用例，即一个不超过1000位的正整数N。输出格式：对N中每一种不同的个位数字，以D:M的格式在一行中输出该位数字D及其在N中]]>https://blog.youkuaiyun.com/Cwsy_C/article/details/78316417https://blog.youkuaiyun.com/Cwsy_C/article/details/78316417Cwsy_CMon, 23 Oct 2017 10:44:56 +0800https://blog.youkuaiyun.com/Cwsy_C/article/details/78302705https://blog.youkuaiyun.com/Cwsy_C/article/details/78302705Cwsy_CSat, 21 Oct 2017 12:29:20 +0800C，否则输出“Case #X: false”，其中X是测试用例的编号（从1开始）。输入样例： 4 1 2]]>https://blog.youkuaiyun.com/Cwsy_C/article/details/78299800https://blog.youkuaiyun.com/Cwsy_C/article/details/78299800Cwsy_CFri, 20 Oct 2017 21:43:25 +0800https://blog.youkuaiyun.com/Cwsy_C/article/details/78299083https://blog.youkuaiyun.com/Cwsy_C/article/details/78299083Cwsy_CFri, 20 Oct 2017 20:25:52 +0800https://blog.youkuaiyun.com/Cwsy_C/article/details/78298483https://blog.youkuaiyun.com/Cwsy_C/article/details/78298483Cwsy_CFri, 20 Oct 2017 19:02:18 +0800]]>