Cod sursa(job #1537998)
| Utilizator | Data | 28 noiembrie 2015 13:07:13 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
using namespace std;
bool v[2000000];
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n, i, j, nr;
in>>n;
nr=0;
for(i=2; i<=n; i++)
if(v[i]==0)
for(j=i+1; j<=n; j++)
if(j%i==0)
v[j]=1;
for(i=2; i<=n; i++)
if(v[i]==0)
nr=nr+1;
out<<nr<<"\n";
return 0;
}
