Cod sursa(job #1509023)
Utilizator | Data | 23 octombrie 2015 13:49:26 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool taiat[2000001];
int main()
{
int n,i,v[2000001],j,nr=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=1;i<=n;i++)
v[i]=i;
for(i=2;i<=n;i++)
{
if(taiat[i] == 0)
for(j=i+i;j<=n;j+=i)
taiat[j]=1;
}
for(i=2;i<=n;i++)
if(taiat[i]==0)
nr++;
g<<nr;
return 0;
}