ACM抽屉原理、容斥原理
桑榆207
在最终的结果到来之前,任何肯定会赢之类的话都是虚无缥缈的。
展开
-
HDU 4059 The Boss on Mars(容斥原理 + 四次方求和+求逆元)
题目大意:给定 T 组数据,每组数据一个数 n ,然后让你求 <n且与 n 互素的数的四次方,详见样例。Sample Input2 4 5Sample Output82 35#include <cstdio>#include <cstring>#include<iostream>#include <algorithm&...原创 2018-08-14 09:53:58 · 136 阅读 · 0 评论 -
容斥原理的(二进制思想和质因子分解+模板)
#include<iostream>#include<string>#include<cstdio>#include<algorithm>#include<cmath>#include<iomanip>#include<queue>#include<cstring>#i原创 2018-08-15 18:49:31 · 328 阅读 · 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-t...原创 2018-08-15 16:34:25 · 185 阅读 · 0 评论 -
hdu 1205 吃糖果(抽屉原理)
Problem DescriptionHOHO,终于从Speakless手上赢走了所有的糖果,是Gardon吃糖果时有个特殊的癖好,就是不喜欢将一样的糖果放在一起吃,喜欢先吃一种,下一次吃另一种,这样;可是Gardon不知道是否存在一种吃糖果的顺序使得他能把所有糖果都吃完?请你写个程序帮忙计算一下。Input第一行有一个整数T,接下来T组数据,每组数据占2行,第一行是一个整数N(0&l...原创 2018-08-14 15:20:44 · 117 阅读 · 0 评论 -
POJ 3370 Halloween treats(抽屉原理)
Problem DescriptionEvery year there is the same problem at Halloween: Each neighbour is only willing to give a certain total number of sweets on that day, no matter how many children call on him, so...原创 2018-08-13 11:33:00 · 110 阅读 · 0 评论 -
HDU 4135:Co-prime求(1,m)中与n互质的数的个数(容斥原理&&二进制)
题意: 求 a到b的数中与n互质的数的个数#include<iostream>#include<cstdio>#include<cstring>using namespace std;#define LL long long #define maxn 70LL prime[maxn];LL make_ans(LL num,int m)//1到...原创 2018-08-13 21:10:00 · 322 阅读 · 0 评论 -
HDU 4135:Co-prime求(1,m)中与n互质的数的个数(容斥原理&&队列实现)
题意: 求 a到b的数中与n互质的数的个数#include <cstdio>#include <iostream>#include <algorithm>#include <cstring>#include <vector>#include <queue>#include <set>#defin原创 2018-08-13 21:42:24 · 388 阅读 · 0 评论 -
POJ 2356 Find a multiple(抽屉原理||深搜(数据大时不可用))
Problem DescriptionThe input contains N natural (i.e. positive integer) numbers ( N <= 10000 ). Each of that numbers is not greater than 15000. This numbers are not necessarily different (so it m...原创 2018-08-14 11:35:28 · 128 阅读 · 0 评论 -
求逆元的几种方式及情况
遇到一个题,n(n+1)(2n+1)(3n^2+3n+1)/30mod10^9+7先求30对于10^9+7的逆元代码:#include <cstdio>#include <cstring>#include<iostream>#include <algorithm>using namespace std;long long ex...原创 2018-08-14 10:18:43 · 408 阅读 · 0 评论 -
CF--839EMother of Dragons--容斥原理+数学+算贡献
There arencastles in the Lannister's Kingdom and some walls connect two castles, no two castles are connected by more than one wall, no wall connects a castle to itself.Sir Jaime Lannister has dis...原创 2019-08-12 20:45:06 · 279 阅读 · 0 评论