Cod sursa(job #1669557)
Utilizator | Data | 30 martie 2016 20:31:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[2000000];
int main()
{
int n,nr=0;
ifstream f("ciur.in");
f>>n;
f.close();
for(int i=2;i<=n;i++)
{
if(v[i]==0)
{
nr++;
for(int j=i+i;j<=n;j+=i)
v[j]=1;
}
}
ofstream g("ciur.out");
g<<nr;
g.close();
return 0;
}