Cod sursa(job #1255601)
Utilizator | Data | 4 noiembrie 2014 23:07:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int a[2000006],j,k,i;
void Ciur(int n)
{
for(i=2;i<=n;i++)
if(a[i]==0)
for(j=i+i;j<=n;j+=i)
a[j]=1;
k=0;
for(i=2;i<=n;i++)
if(a[i]==0)
k++;
}
int main()
{
int n;
f>>n;
Ciur(n);
g<<k<<"\n";
return 0;
}