数论
BYSora
这个作者很懒,什么都没留下…
展开
-
hdu4549——M斐波那契数列(费马小定理+矩阵快速幂)
Problem Description M斐波那契数列F[n]是一种整数数列,它的定义如下:F[0] = a F[1] = b F[n] = F[n-1] * F[n-2] ( n > 1 )现在给出a, b, n,你能求出F[n]的值吗?Input 输入包含多组测试数据; 每组数据占一行,包含3个整数a, b, n( 0 <= a, b, n <= 10^9 )Output 对每组测试原创 2017-04-18 21:27:30 · 849 阅读 · 0 评论 -
1~n中所有数的欧拉函数值
摘自刘汝佳的《算法竞赛入门经典》void phi_table(int n,int *phi){ for(int i=2; i<=n; ++i) phi[i]=0; phi[1]=1; for(int i=2; i<=n; ++i) if(!phi[i]) for(int j=i; j<=n; j+=i)原创 2016-08-03 17:42:27 · 5305 阅读 · 0 评论 -
poj1284——Primitive Roots(欧拉函数)
DescriptionWe say that integer x, 0 < x < p, is a primitive root modulo odd prime p if and only if the set { (xi mod p) | 1 <= i <= p-1 } is equal to { 1, …, p-1 }. For example, the consecutive powers原创 2016-08-03 17:31:22 · 1073 阅读 · 0 评论 -
山东省第四届ACM省赛题——Square Number(平方数的性质)
题目描述 In mathematics, a square number is an integer that is the square of an integer. In other words, it is the product of some integer with itself. For example, 9 is a square number, since it can be w原创 2016-05-22 11:48:13 · 1481 阅读 · 0 评论 -
hdu1249——三角形
Problem Description用N个三角形最多可以把平面分成几个区域?Input输入数据的第一行是一个正整数T(1Output对于每组测试数据,请输出题目中要求的结果.Sample Input212Sample Output28代码#include using namespac原创 2015-01-21 13:16:55 · 1395 阅读 · 0 评论 -
hdu2044——一只小蜜蜂...
Problem Description有一只经过训练的蜜蜂只能爬向右侧相邻的蜂房,不能反向爬行。请编程计算蜜蜂从蜂房a爬到蜂房b的可能路线数。其中,蜂房的结构如下所示。Input输入数据的第一行是一个整数N,表示测试实例的个数,然后是N 行数据,每行包含两个整数a和b(0Output对于每个测试实例,请输出蜜蜂从蜂房a爬到蜂房b的可能路线数,原创 2015-01-21 14:23:11 · 2536 阅读 · 0 评论 -
ytu2887——机器人排序问题(已解决)
大致是一个机器人很聪明,但会把质数反过来看,例如把13看成31,所以排序时19比37大。现先输入一个数N,代表实验实例的个数接下来输入a和b,代表[a,b]区间。下一行输出这个区间内的质数,从小到大排序,注意要按机器人的要求,例如输入19和35,输出31 23 19 29,每个数之间有一个空格。我给出的这段代码理论上是正确的,但就是错误的。。。。。#includeusin原创 2015-04-06 21:16:01 · 1157 阅读 · 0 评论 -
hdu1021——Fibonacci Again
Problem DescriptionThere are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).InputInput consists of a sequence of lines, each containing an integer原创 2015-05-28 17:09:00 · 693 阅读 · 0 评论 -
hdu1418——抱歉
Problem Description非常抱歉,本来兴冲冲地搞一场练习赛,由于我准备不足,出现很多数据的错误,现在这里换一个简单的题目:前几天在网上查找ACM资料的时候,看到一个中学的奥数题目,就是不相交的曲线段分割平面的问题,我已经发到论坛,并且lxj 已经得到一个结论,这里就不多讲了,下面有一个类似的并且更简单的问题:如果平面上有n个点,并且每个点至少有2条曲线原创 2015-05-28 22:02:29 · 604 阅读 · 0 评论 -
lightoj1370——Bi-shoe and Phi-shoe(欧拉函数应用)
Description Bamboo Pole-vault is a massively popular sport in Xzhiland. And Master Phi-shoe is a very popular coach for his success. He needs some bamboos for his students, so he asked his assistant B原创 2016-08-04 20:14:12 · 1326 阅读 · 0 评论 -
51nod1080——两个数的平方和
给出一个整数N,将N表示为2个整数i j的平方和(i <= j),如果有多种表示,按照i的递增序输出。 例如:N = 130,130 = 3^2 + 11^2 = 7^2 + 9^2 (注:3 11同11 3算1种)Input 一个数N(1 <= N <= 10^9)Output 共K行:每行2个数,i j,表示N = i^2 + j^2(0 <= i <= j)。 如果无法分解为2个数的平原创 2016-08-01 17:15:51 · 971 阅读 · 0 评论 -
51nod1136——欧拉函数
对正整数n,欧拉函数是少于或等于n的数中与n互质的数的数目。此函数以其首名研究者欧拉命名,它又称为Euler’s totient function、φ函数、欧拉商数等。例如:φ(8) = 4(Phi(8) = 4),因为1,3,5,7均和8互质。Input 输入一个数N。(2 <= N <= 10^9)Output 输出Phi(n)。Input示例 8Output示例 4#include <原创 2016-08-01 17:39:53 · 993 阅读 · 0 评论 -
poj1845——Sumdiv(数论+幂的因子和)
DescriptionConsider two natural numbers A and B. Let S be the sum of all natural divisors of A^B. Determine S modulo 9901 (the rest of the division of S by 9901). InputThe only line contains the two n原创 2017-04-11 16:26:25 · 972 阅读 · 0 评论 -
poj3292——Semi-prime H-numbers(数论)
DescriptionThis problem is based on an exercise of David Hilbert, who pedagogically suggested that one study the theory of 4n+1 numbers. Here, we do only a bit of that.An H-number is a positive number原创 2017-02-18 21:15:30 · 1040 阅读 · 0 评论 -
poj2635——The Embarrassed Cryptographer(高精度取模)
DescriptionThe young and very promising cryptographer Odd Even has implemented the security module of a large system with thousands of users, which is now in use in his company. The cryptographic keys原创 2017-02-18 12:37:47 · 794 阅读 · 0 评论 -
hdu5793——A Boring Question(快速幂+逆元)
Problem Description There are an equation. ∑0≤k1,k2,⋯km≤n∏1⩽j<’m(kj+1kj)%1000000007=? We define that (kj+1kj)=kj+1!kj!(kj+1−kj)! . And (kj+1kj)=0 while kj+1<’kj. You have to get the answer for each原创 2016-08-09 10:51:28 · 950 阅读 · 0 评论 -
Lightoj1259——Goldbach`s Conjecture(哥德巴赫猜想)
Description Goldbach’s conjecture is one of the oldest unsolved problems in number theory and in all of mathematics. It states:Every even integer, greater than 2, can be expressed as the sum of two pr原创 2016-08-06 11:38:31 · 1316 阅读 · 0 评论 -
Lightoj1282——Leading and Trailing(幂取模求前三位)
Description You are given two integers: n and k, your task is to find the most significant three digits, and least significant three digits of nk.Input Input starts with an integer T (≤ 1000), denoti原创 2016-08-05 17:41:09 · 838 阅读 · 0 评论 -
Lightoj1336——Sigma Function(因子和)
Description Sigma function is an interesting function in Number Theory. It is denoted by the Greek letter Sigma (σ). This function actually denotes the sum of all divisors of a number. For example σ(2转载 2016-08-05 16:03:17 · 552 阅读 · 0 评论 -
Lightoj1341——Aladdin and the Flying Carpet(算术基本定理)
Description It’s said that Aladdin had to solve seven mysteries before getting the Magical Lamp which summons a powerful Genie. Here we are concerned about the first mystery.Aladdin was about to enter原创 2016-08-05 11:17:37 · 829 阅读 · 0 评论 -
hdu1405——The Last Practice
Problem DescriptionTomorrow is contest day, Are you all ready?We have been training for 45 days, and all guys must be tired.But , you are so lucky comparing with many excellent boys who have no原创 2015-05-28 22:35:53 · 842 阅读 · 0 评论 -
hdu1061——Rightmost Digit
Problem DescriptionGiven a positive integer N, you should output the most right digit of N^N.InputThe input contains several test cases. The first line of the input is a single integer T原创 2015-05-30 17:13:08 · 962 阅读 · 1 评论 -
poj3006——Dirichlet's Theorem on Arithmetic Progressions
DescriptionIf a and d are relatively prime positive integers, the arithmetic sequence beginning with a and increasing by d, i.e., a, a + d, a + 2d, a + 3d, a + 4d, ..., contains infinitely man原创 2015-08-14 16:23:28 · 898 阅读 · 0 评论 -
hdu4135——Co-prime(容斥原理求区间互素)
Problem Description Given a number N, you are asked to count the number of integers between A and B inclusive which are relatively prime to N. Two integers are said to be co-prime or relatively prime转载 2016-04-28 15:16:22 · 1027 阅读 · 0 评论 -
hdu2006——求奇数的乘积
Problem Description给你n个整数,求他们中所有奇数的乘积。Input输入数据包含多个测试实例,每个测试实例占一行,每行的第一个数为n,表示本组数据一共有n个,接着是n个整数,你可以假设每组数据必定至少存在一个奇数。Output输出每组数中的所有奇数的乘积,对于测试实例,输出一行。Sample Input3 1 2 34 2原创 2015-01-21 12:51:45 · 4084 阅读 · 0 评论 -
Lightoj1008——Fibsieve`s Fantabulous Birthday(找规律)
Fibsieve had a fantabulous (yes, it's an actual word) birthday party this year. He had so many gifts that he was actually thinking of not having a party next year.Among these gifts there was an N x原创 2016-04-14 19:03:56 · 639 阅读 · 0 评论 -
Lightoj1294——Positive Negative Sign(神坑)
Given two integers: n and m and n is divisible by 2m, you have to write down the first n natural numbers in the following form. At first take first m integers and make their sign negative, then take ne原创 2016-04-14 18:28:46 · 520 阅读 · 0 评论 -
poj1338——Ugly Numbers
DescriptionUgly numbers are numbers whose only prime factors are 2, 3 or 5. The sequence 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, … shows the first 10 ugly numbers. By convention, 1 is included. Given the原创 2016-02-03 17:25:22 · 468 阅读 · 0 评论 -
poj2115——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原创 2016-03-09 20:13:19 · 567 阅读 · 0 评论 -
poj1995——Raising Modulo Numbers(快速幂取余)
DescriptionPeople are different. Some secretly read magazines full of interesting girls' pictures, others create an A-bomb in their cellar, others like using Windows, and some like difficult mathema原创 2016-03-11 19:48:55 · 532 阅读 · 0 评论 -
zoj2876——May Day Holiday(算星期)
As a university advocating self-learning and work-rest balance, Marjar University has so many days of rest, including holidays and weekends. Each weekend, which consists of Saturday and Sunday, is a原创 2016-04-02 18:45:32 · 436 阅读 · 0 评论 -
Lightoj1109——False Ordering(简单数学)
We define b is a Divisor of a number a if a is divisible by b. So, the divisors of 12 are 1, 2, 3, 4, 6, 12. So, 12 has 6 divisors.Now you have to order all the integers from 1 to 1000. x will come原创 2016-04-16 11:22:00 · 584 阅读 · 0 评论 -
Lightoj1010——Knights in Chessboard(找规律)
Given an m x n chessboard where you want to place chess knights. You have to find the number of maximum knights that can be placed in the chessboard such that no two knights attack each other.Those原创 2016-04-16 12:52:42 · 375 阅读 · 0 评论 -
集合划分问题(斯特林数模板)
Description n个元素的集合{1,2,…,n}可以划分若干个非空子集。例如,当n=4时,集合{1,2,3,4}可以划分为15个不同的非空子集如下:{{1},{2},{3},{4}}, {{1,2},{3},{4}}, {{1,3},{2},{4}}, {{1,4},{2},{3}}, {{2,3},{1},{4}}, {{2,4},{1},{3}}, {{3,4},{1},{原创 2016-04-29 13:38:34 · 1524 阅读 · 0 评论 -
poj2109——Power of Cryptography
DescriptionCurrent work in cryptography involves (among other things) large prime numbers and computing powers of numbers among these primes. Work in this area has resulted in the practical use of resu原创 2016-06-01 16:39:09 · 1046 阅读 · 0 评论 -
山东省第四届ACM省赛题——Alice and Bob(二进制)
题目描述 Alice and Bob like playing games very much.Today, they introduce a new game.There is a polynomial like this: (a0*x^(2^0)+1) * (a1 * x^(2^1)+1)*.......*(an-1 * x^(2^(n-1))+1). Then Alice ask B原创 2016-05-28 16:31:32 · 1170 阅读 · 0 评论 -
山东省第五届ACM省赛题——Hearthstone II(第二类Stiring数)
题目描述 The new season has begun, you have n competitions and m well prepared decks during the new season. Each competition you could use any deck you want, but each of the decks must be used at least on原创 2016-04-20 13:17:53 · 733 阅读 · 0 评论 -
Lightoj1136——Division by 3(数学)
There is sequence 1, 12, 123, 1234, ..., 12345678910, ... . Now you are given two integers A and B, you have to find the number of integers from Ath number to Bth(inclusive) number, which are divisi原创 2016-04-18 19:09:01 · 523 阅读 · 0 评论 -
Lightoj1214——Large Division(同余定理,判断是否整除)
Given two integers, a and b, you should check whether a is divisible by b or not. We know that an integer a is divisible by an integer b if and only if there exists an integer c such that a = b * c.原创 2016-04-18 15:24:10 · 463 阅读 · 0 评论 -
Lightoj1045——Digits of Factorial(k进制的n的阶乘位数)
Factorial of an integer is defined by the following functionf(0) = 1f(n) = f(n - 1) * n, if(n > 0)So, factorial of 5 is 120. But in different bases, the factorial may be different. For example,原创 2016-04-18 12:28:06 · 733 阅读 · 0 评论