Cod sursa(job #432218)
Utilizator | Data | 1 aprilie 2010 23:06:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<stdio.h>
FILE *f,*g;
int contor;
int n,i,j;
char v[2000000];
int main() {
f=fopen("ciur.in","r");
fscanf(f,"%d",&n);
fclose(f);
j=2;
while(j<=n)
{
if(v[j]!='1')
{
contor++;
for(i=j;i<=n;i+=j)
v[i]='1';
}
j++;
}
g=fopen("ciur.out","w");
fprintf(g,"%d\n",contor);
fclose(g);
return 0;}