Cod sursa(job #1340013)
Utilizator | Data | 11 februarie 2015 14:04:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | 9neplace | Marime | 0.29 kb |
#include <fstream>
using namespace std;
int main()
{
int i,k=0,n,j;
char ciur[2000001];
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2; i<=n; i++)
{
if (ciur[i]==0)
{k++;
for (j=i+i;j<=n;j=j+i)
ciur[j]=1; } }
fout<<k;
fin.close();
fout.close();
return 0;
}