ACMer'

Subway planningTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 1384Accepted: 375DescriptionThe government in a foreign country is looking into the possibility of establishing a subway syste

Amphiphilic Carbon MoleculesTime Limit: 20000MSMemory Limit: 65536KTotal Submissions: 1577Accepted: 543DescriptionShanghai Hypercomputers, the world’s largest computer chip manufacturer, has invente

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

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

【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

【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

【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

【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

【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

【POJ 2947】Widget Factory（高斯消元+逆元）Widget FactoryTime Limit: 7000MSMemory Limit: 65536KTotal Submissions: 5464Accepted: 1884DescriptionThe widget factory produces several different kinds of widgets. Ea

【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

【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

【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

【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

【POJ 2409】 Let it Bead（Polya）Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5378 Accepted: 3596Description"Let it Bead" company is located upstairs a

【POJ 1286】Necklace of Beads（polya定理）Necklace of BeadsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7550 Accepted: 3145DescriptionBeads of red,

【POJ 3070】Fibonacci（矩阵快速幂）Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12333 Accepted: 8752DescriptionIn the Fibonacci integer sequence, F0 = 0,

【POJ 2891】Strange Way to Express Integers（扩展欧几里得）Time Limit: 1000MS Memory Limit: 131072KTotal Submissions: 12934 Accepted: 4130DescriptionElina is reading a bo

【POJ 1061】青蛙的约会（扩展欧几里得）Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 103473 Accepted: 20116Description两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条

【POJ 3440】 Coin Toss（概率公式）Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 3591 Accepted: 957DescriptionIn a popular carnival game, a coin is tossed

【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

【POJ 1151】 Atlantis（离散化+扫描线）Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20223 Accepted: 7634DescriptionThere are several ancient Greek texts that

【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)

【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

【POJ 1681】 Painter's Problem （高斯消元）Painter's ProblemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5119 Accepted: 2481DescriptionTher

【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

【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):

【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

【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

【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) {

【POJ 1408】 Fishnet (叉积求面积)一个1*1㎡的池塘 有2*n条线代表渔网 问这些网中围出来的最大面积 一个有效面积是相邻两行和相邻两列中间夹的四边形Input为n 后面跟着四行 每行n个浮点数 每一行分别代表a,b,c,d  如图 并且保证a(i) > a(i-1) b(i) > b(i-1) c(i) > c(i-1) d(i) > d(i-1)n(n

【POJ 2187】 Beauty Contest (凸包-Graham扫描算法)找平面最远点对 数据很大 用暴力会T..我感觉……扫描出个凸包 然后枚举凸包上的点即可 没坑 int也可过 注意重边跟共线就行 代码下附赠几组数据代码如下:#include #include #include #include #include #include #include

【POJ 1113】 Wall给n个点 连出一个凸包 然后在凸包外筑墙 要求墙与凸包每一处的距离都>=l 问需要建的最短的墙长乍一看挺难 画画图就能看出来 凸包外建距离l的墙 其实就是在凸包每个顶点处 以顶点为圆心 做半径为l的弧 做到两侧半径与点的两边平行即可 然后把这些弧都用直线衔接 就是最短墙长这样还不好求 呢把弧拿出来呢 其实就相当于把整个凸包作为一个点 以该点为圆心

【HDOJ 4686】 Arc of Dream (矩阵快速幂)两个公式a(i) = a(i-1)*Ax+Ay b(i) = b(i-1)*Bx+By求0~(n-1) 的a(i)*b(i)初始矩阵为                                       求幂矩阵为a0

【HDOJ 1021】 Fibonacci Again没错 我又来发水题了。。。感觉做矩快会上瘾。。。这种原本绝壁超时的东西突然秒秒钟出来。。。这感觉。。。爽 上代码#include #include #include using namespace std;typedef struct Matrix Matrix;struct Matrix{ int

【HDOJ 1005】 Number Sequence原谅我贴个水题。。。攒了一年的'恩怨'终于了解了　b(￣▽￣)d去年就接触过矩阵快速幂 线代太弱  看他们代码没参悟透。。可能真是悟性太差了。。然后一直以为矩阵快速幂是很叼的东西(不过确实很叼) 太高深 再没敢碰。。有毒啊…………知道最近比赛(VJ)出现矩阵快速幂的频率太高了 今下午又来一道 金巨巨看我万般费解 上来一张纸 一支

【POJ 1039】 Pipe一个水管由多个拐点组成 给出每个拐点的上点 管宽1 即管上下两点分别为(x,y) (x,y-1)问从管口射入光线能到达的最远的x 光线不可折射反射分析可知 光线射得最远 一定会夹在上下两个拐点之间 画画图就明白了 并且一定是一上一下这样枚举每两个拐点 每两个可以组成(x1-x2,(y1-1)-y2) (x1-x2,y1-(y2-1))这样两个上下向量

【POJ 1265】 Area从原点开始走 输入的是每次行走x y移动的长度 可正可负 最终会走会起点问围成的多边形内部点数 边上点数 和面积用到三个定理:1.网格中两格点间经过的格点数+1 = 两点横向和纵向距离的最大公约数2.网格中多边形面积s 边上格点n 内部格点x 则有公式 s = x+n/2-13.网格中多边形面积等于从一点逆时针走一圈 每相邻两个点分别与

【POJ 1905】 Expanding Rods公式+二分题意是一根棍 恰好夹在两面墙之间 在n温度下膨胀成(1+n*c)*l长度 问此时中的距原中点距离膨胀后变成一段弧 也就是圆的一部分 原来的棍子就变成了圆的截线。。。这不是高中很常见的图么。。。不会在电脑作图。。大家手画一下就知道了这样做几条辅助线 从圆心做截线的垂线延长到弧 设棍子原长L 膨胀后(弧)长s 膨胀后中点与

【CF 453A】 Little Pony and Expected Maximum (最大期望)推一下可以发现掷出i的概率为 (i/m)^n-((i-1)/m)^n这样递推求值即可 注意直接先求比再求幂 分子分母分开的话会爆 说了误差不超1e-4即可 不必担心精度代码如下:#include #include #include #include #define