Cod sursa(job #2024362)
Utilizator | Data | 20 septembrie 2017 14:53:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int N,i,ciur[2000001],j;
int main()
{
f>>N;j=0;
for(i=2;i<=N;++i)
if(ciur[i]==0)
{
++j;
for(int q=i*i;q<=N;q+=i)ciur[q]=1;
}
g<<j;
}