数论
MInNrz
猪事顺利^(oo)^
展开
-
hdu1115(求多边形的重心)
代码和思路://①质量集中在顶点上// n个顶点坐标为(xi,yi),质量为mi,则重心// X = ∑( xi×mi ) / ∑mi// Y = ∑( yi×mi ) / ∑mi// 特殊地,若每个点的质量相同,则// X = ∑xi / n// Y = ∑yi / n//②质量分布均匀// 特殊地,质量均匀的三角形重心:// X = ( x0 + x...转载 2019-08-10 22:58:06 · 234 阅读 · 0 评论 -
HDU 4407 Sum
XXX is puzzled with the question below: 1, 2, 3, ..., n (1<=n<=400000) are placed in a line. There are m (1<=m<=1000) operations of two kinds. Operation 1: among the x-th number to the y...原创 2018-08-20 16:27:17 · 190 阅读 · 0 评论 -
hdu 3388 Coprime
Please write a program to calculate the k-th positive integer that is coprime with m and n simultaneously. A is coprime with B when their greatest common divisor is 1.InputThe first line contains...原创 2018-08-19 18:04:44 · 297 阅读 · 0 评论 -
hdu2841(容斥原理)
There are many trees forming a m * n grid, the grid starts from (1,1). Farmer Sherlock is standing at (0,0) point. He wonders how many trees he can see. If two trees and Sherlock are in one line, Far...原创 2018-08-16 17:53:22 · 651 阅读 · 0 评论 -
hdu 1695 (容斥原理)
Given 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 very large, you're...原创 2018-08-16 17:00:31 · 455 阅读 · 0 评论 -
扩展欧几里得算法与中国剩余定理(+逆元)
一篇看起来很舒服的博客转载来自:http://blog.miskcoo.com/2014/09/chinese-remainder-theorem这个也不错:https://blog.csdn.net/tick_tock97/article/details/71313058逆元:https://blog.csdn.net/baidu_35643793/article/details/7...转载 2018-08-08 21:04:19 · 193 阅读 · 0 评论 -
拓展欧几里得模板(acm笔记)
公式:x1=y2; y1=x2-a/b*y2;求方程 ax+by =gcd(a, b) 的一组解int exgcd(int a,int b,int &x,int &y){ if(b==0) { x=1; y=0; return a; } int gcd=exgcd(b,a%b,...原创 2018-08-08 17:23:24 · 264 阅读 · 0 评论 -
容斥原理模板(二进制表示)
烦的噶兰滴被容斥定理给纠结死了注释有详细解释,一个模板,改改就行强烈推荐手动模拟程序#include <bits/stdc++.h>using namespace std;int gcd(int a,int b){ return b==0?a:gcd(b,a%b);}int lcm(int a,int b){ return a*b/gc...原创 2018-08-15 15:54:42 · 329 阅读 · 2 评论 -
欧拉函数模板(acm笔记)
https://www.cnblogs.com/handsomecui/p/4755455.html直接转载过来,写的很好欧拉函数模板(求1~N之间与N互质的数的个数)包括1也可以用打表的方法写#include <iostream>#include <cmath>using namespace std;int Euler(int n){ ...原创 2018-08-08 09:47:03 · 329 阅读 · 0 评论 -
数学笔记(二项式定理)
定理定义二项式定理可以将x+y的任意次幂展开成和的形式其中每个 为一个称作二项式系数的特定正整数,其等于 。这个公式也称二项式公式或二项恒等式。使用求和符号,可以把它写作很明显,当x==y==1时,会有下面这个公式C(n,0)+C(n,1)+……C(n,n)=(1+1)^n=2^n 在容斥定理中:那么总共有多少项呢?其实就是组合数。就...原创 2018-08-15 11:20:57 · 3056 阅读 · 1 评论 -
hdu2588(欧拉函数的运用)
Problem DescriptionThe greatest common divisor GCD(a,b) of two positive integers a and b,sometimes written (a,b),is the largest divisor common to a and b,For example,(1,2)=1,(12,18)=6.(a,b) can be ...原创 2018-08-15 10:29:49 · 153 阅读 · 0 评论 -
hdu 4135 Co-prime(容斥定理)
一个容斥定理的运用,代码实现感觉有点难理解,不过自己手动模拟一下程序就好了#include <iostream>#include <cmath>#include <cstdio>using namespace std;typedef long long ll;int fac[100000];//存的是n的素因子ll Q[100000];...原创 2018-08-10 16:37:44 · 131 阅读 · 0 评论