Cod sursa(job #1192987)
Utilizator | Data | 30 mai 2014 14:38:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
#include<iostream>
using namespace std;
int main()
{
char prim[100];
long long i,j,n,nrprim,nrprime;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
prim[i]=1;
for(i=2;i<=n;i++)
if(prim[i]==1)
{
nrprim++;
for(j=i+i;j<=n;j=j+i)
prim[j]=0;
}
g<< " "<<nrprime;
return 0;
}