Cod sursa(job #971017)
| Utilizator | Data | 8 iulie 2013 11:49:22 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
using namespace std;
int main()
{
long long n,i,j,sol = 0;
bool ciur[2000005];
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>n;
for(i = 2 ; i <= n ; ++i)
ciur[i] = true;
for(i = 2 ; i <= n ; ++i)
{
if(ciur[i] == true)
{
sol++;
for(j = 2*i ; j<=n ; j += i)
ciur[j] = false;
}
}
out<<sol;
out.close();
in.close();
return 0;
}
