#include <stdio.h> int main() { int n; while(scanf("%d",&n) != EOF) { if(n == 0) break; int count = 0; while(n != 1)...

#include <stdio.h> #include <string.h> int Prefix(char *s,char *t) { char *p,*q; p = s; q = t; while(*p && *p ==...

#include <stdio.h> double Factorial(int n) { int i; double fact = 1.0; for(i = 1; i <= n; i++) fact = fact*(double)i; ret...

#include <stdio.h> #include <string.h> int main() { char L[37],t[37]; int n; gets(L); scanf("%d",&n); char *p; p...

#include <stdio.h> int main() { char s[51]; int m; while(scanf("%d",&m) != EOF) { int i,j; for(i = 0; i < m; i++) ...

#include <stdio.h> int Symmetry(long long n) { long long sym = n*n; int a[20],i = 0; while(sym) { a[i++] = sym%10; sym/=1...

#include <stdio.h> int main() { char s[101]; while(gets(s) != NULL) { int a = 0,e = 0,i = 0,o = 0,u = 0; char *p = s; wh...

#include <stdio.h> int main() { int n,i,j,k = 1; scanf("%d",&n); for(i = 0; i < n; i++) { for(j = 0; j <= i; j++) ...

 先排序，最小的两个数在前面，weight权值为非叶子节点值的总和 #include <stdio.h> void Sort(int a[],int n) { int i,j,t; for(i = 0; i < n-1; i++) f...

#include <stdio.h> #include <stdlib.h> #include <string.h> typedef struct node{ char data; struct node *lchild,*rchild...

#include <stdio.h> int main() { int s,i,n,a[1000],b[1000],k = 0,count; while(scanf("%d",&n) != EOF) { if(n == 0) break; ...

#include <stdio.h> int main() { int a[6],i; while(scanf("%d",&a[0]) != EOF) { for(i = 1; i <= 5; i++) scanf(" %d",&...

#include <stdio.h> typedef struct{ int num; char name[120]; char sex[40]; int age; }Student; int main() { int m,n,i,s; ...

#include <stdio.h> #include <string.h> void MergeString(char s[],char s1[],char s2[]) { int i = 0; char *p,*q; p = s1; q...

#include <stdio.h> int Sum(int s[],int a,int n) { int m = 0,t[101],i,j,sum; for(i = 0; i < n; i++) s[i] = a; for(i = 0; i ...

#include <stdio.h> int Reverse(int n) { int m = 0; while(n) { m = m*10+n%10; n/=10; } return m; } int main() { i...

#include <stdio.h> #include <string.h> int main() { char s[1000]; while(gets(s) != NULL) { char *p,*q; p = s; q =...

#include <stdio.h> void Sort(int a[],int n) { int i,j,t; for(i = 0; i < n-1; i++) for(j = 1; j < n-i; j++) if(a[j] <...

#include <stdio.h> int Sort(int a[][100000],int n) { int i,j,t; for(i = 0; i < n-1; i++) for(j = 1; j < n-i; j++) if(a...

#include <stdio.h> int Sum(int s[],int a,int n) { int m = 0,t[101],i,j,sum; for(i = 0; i < n; i++) s[i] = a; for(i = 0; i ...