Cod sursa(job #1916529)
| Utilizator | Data | 9 martie 2017 09:41:54 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int n,i,k,j;
char v[2000001];
int main()
{
v[0]='1';
v[1]='1';
for(i=2;i*i<2000000;i++)
{
if (v[i]==0)for(j=2;i*j<2000000;j++)v[i*j]='1';
}
in>>n;
for(i=1;i<=n;i++)
{
if(v[i]==0)k++;
}
out<<k;
return 0;
}
