Pagini recente » Cod sursa (job #880051) | Cod sursa (job #2777895) | Cod sursa (job #2715051) | Cod sursa (job #2783330) | Cod sursa (job #444590)
Cod sursa(job #444590)
#include <iostream>
const int m=2;
using namespace std;
int main(void) {
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
long k,n,db=0;
double x[1000000],s;
bool jo,jo2;
cin >>n;
long v[n];
k=1;
v[k]=0;
while (k>0) {
do {
v[k]++;
jo=true;
}while(!(jo || v[k]==n+1));
if (jo && v[k]<=n) {
if (k==m) {
jo2=true;
s=(float)v[1]/v[2];
for (int i=1;i<=db;i++)
if (x[i]==s) jo2=false;
if (jo2) {
db++;
x[db]=(((float)v[1]/v[2]));
}
}else{
k++;
v[k]=0;
}
}else k--;
}
cout << db;
}