Cod sursa(job #1379397)
Utilizator | Data | 6 martie 2015 17:43:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n;
int64_t sol=0;
bool a[2000001];
void ciur()
{
for(int i=2;i<=n;i++)
for (int j = 2; j<=n; ++j)
{
a[i*j]=1;
}
}
int main()
{
f>>n;
ciur();
for (int i = 2; i <= n; ++i)
{
if (!a[i]) ++sol;
}
g<<sol;
return 0;
}