Cod sursa(job #1976466)
Utilizator | Data | 3 mai 2017 15:11:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool ciur[2000001];
int main()
{
int n,i,d,cnt=0;
in>>n;
for(d=2; d<=n; d++)
{
if(ciur[d]==0)
{
for(i=d*2; i<=n; i+=d)
{
ciur[i]=1;
}
}
}
for(int j=2; j<=n; j++)
cnt+=ciur[j];
out<<n-cnt-1;
return 0;
}