【九度OJ】1060【模拟】【C实现】【清华2000】

/*by qr jobdu 1060 2014-9-16*/#include <stdio.h>//#include <math.h>int main(){int E[59];int G[59];int index1=0;int index2=0;//两个数组的指针int i;for(i=3;i<=60;i++){  //2不是盈数int sum=0;//因子的和//int p=(int)sqrt(i);int p=i/2+1;for(int j=1;j<=p;j++){if(i%j==0)sum+=j;}if(sum==i)E[index1++]=i;else if(sum>i)G[index2++]=i;}printf("E: ");for(i=0;i<index1;i++){printf("%d",E[i]);if(i!=(index1-1))printf(" ");elseprintf("\n");}printf("G: ");for(i=0;i<index2;i++){printf("%d",G[i]);if(i!=(index2-1))printf(" ");elseprintf("\n");}return 0;}