Cod sursa(job #793507)
| Utilizator | Data | 3 octombrie 2012 12:50:32 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
#define MAXN 2000002
char a[MAXN];
int i,j,nr,n;
int main() {
ifstream f1("ciur.in");
ofstream f2("ciur.out");
f1>>n;
for (i=2; i<=n; i++)
if (!a[i])
{ nr++;
for (j=i; j<=n; j+=i) a[j]++; }
f2<<nr;
f1.close();
f2.close();
return 0; }
