Cod sursa(job #1919908)
Utilizator | Data | 9 martie 2017 21:31:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
char c[2000001];
int main()
{
ifstream f("ciur.in"); ofstream g("ciur.out");
int nr,n,i,j;
f>>n;
nr=0;
for(i=2;i<=n;i++)
{
c[i]=1;
}
for(i=2;i<=n;i++)
{
if(c[i])
{
nr++;
for(j=i*2;j<=n;j+=i)
{
c[j]=0;
}
}
}
g<<nr;
return 0;
}