Cod sursa(job #1509028)
Utilizator | Data | 23 octombrie 2015 13:51:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n,j,i,a[2000000],k=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
a[i]=1;
for(i=2;i<=n;i++)
if(a[i]==1)
{
k++;
for(j=i*2;j<=n;j=j+i)
a[j]=0;
}
g<<k;
return 0;
}