WZJRJ28

Arkady owns a non-decreasing array ????1,????2,…,????????. You are jealous of its beauty and want to destroy this property. You have a so-called XOR-gun that you can use one or more times.In one step you can select two consecutive elements of the array, l

"Everything has been planned out. No more hidden concerns. The condition of Cytus is also perfect.The time right now… 00:01:12…It’s time."The emotion samples are now sufficient. After almost 3 year...

DescriptionConsider two natural numbers A and B. Let S be the sum of all natural divisors of A^B. Determine S modulo 9901 (the rest of the division of S by 9901).InputThe only line contains the

链接：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=2075题目大意：在一个n*n的棋盘上放置n个车，使得它们之间都不能互相攻击（任意两个车都不能同行或同列），并且，对于第i个车，限制它只能放在一个矩形区域内，(xl

A sweet little monster Om Nom loves candies very much. One day he found himself in a rather tricky situation that required him to think a bit in order to enjoy candies the most. Would you succeed with

Petya and Gena love playing table tennis. A single match is played according to the following rules: a match consists of multiple sets, each set consists of multiple serves. Each serve is won by one o

Limak is a little polar bear. He doesn't have many toys and thus he often plays with polynomials.He considers a polynomial valid if its degree is n and its coefficients are integers not exceedin

Famous abstract painter Va Sya plans to start new painting. It will be composed as square with gridn × n, where each unit square is painted by some color.Va Sya already defined the colors for some unit squares. Color of other squares does not matter for h

Problem DescriptionHere is a famous story in Chinese history."That was about 2300 years ago. General Tian Ji was a high official in the country Qi. He likes to play horse racing with the king

You are given a rebus of form ? + ? - ? + ? = n, consisting of only question marks, separated by arithmetic operation '+' and '-', equality and positive integer n. The goal is to replace each questi

International Center for Picassonian Cubism is a Spanish national museum of cubist artworks, dedicated to Pablo Picasso. The center held a competition for an artwork that will be displayed in front of

International Abbreviation Olympiad takes place annually starting from 1989. Each year the competition receives an abbreviation of formIAO'y, where y stands for some number of consequent last digits

Problem Description正如你所知道从前有一个人叫s_sin，她拥有着坐拥三千舰狼的梦想！然而天不遂人愿当她踏进hentai collection的大门之后，现实让她领略到了无情。身为一个坚强的妹子，她知道即使出门大破，即使十一连抽全是R，也要坚信着“玄不救非，氪不改命”，而自己是一个欧白这样最初的信仰！有一天s_sin率领着她的舰狼们到达了某海峡，以一个N*M的

As Famil Door’s birthday is coming, some of his friends (like Gabi) decided to buy a present for him. His friends are going to buy a string consisted of round brackets since Famil Door loves string of

Problem DescriptionYour current task is to make a ground plan for a residential building located in HZXJHS. So you must determine a way to split the floor building with walls to make apartments in t

Problem DescriptionTom owns a company and he is the boss. There are n staffs which are numbered from 1 to n in this company, and every staff has a ability. Now, Tom is going to assign a special task

There are n banks in the city where Vasya lives, they are located in a circle, such that any two banks are neighbouring if their indices differ by no more than1. Also, bank 1 and bankn are neighbo

During the programming classes Vasya was assigned a difficult problem. However, he doesn't know how to code and was unable to find the solution in the Internet, so he asks you to help.You are given

Description近日，园长发现动物园中好吃懒做的动物越来越多了。例如企鹅，只会卖萌向游客要吃的。为了整治动物园的不良风气，让动物们凭自己的真才实学向游客要吃的，园长决定开设算法班，让动物们学习算法。某天，园长给动物们讲解KMP算法。园长：“对于一个字符串S，它的长度为L。我们可以在O(L)的时间内，求出一个名为next的数组。有谁预习了next数组的含义吗？”熊猫：“对于

Vasya commutes by train every day. There are n train stations in the city, and at thei-th station it's possible to buy only tickets to stations fromi + 1 to ai inclusive. No tickets are sold at th

We call a string good, if after merging all the consecutive equal characters, the resulting string is palindrome. For example, "aabba" is good, because after the merging step it will become "aba".

There are two strings A and B with equal length. Both strings are made up of lower case letters. Now you have a powerful string painter. With the help of the painter, you can change a segment of chara

There are n psychos standing in a line. Eachpsycho(心理分析) isassigned(分配) aunique(独特的)integer(整数) from1 to n. At each step every psycho who has an id greater than the psycho to his right (if e

One day, ZS the Coder wrote down an array of integers a with elementsa1,  a2,  ...,  an.A subarray of the array a is a sequenceal,  al  +  1,  ...,  ar for some integers(l,  r) such that 1  

Students in a class are making towers of blocks. Each student makes a (non-zero) tower by stacking pieces lengthwise on top of each other.n of the students use pieces made of two blocks andm of th

We all know the impressive story of Robin Hood. Robin Hood uses his archery skills and his wits to steal the money from rich, and return it to the poor.There are n citizens in Kekoland, each person

Korea's reputation in archery is well known because the Korean archery teams have been sweeping almost all gold, silver, and bronze medals in the Olympic Games.An archery game ICPC supported by NE

You are competing in a ski slalom, and you need to selectthe best skis for the race. The format of the race is that there areNpairs of left and right gates, where each right gate isW metres to the rig

题意：有n个任务，每个任务有三个参数，ri,di,wi，表示在ri di之内需要执行完工作量为wi的任务，任务可以分块执行，求执行过程中的最大速度的最小值。速度需为整数。分析：二分判断，判断有些复杂，要用到单调队列，写的挺烂的，但是一遍过了。#include #include #include #include #include #define MAXN 10002

D. Bear and Tower of Cubestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLimak is a little polar bear. He plays by

DescriptionA Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. The machine uses exactly N distinct bill denominatio

题意：给出n和k，表示说书架上有n本书，可以取出k次书，每次取出后可以任意放回书架中，书的编号为25~32八种，定义该书架的混乱程度为片段的个数。求出最小的混乱度。

Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in thei-th row and j-th columns contains the chest of typeaij. Each chest o

Problem DescriptionProfessor Zhang has an undirected graph G with n vertices and m edges. Each vertex is attached with a weight wi. Let Gi be the graph after deleting the i-th vertex f

题意：一棵n个结点的有根树，树的边有正整数权，表示两个结点之间的距离。你的任务是回答这样的询问：从根结点处罚，走不超过x单位距离，最多经过多少个结点？同一个结点经过最多算一次。分析：设dp[x][j][0]表示以x为根的树经过i个点且回来的最小费用，dp[x][j][1]表示不会来的最小费用。            则有： dp[x][j][0] = min(dp[x][j

题意：在一个无向图中选择尽量少的点涂黑，使得任意删除一个点后，每个连通分量至少有一个黑点，问你最少选几个点和其方案数。分析：求出所有点双连通分量后，构造block forest data structure,很容易发现我们只需染”叶子虚点“下的点就可以了，注意当全图为一个连通分量时答案为2，方案为n*(n-1)/2。#include #include #include

题意：有n个骑士经常举行圆桌会议，商讨大事，每次圆桌会议至少应有3个骑士参加，且互相憎恨的骑士不能坐在圆桌旁的相邻位置，如果发生意见分歧，则需要举手表决，因此参加会议的骑士数目必须是奇数，以防赞同和反对票一样多，知道哪些骑士互相憎恨之后，你的任务是统计有多少个骑士不可能参加任何一个会议。分析：求出原图的补图后，问题转化为判断一个点是否存在一个奇数环内，一个环内的所有点一定在同一个点双联

DescriptionGiven an integer sequence { an } of length N, you are to cut the sequence into several parts every one of which is a consecutive subsequence of the original sequence. Every part must sa

Description　　P教授要去看奥运，但是他舍不下他的玩具，于是他决定把所有的玩具运到北京。他使用自己的压缩器进行压缩，其可以将任意物品变成一堆，再放到一种特殊的一维容器中。P教授有编号为1...N的N件玩具，第i件玩具经过压缩后变成一维长度为Ci.为了方便整理，P教授要求在一个一维容器中的玩具编号是连续的。同时如果一个一维容器中有多个玩具，那么两件玩具之间要加入一个单位

DescriptionA word ring is a sequence of words where the last two letters of each word are the same as the first two letters of the next word (and the last two letters of the last word are the same a