Cod sursa(job #1999645)
| Utilizator | Data | 11 iulie 2017 18:34:06 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int x = 0, i, j, n;
long p[2000001]
cin >> n;
for(i = 2; i <= n; i++)
for(i = 2; i <= n; i++)
if(p[i])
{
x++;
for(j = i+i; j <= n; j += i)
p[j] = 0;
}
g << x;
return 0;
}
