Cod sursa(job #2241311)
Utilizator | Data | 15 septembrie 2018 15:13:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
bool verif[2000002];
int N;
int c=0;
int main()
{
f>>N;
for(int i=2; i<=N; i++)
{
if(verif[i]==0)
{
c++;
for(int j=2*i; j<=N; j+=i)
verif[j] = 1;
}
}g<<c;
return 0;
}