Pagini recente » Cod sursa (job #3140701) | Cod sursa (job #920996) | Cod sursa (job #2771762) | Borderou de evaluare (job #1295087) | Cod sursa (job #1107786)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{int i,j,terminat=0,a[1000],b[1000];
long n;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
f>>n;
for (i=0;i<n;i++) a[i]=2*i+3;
b[0]=2;j=0;
for (i=0;i<n;i++)
if (a[i]%b[j]==0) a[i]=0;
for (i=0;a[i]==0;i++);
if (i<n) b[++j]=a[i];
g<<j+1;
f.close();
g.close();
return 0;
}