2016年05月_sdfzyhx

原创【NOIP合并果子】uva 10954 add all【贪心】——yhx

Yup!! The problem name reects your task; just add a set of numbers. But you may feel yourselvescondescended, to write a C/C++ program just to add a set of numbers. Such a problem will simplyquestion y

2016-05-16 10:08:08 399

原创【NOIP提高组2015D2T1】uva 714 copying books【二分答案】——yhx

Before the invention of book-printing, it was very hard to make a copy of a book. All the contents hadto be re-written by hand by so called scribers. The scriber had been given a book and after severa

2016-05-16 10:08:03 585

原创 uva 1471 defence lines——yhx

After the last war devastated your country, you - as the king of the land of Ardenia - decided it washigh time to improve the defense of your capital city. A part of your fortication is a line of mag

2016-05-16 10:07:32 403

原创 uva 11572 unique snowflakes——yhx

Emily the entrepreneur has a cool business idea: packaging and selling snowakes. She has devised amachine that captures snowakes as they fall, and serializes them into a stream of snowakes that ow,one

2016-05-16 10:07:28 221

原创 NOIP2009普及组细胞分裂（数论）——yhx

题目描述Hanks 博士是 BT (Bio-Tech，生物技术) 领域的知名专家。现在，他正在为一个细胞实验做准备工作：培养细胞样本。Hanks 博士手里现在有 N 种细胞，编号从 1~N，一个第 i 种细胞经过 1 秒钟可以分裂为Si个同种细胞（Si为正整数）。现在他需要选取某种细胞的一个放进培养皿，让其自由分裂，进行培养。一段时间以后，再把培养皿中的所有细胞平均分入 M 个

2016-05-16 10:07:21 2051

原创 uva 1606 amphiphilic carbon molecules【把缩写写出来，有惊喜】（滑动窗口）——yhx

Shanghai Hypercomputers, the world's largest computer chip manufacturer, has invented a new classof nanoparticles called Amphiphilic Carbon Molecules (ACMs). ACMs are semiconductors. It meansthat they

2016-05-16 10:07:02 681

原创 uva 11054 wine trading in gergovia （归纳【好吧这是我自己起的名字】）——yhx

As you may know from the comic \Asterix and the Chieftain's Shield", Gergovia consists of one street,and every inhabitant of the city is a wine salesman. You wonder how this economy works? Simpleenoug

2016-05-16 10:06:57 249

原创 uva 11134 fabled rooks （贪心）——yhx

We would like to place n rooks, 1 n 5000, on a n nboard subject to the following restrictions• The i-th rook can only be placed within the rectan-gle given by its left-upper corner (xli; yli) an

2016-05-16 10:06:49 252

原创 NOIP2008普及组传球游戏（动态规划）——yhx

题目描述上体育课的时候，小蛮的老师经常带着同学们一起做游戏。这次，老师带着同学们一起做传球游戏。游戏规则是这样的：n个同学站成一个圆圈，其中的一个同学手里拿着一个球，当老师吹哨子时开始传球，每个同学可以把球传给自己左右的两个同学中的一个（左右任意），当老师在此吹哨子时，传球停止，此时，拿着球没有传出去的那个同学就是败者，要给大家表演一个节目。聪明的小蛮提出一个有趣的问题：有多少种不同的

2016-05-16 10:06:14 358

原创 uva 1152 4 values whose sum is zero ——yhx

The SUM problem can be formulated as follows: given four lists A;B;C;D of integer values, computehow many quadruplet (a; b; c; d) 2 AB C D are such that a+b+c+d = 0. In the following, weassume that

2016-05-16 10:05:46 734

原创 uva 1605 building for UN ——yhx

The United Nations has decided to build a new headquarters in Saint Petersburg, Russia. It will have aform of a rectangular parallelepiped and will consist of several rectangular oors, one on top of a

2016-05-16 10:05:40 187

原创 uva 120 stacks of flapjacks ——yhx

Stacks of Flapjacks BackgroundStacks and Queues are often considered the bread and butter of data structures and find use in architecture, parsing, operating systems, and discrete event

2016-05-16 10:05:33 227

原创 uva 1354 Mobile Computing ——yhx

1 #include 2 #include 3 #include 4 struct node 5 { 6 int fat,lson,rson; 7 double wei; 8 }tree[500]; 9 double w[10],lim,ans;10 int n;11 double max(double x,double y)12 {

2016-05-16 10:04:58 516

原创 uva 140 bandwidth （好题） ——yhx

Bandwidth Given a graph (V,E) where V is a set of nodes and E is a set of arcs in VxV, and an ordering on the elements in V, then the bandwidth of a node v is defined as the maximum distance

2016-05-16 10:04:30 249

原创 uva 129 krypton factors ——yhx

Krypton Factor You have been employed by the organisers of a Super Krypton Factor Contest in which contestants have very high mental and physical abilities. In one section of the contest the

2016-05-16 10:04:20 317

原创 uva 524 prime ring problem——yhx

Prime Ring Problem A ring is composed of n (even number) circles as shown in diagram. Put natural numbers into each circle separately, and the sum of numbers in two adjacent circles should

2016-05-16 10:04:12 231

原创 uva 10976 fractions again（水题）——yhx

1 #include 2 int a[30010],b[30010]; 3 int main() 4 { 5 int i,j,k,l,m,n,x,y,z; 6 while (scanf("%d",&k)==1) 7 { 8 n=0; 9 for (i=k+1;i2*k;i++)10 if

2016-05-16 10:04:03 220

原创 uva 11059 maximum product（水题）——yhx

1 #include 2 int a[20]; 3 int main() 4 { 5 int i,j,k,m,n,p,t,q,y,z; 6 long long ans,x; 7 t=0; 8 while (scanf("%d",&n)==1) 9 {10 ans=0;11 for (i=

2016-05-16 10:03:56 577

原创 uva 725 division（水题）——yhx

1 #include 2 #include 3 #include 4 bool b; 5 bool ok(int x,int y) 6 { 7 int p,q,i; 8 if (x10000) return 0; 9 bool bb[15]={0};10 for (i=1;i5;i++)11 {12

2016-05-16 10:03:51 327

原创 uva 11853 paintball（好题）——yhx

1 #include 2 #include 3 #include 4 struct circ 5 { 6 double x,y,r; 7 }a[1010]; 8 bool vis[1010]; 9 int n;10 double ans_l,ans_r;11 double min(double a,double b)12 {13 re

2016-05-16 10:03:45 929

原创 uva 1599 ideal path（好题）——yhx

1 #include 2 #include 3 #include 4 #include 5 using namespace std; 6 queueint> q1,q2; 7 stackint> s; 8 int first[100010],next[400010],to[400010],dis[100010]; 9 long long color[400010]

2016-05-16 10:03:34 336

原创 uva 1572 self-assembly ——yhx

1 #include 2 #include 3 #include 4 using namespace std; 5 int map[60][60],cnt[60]; 6 queueint> q; 7 char s[10]; 8 int main() 9 {10 int i,j,k,m,n,p,t,x,y,z,w,temp[5];11 whil

2016-05-16 10:03:29 260

空空如也

空空如也