Two little greedy bears have found two pieces of cheese in the forest of weight a and b grams, correspondingly. The bears are so greedy that they are ready to fight for the larger piece. Thats where the fox comes in and starts the dialog:Two little greedy bears have found two pieces of cheese in the forest of weight a and b grams, correspondingly. The bears are so greedy that they are ready to fig...
Well define S ( n ) for positive integer n as follows: the number of the n s digits in the decimal base. For example, S (893)?=?3 , S (114514)?=?6 . You want to make a consecutive integer sequence starting from number m ( m ,? m ??1,?...Well define S(n) for positive integer n as follows: the number of the ns digits in the decimal base. For example,S(893)?=?3, S(114514)?=?6.
You want to make a cons...
题目点击打开链接 凸多边形A， 多边形B， 判断B是否严在A内。 注意AB有重点 。 将A,B上的点合在一起求凸包，如果凸包上的点是B的某个点，则B肯定不在A内。 或者说B上的某点在凸包的边上则也说明B不严在A里面。 这个处理有个巧妙的方法，只需在求凸包的时候，题目点击打开链接
凸多边形A， 多边形B， 判断B是否严格在A内。
注意AB有重点 。
将A,B上的点合在一起求凸包，如果凸包上的点是B的某个点，则B肯定不在A内。
或者说B上的某...
题目链接：http://codeforces.com/contest/469/problem/D 题目的意思就是把n个不同的数分成2个集合。。 If number x belongs to set A , then number a ?-? x must also belong to set A . If number x belongs to set B , then number b ?-? x must also be题目链接：http://codeforces.com/contest/469/problem/D
题目的意思就是把n个不同的数分成2个集合。。 If number x belongs to set
A, then number a?-?x must also belon...
There is a system of n vessels arranged one above the other as shown in the figure below. Assume that the vessels are numbered from 1 to n , in the order from the highest to the lowest, the volume of the i -th vessel is a i liters. InitialThere is a system of n vessels arranged one above the other as shown in the figure below. Assume that the vessels are numbered from 1 to n, in the order from the...
Inna loves sweets very much. Thats why she decided to play a game called "Sweet Matrix". Inna sees an n m matrix and k candies. Well index the matrix rows from 1 to n and the matrix columns from 1 to m . Well represent the cell in the iInna loves sweets very much. Thats why she decided to play a game called "Sweet Matrix".
Inna sees an n??m matrix and k candies. Well index the matrix rows from 1 t...
Input The first line contains an integer n ( 1?≤? n ?≤?10 5 ) — the number of laptops. Next n lines contain two integers each, a i and b i (1?≤? a i ,? b i ?≤? n ) , where a i is the price of the i -th laptop, and b i is the number th
InputThe first line contains an integer n (1?≤?n?≤?105)— the number of laptops.Next n lines contain two integers each, ai and bi (1?≤?ai,?bi?≤?n),where ai ...
题目链接：D. Population Size 题意：一些数字，要求分块，使得每一块都是等差数列，但是有些数字是-1，代表任意数字（但是要大于0），问最少需要分几块。 思路：贪心。每次找到相邻两个确定数字，并且记录下第一个数字前有多少个-1，就能确定出公差，然后利题目链接：D. Population Size题意：一些数字，要求分块，使得每一块都是等差数列，但是有些数字是-1，代表任意数字（但是要大于0），问最少需要分几块。
思路：贪心。每次找...
Problems # Name A On Segments Own Points standard input/output 1 s, 256 MB x1657 B On Corruption and Numbers standard input/output 1 s, 256 MB x925 C On Number of Decompositions into Multipliers standard input/output 1 s, 256 MB x181 D On
Problems#NameAOn Segments Own Pointsstandard input/output
1 s, 256 MBx1657BOn Corruption and Numbersstandard input/output
1 s, 256 MBx925COn Number of Decomposit...
Codeforces Round #264 (Div. 2) 题目链接 A：注意特判正好的情况，其他就一个个去判断记录最大即可 B：扫一遍，不够的用钱去填即可，把多余能量记录下来 C：把主副对角线处理出来，然后黑白只能各选一个最大的放即可 D：转化为DAG最长路问题，每个数字记录
Codeforces Round #264 (Div. 2)题目链接A：注意特判正好的情况，其他就一个个去判断记录最大值即可B：扫一遍，不够的用钱去填即可，把多余能量记录下来C：把主副对角线处理...
Problems # Name A Inna and Choose Options standard input/output 1 s, 256 MB x1942 B Inna and New Matrix of Candies standard input/output 1 s, 256 MB x1556 C Inna and Huge Candy Matrix standard input/output 2 s, 256 MB x1114 D Dima and Bact
Problems#NameAInna and Choose Optionsstandard input/output
1 s, 256 MBx1942BInna and New Matrix of Candiesstandard input/output
1 s, 256 MBx1556CInna and Huge C...
题目: http://codeforces.com/contest/527/problem/B 题意: 给出两串n( 1?≤? n ?≤?200?000 )个字母的字符串, 求出最多交换一对数, 使得不相同对数变少,求出不相同的对数以及交换的数的位置,若不需交换则输出-1,-1. 思路: 用矩阵记录两个串相同位置不同的字题目:
http://codeforces.com/contest/527/problem/B
题意:
给出两串n(1?≤?n?≤?200?000)个字母的字符串, 求出最多交换一对数, 使得不相同对数变少,求出不相同的对数以及交...
519A A and B and Chess /*********************************************** * Author: fisty * Created Time: 2015/2/28 21:12:09 * File Name : A.cpp *********************************************** */#include iostream#include cstring#include dequ519AA and B and Chess/************************************************ Author: fisty* Created Time: 2015/2/28 21:12:09* File Name : A.cpp**********************...
A. Playing with Dice time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Two players are playing a game. First each of them writes an integer from 1 to 6, and then a dice is thrown.
A. Playing with Dicetime limit per test
1 secondmemory limit per test
256 megabytesinput
standard inputoutput
standard outputTwo players are playing a game. Firs...
The bear has a string s ?=? s 1 s 2 ... s | s | (record | s | is the strings length), consisting of lowercase English letters. The bear wants to count the number of such pairs of indices i ,? j (1?≤? i ?≤? j ?≤?| s |) , that string x (
The bear has a string s?=?s1s2... s|s| (record |s| isthe strings length), consisting of lowercase English letters. The bear wants to count the number of such pai...
