Cod sursa(job #1841391)
Utilizator | Data | 5 ianuarie 2017 16:41:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,nr,i,j;
char a[2000001];
int main()
{
f>>n;
for(i=2;i<=n;i++)
if(!a[i])
{
nr++;
for(j=2*i;j<=n;j+=i)
a[j]=1;
}
g<<nr;
return 0;
}