摘要:
题目: 求 (n-1)!mod(n)的值。很显然当 n 是合数时 结果为0(当然这里有个特例4)当 n 为素数时, 直接用 威尔逊定理 结果为n-1.#include#include#include#include#define LL long longusing namespace std;boo... 阅读全文
posted @ 2015-08-29 16:18
草滩小恪
阅读(544)
评论(0)
推荐(0)
摘要:
SticksTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 129606Accepted: 30388DescriptionGeorge took sticks of the same length and cut them rand... 阅读全文
posted @ 2015-08-29 15:04
草滩小恪
阅读(253)
评论(0)
推荐(0)
浙公网安备 33010602011771号