#28243: C++ next_permutation 解法


asteroid5566 (113級提畢仔)


既然標籤打窮舉了大家就別靠WA解題了吧XD

簡單講一下暴力法怎麼做

 

       arr[10] = 0 到 9

do {

f = arr[0];

o = arr[1];

r = arr[2];

...共十個

 

if (y + n + n + 10 * (t + e + e) + 100 * (r + t + t) + 1000 * o + 10000 * f == y + 10 * t + 100 * x + 1000 * i + 10000 * s) {

//輸出答案

break;

}

} while (next_permutation(arr, arr + 10));