|
|
29060 |
codeforces#P926C
Is This a Zebra?
|
0 / 0 |
5 |
|
|
29066 |
codeforces#P926I
A Vital Problem
|
0 / 0 |
5 |
|
|
29075 |
codeforces#P929C
Красивая команда
|
0 / 0 |
5 |
|
|
29084 |
codeforces#P931C
Laboratory Work
|
0 / 0 |
5 |
|
|
29105 |
codeforces#P936A
Save Energy!
|
0 / 0 |
5 |
|
|
29113 |
codeforces#P938C
Constructing Tests
|
0 / 0 |
5 |
|
|
29139 |
codeforces#P949B
A Leapfrog in the Array
|
0 / 0 |
5 |
|
|
29155 |
codeforces#P954C
Matrix Walk
|
0 / 0 |
5 |
|
|
29193 |
codeforces#P960C
Subsequence Counting
|
0 / 0 |
5 |
|
|
29244 |
codeforces#P977F
Consecutive Subsequence
|
0 / 0 |
5 |
|
|
29251 |
codeforces#P978G
Petya's Exams
|
0 / 0 |
5 |
|
|
29259 |
codeforces#P980C
Posterized
|
0 / 0 |
5 |
|
|
29277 |
codeforces#P983A
Finite or not?
|
0 / 0 |
5 |
|
|
29314 |
codeforces#P990D
Graph And Its Complement
|
0 / 0 |
5 |
|
|
29360 |
codeforces#P1000C
Covered Points Count
|
1 / 3 |
5 |
|
|
29373 |
codeforces#P1001I
Deutsch-Jozsa algorithm
|
0 / 0 |
5 |
|
|
29374 |
codeforces#P1001I
Deutsch-Jozsa algorithm
|
0 / 0 |
5 |
|
|
29382 |
codeforces#P1002B4
Distinguish four 2-qubit states - 2
|
0 / 0 |
5 |
|
|
29383 |
codeforces#P1002C1
Distinguish zero state and plus state with minimum error
|
0 / 0 |
5 |
|
|
29412 |
codeforces#P1006D
Two Strings Swaps
|
1 / 1 |
5 |
|
|
29424 |
codeforces#P1009C
Annoying Present
|
0 / 0 |
5 |
|
|
29425 |
codeforces#P1009D
Relatively Prime Graph
|
0 / 0 |
5 |
|
|
29449 |
codeforces#P1015E1
Stars Drawing (Easy Edition)
|
0 / 0 |
5 |
|
|
29467 |
codeforces#P1019A
Elections
|
0 / 0 |
5 |
|
|
29477 |
codeforces#P1023D
Array Restoration
|
0 / 0 |
5 |
|
|
29491 |
codeforces#P1027D
Mouse Hunt
|
0 / 0 |
5 |
|
|
29524 |
codeforces#P1032C
Playing Piano
|
0 / 0 |
5 |
|
|
29551 |
codeforces#P1037D
Valid BFS?
|
1 / 1 |
5 |
|
|
29572 |
codeforces#P1041D
Glider
|
0 / 0 |
5 |
|
|
29577 |
codeforces#P1042C
Array Product
|
0 / 0 |
5 |
|
|
29584 |
codeforces#P1043D
Mysterious Crime
|
0 / 0 |
5 |
|
|
29588 |
codeforces#P1044A
The Tower is Going Home
|
0 / 0 |
5 |
|
|
29612 |
codeforces#P1051D
Bicolorings
|
0 / 0 |
5 |
|
|
29634 |
codeforces#P1056C
Pick Heroes
|
0 / 0 |
5 |
|
|
29658 |
codeforces#P1061C
Multiplicity
|
1 / 1 |
5 |
|
|
29687 |
codeforces#P1066E
Binary Numbers AND Sum
|
0 / 0 |
5 |
|
|
29696 |
codeforces#P1068C
Colored Rooks
|
0 / 0 |
5 |
|
|
29714 |
codeforces#P1073D
Berland Fair
|
1 / 1 |
5 |
|
|
29768 |
codeforces#P1085D
Minimum Diameter Tree
|
0 / 0 |
5 |
|
|
29808 |
codeforces#P1091D
New Year and the Permutation Concatenation
|
0 / 0 |
5 |
|
|
29815 |
codeforces#P1092C
Prefixes and Suffixes
|
0 / 0 |
5 |
|
|
29823 |
codeforces#P1093D
Beautiful Graph
|
0 / 0 |
5 |
|
|
29875 |
codeforces#P1102E
Monotonic Renumeration
|
0 / 0 |
5 |
|
|
29924 |
codeforces#P1111B
Average Superhero Gang Power
|
0 / 0 |
5 |
|
|
29925 |
codeforces#P1111C
Creative Snap
|
0 / 0 |
5 |
|
|
29932 |
codeforces#P1114C
Trailing Loves (or L'oeufs?)
|
0 / 0 |
5 |
|
|
29941 |
codeforces#P1115U3
Block unitary
|
0 / 0 |
5 |
|
|
29964 |
codeforces#P1118C
Palindromic Matrix
|
0 / 1 |
5 |
|
|
29965 |
codeforces#P1118D1
Coffee and Coursework (Easy version)
|
0 / 0 |
5 |
|
|
29966 |
codeforces#P1118D2
Coffee and Coursework (Hard Version)
|
0 / 0 |
5 |
