Cod sursa(job #1024596)
Utilizator | Data | 8 noiembrie 2013 20:44:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
ifstream f("ciur.in", ios::in);
ofstream g("ciur.out", ios::out);
int main()
{
int n,k,i,p,j;
char prim[100];
f>>n;
k=0;
for(i=2;i<=n;i++)
prim[i]=1;
for(i=2;i<=n;i++)
if(prim[i]==1)
{
k++;
for(j=i+i;j<=n;j=j+i)
prim[j]=0;}
g<<k;
return 0;}