数论
一种坚持__
这个作者很懒,什么都没留下…
展开
-
青蛙的约会(欧几里得扩展)
C - 青蛙的约会Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰面为止原创 2014-08-07 09:20:19 · 452 阅读 · 0 评论 -
HDU 5387 Clock(时分秒针之间角度)
ClockTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 189 Accepted Submission(s): 135Problem DescriptionGive a time.(hh:mm:ss)原创 2015-08-13 21:11:53 · 722 阅读 · 0 评论 -
POJ 2115 C Looooops(单变元模线性方程)
C LooooopsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20180 Accepted: 5422DescriptionA Compiler Mystery: We are given a C-language style for loop of原创 2015-08-26 15:12:03 · 450 阅读 · 0 评论 -
ZOJ 3609 Modular Inverse(求最小乘法逆元)
Modular InverseTime Limit: 2 Seconds Memory Limit: 65536 KB The modular modular multiplicative inverse of an integer a modulo m is an integer x such that a-1≡x (modm). This is equiv原创 2015-08-24 21:21:15 · 985 阅读 · 0 评论 -
扩展欧几里德算法详解
扩展欧几里德算法 谁是欧几里德?自己百度去 先介绍什么叫做欧几里德算法 有两个数 a b,现在,我们要求 a b 的最大公约数,怎么求?枚举他们的因子?不现实,当 a b 很大的时候,枚举显得那么的naïve ,那怎么做? 欧几里德有个十分又用的定理: gcd(a, b) = gcd(b , a%b) ,这样,我们就可以在几乎是 log 的时转载 2015-08-24 20:35:36 · 389 阅读 · 0 评论 -
HDU 5365 Run (判断正方形个数)
RunTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 769 Accepted Submission(s): 330Problem DescriptionAFA is a girl who like r原创 2015-08-10 10:49:28 · 399 阅读 · 0 评论 -
POJ 2635 The Embarrassed Cryptographer(素数筛+高精度求模+同余模)
The Embarrassed CryptographerTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 12906 Accepted: 3473DescriptionThe young and very promising cryptographer O原创 2015-07-25 16:52:42 · 365 阅读 · 0 评论 -
POJ 3070 Fibonacci(矩阵快速幂模板)
FibonacciTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10007 Accepted: 7141DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn原创 2015-03-03 20:34:37 · 383 阅读 · 0 评论 -
UVA 270 Lining Up(多点共线)
Lining UpTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription Lining Up ``How am I ever going to solve this prob原创 2015-02-02 14:40:23 · 550 阅读 · 0 评论 -
uva Simple calculations (数学推导)
Simple calculations The ProblemThere is a sequence of n+2 elements a0, a1,…, an+1 (n i 1000). It is known that ai = (ai–1 + ai+1)/2 – ci for each i=1, 2, ..., n. You are given a0,原创 2015-01-16 10:37:13 · 607 阅读 · 0 评论 -
Product(大数乘法模板)
K -ProductTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription Product The ProblemThe problem is to mult原创 2014-12-03 12:47:46 · 536 阅读 · 0 评论 -
UVA 10341Solve It(二分求方程解)
Problem FSolve ItInput: standard inputOutput: standard outputTime Limit: 1 secondMemory Limit: 32 MBSolve the equation: p*e-x+ q*sin(x) + r*cos(x) + s*tan(x) + t*x2 + u = 0原创 2015-02-02 15:46:32 · 647 阅读 · 0 评论 -
POJ Goldbach's Conjecture(素数筛~欧拉筛法)
Goldbach's ConjectureTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 39018 Accepted: 14944DescriptionIn 1742, Christian Goldbach, a German amateur mathe原创 2015-01-26 19:01:06 · 723 阅读 · 1 评论 -
POJ 2234 Matches Game(博弈论)
Matches GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8595 Accepted: 4995DescriptionHere is a simple game. In this game, there are several piles o原创 2014-09-16 19:21:14 · 529 阅读 · 0 评论 -
HDU 1573 X问题(数论)
X问题Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3294 Accepted Submission(s): 1067Problem Description求在小于等于N的正整数中有多少个X满足:X原创 2014-08-09 19:54:37 · 479 阅读 · 0 评论 -
POJ 3292 Semi-prime H-numbers(筛选)
Semi-prime H-numbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8018 Accepted: 3446DescriptionThis problem is based on an exercise of David Hilbert,原创 2015-08-05 15:42:18 · 291 阅读 · 0 评论