摘要: a*b^n(mod(b-1) =a(mod(b-1)http://acm.timus.ru/problem.aspx?space=1&num=1104 1 #include 2 #include 3 4 char str[1000000 + 10]; 5 6 int CharToInt(ch... 阅读全文
posted @ 2015-01-10 15:41 justPassBy 阅读(329) 评论(0) 推荐(0) 编辑