ACM-扩展欧几里德
寻找星空的孩子
CSDN博客首页:http://blog.csdn.net/u010579068?viewmode=list
博客园地址:http://www.cnblogs.com/yuyixingkong/
展开
-
欧几里得算法和扩展欧几里得算法
欧几里得算法作用:计算两个数的最大公约数。算法:欧几里德算法又称辗转相除法,用于计算两个整数a,b的最大公约数。用gcd(a, b)表示a和b的最大公约数。gcd函数的基本性质:gcd(a,b)=gcd(b,a)=gcd(-a,b)=gcd(|a|,|b|)=gcd(a,b-a)C实现:1 typedef long lon转载 2015-03-24 23:21:08 · 657 阅读 · 0 评论 -
Bell(hdu4767+矩阵+中国剩余定理)
BellTime Limit:3000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 4767 DescriptionWhat? MMM is learning Combinatorics!? Looks like she原创 2015-05-08 23:52:32 · 1083 阅读 · 0 评论 -
Strange Way to Express Integers(中国剩余定理+不互质)
Strange Way to Express IntegersTime Limit:1000MS Memory Limit:131072KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2891Appoint description: System Crawler (2015-04原创 2015-05-03 00:26:05 · 2373 阅读 · 0 评论 -
Chinese remainder theorem again(中国剩余定理+不互质版+hud1788)
Chinese remainder theorem againTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1788Appoint description: System Crawler (2015-04-原创 2015-05-02 18:39:33 · 1587 阅读 · 0 评论 -
C Looooops(欧几里德+poj2115)
C LooooopsDescriptionA 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 while variable is not equal to B, repe原创 2015-05-02 17:35:21 · 3257 阅读 · 5 评论 -
X问题(中国剩余定理应用)
X问题Problem Description求在小于等于N的正整数中有多少个X满足:X mod a[0] = b[0], X mod a[1] = b[1], X mod a[2] = b[2], …, X mod a[i] = b[i], … (0 < a[i] <= 10)。原创 2015-05-02 16:00:18 · 1439 阅读 · 0 评论 -
Hello Kiki(hdu3579+不互质的中国剩余定理)
Hello KikiTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 3579Appoint description: System Crawler (2015-04-29)Description原创 2015-05-01 22:51:02 · 2221 阅读 · 0 评论 -
Modular Inverse(zoj3609+欧几里德)
Modular Inverse,zoj3609,欧几里德,The 9th Zhejiang Provincial Collegiate Programming Contest,The modular modular multiplicative inverse of an integer a modulo m is an integer x such that a-1≡x (mod m). This is equivalent to ax≡1 (mod m).原创 2015-04-27 20:27:14 · 1234 阅读 · 0 评论 -
青蛙的约会(poj1061+欧几里德+同余方程)
**青蛙的约会**Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 94174 Accepted: 17412 Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰面为止。可是它们出发之前忘记了一件很重要原创 2015-03-27 19:34:24 · 4760 阅读 · 1 评论 -
扩展欧几里德求逆元模板
扩展欧几里德求逆元模板:#include<iostream>#define __int64 long longusing namespace std;//举例 3x+4y=1 ax+by=1//得到一组解x0=-1,y0=1 通解为x=-1+4k,y=1-3kinline __int64 extend_gcd(__int64 a,__int64 b,__int64 &x,__int64转载 2015-03-23 22:55:52 · 991 阅读 · 0 评论 -
Bell(矩阵快速幂+中国剩余定理)
BellTime Limit:3000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 4767Appoint description: System Crawler (2015-03-15)DescriptionWhat? M原创 2015-03-23 11:33:05 · 700 阅读 · 0 评论 -
Biorhythms(poj1006+中国剩余定理)
生理周期Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 117861 Accepted: 36978Description人生来就有三个生理周期,分别为体力、感情和智力周期,它们的周期长度为23天、28天和33天。每一个周期中有一天是高峰。在高峰这天,人会在相原创 2015-03-23 11:33:10 · 564 阅读 · 0 评论 -
POJ1006: 中国剩余定理的完美演绎
POJ1006: 中国剩余定理的完美演绎问题描述 人自出生起就有体力,情感和智力三个生理周期,分别为23,28和33天。一个周期内有一天为峰值,在这一天,人在对应的方面(体力,情感或智力)表现最好。通常这三个周期的峰值不会是同一天。现在给出三个日期,分别对应于体力,情感,智力出现峰值的日期。然后再给出一个起始日期,要求从这一天开始,算出最少再过多少天后三个峰值同时出转载 2015-03-22 21:58:25 · 652 阅读 · 0 评论 -
Interesting Integers(CF---BAPC 14 + hnoj11589)扩展欧几里得
I Interesting Integerssource: xkcd.com/587Undoubtedly you know of the Fibonacci numbers. Starting withF1 = 1 and F2 = 1, every next number is the sum of the twoprevious ones. This results in the sequence 1, 1, 2, 3, 5, 8, 13, . . ..Now let us consider原创 2015-08-12 22:16:34 · 1465 阅读 · 0 评论 -
Root(hdu5777+扩展欧几里得+原根)
Root-------------------2015 Multi-University Training Contest 7Problem DescriptionGiven a number sum(1≤sum≤100000000),we have m queries which contains a pair (xi,yi) and would like to know the smallest nonnegative integer ki satisfying xkii=yi mod p whe原创 2015-08-12 00:20:17 · 1588 阅读 · 0 评论 -
One Person Game(zoj3593+扩展欧几里德)
One Person GameTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 3593Appoint description: System Crawler (2015-04-29)Descripti原创 2015-05-04 22:20:57 · 1669 阅读 · 0 评论 -
Mike and Frog(CF547A)
A. Mike and Frogtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMike has a frog and a flower. His frog is n原创 2015-06-11 21:50:54 · 1091 阅读 · 0 评论