lc311309010103的专栏

#include int a[3000]={1,1,0}; int fun() {     int i,j;     for(i=2;i*i     {      if(!a[i])      for(j=i*i;j      a[j]=1;                        }     } int sum(int n) {     return n*n+

Primes Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6867    Accepted Submission(s): 2782 Problem Description Write a program to re

#include int sushu(int n) { int i; for(i=2;i<=n/2;i++) { if(n%i==0) return 1; } return 0; } int main() { int n,i,j; while(scanf("%d