Cod sursa(job #2380739)
Utilizator | Data | 15 martie 2019 14:41:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool v[2000001];
int gigel,i,j,n;
int main()
{
in>>n;
gigel=n-1;
for (i=2; i<=n; i++)
if (v[j]==0)
for (j=i*i; j<=n; j+=i)
gigel--;
out<<gigel;
return 0;
}