Cod sursa(job #1819983)
| Utilizator | Data | 1 decembrie 2016 00:33:06 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
#define N 2000001
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,k,r,i,ok=1,p,sum=0,v[N];
int main()
{
f>>n;
p=2;
while(ok==1)
{
for(i=p;i<=n;i=i+p)
{
if(i>p)
v[i]=1;
}
for(i=p+1;i<=n;i++)
{
if(v[i]==0 && i!=n)
{
p=i;
break;
}
else
ok=0;
}
}
for(i=2;i<=n;i++)
{
if(v[i]==0)
sum++;
}
g<<sum;
}
