Cod sursa(job #1937849)
| Utilizator | Data | 24 martie 2017 12:33:23 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool c[2000001];
int i,j,s,n;
int main()
{
fin>>n;
for(i=2;i<=n;i++)
if(c[i]==0)
for(j=i*2;j<=n;j+=i)
c[j]=1;
for(i=2; i<=n;i++)
if(c[i]==0)
s++;
fout<<s;
return 0;
}
