$O(...)$
#include<cstdio> #include<algorithm> int n, a[10]; int main() { scanf("%d", &n); for (int i = 0; i < 10; i++)a[i] = i; do { int p = a[2] * 1e4 + a[1] * 1e3 + a[3] * 110 + a[4]; if (a[2] && a[6] && p + a[6] * 1e4 + a[4] * 1e3 + a[5] * 1e2 + a[3] * 10 + a[0] == n) { printf(" %d\n+ %d\n-------\n %6d", p, n - p, n); return 0; } } while (std::next_permutation(a, a + 10)); puts("No Answer"); return 0; }
댓글 없음 :
댓글 쓰기