Cod sursa(job #2083437)
Utilizator | Data | 7 decembrie 2017 18:45:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int s[2000000];
void ciur(long long numar)
{
long long i,nr=0,j,init;
for(i=2;i<numar;i++)
{
if(s[i]==0)
{
nr++;
j=i;
init=j;
s[j]=1;
j=j*j;
while(j<numar)
{
s[j]=1;
j=j+init;
}
}
}
g<<nr;
}
int main()
{
long long n;
f>>n;
ciur(n);
return 0;
}