[BOJ 9356] Skill
View as PDF
Submit solution
Assembly, Awk, C, C++, Java, Pascal, Perl, Python, Sed, Text
Points:
3
Time limit:
1.0s
Memory limit:
128M
Problem types
Allowed languages
Yasser is an Egyptian coach; he will be organizing a training camp in Jordan. At the end of camp, Yasser was quite amazed that the participants solved all of the hard problems he had prepared; so he decided to give them one last challenge:</p>
Print the number of integers having N digits where the digits form a non decreasing sequence.
입력 형식
Input will start with T ≤ 100 number of test cases. Each test case consists of a single line having integer N where 1 ≤ N ≤ 100000.</p>
출력 형식
For each test case print on a separate line the number of valid sequences modulo 1000000007.
예제 입력
3
2
3
4
예제 출력
55
220
715
Comments