Cod sursa(job #398702)
Utilizator | Data | 19 februarie 2010 10:44:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<stdio.h>
#include<iostream.h>
FILE *f=fopen("ciur.in","r");
FILE *g=fopen("ciur.out","w");
long n,k,i,j,v[2000001];
int main(){
fscanf(f,"%ld",&n);
for(i=2;i<=n;i++)
v[i]=1;
for(i=2;i<=n;i++)
if(v[i]){
k++;
for(j=2*i;j<=n;j=j+i)
v[j]=0;}
fprintf(g,"%ld",k);
fclose(f);
fclose(g);
return 0;}