摘要：
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 a 阅读全文
摘要：
The only difference between easy and hard versions is constraints. Now elections are held in Berland and you want to win them. More precisely, you wan 阅读全文
摘要：
You are given n arrays a1, a2, ..., an; each array consists of exactly m integers. We denote the y-th element of the x-th array as ax,y. You have to c 阅读全文
摘要：
https://codeforces.com/contest/1244/problem/D D. Paint the Tree https://codeforces.com/contest/1244/problem/D D. Paint the Tree You are given a tree c 阅读全文
摘要：
http://codeforces.com/contest/1230/problem/C C. Anadi and Domino C. Anadi and Domino Anadi has a set of dominoes. Every domino has two parts, and each 阅读全文
摘要：
http://codeforces.com/contest/1216/problem/E1 E2. Numerical Sequence (hard version) You are given an infinite sequence of form "112123123412345……" whi 阅读全文
摘要：
D. Make The Fence Great Again http://codeforces.com/contest/1221/problem/D 题意：给出n个篱笆，每个篱笆高度为a，一米的造价为b，要求相邻的两个篱笆高度不能相同，且每个篱笆的高度只能增加，求符合条件的最小造价； 思路：首先：可 阅读全文
摘要：
Hat’s Words Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21250 Accepted Submission(s): 7449 Pr 阅读全文
摘要：
统计难题 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 69587 Accepted Submission(s): 24087 Problem 阅读全文
摘要：
Problem Description Two players, Stan and Ollie, play, starting with two natural numbers. Stan, the first player, subtracts any positive multiple of t 阅读全文