Cod sursa(job #1550720)
Utilizator | Data | 14 decembrie 2015 16:35:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
long long int n,c,cate,i;
bool a[2000005];
int main()
{
f>>n;
for(c=2;c<=n;c++)
{
if(a[c]==0)
{
for(i=c*2;i<=n;i=i+c)
a[i]=1;
}
}
cate=0;
for(i=2;i<=n;i++)
if(a[i]==0)
cate++;
g<<cate;
return 0;
}