
数论
文章平均质量分 61
tokers
所有的魅力在“习惯”面前都将无色。
展开
-
Codeforces Round #305 (Div. 2)C---Mike and Frog(扩欧+乱搞)
Mike has a frog and a flower. His frog is named Xaniar and his flower is named Abol. Initially(at time 0), height of Xaniar is h1 and height of Abol is h2. Each second, Mike waters Abol and Xaniar.So,原创 2015-05-27 20:08:18 · 1218 阅读 · 0 评论 -
hdu4059---The Boss on Mars(容斥原理+前n项的4次方和)
Problem Description On Mars, there is a huge company called ACM (A huge Company on Mars), and it’s owned by a younger boss.Due to no moons around Mars, the employees can only get the salaries per-year原创 2015-05-28 18:30:20 · 1094 阅读 · 0 评论 -
LightOJ1007---Mathematically Hard (欧拉函数)
Mathematically some problems look hard. But with the help of the computer, some problems can be easily solvable.In this problem, you will be given two integers a and b. You have to find the summation o原创 2015-06-04 17:59:16 · 1532 阅读 · 0 评论 -
POJ1284---Primitive Roots(求原根个数, 欧拉函数)
Description We say that integer x, 0 < x < p, is a primitive root modulo odd prime p if and only if the set { (xi mod p) | 1 <= i <= p-1 } is equal to { 1, …, p-1 }. For example, the consecutive power原创 2015-06-04 18:04:35 · 1171 阅读 · 0 评论 -
POJ2407---Relatives(求单个数的欧拉函数)
Description Given n, a positive integer, how many positive integers less than n are relatively prime to n? Two integers a and b are relatively prime if there are no integers x > 1, y > 0, z > 0 such t原创 2015-06-04 18:24:27 · 1722 阅读 · 0 评论