Cod sursa(job #1655534)
Utilizator | Data | 18 martie 2016 02:35:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
char prim[2000000];
int main()
{
int n,nr=0;
f>>n;
for (int i=2;i<=n;i++)
if (prim[i]==0)
for (int j=i+i;j<=n;j+=i)
prim[j]=1;
for (int i=2;i<=n;i++)
if (prim[i]==0) nr++;
g<<nr;
}