Cod sursa(job #1134434)
Utilizator | Data | 6 martie 2014 15:31:00 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n,nr=1;
in>>n;
bool v[n+1];
for(int i=2;i<=n;i++)
v[i]=1;
for(int i=3;i<=n;i=i+2)
{
if(v[i]==1)
{
nr+=1;
//cout << i << " ";
for(int j=1;j*i<=n;j++)
{
v[i*j]=0;
}
}
}
out<<nr;
return 0;
}