Cod sursa(job #1008778)
Utilizator | Data | 11 octombrie 2013 20:18:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
int n, i, ctr, j;
bool v[2000005];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
v[i]=1;
for(i=2;i<=n;i++)
if(v[i])
{
ctr++;
for(j=i+i;j<=n;j+=i)
v[j]=0;
}
g<<ctr<<"\n";
f.close();g.close();
}