Cod sursa(job #1064067)
Utilizator | Data | 21 decembrie 2013 13:43:18 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <stdio.h>
using namespace std;
FILE*f=fopen("ciur.in","r");
FILE*g=fopen("ciur.out","w");
int n,cnt,prim[2000010];
int main()
{
fscanf(f,"%d",&n);
for (int i=2;i<=n;i++)
{
prim[i]=1;
}
for (int i=2;i<=n;i++)
{
if (prim[i])
{
cnt++;
for (int j=i+i;j<=n;j+=i)
prim[i]=0;
}
}
fprintf(f,"%d",cnt);
}