算法-数论
FawkesLi
这个作者很懒,什么都没留下…
展开
-
poj 3233 矩阵快速幂
构造一个左上角是A+A2+A3 …的矩阵,然后去算就可以了#include <cstdio>#include <iostream>#include <iomanip>#include <string>#include <cstdlib>#include <cstring>#include <queue>#include <set>#include <vector>#include原创 2020-06-28 15:17:28 · 112 阅读 · 0 评论 -
bzoj 2818 欧拉函数
第一种思路,就是对于某个数q,跟他互质的数p,kp和kq的最大公约数是k,那么这个数能组成的答案的数量就是phi[i]乘以某个质数,且乘积小于n基于这种思路写下这个代码#include <cstdio>#include <iostream>#include <iomanip>#include <string>#include <cstdlib>#include <cstring>#include <queue>原创 2020-06-25 13:30:33 · 173 阅读 · 0 评论 -
cf edu 89 d 求一个数的因子和与自己互质
题意:输入n(1≤n≤5*105) ,在输入n个数,问你对于ai(2≤ai≤107) ,是否存在ai的两个因数d1>1 and d2>1,且gcd(d1+d2,ai)=1。有就输出d1,d2,没有就输出-1.input102 3 4 5 6 7 8 9 10 24output-1 -1 -1 -1 3 -1 -1 -1 2 2-1 -1 -1 -1 2 -1 -1 -1 5 3(输出数据的每一列表示一个ai的答案,比如第5列,表示a5–即6的答案)思路:对于每一个ai,先保存原创 2020-06-12 12:06:12 · 351 阅读 · 0 评论 -
poj 3233
#include <iostream>#include <cstdio>#include <iomanip>#include <string>#include <cstdlib>#include <cstring>#include <queue>#include <set>#include <vector>#include <map>#include <alg..转载 2020-05-10 00:03:08 · 201 阅读 · 0 评论 -
poj 2084
递推公式 k(n)=(4n-2)/(n+1)*k(n-1)通项公式 k(n)=c(2n,n)/(n+1) = 2n!/n!/(n-1)h(0) = 1;import java.math.BigInteger;import java.util.Scanner;public class Main { public static void main(String[] args) {...原创 2020-04-20 19:56:17 · 133 阅读 · 0 评论 -
poj 1113 凸包模板 (poj的远古c++居然不支持lambda)
#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <iostream>#include <iomanip>#include <string>#include <algorithm>#...原创 2020-03-18 15:33:13 · 91 阅读 · 0 评论 -
cf 1312 D 逆元模板
Your task is to calculate the number of arrays such that:each array contains n elements;each element is an integer from 1 to m;for each array, there is exactly one pair of equal elements;for each ...原创 2020-03-10 14:56:53 · 1438 阅读 · 0 评论 -
cf 1312 c
Suppose you are performing the following algorithm. There is an array v1,v2,…,vn filled with zeroes at start. The following operation is applied to the array several times — at i-th step (0-indexed) y...原创 2020-03-10 14:54:55 · 171 阅读 · 0 评论 -
数论(好题)
给你一个数组a,求ans=(a1+a2)^ (a1+a3)^ …(a n-1+a n),(共(n+1)*n/2项),数组长度是10的5次方,ai是10的7次方的,求ans。解析:一位一位的算。一堆0和1异或的结果,只和其中的1的个数有关,与0个个数无关。#include <cstdio>#include <cstdlib>#include <cstring&g...原创 2020-03-10 12:44:27 · 176 阅读 · 0 评论 -
poj 1284
若p为奇素数,则p有euler(p-1)个原根int get_euler(int n) { int res = n, a = n; for (int i = 2; i*i <= a; i++) { if (a%i == 0) { res = res / i * (i - 1); while (a%i == 0)a = a / i; } } if (a > ...原创 2020-01-12 16:19:03 · 145 阅读 · 0 评论 -
poj 1995
#include <iostream>#include <cstdio>#include <iomanip>#include <string>#include <cstdlib>#include <cstring>#include <queue>#include <set>#includ...原创 2019-11-24 16:38:48 · 78 阅读 · 0 评论 -
poj 3641
#include <iostream>#include <cstdio>#include <iomanip>#include <string>#include <cstdlib>#include <cstring>#include <queue>#include <set>#includ...原创 2019-11-24 16:16:49 · 73 阅读 · 0 评论 -
poj 3421
#include <iostream>#include <cstdio>#include <iomanip>#include <string>#include <cstdlib>#include <cstring>#include <queue>#include <set>#includ...原创 2019-11-24 15:09:11 · 76 阅读 · 0 评论 -
poj 1091 (容斥原理)
#include <iostream>#include <cstdio>#include <iomanip>#include <string>#include <cstdlib>#include <cstring>#include <queue>#include <set>#includ...原创 2019-10-28 13:43:35 · 177 阅读 · 0 评论 -
poj 1150 (mod)
#include <iostream>#include <cstdio>#include <iomanip>#include <string>#include <cstdlib>#include <cstring>#include <queue>#include <set>#includ...转载 2019-11-03 22:18:43 · 73 阅读 · 0 评论 -
poj 1061 (ext_gcd)
要用long long要判断a是否小于零要判断结果是否小于0#include <iostream>#include <cstdio>#include <iomanip>#include <string>#include <cstdlib>#include <cstring>#include <qu...原创 2019-11-01 12:00:38 · 166 阅读 · 0 评论 -
poj 3126 (素数筛)
#include <iostream>#include <cstdio>#include <iomanip>#include <string>#include <cstdlib>#include <cstring>#include <queue>#include <set>#includ...原创 2019-11-03 16:52:35 · 165 阅读 · 0 评论 -
poj 1930 (gcd)
#include <iostream>#include <cstdio>#include <iomanip>#include <string>#include <cstdlib>#include <cstring>#include <queue>#include <set>#inclu...原创 2019-11-03 16:02:30 · 122 阅读 · 0 评论