Cod sursa(job #1169355)
Utilizator | Data | 10 aprilie 2014 23:04:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool v[2000002];
int k;
int main()
{
int i,j,n;
fin>>n;
for (i=2;i<=n;++i)
if (v[i]==0)
{
k++;
for (j=2*i;j<=n;j+=i)
v[j]=1;
}
fout<<k;
return 0;
}