Cod sursa(job #2047597)
Utilizator | Data | 25 octombrie 2017 00:32:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
char a[2000001];
int n, nr;
int main()
{
int i, j;
f>>n;
for (i=2; i<=n; i++) a[i]='t';
for (i=2; i<=n; i++)
if (a[i]=='t')
{
//cout<<i<<" "; pt a afisa toti factorii primi
nr++;
for (j=2; j<=n/i; j++)
a[j*i]='f';
}
g<<nr;
return 0;
}