Cod sursa(job #1466868)
Utilizator | Data | 31 iulie 2015 11:02:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.26 kb |
#include<fstream>
using namespace std;
bool c[2000001];
long n,i,nr,j;
int main()
{
ifstream f("U.in");
ofstream g("U.out");
{
f>>n;
for(i=2;i<=n;i++)
if(c[i]==0)
{
nr++;
for(j=i+i;j<=n;j=j+i)
c[j]=i;
}
g<<nr;
return 0;
}
}