Cod sursa(job #1533969)
Utilizator | Data | 23 noiembrie 2015 09:47:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
bool v[2000000];
int n,nr,k,i;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
{
if(v[i]==0)
{
nr++;
// g<<i<<" ";
for(k=i;k<=n;k=k+i)
v[k]=1;
}
}
//g<<"\n";
g<<nr;
return 0;
}