蒟蒻JHY

摘要： Discription Mahmoud and Ehab live in a country with n cities numbered from 1 to n and connected by n - 1 undirected roads. It's guaranteed that you ca 阅读全文

摘要： Read problems statements in Mandarin Chinese and Russian. Little Elephant from Zoo of Lviv likes to watch movies. There are N different movies (number 阅读全文

摘要： Read problems statements in Mandarin Chinese and Russian. A meteor fell on Andrew's house. That's why he decided to build a new home and chose a site 阅读全文

摘要： Discription Mahmoud has an array a consisting of n integers. He asked Ehab to find another arrayb of the same length such that: b is lexicographically 阅读全文

摘要： Discription Ehab has an array a of n integers. He likes the bitwise-xor operation and he likes to bother Mahmoud so he came up with a problem. He gave 阅读全文

摘要： Discription Ehab is interested in the bitwise-xor operation and the special graphs. Mahmoud gave him a problem that combines both. He has a complete g 阅读全文

摘要： Discription Sigma function is an interesting function in Number Theory. It is denoted by the Greek letter Sigma (σ). This function actually denotes th 阅读全文

摘要： 设 g(x) = f(x) * x ，多项式 A = Σ g(i) * x^i , 多项式 B = Σ f(i) * x^i。 首先，g(x) = g(x-1) + g(x-2) + f(x-1) + 2f(x-2)，所以我们可以得到: A = x * A + x^2 * A + x * B + 2 阅读全文

摘要： 题目描述 对于一个给定的序列a1, …, an，我们对它进行一个操作reduce(i)，该操作将数列中的元素ai和ai+1用一个元素max(ai，ai+1)替代，这样得到一个比原来序列短的新序列。这一操作的代价是max(ai，ai+1)。进行n-1次该操作后，可以得到一个长度为1的序列。 我们的任务 阅读全文

摘要： Discription 给出一个 N 行 M 列的矩阵A, 保证满足以下性质: 1.M>N。 2.矩阵中每个数都是 [0,N] 中的自然数。 3.每行中, [1,N] 中每个自然数都恰好出现一次。这意味着每行中 0 恰好出现 M−N 次。 4.每列中，[1,N] 中每个自然数至多出现一次。 现在我们 阅读全文