![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数论
Fly++
不论何时,能依赖到最后的只有自己的强大
展开
-
Marshal's Confusion III
DescriptionMarshallike to solve acm problems.But they are very busy, one day they meet a problem. Given three intergers a,b,c, the task is to compute a^(b^c))%317000011. so the turn to you for help. I...原创 2018-05-12 13:42:36 · 188 阅读 · 0 评论 -
Happy 2004
DescriptionConsider a positive integer X,and let S be the sum of all positive integer divisors of 2004^X. Your job is to determine S modulo 29 (the rest of the division of S by 29).Take X = 1 for an e...原创 2018-05-12 14:03:31 · 206 阅读 · 0 评论 -
青蛙的约会
Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰面为止。可是它们出发之前忘记了一件很重要的事情,既没有问清楚对方的特征,也没有约定见面的具体位置。不过青蛙们都是很乐观的,它们觉得只要一直朝着某个方向跳下去,总能碰到对方的。但是除非这两只青蛙在同一时间跳到同一点上,不然是永远都不可能碰面的。为了...原创 2018-05-12 14:21:52 · 1715 阅读 · 1 评论 -
Sum HDU4704
DescriptionSample Input2Sample Output2Hint1. For N = 2, S(1) = S(2) = 1.2. The input file consists of multiple test cases. 将N拆分成1-n个数,问有多少种组成方法。比如Sn=s1+s2+s3+..sn,S(n+1)=s1+s2+s3+...sn+s(n+1);S...原创 2018-05-12 14:39:32 · 210 阅读 · 0 评论 -
牛客2018第六场C
链接:https://www.nowcoder.com/acm/contest/144/C来源:牛客网 题目描述Oak is given N empty and non-repeatable sets which are numbered from 1 to N.Now Oak is going to do N operations. In the i-th operation, h...原创 2018-08-05 10:28:03 · 196 阅读 · 0 评论