fang_abc的专栏

#include #include int main() { int k,i; while(scanf("%d",&k)!=EOF) { if(k100000) continue; int *a=(int *)malloc(k*sizeof(int)); int sum=0,b=0; for(i=0;i<k;i++) scanf("%d",&a[i]); fo

#include #include int main() { int k,i; int *a; while(scanf("%d",&k)!=EOF) { int sum=0,b=0; int f=0,l=k,t=0; a=(int *)malloc(k*sizeof(int)); for(i=0;i<k;i++) { scanf("%d",&a[i]); i

#include #include int main() { int k,i; int *a; while(scanf("%d",&k)!=EOF) { if(k10000) continue; int sum=0,b=0; int f=0,l=k,t=0; a=(int *)malloc(k*sizeof(int)); for(i=0;i<k;i++) {

#include #include typedef struct Node { int curadd; int data; int nextadd; }Node; int main() { int n,k,firstadd,i,num,j; Node *a,temp; int c; while(scanf("%d%d%d",&firstadd,&n,&k)!=EOF) { a=

#include typedef struct B { int x,y; }B; int main() { B a[2010]; int n=0,i; while(~scanf("%d%d",&a[n].x,&a[n].y)) n++; if(n==1&&a[0].y==0) printf("0 0\n"); else { if(a[0].y!=0){ printf("%d