数论
文章平均质量分 51
CZWin32768
这个作者很懒,什么都没留下…
展开
-
HDU3049 逆元
HDU3049 题目描述: Chinachen is a football fanatic, and his favorite football club is Juventus fc. In order to buy a ticket of Juv, he finds a part-time job in Professor Qu’s lab.And now, Chinachen ha原创 2015-07-30 09:39:14 · 665 阅读 · 0 评论 -
RGCDQ (HDU5317)
RGCDQ题目描述 Mr. Hdu is interested in Greatest Common Divisor (GCD). He wants to find more and more interesting things about GCD. Today He comes up with Range Greatest Common Divisor Query (RGCDQ). What原创 2015-08-26 21:52:46 · 637 阅读 · 2 评论 -
HDU4497 GCD and LCM
HDU4497 GCD and LCM题目描述 Given two positive integers G and L, could you tell me how many solutions of (x, y, z) there are, satisfying that gcd(x, y, z) = G and lcm(x, y, z) = L? Note, gcd(x, y, z)原创 2015-08-17 22:47:32 · 790 阅读 · 0 评论 -
hdu5778 abs 简单数论
题目描述给定一个数x,求正整数y\geq 2y≥2,使得满足以下条件: 1.y-x的绝对值最小 2.y的质因数分解式中每个质因数均恰好出现2次。 对于每组数据,输出一行y-x的最小绝对值解法暴力向两边找,但是要注意要先开方!代码#include<bits/stdc++.h> using namespace std;typedef long long ll;bool sat(ll z) {原创 2016-08-10 13:59:39 · 542 阅读 · 0 评论