![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
[ACM]_数论
同学少年
没有什么不可能!
展开
-
[ACM] POJ 2635 The Embarrassed Cryptographer (同余定理,素数打表)
The Embarrassed CryptographerTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 11978 Accepted: 3194DescriptionThe young and very promising cryptographer原创 2014-07-20 14:28:57 · 2127 阅读 · 0 评论 -
[ACM] HDU 5139 Formula (离线处理)
FormulaProblem Descriptionf(n)=(∏i=1nin−i+1)%1000000007You are expected to write a program to calculate f(n) when a certain n is given. InputMulti test cases (about 10000原创 2014-12-07 09:49:23 · 2235 阅读 · 0 评论 -
[ACM] sdut 2878 Circle (高斯消元)
CircleTime Limit: 2000ms Memory limit: 65536K 有疑问?点这里^_^题目描述You 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原创 2014-11-27 19:09:58 · 2443 阅读 · 0 评论 -
[ACM] sdut 2877 angry_birds_again_and_again (简单数学积分)
angry_birds_again_and_againTime Limit: 2000ms Memory limit: 65536K 有疑问?点这里^_^题目描述The problems called "Angry Birds" and "Angry Birds Again and Again" has been solved by many原创 2014-11-27 20:48:28 · 1901 阅读 · 0 评论 -
[ACM] POJ 2689 Prime Distance (大区间素数筛选)
Prime DistanceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12811 Accepted: 3420DescriptionThe branch of mathematics called number theory is about p原创 2014-11-12 12:11:33 · 2964 阅读 · 0 评论 -
[ACM] hdu 3037 Saving Beans (Lucas定理,组合数取模)
Saving BeansProblem 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 tim原创 2014-09-04 20:32:43 · 3263 阅读 · 0 评论 -
[BestCoder Round #5] hdu 4956 Poor Hanamichi (数学题)
Poor HanamichiTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 743 Accepted Submission(s): 275Problem DescriptionHanamichi i原创 2014-08-18 11:25:12 · 1519 阅读 · 0 评论 -
[ACM] POJ 3233 Matrix Power Series (求矩阵A+A^2+A^3...+A^k,二分求和或者矩阵转化)
Matrix Power SeriesTime Limit: 3000MS Memory Limit: 131072KTotal Submissions: 15417 Accepted: 6602DescriptionGiven a n × n matrix A and a positive integer k,原创 2014-09-18 12:19:05 · 3635 阅读 · 2 评论 -
[ACM] POJ 3070 Fibonacci (矩阵幂运算)
FibonacciTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9517 Accepted: 6767DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = F原创 2014-09-18 09:45:21 · 2264 阅读 · 0 评论 -
[BestCoder Round #3] hdu 4910 Problem about GCD
转载自:http://www.kuangbin.net/archives/hdu4910 慢慢学习.HDU 4910Problem about GCD求小于等于 N 的与N互质的所有数的乘积MOD N Problem about GCDTime Limit: 2000/1000 MS (Java/Others)转载 2014-08-05 15:30:06 · 1087 阅读 · 0 评论 -
[ACM] POJ 2947 Widget Factory (高斯消元)
Widget FactoryTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 4436 Accepted: 1502DescriptionThe widget factory produces several different kinds of widge原创 2014-07-29 19:22:13 · 2348 阅读 · 0 评论 -
[ACM] POJ 1061青蛙的约会(扩展欧几里得求模线性方程)
青蛙的约会Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 89206 Accepted: 15926Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到原创 2014-07-28 16:26:04 · 1118 阅读 · 0 评论 -
[ACM] hdu 3923 Invoker (Poyla计数,快速幂运算,扩展欧几里得或费马小定理)
InvokerProblem DescriptionOn of Vance's favourite hero is Invoker, Kael. As many people knows Kael can control the elements and combine them to invoke a powerful skill. Vance like Kael v原创 2014-07-25 19:35:07 · 2296 阅读 · 0 评论 -
[ACM] POJ 2115 C Looooops (扩展欧几里得求解模线性方程)
解题思路:参考:原创 2014-07-23 09:24:17 · 2294 阅读 · 0 评论 -
[ACM] POJ 1845 Sumdiv(求A的B次方的所有因子的和,一大堆数学公式...,可做模板)
解题思路:题意是求A的B次方的所有因子的和。学到了一堆数学公式。。下面知识点和思路转载于:http://blog.csdn.net/lyy289065406/article/details/6648539应用定理主要有三个:要求有较强 数学思维 的题应用定理主要有三个:(1) 整数的唯一分解定理: 任意正整数都有且只有一种方式写出其原创 2014-07-21 16:21:59 · 2794 阅读 · 0 评论 -
Binary system(求区间内二进制中1的个数最多的数)
Description给定一个范围[a,b] (0Input输入数据有多组,每组数据输入两个整数a,b,表示区间[a, b]。Output输出该区间内二进制的1最多的整数,如果有多个数二进制1的个数相同,输出最小的那个数。Sample Input4 87 14Sample Output77HINT 思路:区间原创 2015-03-07 16:09:43 · 3123 阅读 · 0 评论