Occult

Mr. Frog likes generating numbers! He can generate many numbers from a sequence. For a given sequence a1,a2,⋯,ana1,a2,⋯,an Mr. Frog can choose two numbers l and r (1≤l≤r≤n1≤l≤r≤n) and calculat

Problem DescriptionThe shorter, the simpler. With this problem, you should be convinced of this truth.    You are given an array A of N postive integers, and M queries in the form (l,r).

Problem DescriptionAlice gets N strings. Now she has Q questions to ask you. For each question, she wanna know how many different prefix strings between Lth and Rth strings. It's so easy right? So

Problem DescriptionGive you a sequence of N(N≤100,000) integers : a1,...,an(0ai≤1000,000,000). There are Q(Q≤100,000) queries. For each query l,r you have to calculate gcd(al,,al+1,...,ar)

Problem DescriptionAfter all the difficulties, Psyche and Cupid are finally getting married.No ordinary pearls can hold Cupid's love for Psyche. So he has collected the Jewelry of Gods at the

Problem Description小A有一个含有n个非负整数的数列与m个区间。每个区间可以表示为li,ri。它想选择其中k个区间， 使得这些区间的交的那些位置所对应的数的和最大。例如样例中，选择[2,5]与[4,5]两个区间就可以啦。 Input多组测试数据第一行三个数n,k,m(1≤n≤100000,1≤k≤m≤100000

Problem Description百度科技园内有n个零食机，零食机之间通过n−1条路相互连通。每个零食机都有一个值v，表示为小度熊提供零食的价值。由于零食被频繁的消耗和补充，零食机的价值v会时常发生变化。小度熊只能从编号为0的零食机出发，并且每个零食机至多经过一次。另外，小度熊会对某个零食机的零食有所偏爱，要求路线上必须有那个零食机。为小度熊规划一个路线，使得路线上的价

HimalayasTime Limit: 5 Seconds      Memory Limit: 65536 KBThe Himalayas or Himalaya is a mountain range in the Indian subcontinent, which separates the Indo-Gangetic Plain from the Tibetan Pla

Problem DescriptionSuper Deity ztr likes trees from childhood,CCTV-children:"The apple on the apple tree.You and I under the apple tree.Play games in front of the apple tree.So many happiness".

DescriptionGiven N integers A={A[0],A[1],...,A[N-1]}. Here we have some operations:Operation 1: AND opn L RHere opn, L and R are integers.For L≤i≤R, we do A[i]=A[i] AND opn (here "AND" is bi

DescriptionYou are working for Macrohard company in data structures department. After failing your previous task about key insertion you were asked to write a new data structure that would be ab

DescriptionPete and Bob invented a new interesting game. Bob takes a sheet of paper and locates a Cartesian coordinate system on it as follows: point (0, 0) is located in the bottom-left corner, O

Problem DescriptionYou are given a rooted tree of N nodes, labeled from 1 to N. To the ith node a non-negative value ai is assigned.An ordered pair of nodes (u,v) is said to be weak

DescriptionThe cows are journeying north to Thunder Bay in Canada to gain cultural enrichment and enjoy a vacation on the sunny shores of Lake Superior. Bessie, ever the competent travel agent,

Given n non-negative integers , We define a statistical function as follows: It will be noted that the nature of F(k) is calculated with the number of choices, such that: 1)0≤b i≤a i，0≤i≤n-1，b

In the shooting game, the player can choose to stand in the position of 1,X1,X to shoot, you can shoot all the nearest K targets. The value of K may be different on different shootings. There are N

DescriptionKochiya Sanae is a lazy girl who makes and sells bread. She is an expert at bread making and selling. She can sell the i-th customer some pieces of bread at price pi for each piece. But

Mee is the only genius engineer in country Nii who is fond of making machines. One day, when he was working with his research, an amazing idea thrilled through his head and he decided to make a powerf

Description给定一棵N个节点的树，每个点有一个权值，对于M个询问(u,v,k)，你需要回答u xor lastans和v这两个节点间第K小的点权。其中lastans是上一个询问的答案，初始为0，即第一个询问的u是明文。Input第一行两个整数N,M。第二行有N个整数，其中第i个整数表示点i的权值。后面N-1行每行两个整数(x,y)，

2014上海区域赛的D题，十分复杂的感觉。按照x坐标排序，对于炸弹来说，不考虑y坐标的情况，可以看成数轴上的一个线段，当线段向右移动的时候，可以知道每一个时刻，线段上有多少的点，这一点显然可以用twopoint搞定O(n)得到。然后对于每一个时刻，炸弹能炸的最多的数量，显然是当前在线段上的点，以及不在线段上的点里，用H能覆盖的最多的情况，当然，要去掉不能覆盖的那些位置。这一点，

DescriptionBobo has a tree with n vertices numbered by 1,2,…,n and (n-1) edges. The i-th vertex has color ci, and the i-th edge connects vertices ai and bi.Let C(x,y) denotes the set of colors

Problem DescriptionAs we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:Yuta has an array A with n numb

Problem DescriptionGiven some segments which are paralleled to the coordinate axis. You need to count the number of their intersection.The input data guarantee that no two segments share the s

DescriptionYou have an array ,the length of  is  Let  InputThere are multiple test cases. The first line of input contains an integer T, indicating the number of test cases. Fo

Problem DescriptionRikka and Yuta are interested in Phi function (which is known as Euler's totient function).Yuta gives Rikka an array A[1..n] of positive integers, then Yuta makes m querie

Problem DescriptionC国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段，所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人数都有可能发生变动，可能增加或减少若干人手,但这些都逃不过C国的监视

1057. Stack (30)时间限制150 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueStack is one of the most fundamental data structures

Problem DescriptionThere are infinite balls in a line (numbered 1 2 3 ....), and initially all of them are paint black. Now Jim use a brush paint the balls, every time give two integers a b and fo

Problem DescriptionAFa have n mountains. These mountains in a line。All of mountains have same height initially. Every day , AFa would request ZJiaQ to cut some mountains or put stones in some moun

DescriptionThe citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all places at their whim. The city coun

DescriptionFarmer John has constructed an obstacle course for the cows' enjoyment. The course consists of a sequence of N fences (1 The door to FJ's barn is at the origin (marked '*' below).

Problem DescriptionFantasy magicians usually gain their ability through one of three usual methods: possessing it as an innate talent, gaining it through study and practice, or receiving it from a

DescriptionKousaka Honoka and Minami Kotori are playing a game about a secret of Yazawa Nico.When the game starts, Kousaka Honoka will give Minami Kotori an array A of N non-negative integers. T

Description      Let us consider the sequence a1, a2,..., an of non-negative integer numbers. Denote as ci,j the number of occurrences of the number i among a1,a2,..., aj. We call the sequence

Font Size: ← →Problem DescriptionWhen the magic ball game turns up, Kimi immediately falls in it. The interesting game is made up of N balls, each with a weight of w[i]. These N balls form a r

Problem DescriptionThe inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i aj.For a given sequence of numbers a1, a2, ..., an, if we mov

Problem DescriptionFor a set of sequences of integers｛a1，a2，a3，...an｝, we define a sequence｛ai1,ai2,ai3...aik｝in which 1<=i1<i2<i3<...<ik<=n, as the sub-sequence of ｛a1，a2，a3，...an｝. It is quite o

Problem DescriptionTired of playing computer games, alpc23 is planning to play a game on numbers. Because plus and subtraction is too easy for this gay, he wants to do some multiplication in a num

Problem Descriptionlxhgww got a sequence contains n characters which are all '0's or '1's.We have five operations here:Change operations:0 a b change all characters into '0's in [a , b]1 a

Problem DescriptionThere are several ancient Greek texts that contain descriptions of the fabled island Atlantis. Some of these texts even include maps of parts of the island. But unfortunately, t