Cod sursa(job #2658338)
Utilizator | Data | 13 octombrie 2020 19:30:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool a[2000001];
int nr,n,i,k;
int main()
{
f >> n;
k=2;
while(k<=n)
{
for(i=2;i<=n/k;i++)
a[i*k]=1;
k++;
}
a[1]=1;
for(i=2;i<=n;i++)
{
if(a[i]==0)
{
nr++;
}
}
g << nr;
return 0;
}