Cod sursa(job #2535040)
Utilizator | Data | 31 ianuarie 2020 12:46:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
bool v[2000050];
int n,i,j,cn;
int main()
{
f>>n;
int cn;
cn=0;
for(i=2;i<=n/2+1;i++)
for(j=i*2;j<=n;j=j+i)
{if(v[j]!=1)cn++;
v[j]=1;
}
cout<<n-cn-1;
}