This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
yukicoder No. 411 昇順昇順ソート | |
http://yukicoder.me/problems/no/411 | |
問題: | |
1, ..., N を並び替えて出来る数列のうち、 | |
先頭が K で、かつ減少点が 1 つだけ存在するような数列の個数を求めよ。 | |
例: | |
(N = 10, K = 4 のときの条件を満たす数列の例) | |
4, 5, 6, 9, 1, 2, 3, 7, 8, 10 |
NewerOlder