Cod sursa(job #1323789)
Utilizator | Data | 21 ianuarie 2015 16:07:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int qw,n,i,j;
int a[2000001];
int main()
{
fin>>n;
for(i=2;i<=2000000;i++)
{
if(a[i]==0)
{
if(n>=i)
qw++;
for(int j=i*2;j<=2000000;j+=i)
a[j]=1;
}
}
fout<<qw;
return 0;
}