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