Cod sursa(job #1168969)
Utilizator | Data | 10 aprilie 2014 00:12:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
bool prim[2000001];
int n,sol;
int main()
{
ifstream f1("ciur.in");
ofstream f2("ciur.out");
f1>>n;
for(int i=2;i<=n;i++)
prim[i]=true;
for(int i=2;i<=n;i++)
if(prim[i])
{
sol++;
for(int j=i+i;j<=n;j+=i)
prim[j]=false;
}
f2<<sol;
return 0;
}