Low Coder的博客

A. Odds and Endstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhere do odds begin, and where do they end?

Ignatius and the Princess IVTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 39051    Accepted Submission(s): 17048Problem Description"OK, you ar...

B1. 数列区间翻转Time limit per test: 1.5 secondsMemory limit: 256 megabytes现在有一列数 1,2,3,…,n−1,n，现在进行一系列操作，每次操作将一个区间内的数翻转，最后回答第 k 个位置上的数。Input第一行三个整数 n,m,k (1≤n,m≤105,1≤k≤n)。接下来 m 行，每行两个整数 l,r (1≤l≤r≤n)，表示将区...

D. Polycarp and Div 3time limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp likes numbers that are divisible by 3.He has a huge number ss. Polyc...

A. Maxim and Discounts Maxim always goes to the supermarket on Sundays. Today the supermarket has a special offer of discount systems.There are m types of discounts. We assume that the discounts...

D. Black and White TreeThe board has got a painted tree graph, consisting of n nodes. Let us remind you that a non-directed graph is called a tree if it is connected and doesn't contain any cycles....

A. Levko and Array RecoveryLevko loves array a1, a2, ... , an, consisting of integers, very much. That is why Levko is playing with array a, performing all sorts of operations with it. Each operatio...

Rooter's Song Wherever the destination is, whoever we meet, let's render this song together.On a Cartesian coordinate plane lies a rectangular stage of size w × h, represented by a rectangle with ...

E. Permutation PolygonThere are n cities in Regularia, Alice's homeland. They are located at the vertices of a regular n-gon. The cities are numbered from 1 to nin a clockwise order (see the figure)...