寫(xiě)出一個(gè)可以工作的程序并不夠
Given an int m and a vector <int> a containing n numbers, return the result of the following expression:
Notes
-
The expression is calculated from top to bottom.
"x mod y" means the remainder of x divided by y.
Assume 0! = 1.
Constraints
a will contain between 1 and 50 elements, inclusive.
Each element of a will be between 0 and 2147483647, inclusive.
m will be between 1 and 40000, inclusive.
posted on 2006-12-21 10:58 Dain 閱讀(1029) 評(píng)論(6) 編輯 收藏 引用 所屬分類(lèi): 算法 、問(wèn)題
好好想一想,冪與模的幾個(gè)定理都忘了 你現(xiàn)在有些什么想法? 回復(fù) 更多評(píng)論
在想ing 有什么想法，交流交流 回復(fù) 更多評(píng)論
做出來(lái)有獎(jiǎng) 回復(fù) 更多評(píng)論
看不到圖了 回復(fù) 更多評(píng)論
@李錦俊 能看到阿，可能顯示慢吧 回復(fù) 更多評(píng)論
看來(lái)，沒(méi)人做出來(lái)啊 我只好貼答案咯 http://www.topcoder.com/tc?module=Static&d1=match_editorials&d2=srm283 回復(fù) 更多評(píng)論
Powered by: C++博客 Copyright © Dain
