Cod sursa(job #1711966)
| Utilizator | Data | 1 iunie 2016 17:54:37 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int N,i,cont,j,v[2000000];
int main()
{
f >> N;
for(i=2;i<=N;i++)
{
if(!v[i])
{
cont++;
for(j=i+i;j<=N;j+=i)
v[j]=1;
}
}
g<<cont;
return 0;
}
