Cod sursa(job #2035397)
| Utilizator | Data | 9 octombrie 2017 12:06:36 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
bool nb[2000001];
int main()
{
int i,j,n,val = 0;
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>n;
for(i = 2; i < n; i++)
{
for(j = i + i; j <= n; j += i)
{
nb[j] = 1;
}
if(nb[i])
{
val++;
}
}
out<<val;
}
