#include <stdio.h>
// You can compute all integer pairs (a, b) such that a × b = 899
// by checking every divisor of 899
void findAB(int n) {
for (int a = 1; a <= n; a++) {
if (n % a == 0) {
int b = n / a;
printf("a = %d, b = %d\n", a, b);
}
}
}
int main() {
int n = 899;
findAB(n);
return 0;
}
/*
run:
a = 1, b = 899
a = 29, b = 31
a = 31, b = 29
a = 899, b = 1
*/