Cod sursa(job #1010710)
| Utilizator |  Leontin leontin |
Data | 15 octombrie 2013 15:23:05 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.31 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{int i,n,nr=0,k=2,v[1000],c;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=1;i<=n;i++)
v[i]=0;
while(k<=n)
{
if(v[k]==0){
nr++;
c=2*k;
while(c<=n)
{v[c]=1;
c=c+k;}}
k++;}
g<<nr<<" ";
f.close();
g.close();
return 0;}