杂杂的
薄层
努力就有收获~
展开
-
C-Cleaning Pipes(判断两线段相交+二分图判定) 2015-2016 Northwestern European Regional Contest (NWERC 2015)
Linköping has a quite complex water transport system.Around Linköping there are several wells from which wateris drawn. The water is then transported to other locationsusing pipes. Each pipe is a straight canal from one of thewells to some location in原创 2017-10-15 19:35:14 · 413 阅读 · 0 评论 -
HDU-6038 Function - 2017 Multi-University Training Contest - Team 1(构造置换或强连通分量)
You are given a permutation aa from 00 to n−1n−1 and a permutation bb from 00 to m−1m−1. Define that the domain of function ff is the set of integers from 00 to n−1n−1, and the range of it is the set of integers from 00 to m−1m−1. Please calculate the quan原创 2017-07-26 00:45:32 · 389 阅读 · 0 评论 -
POJ 1006(中国剩余定理)
Description人生来就有三个生理周期,分别为体力、感情和智力周期,它们的周期长度为23天、28天和33天。每一个周期中有一天是高峰。在高峰这天,人会在相应的方面表现出色。例如,智力周期的高峰,人会思维敏捷,精力容易高度集中。因为三个周期的周长不同,所以通常三个周期的高峰不会落在同一天。对于每个人,我们想知道何时三个高峰落在同一天。对于每个周期,我们会给出从当前年份的第一天开始,到出转载 2016-11-04 20:30:39 · 560 阅读 · 0 评论 -
HDU-6069 Counting Divisors - 2017 Multi-University Training Contest - Team 4(分解质因子区间筛法)
In mathematics, the function d(n)d(n) denotes the number of divisors of positive integer nn. For example, d(12)=6d(12)=6 because 1,2,3,4,6,121,2,3,4,6,12are all 1212's divisors. In this problem, given l,rl,r and kk, your task is to calculate the following原创 2017-08-04 16:50:33 · 342 阅读 · 0 评论 -
POJ-2689 Prime Distance(区间素数筛--经典题)
The branch of mathematics called number theory is about properties of numbers. One of the areas that has captured the interest of number theoreticians for thousands of years is the question of primality. A prime number is a number that is has no proper fac原创 2017-08-04 16:31:55 · 804 阅读 · 0 评论 -
数学知识小记
2017/05/19 12:12:53.真de弱智,今天连等差数列求和公式都忘了...1.等差数列.通项公式:a(n) = a(1) + (n-1)*d;前n项和: S(n) = n*a(1) + n*(n-1)/2*d;变形:S(n) = (a(1) + a(n))*n/2;2.等比数列.通项公式:a(n) = a(1)*q^(n-1);前n项和:原创 2017-05-19 13:11:55 · 378 阅读 · 0 评论 -
sdut 3258 (第六届山东省ACM省赛H题)
题意:一个数可以表示为另一个数的平方叫做square number,像3*3 = 9,9是一个square number。给定n个数,求有多少对(ai,bi)满足ai×bi为一个square number,其中i != j。思路:除1之外的任何一个整数都可分解为有限个质数的乘积,所以可以推得两个数分解为质因数乘积之后的乘积,只有满足任意一个质因数的个数为偶数个时,它们的乘积原创 2017-04-30 17:04:57 · 415 阅读 · 0 评论 -
关于数论乘法逆元及相关知识点
在求解a/b%m时,可以转化为(a%(b*m))/b,转化过程如下令k = (a/b)/m(向下取整), x = (a/b)%m;a/b = k*m + x (x a = k*b*m + b*x;a%(b*m) = b*x;a%(b*m)/b = x;得证: a/b%m = a%(b*m)/b;所有的除法取模问题都可以用这种方法,但是当b很大的时候,则会出现爆精度问题,所以引出乘法逆元,将除法取模转换为乘法取模。b存在乘法逆元的充要条件是b与模数m互质。设令c为b的逆元,即b*c ≡ 1(原创 2017-05-10 20:57:47 · 9703 阅读 · 1 评论 -
几个余数的定理和性质以及它们的应用
数论中除了整除以外,还有一个很重要也很难的知识点,就是余数,理解余数性质时,要与整除性联系起来,从被除数中减掉余数,那么所得到的差就能够被除数整除了.在一些题目中因为余数的存在,不便于我们计算,去掉余数,回到我们比较熟悉的整除性问题,那么问题就会变得简单了,这样就需要用到余数中一个非常重要的定理—同余定理。同余定义如果a,b除以c的余数相同,就称a,b对于除数c来说是同余的,且有a原创 2017-04-21 22:03:47 · 65372 阅读 · 2 评论 -
ZOJ-1577 求素因子个数 + gcd和lcm的性质?(或者你也可以暴力?)
题意:给出两个数x,y,求有多少组p,q,满足gcd(p,q) = x 且 lcm(p,q) = y。注意:pair(p, q) 和 pair(q, p)是两种方案。思路:两个很易得的结论:lcm(x,y)/ gcd(x,y) = (x / gcd(x,y)) * (y / gcd(x,y))lcm(x,y)* gcd(x,y) = x*y假设g原创 2017-05-02 15:39:40 · 593 阅读 · 0 评论 -
Meisell-Lehmer算法(求1...n范围内的素数个数)
求1...n范围内的素数个数有多少了,如果数据不大的话素筛肯定就可以了,但像HDU-5901中n的范围为10^11肯定就不能素筛了,所以这里介绍Meisell-Lehmer算法,代码颇是复杂,摘的网上的模板然后改成自己的代码习惯。//Meisell-Lehmer算法#include #include #define LL long longusing namespace st原创 2017-05-15 00:38:19 · 1463 阅读 · 0 评论 -
ZJC-1489 L先生与质数V4 51Nod-1184 第N个素数 (大区间求素数个数模板+二分)
Description在解决了上一个质数问题之后,L先生依然不甘心,他还想计算下更多范围内的质数,你能帮助他吗?(没错这题题面和V3一毛一样)Input有多组测试例。(测试例数量<70)每个测试例一行,输入一个数字n(0<n<=3000000),输入0表示结束。Output输出测试例编号和第N个质数。Case X: YSample Input1234101000Sample OutputCase 1: 2Case 2: 3Case 3: 5Case 4: 7Case原创 2017-07-11 01:19:44 · 527 阅读 · 0 评论 -
CodeForces 616E(数学规律)
题意:输入n, m(1 ≤ n, m ≤ 10^13),求 n%1 + n%2 + ... + n%m的值.思路:n%i = n - n/i(整除)*i;所以 ∑(i=1, m) n%i 可以转化为 m*n - ∑(i=1, m) n/i*i;易知:给定一个i,被n整除得c = n/i,另r = n/c,很容易可以得到n整除i到r范围内的所有数的值都是相同的,所以我原创 2017-05-19 13:47:37 · 697 阅读 · 0 评论 -
康拓展开及其逆运算和全排列函数
有所摘抄,但重要的是自己的想法。 康托展开是一个全排列到一个自然数的双射,常用于构建哈希表时的空间压缩。 康托展开的实质是计算当前排列在所有由小到大全排列中的顺序,因此是可逆的。 X = a[n]*(n-1)! + a[n-1]*(n-2)! + ... + a[i]*(i-1)! + ... + a[1]*0!index:原创 2017-01-14 16:57:31 · 1892 阅读 · 0 评论 -
HDU-6033 Add More Zero - 2017 Multi-University Training Contest - Team 1(水之崩心态题)
There is a youngster known for amateur propositions concerning several mathematical hard problems. Nowadays, he is preparing a thought-provoking problem on a specific type of supercomputer which has ability to support calculations of integers between 00原创 2017-07-25 19:01:42 · 693 阅读 · 0 评论 -
HDU-5826 physics(物理定理+微分方程)
There are n balls on a smooth horizontal straight track. The track can be considered to be a number line. The balls can be considered to be particles with the same mass.At the beginning, ball i is at position Xi. It has an initial velocity of Vi and is m原创 2017-09-12 12:03:43 · 346 阅读 · 0 评论 -
HDU-5858 Hard problem(数学公式、计算几何)
2016 Multi-University Training Contest 10Give you the side length of the square L, you need to calculate the shaded area in the picture. The full circle is the inscribed circle of the square, and the center of two quarter circle is the vertex of square,原创 2017-09-14 01:49:50 · 370 阅读 · 0 评论 -
计蒜客-2017 ACM-ICPC 亚洲区(西安赛区)网络赛Trig Function(数学公式推理)
2017 ACM-ICPC 亚洲区(西安赛区)网络赛f(cos(x))=cos(n∗x) holds for all xx.Given two integers nn and mm, you need to calculate the coefficient of x^mxm in f(x)f(x), modulo 998244353998244353.Input FormatMultiple test cases (no more than 100100).Each test原创 2017-09-26 23:48:50 · 240 阅读 · 0 评论 -
code forces 735D 数论(哥德巴赫猜想)
哥德巴赫猜想:当 n > 5 且 n为奇数(odd number)时, n可写成两个质数之和;当 n > 2 且n为偶数(even number)时, n可写成三个质数之和.本题就利用了这个猜想基本内容来做的。本题思路:当n为质数时ans=1,当n不为质数且为偶数时,根据哥德巴赫猜想ans=2,当n不为质数且为奇数时,可知奇数减去一个最小的偶质数2之后还是奇原创 2017-04-28 17:16:52 · 498 阅读 · 0 评论