数论
文章平均质量分 81
utoppia
这个作者很懒,什么都没留下…
展开
-
sgu 117 Counting
题目描述:117. Countingtime limit per test: 0.5 sec. memory limit per test: 4096 KBFind amount of numbers for given sequence of integer numbers such that after raising them to theM-th pow原创 2012-10-29 08:54:15 · 425 阅读 · 0 评论 -
SGU_511_Fermat's Last Theorem
PRO IS HEREx^n + y^n = z^n (mod p)假设p的原根是r我们设 x=r^a,y=r^b,z=r^c;原方程化为r^an + r^bn = r^cn (mod p)令R=r^n设a=> 1 + R^(b-a) = R^(c-a) (mod p) (c>=a)或者R^(a-c) + R^(b-c) = 1 (mod p)原创 2013-07-29 17:09:01 · 1223 阅读 · 5 评论 -
ZOJ 2674 Stange Limit
PROM IS HERE欧拉定理: a^b = a^(phi(m) + b%phi(m)) { mod m }#include#include#include#include#include#include#includeusing namespace std;#define FOR(i,a,b) for(int (i)=(a);(i)<=(b)原创 2013-04-18 15:31:47 · 718 阅读 · 1 评论 -
sgu 169 Numbers
169. Numberstime limit per test: 0.5 sec.memory limit per test: 4096 KBinput: standardoutput: standardLet us call P(n) - the product of all digits of number n (in decimal notation)原创 2012-11-06 15:43:39 · 453 阅读 · 0 评论 -
sgu 193 Chinese Girls' Amusement
193. Chinese Girls' Amusementtime limit per test: 0.5 sec.memory limit per test: 65536 KBinput: standardoutput: standardYou must have heard that the Chinese culture is quite differ原创 2012-11-06 23:18:13 · 10026 阅读 · 0 评论 -
sgu 154 Factorial
154. Factorialtime limit per test: 0.5 sec.memory limit per test: 4096 KBinput: standard inputoutput: standard outputYou task is to find minimal natural number N, so that N! contai原创 2012-11-05 02:07:04 · 370 阅读 · 0 评论 -
sgu 113 Nearly prime numbers
题目描述:113. Nearly prime numberstime limit per test: 0.5 sec. memory limit per test: 4096 KBNearly prime number is an integer positive number for which it is possible to find such primes原创 2012-10-26 09:07:18 · 410 阅读 · 0 评论 -
sgu 140 Integer Sequences
140. Integer Sequencestime limit per test: 0.5 sec. memory limit per test: 4096 KBA sequence Ais called aninteger sequence of length N if all its elementsA1A2 .. AN are non-negative integers原创 2012-11-03 09:52:32 · 677 阅读 · 0 评论 -
sgu 137 Funny Strings
题目描述:137. Funny Stringstime limit per test: 0.5 sec. memory limit per test: 4096 KBLet's consider a stringof non-negative integers, containingN elements. Suppose these elementsare S1原创 2012-11-02 19:39:19 · 410 阅读 · 0 评论 -
sgu 106 The equation
题目描述:106. The equationtime limit per test: 0.5 sec. memory limit per test: 4096 KBThere is an equation ax + by + c = 0. Given a,b,c,x1,x2,y1,y2 you must determine, how many integer roo原创 2012-10-24 00:48:13 · 627 阅读 · 0 评论 -
sgu 126 Boxes
126. Boxestime limit per test: 0.5 sec. memory limit per test: 4096 KBThere are two boxes. There are A balls in the first box, and B balls in the second box (0 < A + B < 2147483648). It is pos原创 2012-11-01 00:35:51 · 410 阅读 · 0 评论 -
sgu 119 Magic Pairs
题目描述:119. Magic Pairstime limit per test: 0.5 sec. memory limit per test: 4096 KB“Prove that for any integer X and Y if 5X+4Y is divided by 23 than 3X+7Y is divided by23 too.原创 2012-10-30 13:31:12 · 564 阅读 · 0 评论 -
sgu 118 Digital Root
118. Digital Roottime limit per test: 0.5 sec. memory limit per test: 4096 KBLet f(n) be a sum of digits for positive integern. If f(n) is one-digit number then it is a digital root for n原创 2012-10-29 09:26:13 · 348 阅读 · 0 评论 -
模板,pollard_rho大数因数分解
大数分解,没有模板你就OUT啦。。。原创 2014-04-16 21:31:27 · 1585 阅读 · 0 评论