#include int gcd (int a, int b) { return b?gcd(b,a%b):a; } int solve(int n, int k) { int a[20]; int counter1,counter2,d,g,res; if (k>(n/2)) k=n-k; for (counter1=0; counter11; counter1++) { g = gcd(a[counter1],d); a[counter1] /= g; d /= g; } for (counter1=0, res=1; counter1