本文共 5295 字，大约阅读时间需要 17 分钟。
1471
#include #include #define N 100int main(void){ int n1, n2, i, j, k; char s1[N+1], s2[N+1], s[2*N+1]; while (scanf("%s%s", s1, s2) != EOF) { n1 = strlen(s1); n2 = strlen(s2); k = 0; for(i=0, j=n2-1; i =0; ) { if (i =0) s[k++] = s2[j--]; } s[k] = '\0'; printf("%s\n", s); } return 0;}/************************************************************** Problem: 1471 User: liangrx06 Language: C Result: Accepted Time:0 ms Memory:912 kb****************************************************************/
1472
#include #include #define M 1000int main(){ int i, j, m; int a[2*M+1], c, d; while (scanf("%d", &m) != EOF) { memset(a, 0, sizeof(a)); for (i=0; i =0; i--) { if (a[i] != 0) break; } printf("%d %d", a[i], i-M); for (j=i-1; j>=0; j--) { if (a[j] != 0) printf(" %d %d", a[j], j-M); } printf("\n"); } return 0;}/************************************************************** Problem: 1472 User: liangrx06 Language: C Result: Accepted Time:10 ms Memory:912 kb****************************************************************/
1473
#include #define N 20int main(void){ int n, i, j, k, a; char s[40]; while (scanf("%d", &n) != EOF) { for(i=0; i =0; j--) printf("%c", s[j]); printf("\n"); } } return 0;}/************************************************************** Problem: 1473 User: liangrx06 Language: C Result: Accepted Time:0 ms Memory:912 kb****************************************************************/
1474
#include #define N 10int main(void){ int t, n, k, i, j, m, r, s; int a[N][N], b[N][N], c[N][N]; while (scanf("%d", &t) != EOF) { for(m=0; m
1475
#include #define N 1024int main(void){ int i; int p[N]; char s[N]; int offset; int count, total; scanf("%d", &total); gets(s); for (count=1; count<=total; count++) { gets(s); sscanf(s, "%p", &p[0]); offset = p[0]%16*4; for(i=1; i
1476
#include #include int main(void){ int n, i; while (scanf("%d", &n) != EOF) { if (n == 0) break; int find = 0; for(i=2; i<=sqrt(n); i++) { if (n%(i*i) == 0) { find = 1; break; } } if (find == 0) printf("No\n"); else printf("Yes\n"); } return 0;}/************************************************************** Problem: 1476 User: liangrx06 Language: C Result: Accepted Time:0 ms Memory:928 kb****************************************************************/
1477
#include #define N 1000int n;int a[N];void init(){ int i; for (i=0; i<=n; i++) a[i] = i;}void shift(int m){ int i; int b[N]; for (i=1; i<=m; i++) b[i] = a[i]; for (i=1; i<=n-m; i++) a[i] = a[i+m]; for (i=1; i<=m; i++) a[i+n-m] = b[i];}void flip(){ int m = n/2; int i; for (i=1; i<=m/2; i++) { int tmp = a[i]; a[i] = a[m-i+1]; a[m-i+1] = tmp; }}int main(void){ int k, i, j, op; while (scanf("%d%d", &n, &k) != EOF && n) { init(); for(i=0; i
1478
#include int max(int a, int b, int c){ int res; res = (a>b) ? a : b; res = (res>c) ? res : c; return res;}int main(void){ int a, b, c; while (scanf("%d%d%d", &a, &b, &c) != EOF) { if (a == 0) break; printf("%d\n", a+b+c-2*max(a, b, c)); } return 0;}/************************************************************** Problem: 1478 User: liangrx06 Language: C Result: Accepted Time:0 ms Memory:912 kb****************************************************************/
1479
#include #define N 1000int n;int a[N];void init(){ int i; for (i=0; i<=n; i++) a[i] = i;}void shift(int m){ int i; int b[N]; for (i=1; i<=m; i++) b[i] = a[i]; for (i=1; i<=n-m; i++) a[i] = a[i+m]; for (i=1; i<=m; i++) a[i+n-m] = b[i];}void flip(){ int m = n/2; int i; for (i=1; i<=m/2; i++) { int tmp = a[i]; a[i] = a[m-i+1]; a[m-i+1] = tmp; }}int main(void){ int k, i, j, op; while (scanf("%d%d", &n, &k) != EOF && n) { init(); for(i=0; i
1480
#include #define N 1000 int main(void){ int n, i, j; int a[N], sum[N]; while (scanf("%d", &n) != EOF) { for (i=0; i sum[i]) sum[i] = sum[j] + a[i]; } } int max = sum[0]; for (i=1; i max ? sum[i] : max; printf("%d\n", max); } return 0;}/************************************************************** Problem: 1480 User: liangrx06 Language: C Result: Accepted Time:30 ms Memory:912 kb****************************************************************/
转载地址：http://rpeli.baihongyu.com/