UVA
绝尘花遗落
一骑红尘妃子笑,无人知是荔枝来
展开
-
Smallest Bounding Rectangle - uva10173
Smallest Bounding RectangleGiven the Cartesian coordinates of n(>0)2-dimensional points, write a program that computes the area of their smallest bounding rectangle (smallest rectangle containing all t原创 2015-12-05 18:07:53 · 742 阅读 · 0 评论 -
【Uvalive3942】Remember the Word——字典树+dp
uvalive 3942给你一个模式串和一些匹配串,问模式串由匹配串组成的方案数。将匹配串建成字典树,在字典树上进行dp。#include <bits/stdc++.h>using namespace std;const int maxn = 310000;const int maxm = 123;const int mod = 20071027;struct node {原创 2016-10-17 20:16:43 · 399 阅读 · 0 评论 -
【UVA11992】Fast Matrix Operations——二维线段树
UVA11992给你 一个矩阵和一些的操作,计算子矩阵的和,最大值,最小值。1表示矩阵所有的元素加v,2表示矩阵所有的元素变为v,3表示查询区间的信息。由于最大只有20行,所以对于每一行建立一颗线段树。进行区间操作,比较恶心的是区间加和区间更改的关系。原创 2016-10-12 23:56:13 · 411 阅读 · 0 评论 -
Uvalive 7366 Brocard
Uvalive7366 Brocard原创 2016-10-09 11:30:54 · 406 阅读 · 0 评论 -
数论刷题-uva【10533】 - Digit Primes
A prime number is a positive number, which is divisible by exactly two different integers. A digit prime is a prime number whose sum of digits is also prime. For example the prime number 41 is a digit原创 2016-07-18 22:00:34 · 1194 阅读 · 0 评论 -
数论刷题-uva【10168】- Summation of Four Primes
Euler proved in one of his classic theorems that prime numbers are infinite in number. But can every number be expressed as a summation of four positive primes? I don’t know the answer. May be you ca原创 2016-07-18 21:15:13 · 693 阅读 · 0 评论 -
【UVA11361】Investigating Div-Sum Property——数位DP
An integer is divisible by 3 if the sum of its digits is also divisible by 3. For example, 3702 is divisible by 3 and 12(3+7+0+2) is also divisible by 3. This property also holds for the integer 9. I原创 2016-03-28 19:52:17 · 915 阅读 · 2 评论 -
【LA3516】Exploring Pyramids——动态规划+乘法原理
Archaeologists have discovered a new set of hidden caves in one of the Egyptian pyramids. The decryption of ancient hieroglyphs on the walls nearby showed that the caves structure is as follows. Ther原创 2016-03-28 08:21:07 · 716 阅读 · 0 评论 -
【UVA11174】Stand in a Line——逆元+树形Dp
All the people in the byteland want to stand in a line in such a way that no person stands closer to the front of the line than his father. You are given the information about the people of the bytela原创 2016-03-27 19:53:19 · 570 阅读 · 0 评论 -
【UVA11137】Ingenuous Cubrency——完全背包
题意:给你一个数n,将n分解成若干个正整数的立方之和,问有多少种方式。 分析:将一个数ii的立方数作为一个物品,体积为i3i^3,每一个物品的个数没有限制,转化为完全背包的形式。#include <cstdio>#include <cstring>#include <cstdlib>#include <cmath>#include <iostream>#include <alg原创 2016-03-27 17:16:52 · 455 阅读 · 0 评论 -
【LA3263】That Nice Euler Circuit——欧拉定理的应用
Little Joey invented a scrabble machine that he called Euler, after the great mathematician. In his primary school Joey heard about the nice story of how Euler started the study about graphs. The pro原创 2016-04-08 11:33:57 · 539 阅读 · 0 评论 -
【UVA11178】Morley's Theorem——Morley 定理
Morleys theorem states that that the lines trisecting the angles of an arbitrary plane triangle meet at the vertices of an equilateral triangle. For example in the figure below the tri-sectors of a原创 2016-04-08 10:43:02 · 834 阅读 · 0 评论 -
【UVA11806】Cheerleaders——容斥
题意:给你一个n×mn \times m的矩阵网格和k个人,问有多少种方法使得每一个格子只放一个人,并且第一行,最后一行,第一列,最后一列都有人。 分析:如果没有限制条件,我们知道答案是ans=C(nm,k),但是有限制条件,我们定义A表示第一行没有人,B表示最后一行没有人,C表示第一列没有人,D表示最后一列没有人,我们可以得到答案是ans=ans−A−B−C−D+AB+AC+AD⋯+AB原创 2016-03-25 19:47:40 · 574 阅读 · 0 评论 -
【UVA10325】The Lottery——简单容斥定理
题意:给你一个数组,问[1,n][1,n]中有多少个数不能整除数组的任何一个数 分析:对于这种问题,我们可以求其逆问题,就是在区间[1,n]中存在多少数可以整除数组中的只少一个数 对于a[i],可以整除它的数的数量为Ai=na[i],但是我们不能将每一个数的数量加起来,因为存在重复元素a[i],可以整除它的数的数量为A_i = \frac{n}{a[i]},但是我们不能将每一个数的数原创 2016-03-24 21:41:38 · 738 阅读 · 0 评论 -
【UVA11401】Triangle Counting——计算方法
题意:从 1,2,3⋯,n1,2,3\cdots ,n中选出三个不同的整数,使它们能够组成三角形,问有多少种方法 分析:设最长的边为xx,另外的两条边为y,z\quad y,z ,所以y+z>x\quad y+z>x,所以z的范围为x>z>x−yx>z>x-y 当y=1时,x>z>x−1显然无解当\quad y =1 时,x>z>x-1\quad 显然无解 当y=2时,x>z>原创 2016-03-24 20:55:24 · 853 阅读 · 0 评论 -
【UVA11538】Chess Queen——简单组合
题意:给你一个n×mn \times m 的棋盘,在上面放两个皇后,(一黑一白)问有多少种放的方法 分析:皇后的攻击的范围为同一行或者同一列或者在同一对角线,这三种情况没有交集,利用加法原理,对于同一行的放置数目为A(n,m)=n×m×(m−1)A(n,m) = n\times m\times (m-1),同一列的放置为B(m,n)=m×n×(n−1)B(m,n) = m\times n原创 2016-03-24 19:54:28 · 749 阅读 · 0 评论 -
【UVA11426】GCD - Extreme (II)——欧拉函数
Given the value of N, you will have to find the value of G. The definition of G is given below: G=∑i=1n∑j=i+1nGCD(i,j)G= \sum\limits_{i=1}^{n} \sum\limits_{j=i+1}^nGCD(i,j) Here GCD(i, j) means the gr原创 2016-03-30 18:07:27 · 855 阅读 · 0 评论 -
【Uva10288】——Coupons概率
题意:一共有n种不同的Coupons,每次得到每种Coupons的概率是相同的,问期望多少次得到所有的n种Coupons假设我们已经得到k种Coupons,那么我们得到新的Coupons的概率为n−kn\frac{n-k}{n},所需的期望步数是nn−k\frac{n}{n-k}。求和我们得到总的期望步数nn+nn−1+⋯n1=n×∑i=1n1i\frac{n}{n}+\frac{n}{n-1}+\原创 2016-11-10 00:11:28 · 581 阅读 · 0 评论