数论
so_so_y
start to record bugs <- so hard so brave
展开
-
组合数学 POJ 1942 Paths on a Grid
DescriptionImagine you are attending your math lesson at school. Once again, you are bored because your teacher tells things that you already mastered years ago (this time he’s explaining that (a+b)2=a原创 2017-02-03 21:36:46 · 346 阅读 · 0 评论 -
POJ 2409 Let it Bead(polya染色问题)
Description“Let it Bead” company is located upstairs at 700 Cannery Row in Monterey, CA. As you can deduce from the company name, their business is beads. Their PR department found out that customers a原创 2017-08-04 19:57:07 · 463 阅读 · 0 评论 -
Polya定理学习总结
Burnside引理设G是N={1,2,……,n}上的置换群,G在N上可引出不同的等价类,其中不同的等价类的个数为1|G|∑g∈G\frac{1}{|G|}\sum_{g∈G}c1(g),其中,c1(g)是置换g中不边缘的个数,即g中1阶循环的个数。理解后续补更……polya定理设G={a1,a2,a3,……,ag}是n个对象的置换群,用m种颜色给这n个对象染色,不同的着色方案为:1|G|{mc(a原创 2017-08-04 18:44:07 · 690 阅读 · 0 评论 -
POJ 2154 Color(polya+欧几里得)
DescriptionBeads of N colors are connected together into a circular necklace of N beads (N<=1000000000). Your job is to calculate how many different kinds of the necklace can be produced. You should kn原创 2017-08-04 20:01:47 · 300 阅读 · 0 评论 -
POJ 3904 Sky Code(容斥)
DescriptionStancu likes space travels but he is a poor software developer and will never be able to buy his own spacecraft. That is why he is preparing to steal the spacecraft of Petru. There is only o原创 2017-08-06 10:12:19 · 301 阅读 · 0 评论 -
HDU 5976 Detachment(逆元)+逆元总结
Description In a highly developed alien society, the habitats are almost infinitedimensional space. In the history of this planet,there is an old puzzle. You have a line segment with x units’ le...原创 2017-05-03 17:26:48 · 546 阅读 · 0 评论 -
51nod 1829 函数(组合数+容斥)
Description想知道f:A->B这个函数(其中|A|=n, |B|=m)的所有映射关系要使B的每个元素都要被A的一个元素覆盖到。 数字可能很大你只要输出方案数模1,000,000,007即可。Input一共一行两个数,n和m。(1<=n,m<=1,000,000)Output一共一行包含一个方案数。Input示例2 2Output示例2解题思路映射是在A中的每个元素在B中都有唯一一个与原创 2017-11-03 15:27:10 · 229 阅读 · 0 评论 -
扩展欧几里得学习总结
扩展欧几里得算法用来在已知整数a,b的情况下求解符合条件的x,y值,满足等式ax+by=gcd(a,b)。 且有对于整数 a,b, 必然存在整数对 x,y,满足ax+by=gcd(a,b)。有关公式的递归关系由欧几里得算法可知求解两个整数gcd的过程,即gcd(a,b)=gcd(b,a%b)。那么当辗转到最终状态时b=0,a=gcd,此时对于ax+by=gcd(a,b)对应着x=1,y=0,即a*原创 2017-08-02 19:38:57 · 403 阅读 · 0 评论 -
51nod 1486 大大走格子(组合数学+容斥)
Description有一个h行w列的棋盘,里面有一些格子是不能走的,现在要求从左上角走到右下角的方案数。Input单组测试数据。 第一行有三个整数h, w, n(1 ≤ h, w ≤ 10^5, 1 ≤ n ≤ 2000),表示棋盘的行和列,还有不能走的格子的数目。 接下来n行描述格子,第i行有两个整数ri, ci (1 ≤ ri ≤ h, 1 ≤ ci ≤ w),表示格子所在的行和列。 输原创 2017-11-29 17:18:21 · 968 阅读 · 0 评论 -
HDU 3037 Saving Beans(组合数学+Lucas定理)
Problem DescriptionAlthough winter is far away, squirrels have to work day and night to save beans. They need plenty of food to get through those long cold days. After some time the squirrel family thi原创 2017-11-26 22:01:18 · 241 阅读 · 0 评论 -
51nod 1120 机器人走方格V3(组合数学+卡特兰数+Lucas)
DescriptionN * N的方格,从左上到右下画一条线。一个机器人从左上走到右下,只能向右或向下走。并要求只能在这条线的上面或下面走,不能穿越这条线,有多少种不同的走法?由于方法数量可能很大,只需要输出Mod 10007的结果。Input输入一个数N(2 <= N <= 10^9)。Output输出走法的数量 Mod 10007。Input示例4Output示例10解题思路 参照博客学原创 2017-11-26 22:15:26 · 293 阅读 · 0 评论 -
山东省第五届ACM省赛 Circle(高斯消元)
Problem DescriptionYou have been given a circle from 0 to n - 1. If you are currently at x, you will move to (x - 1) mod n or (x + 1) mod n with equal probability. Now we want to know the expected n...原创 2017-07-31 17:40:55 · 456 阅读 · 0 评论 -
牛客网 不凡的夫夫(斯特林公式)
链接:https://www.nowcoder.com/acm/contest/75/A 来源:牛客网题目描述 夫夫有一天对一个数有多少位数感兴趣,但是他又不想跟凡夫俗子一样, 所以他想知道给一个整数n,求n!的在8进制下的位数是多少位。 输入描述: 第一行是一个整数t(0<t<=1000000)t(0<t<=1000000)t (0n!≈(2πn)−−...原创 2018-02-16 12:35:59 · 263 阅读 · 0 评论 -
51nod 1419 最小公倍数挑战(数论)
Description几天以前,我学习了最小公倍数。玩得挺久了,想换换口味。 我不想用太多的数字,我想从1到n中选三个数字(可以相同)。使得他们的最小公倍数最大。Input单组测试数据。 第一行有一个整数n (1≤n≤1,000,000)。Output输出一个整数表示选三个数字的最大的最小公倍数。Input示例97Output示例504210解题...原创 2018-02-16 19:46:16 · 206 阅读 · 0 评论 -
51nod 1365 Fib(N) mod Fib(K) & 蓝桥杯 斐波那契(数论)
51nod 1365 Fib(N) mod Fib(K) DescriptionFib(N)表示斐波那契数列的第N项(F(0) = 0, F(1) = 1),给出N和K,求Fib(N) mod Fib(K)。由于结果太大,输出Mod 1000000007的结果。Input第1行:一个数T,表示后面用作输入测试的数的数量。(1 <= T <= 50000) 第2...原创 2018-03-08 19:26:12 · 593 阅读 · 0 评论 -
LOJ 「美团 CodeM 初赛 Round A」二分图染色(组合数学)
Description给定一个完全二分图,图的左右两边的顶点数目相同。我们要把图中的每条边染成红色、蓝色、或者绿色,并使得任意两条红边不共享端点、同时任意两条蓝边也不共享端点。计算所有满足条件的染色的方案数,并对10^9+7取模。Input二分图单边的顶点数目 nOutput输出一个整数,即所求的答案。Sample Input2Sample Out...原创 2018-04-10 21:17:08 · 909 阅读 · 1 评论 -
Codeforces 964 C. Alternating Sum (求和+逆元)
DescriptionYou are given two integers a and b. Moreover, you are given a sequence s0,s1,…,sn. All values in s are integers 1 or −1. It’s known that sequence is k-periodic and k divides n+1. In other...原创 2018-04-18 12:57:52 · 344 阅读 · 0 评论 -
山东省第八届ACM省赛 fireworks(杨辉三角+组合数)
Problem DescriptionHmz likes to play fireworks, especially when they are put regularly. Now he puts some fireworks in a line. This time he put a trigger on each firework. With that trigger, each fi...原创 2018-04-24 09:30:35 · 238 阅读 · 0 评论 -
POJ 1286 Necklace of Beads(Polya染色问题)
DescriptionBeads of red, blue or green colors are connected together into a circular necklace of n beads ( n < 24 ). If the repetitions that are produced by rotation around the center of the circular n原创 2017-08-04 18:56:32 · 411 阅读 · 0 评论 -
POJ 1026 Cipher(置换)
DescriptionBob and Alice started to use a brand-new encoding scheme. Surprisingly it is not a Public Key Cryptosystem, but their encoding and decoding is based on secret keys. They chose the secret key原创 2017-08-04 20:52:03 · 291 阅读 · 0 评论 -
组合数学 POJ 1019 Number Sequence
DescriptionA single positive integer i is given. Write a program to find the digit located in the position i in the sequence of number groups S1S2…Sk. Each group Sk consists of a sequence of positive i原创 2017-02-03 21:00:33 · 376 阅读 · 0 评论 -
组合数学 POJ 1850 Code
DescriptionTransmitting and memorizing information is a task that requires different coding systems for the best use of the available space. A well known system is that one where a number is associated原创 2017-02-03 20:14:39 · 427 阅读 · 0 评论 -
组合数学 POJ 3252 Round Numbers
DescriptionThe cows, as you know, have no fingers or thumbs and thus are unable to play Scissors, Paper, Stone’ (also known as ‘Rock, Paper, Scissors’, ‘Ro, Sham, Bo’, and a host of other names) in ord原创 2017-02-03 18:03:44 · 354 阅读 · 0 评论 -
POJ 2891 Strange Way to Express Integers(扩展欧几里得)
DescriptionElina is reading a book written by Rujia Liu, which introduces a strange way to express non-negative integers. The way is described as following: Choose k different positive integers a1, a2原创 2017-04-18 17:08:15 · 423 阅读 · 0 评论 -
POJ 2115 C Looooops(扩展欧几里得)
DescriptionA Compiler Mystery: We are given a C-language style for loop of type for (variable = A; variable != B; variable += C)statement;I.e., a loop which starts by setting variable to value A and原创 2017-04-16 21:23:19 · 653 阅读 · 0 评论 -
HDU 5974 A Simple Math Problem(简单数学)
Description Given two positive integers a and b,find suitable X and Y to meet the conditions: X+Y=a, Least Common Multiple (X, Y) =bInput Input includes multiple sets of test data.Each test data o原创 2017-05-03 21:26:11 · 684 阅读 · 0 评论 -
第七届蓝桥杯国赛 一步之遥
题意从昏迷中醒来,小明发现自己被关在X星球的废矿车里。矿车停在平直的废弃的轨道上。他的面前是两个按钮,分别写着“F”和“B”。小明突然记起来,这两个按钮可以控制矿车在轨道上前进和后退。按F,会前进97米。按B会后退127米。透过昏暗的灯光,小明看到自己前方1米远正好有个监控探头。他必须设法使得矿车正好停在摄像头的下方,才有机会争取同伴的援助。或许,通过多次操作F和B可以办到。矿车上的动力原创 2017-05-23 09:33:01 · 2436 阅读 · 0 评论 -
POJ 3103 Astronomy
DescriptionThere are n planets in the planetary system of star X. They orbit star X in circular orbits located in the same plane. Their tangent velocities are constant. Directions of orbiting of all pl原创 2017-04-24 19:08:19 · 682 阅读 · 0 评论 -
POJ 1222 EXTENDED LIGHTS OUT(高斯消元)
DescriptionIn an extended version of the game Lights Out, is a puzzle with 5 rows of 6 buttons each (the actual puzzle has 5 rows of 5 buttons each). Each button has a light. When a button is pressed,原创 2017-07-25 20:50:24 · 711 阅读 · 0 评论 -
HDU 6143 Killer Names 组合数+(容斥/第二类Stirling数)
Problem Description Galen Marek, codenamed Starkiller, was a male Human apprentice of the Sith Lord Darth Vader. A powerful Force-user who lived during the era of the Galactic Empire, Marek originate原创 2017-08-18 10:45:54 · 301 阅读 · 0 评论 -
POJ 1681 Painter's Problem(高斯消元)
DescriptionThere is a square wall which is made of n*n small square bricks. Some bricks are white while some bricks are yellow. Bob is a painter and he wants to paint all the bricks yellow. But there i原创 2017-07-26 20:08:05 · 494 阅读 · 0 评论 -
POJ 1830 开关问题(高斯消元)
Description有N个相同的开关,每个开关都与某些开关有着联系,每当你打开或者关闭某个开关的时候,其他的与此开关相关联的开关也会相应地发生变化,即这些相联系的开关的状态如果原来为开就变为关,如果为关就变为开。你的目标是经过若干次开关操作后使得最后N个开关达到一个特定的状态。对于任意一个开关,最多只能进行一次开关操作。你的任务是,计算有多少种可以达到指定状态的方法。(不计开关操作的顺序)Inpu原创 2017-07-26 20:16:00 · 751 阅读 · 0 评论 -
POJ 2065 SETI(高斯消元)
DescriptionFor some years, quite a lot of work has been put into listening to electromagnetic radio signals received from space, in order to understand what civilizations in distant galaxies might be t原创 2017-07-26 20:53:17 · 575 阅读 · 0 评论 -
POJ 2947 Widget Factory(高斯消元)
DescriptionThe widget factory produces several different kinds of widgets. Each widget is carefully built by a skilled widgeteer. The time required to build a widget depends on its type: the simple wid原创 2017-07-26 21:25:43 · 422 阅读 · 0 评论 -
高斯消元学习总结
算法目的主要是用来求解线性方程组,根据方程组得出增广矩阵,对增广矩阵进行化简可得矩阵的秩,并可以根据秩的关系判断方程解的情况。算法主要思想1、线性代数中有关矩阵的化简(主要是初等行变换): 先根据矩阵初等行变换求解方程组 2x+y+z=16x+2y+z=−1−2x+2y+z=72x+y+z=1\\6x+2y+z=-1\\-2x+2y+z=7 先根据方程组表示出增广矩阵,化简 ⎡⎣⎢⎢26−2原创 2017-07-31 13:47:44 · 2286 阅读 · 0 评论 -
欧拉函数学习笔记整理 POJ 2407+POJ 1284+POJ 2478+POJ 3090
定义欧拉函数φ(x)代表1-x中与x互质的数的个数。基本相关性质1.设x=a1p1∗a2p2∗...∗anpnx=a1p1∗a2p2∗...∗anpnx={a1}^{p1}*{a2}^{p2}*...*{an}^{pn} 则φ(x)=x∗(1−1a1)∗(1−1a2)∗...∗(1−1an)x∗(1−1a1)∗(1−1a2)∗...∗(1−1an)x*(1-\frac{1}{a1...原创 2017-04-27 19:18:11 · 603 阅读 · 0 评论 -
POJ 3270 Cow Sorting(置换)
DescriptionFarmer John’s N (1 ≤ N ≤ 10,000) cows are lined up to be milked in the evening. Each cow has a unique “grumpiness” level in the range 1…100,000. Since grumpy cows are more likely to damage F原创 2017-08-04 20:25:57 · 294 阅读 · 0 评论 -
山东省第七届ACM省赛 Triple Nim(Nim博弈)
Problem DescriptionAlice and Bob are always playing all kinds of Nim games and Alice always goes first. Here is the rule of Nim game:There are some distinct heaps of stones. On each turn, two play...原创 2018-04-26 15:43:03 · 212 阅读 · 0 评论