Cod sursa(job #1308792)
Utilizator | Data | 4 ianuarie 2015 17:50:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<iostream>
#include<fstream>
using namespace std;
unsigned int n,a[2000000],i,j,s;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n/2;i++)
if(a[i]==0)
{s++;
for(j=i;j<=n/2;j=j+i) a[i]=1;}
g<<s;
f.close();
g.close();
return 0;
}