数论
老焦哥
这个作者很懒,什么都没留下…
展开
-
LightOJ 1236 - Pairs Forming LCM(唯一分解定理)
DescriptionFind the result of the following code:long long pairsFormLCM( int n ) { long long res = 0; for( int i = 1; i n; i++ ) for( int j = i; j n; j++ ) if(原创 2016-05-11 01:15:35 · 496 阅读 · 0 评论 -
LightOJ 1282 - Leading and Trailing(快速幂取模)
DescriptionYou are given two integers: n and k, your task is to find the most significant three digits, and least significant three digits of nk.InputInput starts with an integer T (≤ 1000), d原创 2016-05-11 01:21:08 · 334 阅读 · 0 评论 -
LightOJ 1220 - Mysterious Bacteria(唯一分解定理)
DescriptionDr. Mob has just discovered a Deathly Bacteria. He named it RC-01. RC-01 has a very strange reproduction system. RC-01 lives exactly x days. Now RC-01 produces exactly p new deadly Bact原创 2016-05-12 19:27:17 · 378 阅读 · 0 评论 -
LightOj 1259-Goldbach`s Conjecture(素数打表)
DescriptionGoldbach's conjecture is one of the oldest unsolved problems in number theory and in all of mathematics. It states:Every even integer, greater than 2, can be expressed as the sum of t原创 2016-05-09 20:58:56 · 297 阅读 · 0 评论 -
HDU - 1695 GCD(欧拉函数+容斥原理)
DescriptionGiven 5 integers: a, b, c, d, k, you're to find x in a...b, y in c...d that GCD(x, y) = k. GCD(x, y) means the greatest common divisor of x and y. Since the number of choices may be ver原创 2016-10-17 17:26:06 · 262 阅读 · 0 评论 -
hdu 4135 Co-prime(容斥原理)
#include #include #include using namespace std;#define LL __int64LL p[100005]; int tol = 0;void init(LL n){ tol = 0; for (int i = 2; i*i < n; i++) { if (n%i == 0) { p[tol++] = i;原创 2016-10-18 17:58:48 · 197 阅读 · 0 评论 -
hdu 5514(容斥原理)
DescriptionThere are stones lying on a circle, and frogs are jumping over them. The stones are numbered from to and the frogs are numbered from to . The -th frog can jump over exactly stones i原创 2016-10-18 20:35:10 · 371 阅读 · 0 评论 -
POJ 1061青蛙的约会(扩展欧几里得)
该题方程很明显可以列出设t为所需步数,则x+nt-y-nt = pL (p为整数)即 (n-m)t+pL = x-y扩展欧几里得的作用是求出形如ax+by = gcd(a,b)的最小解故先求出 (n-m)t+pL = gcd(n-m,L)的解然后此时判断是否 (n-m)t+pL = x-y 有解显然,当(x-y)%gcd(n-m,L)=0,则有解故,在(n-m)t+pL =原创 2016-11-28 20:42:16 · 289 阅读 · 0 评论 -
codeforces 787a
听说这其实就是一道水题,我硬生生用了数论方法来解,真是caonima#include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL long long#define原创 2017-03-25 19:07:11 · 819 阅读 · 0 评论