Cod sursa(job #862463)
Utilizator | Data | 22 ianuarie 2013 18:31:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
FILE *f=fopen("ciur.in","r");
FILE *g=fopen("ciur.out","w");
int v[2000000],i,j,cn,n;
int main()
{
fscanf(f,"%d",&n);
cn=0;
v[2]=1;
for (i=2;i<=n;i++)
if (v[i]==1)
for (j=i+i;j<=n;j=j+i) {
v[i]=1;
cn++;}
fprintf(g,"%d",cn);
fclose(g);
return 0;
}