Cod sursa(job #1119760)
Utilizator | Data | 24 februarie 2014 19:55:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool a[2000000];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int nr=1,n;
f >> n;
for(int i=3;i<=n;i=i+2)
{
if(a[i]==0)
{
++nr;
for(int j=i+i;j<=n;j+=i) a[j]=1;
}
}
g << nr;
return 0;
}