// find fraction that support fallacy proof (howlers)
#include <stdio.h>
//#define const
void printFallacyDecends(int n, int d) {
int i = 0;
for(i = 1; i < 10; ++i) {
const int nn = n * 10 + i;
const int dd = i * 10 + d;
if(dd * n == d * nn) printf("%d/%d = %d/%d\n", nn, dd, n, d);
}
}
int main() {
int i = 0, j = 0;
for(i = 1; i < 10-1; ++i)
for(j = i+1; j < 10; ++j) printFallacyDecends(i, j);
return 0;
}