Cod sursa(job #1808891)
Utilizator | Data | 18 noiembrie 2016 12:42:25 | |
---|---|---|---|
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[2000005];
int n,i,j,nr;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
{
if(a[i]==0)
{
nr++;
for(j=i+i;j<=n;j+=i)
a[j]=1;
}
}
g<<nr;
return 0;
}