eternalmr的专栏

#include int main(){ int N; long A,B,C; scanf("%d",&N); for (int i = 1; i <= N; i++) { scanf("%ld %ld %ld",&A,&B,&C); printf("Case #%d: %s
", i, A+B > C ? "tr

#include #include const int SIZE = 80;int main(){ char string[SIZE]; char *ptr; gets(string);// I know it's an unsave function while ((ptr = strrchr(string,' '))) {

这个题如果只是为了得到正确答案的话，使用直接打印的方法是最简单地。但是如何能真正实现数组元素的循环移位呢？要注意的是：当移位次数k大于数组长度N的时候，跟移位k = k%n的效果是一样的。我能想到的方法是，每次向右移一位，移动n次，实现方法如下：#include void shiftRight(int *array, int offset, int N);void shiftOn

判断素数的算法有很多，这里只是采用了最直接的一种，较为高效的方法叫做筛选法。关于判断素数的算法这里进行了详细的讨论：http://blog.csdn.net/liukehua123/article/details/5482854。百度也能得到其他很多答案。#include #include #define TRUE 1#define FALSE 0int findTwi

#include #include #define TRUE 1#define FALSE 0int isPrime(int num);void find_prime(int N, int *array);int main(){ int M,N,counter = 1; scanf("%d %d",&M,&N); int array[N];

#include #include int main(){ int num, digits = 0, den; scanf("%d", &num); digits = log10(num) + 1; den = pow(10,digits-1); for (int i = 1; i <= digits; i++) {

#include #define SIZE 11typedef struct { char name[SIZE]; char ID[SIZE]; int score;} STUDENT;void printMaxMin(const STUDENT *s, int N);int main(){ int N, i; scanf("%d",

#include #include #include const char pinyin[10][5] = {"ling", "yi", "er", "san", "si", "wu", "liu", "qi", "ba", "jiu"};int main(){ char ch; int i, tmp, den;

学习c编程，刷题中~~#include int callatz(int n);int main(){ int n, counter = 0; scanf("%d",&n); counter = callatz(n); printf("%d
",counter); return 0;}int callatz(int