Cod sursa(job #2168661)
Utilizator | Data | 14 martie 2018 11:53:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
char poz[2000000];
int n;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
n=10;
int nr=0;
for(int i=2; i<=n; i++)
{
if(poz[i]!='1')
{
nr++;
for(int j=i+i; j<=n; j+=i)
{
poz[j]='1';
}
}
}
g<<nr;
return 0;
}