Cod sursa(job #1029659)
Utilizator | Data | 15 noiembrie 2013 15:06:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
int i,j,n,nrprime;
int a[100];
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
f>>n;
for(i=2;i<=n;i++);
if (a[i]==0){
nrprime++;
for (j=i+i;j<=n;j=j+i);
a[j]=1;
}
g<<nrprime;
f.close();
g.close();
}