Ultraviolet A 12712 pattern locker (simple arrangement and combination of mathematical questions)

Reprinted please indicate the source: http://blog.csdn.net/u012860063

Question link: http://uva.onlinejudge.org/index.php? Option = com_onlinejudge & Itemid = 8 & page = show_problem & problem = 4450

Do not understand the modulo operation please stamp: http://baike.baidu.com/link? Url = A86lTLorv-Mim9g6v8EW3mY98qLz10cot1UCt6TZNPDJyslVYS5Ya1KxLv71bJg_8vFxQXV6Ss5uwzdMQLyi4a

The Code is as follows:

# Include <cstdio> int main () {int N, Minn, Maxx; int T, CAS = 0, I, j, TT; long sum = 0, TMP, moD = 10000000000007; while (~ Scanf ("% d", & T) {While (t --) {scanf ("% d", & N, & Minn, & Maxx ); sum = 0, TT = N * n, TMP = 1; for (I = 1; I <= Minn; I ++) {TMP * = tt; TMP % = MOD; TT --;} sum = TMP % MOD; for (I = Minn + 1; I <= Maxx; I ++) {TMP * = tt; TMP % = MOD; TT --; sum + = TMP; sum % = MOD;} printf ("case % d: % LLD \ n", ++ cas, sum) ;}} return 0 ;}