Cod sursa(job #1309384)
Utilizator | Data | 5 ianuarie 2015 18:34:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
int i,j,n,sol,neprime,prim [2000001];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
i=1;
for(i=2;i<=n;i++)
prim[i]=1;
for(i=2;i<=n;i++)
if (prim[i]==1)
{
sol++;
for(j=i+i;j<=n;j+=i)
prim[j]=0;
}
g<<sol;
return 0;
}