数论
SDUTyangkun
这个作者很懒,什么都没留下…
展开
-
poj942Paths on a Grid(组合数学)
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 24411 Accepted: 6050DescriptionImagine you are attending your math lesson at school. Once again, you are bored becau原创 2016-08-17 20:02:08 · 408 阅读 · 0 评论 -
(转)三分问题 + UVALive 6954 Euclidean TSP
三分查找我们都知道 二分查找 适用于单调函数中逼近求解某点的值。如果遇到凸性或凹形函数时,可以用三分查找求那个凸点或凹点。下面的方法应该是三分查找的一个变形。如图所示,已知左右端点L、R,要求找到白点的位置。思路:通过不断缩小 [L,R] 的范围,无限逼近白点。做法:先取 [L,R] 的中点 mid,再取 [mid,R] 的中点 mmid原创 2017-02-23 10:02:54 · 680 阅读 · 0 评论 -
poj 3292 Semi-prime H-numbers(筛法~)
Semi-prime H-numbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8736 Accepted: 3825DescriptionThis problem is based on an exercise of David Hilbert,原创 2016-08-21 13:59:38 · 392 阅读 · 0 评论 -
poj 1845Sumdiv(唯一分解定理&&约数和公式&&二分求等比数列和&&反复平方法计算p^n幂~~~好多定理啊)
SumdivTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 19354 Accepted: 4869DescriptionConsider two natural numbers A and B. Let S be the sum of all natur原创 2016-08-22 19:04:37 · 922 阅读 · 0 评论 -
poj 2115拓展 欧里几得
http://www.cnblogs.com/frog112111/archive/2012/08/19/2646012.html原创 2016-08-22 09:36:35 · 631 阅读 · 0 评论 -
素数筛
方法一//判断是否是一个素数int IsPrime(int a){ //0,1,负数都是非素数 if(a <= 1){ return 0; } //计算枚举上界,为防止double值带来的精度损失,所以采用根号值取整后再加1,即宁愿多枚举一个,也不愿少枚举一个数 int bound = (int)sqrt(a) + 1; for(int i = 2;i < bou原创 2016-08-20 21:30:20 · 413 阅读 · 0 评论 -
poj 2635 The Embarrassed Cryptographer(素数筛 + 同余模定理)
The Embarrassed CryptographerTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14106 Accepted: 3858DescriptionThe young and very promising cryptographer Odd原创 2016-08-20 21:24:12 · 408 阅读 · 0 评论 -
poj 1265 Area(几何 皮克定理 )
AreaTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6261 Accepted: 2753DescriptionBeing well known for its highly innovative products, Merck would defin原创 2016-08-20 17:17:24 · 399 阅读 · 0 评论 -
poj2031Building a Space Station(几何+最小生成树)
Building a Space StationTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 7361 Accepted: 3560DescriptionYou are a member of the space station engineering原创 2016-08-20 15:39:30 · 757 阅读 · 1 评论 -
poj1905 Expanding Rods(二分+几何)
Expanding RodsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 15265 Accepted: 4059DescriptionWhen a thin rod of length L is heated n degrees, it expands原创 2016-08-20 14:54:40 · 329 阅读 · 0 评论 -
poj 3273Monthly Expense(经典二分枚举)
Language:DefaultMonthly ExpenseTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 22175 Accepted: 8681DescriptionFarmer John is an astounding(令人震惊的)原创 2016-08-19 10:33:18 · 455 阅读 · 0 评论 -
poj 1019Number Sequence(数学 巧妙~~~)
Number SequenceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 37890 Accepted: 10952DescriptionA single positive(积极的) integer(整数) i is given. Write a原创 2016-08-18 22:40:57 · 537 阅读 · 0 评论 -
poj1850Code(组合数学)
CodeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 9282 Accepted: 4432DescriptionTransmitting(传输) andmemorizing(记忆) information is a task that requires原创 2016-08-18 18:17:55 · 481 阅读 · 0 评论 -
poj 3252Round Numbers(组合数学)
Round NumbersTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 11850 Accepted: 4461DescriptionThe cows, as you know, have no fingers or thumbs(拇指) and t原创 2016-08-18 15:55:33 · 1239 阅读 · 0 评论 -
java大数板子
import java.util.*;import java.math.*;public class Main{ public static void main(String args[]) { Scanner cin = new Scanner(System.in); BigInteger a, b; //以文件EOF结束转载 2017-03-18 20:08:33 · 358 阅读 · 0 评论