Cod sursa(job #1219329)
Utilizator | Data | 13 august 2014 23:34:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,k=0,i,j;
bool a[2000001];
int main()
{
f>>n;
for(i=2; i<=n; i++)
if (a[i]==0)
for(j=2; j*i<=n; j++)
a[i*j]=1;
for(i=2; i<=n; i++)
if (a[i]==0) k+=1;
g<<k;
return 0;
}