-------数学及计算机几何------
文章平均质量分 71
小胡子Haso
~~
展开
-
【POJ 3735】Training little cats(万万没想到の矩快)
【POJ 3735】Training little cats(万万没想到の矩快)题目大意: n只猫编号1~n 3中操作: g i:给i一粒花生 e i:i把得到的花生全部吃掉 s i j:i与j交换花生。给出一个操作序列,包含k个操作。 问执行这个序列m次,最后n只猫各自拥有的花生数量。一直在找循环节,写了个暴力对拍和数据生成器,结果死活找不到合适的循环。之后问了问度娘……对啊!矩快啊!原创 2016-10-07 15:00:35 · 865 阅读 · 1 评论 -
【POJ 1286】Necklace of Beads(polya定理)
【POJ 1286】Necklace of Beads(polya定理)Necklace of BeadsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7550 Accepted: 3145DescriptionBeads of red,原创 2016-05-17 19:09:26 · 2417 阅读 · 0 评论 -
【POJ 2891】Strange Way to Express Integers(扩展欧几里得)
【POJ 2891】Strange Way to Express Integers(扩展欧几里得)Time Limit: 1000MS Memory Limit: 131072KTotal Submissions: 12934 Accepted: 4130DescriptionElina is reading a bo原创 2016-05-05 20:46:50 · 4113 阅读 · 0 评论 -
【POJ 3440】 Coin Toss(概率公式)
【POJ 3440】 Coin Toss(概率公式)Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 3591 Accepted: 957DescriptionIn a popular carnival game, a coin is tossed原创 2016-04-15 21:50:35 · 4811 阅读 · 0 评论 -
【POJ 1061】青蛙的约会(扩展欧几里得)
【POJ 1061】青蛙的约会(扩展欧几里得)Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 103473 Accepted: 20116Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条原创 2016-04-26 17:47:33 · 4078 阅读 · 0 评论 -
【HDOJ 5652】xiaoxin juju needs help(排列组合)
【HDU 】xiaoxin juju needs help(排列组合)xiaoxin juju needs helpTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1122 Accepted Submission(s)原创 2016-03-28 20:05:32 · 1247 阅读 · 0 评论 -
【POJ 1765】 November Rain(离散化+扫描线)
【POJ 1765】 November Rain(离散化+扫描线)Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 2193 Accepted: 472Case Time Limit: 2000MSDescriptionContemporar原创 2016-04-07 21:17:40 · 1023 阅读 · 0 评论 -
【HDOJ】 Picture (离散化+线段树)
【HDOJ】 Picture (离散化+线段树)Picture Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3898 Accepted Submission(s): 1979Problem Descri原创 2016-04-05 21:02:35 · 1296 阅读 · 0 评论 -
【POJ 2482】 Stars in Your Window(线段树+离散化+扫描线)
【POJ 2482】 Stars in Your Window(线段树+离散化+扫描线)Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11294 Accepted: 3091DescriptionFleeting time does not blur原创 2016-02-26 11:33:17 · 1722 阅读 · 0 评论 -
【HDU 5145】 NPY and girls(组合+莫队)
【HDU 5145】 NPY and girls(组合+莫队)NPY and girlsTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 593 Accepted Submission(s): 179原创 2016-02-25 09:03:38 · 2175 阅读 · 0 评论 -
【POJ 1151】 Atlantis(离散化+扫描线)
【POJ 1151】 Atlantis(离散化+扫描线)Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20223 Accepted: 7634DescriptionThere are several ancient Greek texts that原创 2016-03-31 20:56:51 · 1207 阅读 · 0 评论 -
【POJ 1681】 Painter's Problem (高斯消元)
【POJ 1681】 Painter's Problem (高斯消元)Painter's ProblemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5119 Accepted: 2481DescriptionTher原创 2015-10-30 22:11:12 · 1165 阅读 · 0 评论 -
【ZOJ 3690】 Choosing number (矩阵快速幂)
【ZOJ 3690】 Choosing number (矩阵快速幂)Choosing numberTime Limit: 2 Seconds Memory Limit: 65536 KBThere are n people standing in a row. And There are m numbers, 1.2...m. Every one sh原创 2015-10-27 20:02:33 · 1909 阅读 · 0 评论 -
【HDOJ 2824】 The Euler function (欧拉筛)
【HDOJ 2824】 The Euler function (欧拉筛)The Euler functionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4594 Accepted Submission(s):原创 2015-09-17 19:54:47 · 1567 阅读 · 0 评论 -
【HDOJ 5407】 CRB and Candies (大犇推导
【HDOJ 5407】 CRB and Candies赛后看这题题解只有满眼的迷茫………………g(N) = LCM(C(N,0),C(N,1),...,C(N,N)) f(n)\ =\ LCM(1, 2, ..., n)f(n) = LCM(1,2,...,n), the fact g(n)\ =\ f(n+1) / (n+1)g(n) = f(n+1)/(n+原创 2015-08-21 16:30:47 · 1013 阅读 · 0 评论 -
【HDOJ 4762】 Cut the Cake (数学概率+大数)
【HDOJ 4762】 Cut the Cake (数学概率+大数)Cut the CakeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1205 Accepted Submission(s): 581原创 2015-09-07 12:22:30 · 866 阅读 · 0 评论 -
【POJ 1845】 Sumdiv (整数唯分+约数和公式+二分等比数列前n项和+同余)
【POJ 1845】 Sumdiv用的东西挺全 最主要通过这个题学了约数和公式跟二分求等比数列前n项和 还有一种小优化的整数拆分 整数的唯一分解定理: 任意正整数都有且只有一种方式写出其素因子的乘积表达式。 A=(p1^k1)*(p2^k2)*(p3^k3)*....*(pn^kn) 其中pi均为素数约数和公式:原创 2015-08-21 22:17:34 · 1305 阅读 · 0 评论 -
【HDOJ 4764】 Stone (博弈)
【HDOJ 4764】 Stone (博弈)StoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1090 Accepted Submission(s): 761Problem Descript原创 2015-09-07 11:20:04 · 1469 阅读 · 0 评论 -
【POJ 3070】Fibonacci(矩阵快速幂)
【POJ 3070】Fibonacci(矩阵快速幂)Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12333 Accepted: 8752DescriptionIn the Fibonacci integer sequence, F0 = 0,原创 2016-05-06 19:28:55 · 1331 阅读 · 0 评论 -
【POJ 2409】 Let it Bead(Polya)
【POJ 2409】 Let it Bead(Polya)Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5378 Accepted: 3596Description"Let it Bead" company is located upstairs a原创 2016-05-17 21:31:20 · 2535 阅读 · 0 评论 -
【POJ 3004】Subway planning(极角排序+贪心)
Subway planningTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 1384Accepted: 375DescriptionThe government in a foreign country is looking into the possibility of establishing a subway syste原创 2016-09-07 20:46:35 · 1429 阅读 · 0 评论 -
【POJ 2280】Amphiphilic Carbon Molecules(极角排序+坐标转换+扫描线)
Amphiphilic Carbon MoleculesTime Limit: 20000MSMemory Limit: 65536KTotal Submissions: 1577Accepted: 543DescriptionShanghai Hypercomputers, the world’s largest computer chip manufacturer, has invente原创 2016-09-07 19:15:48 · 1035 阅读 · 1 评论 -
【POJ 1095】Trees Made to Order(卡特兰+递归)
Trees Made to OrderTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 7155Accepted: 4094DescriptionWe can number binary trees using the following scheme: The empty tree is numbered 0.The sin原创 2016-09-01 19:59:44 · 2169 阅读 · 0 评论 -
【POJ 1487】Single-Player Games(建方程高消)
Single-Player GamesTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 1387Accepted: 377DescriptionPlaying games is the most fun if other people take part. But other players are not always availa原创 2016-08-22 21:27:59 · 1502 阅读 · 0 评论 -
【HDOJ 5812】Distance(约数拆分)
【HDOJ 5812】Distance(约数拆分)DistanceTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 216 Accepted Submission(s): 81 Problem DescriptionIn numbe原创 2016-08-10 12:01:20 · 897 阅读 · 0 评论 -
【HDOJ 5794】A Simple Chess(大组合数Lucas定理+容斥)
【HDOJ 5794】A Simple Chess(大组合数Lucas定理+容斥)A Simple ChessTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1081 Accepted Submission(s): 291Problem原创 2016-08-05 17:44:31 · 1277 阅读 · 0 评论 -
【POJ 3270】Cow Sorting(置换群排序)
Cow Sorting(置换群排序) Time Limit: 2000MSMemory Limit: 65536KTotal Submissions: 6909Accepted: 2716DescriptionFarmer John’s N (1 ≤ N ≤ 10,000) cows are lined up to be milked in the evening. Each cow has a u原创 2016-08-17 11:06:54 · 1159 阅读 · 0 评论 -
【HDOJ 5738】Eureka(向量哈希+组合数学)
【HDOJ 5738】Eureka(向量哈希+组合数学)EurekaTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 824 Accepted Submission(s): 207Problem De原创 2016-07-22 09:03:17 · 695 阅读 · 0 评论 -
【HDU 5765】Bonds(进制运算妙用)
【HDU 5765】Bonds(进制运算妙用)BondsTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 309 Accepted Submission(s): 140Problem Description Given a原创 2016-07-31 19:58:17 · 1291 阅读 · 2 评论 -
【POJ 3101】Astronomy(GCD+LCM+公式)
【POJ 3101】Astronomy(GCD+LCM+公式)AstronomyTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 5706Accepted: 1270DescriptionThere are n planets in the planetary system of star X. They orbit star X原创 2016-08-03 14:07:08 · 1048 阅读 · 0 评论 -
【HDU 5768】Lucky7(CRT+容斥)
【HDU 5768】Lucky7(CRT+容斥)Lucky7Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 811 Accepted Submission(s): 299Problem Description When ???? wa原创 2016-07-30 13:37:05 · 937 阅读 · 0 评论 -
【CF 699B】One Bomb(思维)
【CF 699B】One Bomb(思维)B. One Bombtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are giv原创 2016-07-20 08:38:28 · 1016 阅读 · 0 评论 -
【HDU 5721】Palace(平面最近点对)
【HDU 5721】Palace(平面最近点对)PalaceTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 404 Accepted Submission(s): 104Problem Desc原创 2016-07-18 20:37:09 · 3004 阅读 · 0 评论 -
【HDU 5720】Wool(排序+排序/扫描线。。。)
【HDU 5720】Wool(排序+排序/扫描线。。。)WoolTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 136 Accepted Submission(s): 41Problem原创 2016-07-18 08:48:46 · 1287 阅读 · 0 评论 -
【POJ 2947】Widget Factory(高斯消元+逆元)
【POJ 2947】Widget Factory(高斯消元+逆元)Widget FactoryTime Limit: 7000MSMemory Limit: 65536KTotal Submissions: 5464Accepted: 1884DescriptionThe widget factory produces several different kinds of widgets. Ea原创 2016-07-28 10:12:06 · 1071 阅读 · 0 评论 -
【HDU 5755】Gambler Bo(高斯消元)
【HDU 5755】Gambler Bo(高斯消元)Gambler BoTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 236 Accepted Submission(s): 91Special JudgeProblem Descr原创 2016-07-27 14:17:40 · 1443 阅读 · 0 评论 -
【HDU 5729】Rigid Frameworks(组合数学+DP)
【HDU 5729】Rigid Frameworks(组合数学+DP)Rigid FrameworksTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 249 Accepted Submission(s): 200Problem Desc原创 2016-07-26 09:54:28 · 2938 阅读 · 2 评论 -
【POJ 3292】 Semi-prime H-numbers
【POJ 3292】 Semi-prime H-numbers打个表题意是1 5 9 13...这种4的n次方+1定义为H-numbersH-numbers中只由1*自己这一种方式组成 即没有其他因子的 叫做H-prime两个H-prime的乘积叫做H-semi-prime 还有一个要求是H-semi-prime只能由两个H-prime组成 即4个H-number 不可由3原创 2015-08-20 09:02:25 · 979 阅读 · 0 评论 -
【SDUTOJ 3314】 l (扩欧裸题)
【SDUTOJ 3314】 l (扩欧裸题)比赛时候居然没看出来。。眼拙了 做题少了……找一个k令k*m%n=1...这不就是求x*m = 1(mod n)。。。倮倮倮代码如下:#include using namespace std;int Gcd(int a,int b,int &x,int &y){ if(!b) {原创 2015-09-03 13:29:25 · 908 阅读 · 0 评论 -
【POJ 2965】 The Pilots Brothers' refrigerator
【POJ 2965】 The Pilots Brothers' refrigerato预处理用二进制(BFS)暴力枚举原创 2015-06-09 23:57:14 · 741 阅读 · 0 评论