nka_kun的博客

D. Restructuring Companytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputEven the most successful company c

lastyona and her loyal dog Pushok are playing a meaningless game that is indeed very interesting.The game consists of multiple rounds. Its rules are very simple: in each round, a natural number k is chosen. Then, the one who says (or barks) it faster tha

B. Petya and Examtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIt's hard times now. Today Petya needs to

Well played!Recently Max has got himself into popular CCG "BrainStone". As "BrainStone" is a pretty intellectual game, Max has to solve numerous hard problems during the gameplay. Here is one of them:...

Mahmoud and Ehab and the xor-MSTEhab is interested in the bitwise-xor operation and the special graphs. Mahmoud gave him a problem that combines both. He has a complete graph consisting of n vertices ...

TufuramaOne day Polycarp decided to rewatch his absolute favourite episode of well-known TV series "Tufurama". He was pretty surprised when he got results only for season 7 episode 3 with his search q...

The BakerySome time ago Slastyona the Sweetmaid decided to open her own bakery! She bought required ingredients and a wonder-oven which can bake several types of cakes, and opened the bakery.Soon the ...

 The Wutime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputChildan is making up a legendary story and trying to sell his forgery — a...

The Phone Numbertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMrs. Smith is trying to contact her husband, John Smith, but she ...

                                                                                Elections                                                                       time limit 2 secondsAs you know, maj...

                                                                                     Recovering BST                                                                         Time limit per test   1 se...

题目链接：http://codeforces.com/problemset/problem/401/D题意：问给出的数位的全排列组成的数当中，那些数模m等于0.思路：二进制表示选了哪些数，f[i][j]表示选了i表示的那些数，余数为j的方案数.直接状压DP或者记忆化搜索都可以，搜索比较好理解.代码：#include<bits/stdc++.h>#define m...

题目链接：http://codeforces.com/problemset/problem/1077/F1题意：从n个物品中挑选x个物品，每个物品都有一个价值，我们想选出的价值尽量大，还有保证任意连续的k个物品中都至少有一个物品被选出来.思路：既然我们想选择x个物品，我们就可以令f[i][j]表示选择以第i个物品结尾的j个物品的最大价值.这样更新的话f[i][j] = max(f[...

题目链接：http://codeforces.com/problemset/problem/1077/F2题意：https://blog.csdn.net/nka_kun/article/details/84645060的增强版思路：我们根据上一题发现，其实更新f[i][j]的过程就是在f[i-1][j-1]到f[i-k][j-1]之间找一个最大值，用这个值来更新f[i][j].这里我...

There are n cities and n - 1 roads in the Seven Kingdoms, each road connects two cities and we can reach any city from any other by the roads.Theon and Yara Greyjoy are on a horse in the first city, they are starting traveling through the roads. But the

Daenerys Targaryen has an army consisting of k groups of soldiers, the i-th group contains ai soldiers. She wants to bring her army to the other side of the sea to get the Iron Throne. She has recently bought an airplane to carry her army through the sea.

Helen works in Metropolis airport. She is responsible for creating a departure schedule. There are n flights that must depart today, the i-th of them is planned to depart at the i-th minute of the day.Metropolis airport is the main transport hub of Metro

Arpa is taking a geometry exam. Here is the last problem of the exam.You are given three points a, b, c.Find a point and an angle such that if we rotate the page around the point by the angle, the new position of a is the same as the old position of b,

C. Voltage Keepsaketime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have n devices that you want to use simultaneously.The i-th device uses ai units of power per second. This usage is continuo

Lengthening Stickstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given three sticks with positive integer lengths of a, b, and c centimeters. You can increase length of some of them by some

Permutationstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputHappy PMP is freshman and he is learning about algorithmic problems. He enjoys playing algorithmic games a lot.One of the seniors gave

Peculiar apple-treeIn Arcady's garden there grows a peculiar apple-tree that fruits one time per year. Its peculiarity can be explained in following way: there are n inflorescences, numbered from 1 to...

New Year SnowmenAs meticulous Gerald sets the table and caring Alexander sends the postcards, Sergey makes snowmen. Each showman should consist of three snowballs: a big one, a medium one and a small ...

XOR EquationTwo positive integers a and b have a sum of s and a bitwise XOR of x. How many possible values are there for the ordered pair (a, b)?InputThe first line of the input contains two integers ...

Famil Door and BracketsAs 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 Fam...

Hamiltonian Spanning TreeA group of n cities is connected by a network of roads. There is an undirected road between every pair of cities, so there are roads in total. It takes exactly y seconds to tr...

Gadgets for dollars and poundsNura wants to buy k gadgets. She has only s burles for that. She can buy each gadget for dollars or for pounds. So each gadget is selling only for some type of currency. ...

Full Binary Tree QueriesYou have a full binary tree having infinite levels.Each node has an initial value. If a node has value x, then its left child has value 2·x and its right child has value 2·x + ...

In one of the games Arkady is fond of the game process happens on a rectangular field. In the game process Arkady can buy extensions for his field, each extension enlarges one of the field sizes in a particular number of times. Formally, there are n extens

题目链接：http://codeforces.com/problemset/problem/1077/E题意：给出n个题目，每个题目都有一个主题，现在让你安排若干场考试，每场考试的题目数量恰好是前一场的2倍，并且他们的主题是相同的，问最多能用掉多少题目？思路：我们想要用掉尽量多的题目，但是策略比较难定，因为用掉的题目多少跟我们第一场考试用掉的题目多少好像没有直接关系，为了产生这样的...