Cod sursa(job #2634974)
Utilizator | Data | 12 iulie 2020 20:20:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,nr=1;
char vc[2000001];
int main()
{
f>>n;
for (int i=3; i<=n; i+=2)
{
if (vc[i]==0)
{
nr++;
for (int j=i*2; j<=n; j+=i)
vc[j]=1;
}
}
g<<nr;
return 0;
}