Cod sursa(job #432207)
Utilizator | Data | 1 aprilie 2010 22:53:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<stdio.h>
FILE *f,*g;
int *v,contor;
int n,i,j;
int main() {
f=fopen("ciur.in","r");
fscanf(f,"%d",&n);
fclose(f);
v=new int[n+1];
j=2;
while(j<=n)
{
if(v[j]==0)
{
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;}