Cod sursa(job #2346006)
Utilizator | Data | 16 februarie 2019 22:40:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
char v[2000001];
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int main()
{
int n,i;
in>>n;
int cnt=0;
for (i=2;i<=n;i++)
if (v[i]==0)
{
for(unsigned long long j=i*2;j<=n;j+=i)
v[j]=1;
cnt++;
}
out<<cnt;
return 0;
}