Cod sursa(job #1336166)
Utilizator | Data | 6 februarie 2015 20:45:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[2000000],n;
void ciur()
{
ifstream in("ciur.in");
in>>n;
in.close();
int i,j;
v[1]=1;
for(i=2;i<=n;i++)
for(j=2;j<=n;j++)
v[i*j]=1;
}
void afisare()
{
ofstream out("ciur.out");
int i,k=0;
for(i=1;i<=n;i++)
if(v[i]==0)
k++;
out<<k;
out.close();
}
int main()
{
ciur();
afisare();
return 0;
}