Cod sursa(job #1999791)
Utilizator | Data | 12 iulie 2017 09:49:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
char sir[2000001];
int nr;
void ciuruire(int n)
{
for(int i=2;i<=n;i++)
if(sir[i]==0)
{
nr++;
for(int j=i*2;j<=n;j+=i)
sir[j]=1;
}
}
int main()
{
int n;
f>>n;
ciuruire(n);
g<<nr;
return 0;
}