组合\快乘\卢卡斯
摘要：
LL quick_pow(LL a, LL n){ LL ans = 1LL; a %= p; while(n){ if(n & 1) ans = ans * a % p; a = a * a % p; n >>= 1; } return ans; } LL C(LL n, LL m){ if(n 阅读全文
posted @ 2019-01-19 12:59 Esquecer 阅读(171) 评论(0) 推荐(0) 编辑
Gym - 101911C Bacteria (规律题)
摘要：
传送门：点我 Time limit2000 ms Memory limit262144 kB Recently Monocarp has created his own mini-laboratory! The laboratory contains nn bacteria. Monocarp kn 阅读全文
posted @ 2018-11-19 16:25 Esquecer 阅读(290) 评论(0) 推荐(0) 编辑
Gym - 101911B Glider(前缀和+二分)
摘要：
传送门：点我 A plane is flying at a constant height of hh meters above the ground surface. Let's consider that it is flying from the point (−10^9,h)(−10^9,h 阅读全文
posted @ 2018-11-14 23:17 Esquecer 阅读(286) 评论(0) 推荐(0) 编辑
CodeForces - 920C Swap Adjacent Elements
摘要：
传送门：点我 You have an array a consisting of n integers. Each integer from 1 to n appears exactly once in this array. For some indices i (1 ≤ i ≤ n - 1) i 阅读全文
posted @ 2018-09-05 13:30 Esquecer 阅读(248) 评论(0) 推荐(0) 编辑
Northwestern European Regional Contest 2016 NWERC ，F题Free Weights（优先队列+Map标记+模拟）
摘要：
传送门： Vjudge:https://vjudge.net/problem/Gym-101170F CF: http://codeforces.com/gym/101170 The city of Bath is a noted olympic training ground—bringing l 阅读全文
posted @ 2018-08-14 22:44 Esquecer 阅读(233) 评论(0) 推荐(0) 编辑
牛客练习赛19 E和F（签到就走系列）托米的饮料+托米搭积木
摘要：
E题传送门：点我 F题传送门：点我 可爱的小托米得到了n瓶饮料. 但他不小心把开盖的工具弄丢了,所以他只能利用饮料瓶来开盖. 已知第i个瓶子的品牌为ai,且其能打开bi品牌的瓶子. 问有几瓶饮料托米无法喝到. 被用于打开饮料瓶的瓶子不一定需要被打开. 一个瓶子不能打开其本身. 可爱的小托米得到了n瓶 阅读全文
posted @ 2018-06-01 19:35 Esquecer 阅读(371) 评论(0) 推荐(0) 编辑
e-olymp Problem4196 Chocolate bars
摘要：
吐槽一下，这个OJ的题目真的是阅读理解题。代码非常短，就是题目难理解。心累。 传送门：点我 Chocolate bars It is hard to overestimate the role of chocolate bars in traditional programming competit 阅读全文
posted @ 2018-05-18 16:04 Esquecer 阅读(233) 评论(0) 推荐(0) 编辑
e-olymp Problem8352 Taxi
摘要：
作为我在这个OJ玩了一下午的终结吧。 水题一道，阅读理解OJ。 传送门：点我 Taxi At the peak hour, three taxi buses drove up at the same time, following one route, where the passengers im 阅读全文
posted @ 2018-05-17 21:50 Esquecer 阅读(178) 评论(0) 推荐(0) 编辑
e-olymp Problem9 N-digit numbers（打表）
摘要：
传送门：点我 N-digit numbers Find the quantity of N-digit numbers, which the sum is equal to their product. Call the least from numbers for given N (N < 10) 阅读全文
posted @ 2018-05-17 17:47 Esquecer 阅读(229) 评论(0) 推荐(0) 编辑
e-olymp Problem11 Big accuracy
摘要：
传送门：点我 Big accuracy The rational fraction m/n is given. Write it in the decimal notation with k digits after the decimal point. Input Three numbers m, 阅读全文
posted @ 2018-05-17 17:42 Esquecer 阅读(137) 评论(0) 推荐(0) 编辑
