Cod sursa(job #374068)
Utilizator | Data | 15 decembrie 2009 21:15:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<stdio.h>
int n,x,i,j;
int v[2000001];
int main(){
FILE * f = fopen("ciur.in","r");
fscanf(f,"%d",&n);
fclose(f);
for (i=2;i<=n;i++){
v[i]=1;
}
for(i=1;i<=n;i++){
if(v[i]){
x++;
for(j=1;j<=n;j++)
v[j]=0;
}
}
FILE * g = fopen("ciur.out","w");
fprintf(g,"%d",x);
fclose(g);
return 0;
}