|
|
9336 |
codeforces#P1970D3 Arithmancy (Hard)
|
0 / 0 |
10 |
|
|
9335 |
codeforces#P1970E1 Trails (Easy)
|
0 / 0 |
6 |
|
|
9334 |
codeforces#P1970E2 Trails (Medium)
|
0 / 0 |
7 |
|
|
9333 |
codeforces#P1970E3 Trails (Hard)
|
0 / 0 |
8 |
|
|
9332 |
codeforces#P1970F1 Playing Quidditch (Easy)
|
0 / 0 |
8 |
|
|
9331 |
codeforces#P1970F2 Playing Quidditch (Medium)
|
0 / 0 |
8 |
|
|
9330 |
codeforces#P1970F3 Playing Quidditch (Hard)
|
0 / 0 |
8 |
|
|
9329 |
codeforces#P1970G1 Min-Fund Prison (Easy)
|
0 / 0 |
6 |
|
|
9328 |
codeforces#P1970G2 Min-Fund Prison (Medium)
|
0 / 0 |
8 |
|
|
9327 |
codeforces#P1970G3 Min-Fund Prison (Hard)
|
0 / 0 |
9 |
|
|
9326 |
codeforces#P1971A My First Sorting Problem
|
0 / 0 |
3 |
|
|
9325 |
codeforces#P1971B Different String
|
0 / 0 |
3 |
|
|
9324 |
codeforces#P1971C Clock and Strings
|
0 / 0 |
3 |
|
|
9323 |
codeforces#P1971D Binary Cut
|
0 / 0 |
3 |
|
|
9322 |
codeforces#P1971E Find the Car
|
0 / 0 |
5 |
|
|
9321 |
codeforces#P1971F Circle Perimeter
|
0 / 0 |
5 |
|
|
9320 |
codeforces#P1971G XOUR
|
0 / 0 |
4 |
|
|
9319 |
codeforces#P1971H ±1
|
0 / 0 |
7 |
|
|
9318 |
codeforces#P1972A Contest Proposal
|
0 / 0 |
3 |
|
|
9317 |
codeforces#P1972B Coin Games
|
0 / 0 |
3 |
|
|
9316 |
codeforces#P1973A Chess For Three
|
0 / 0 |
3 |
|
|
9315 |
codeforces#P1973B Cat, Fox and the Lonely Array
|
0 / 0 |
4 |
|
|
9314 |
codeforces#P1973C Cat, Fox and Double Maximum
|
0 / 0 |
5 |
|
|
9313 |
codeforces#P1973D Cat, Fox and Maximum Array Split
|
0 / 0 |
9 |
|
|
9312 |
codeforces#P1973E Cat, Fox and Swaps
|
0 / 0 |
9 |
|
|
9311 |
codeforces#P1973F Maximum GCD Sum Queries
|
0 / 0 |
10 |
|
|
9310 |
codeforces#P1974A Phone Desktop
|
0 / 0 |
3 |
|
|
9309 |
codeforces#P1974B Symmetric Encoding
|
0 / 0 |
3 |
|
|
9308 |
codeforces#P1974C Beautiful Triple Pairs
|
0 / 0 |
4 |
|
|
9307 |
codeforces#P1974D Ingenuity-2
|
0 / 0 |
4 |
|
|
9306 |
codeforces#P1974E Money Buys Happiness
|
0 / 0 |
6 |
|
|
9305 |
codeforces#P1974F Cutting Game
|
0 / 0 |
6 |
|
|
9304 |
codeforces#P1974G Money Buys Less Happiness Now
|
0 / 0 |
7 |
|
|
9303 |
codeforces#P1975A Bazoka and Mocha's Array
|
0 / 0 |
(None) |
|
|
9302 |
codeforces#P1975B 378QAQ and Mocha's Array
|
0 / 0 |
(None) |
|
|
9301 |
codeforces#P1975C Chamo and Mocha's Array
|
0 / 0 |
(None) |
|
|
9300 |
codeforces#P1975D Paint the Tree
|
0 / 0 |
(None) |
|
|
9299 |
codeforces#P1975E Chain Queries
|
0 / 0 |
(None) |
|
|
9298 |
codeforces#P1975F Set
|
0 / 0 |
(None) |
|
|
9297 |
codeforces#P1975G Zimpha Fan Club
|
0 / 0 |
(None) |
|
|
9296 |
codeforces#P1975H 378QAQ and Core
|
0 / 0 |
(None) |
|
|
9295 |
codeforces#P1975I Mind Bloom
|
0 / 0 |
(None) |
|
|
9294 |
codeforces#P1977A Little Nikita
|
0 / 0 |
(None) |
|
|
9293 |
codeforces#P1977B Binary Colouring
|
0 / 0 |
(None) |
|
|
9292 |
codeforces#P1977C Nikita and LCM
|
0 / 0 |
(None) |
|
|
9291 |
codeforces#P1977D XORificator
|
0 / 0 |
(None) |
|
|
9290 |
codeforces#P1977E Tensor
|
0 / 0 |
(None) |
|
|
5076 |
codeforces#P92101 Labyrinth-01
|
0 / 0 |
10 |
|
|
5075 |
codeforces#P92102 Labyrinth-02
|
0 / 0 |
10 |
|
|
5074 |
codeforces#P92103 Labyrinth-03
|
0 / 0 |
10 |
|
|
5073 |
codeforces#P92104 Labyrinth-04
|
0 / 0 |
10 |
|
|
5072 |
codeforces#P92105 Labyrinth-05
|
0 / 0 |
10 |
|
|
5064 |
codeforces#P92106 Labyrinth-06
|
0 / 0 |
10 |
|
|
5063 |
codeforces#P92107 Labyrinth-07
|
0 / 0 |
10 |
|
|
5062 |
codeforces#P92108 Labyrinth-08
|
0 / 0 |
10 |
|
|
5061 |
codeforces#P92109 Labyrinth-09
|
0 / 0 |
10 |
|
|
5060 |
codeforces#P92110 Labyrinth-10
|
0 / 0 |
10 |
|
|
5059 |
codeforces#P92111 Labyrinth-11
|
0 / 0 |
10 |
|
|
5058 |
codeforces#P92112 Labyrinth-12
|
0 / 0 |
10 |
|
|
5057 |
codeforces#P92113 Labyrinth-13
|
0 / 0 |
10 |
|
|
5056 |
codeforces#P92114 Labyrinth-14
|
0 / 0 |
10 |
|
|
3715 |
spoj#A001856 Chiaki Sequence
|
0 / 0 |
(None) |
|
|
3369 |
spoj#AAC2 Atul and Aastha Chronicles 2
|
0 / 0 |
(None) |
|
|
1984 |
spoj#ABA12B String Factorization!
|
0 / 0 |
(None) |
|
|
1988 |
spoj#ABA12C Buying Apples!
|
0 / 0 |
(None) |
|
|
1989 |
spoj#ABA12D Sum of divisors!
|
0 / 0 |
(None) |
|
|
1992 |
spoj#ABA12E Shooting the balloons!
|
0 / 0 |
(None) |
|
|
1654 |
spoj#ABCD Colours A, B, C, D
|
0 / 0 |
(None) |
|
|
1098 |
spoj#ABCDEF ABCDEF
|
0 / 0 |
(None) |
|
|
1893 |
spoj#ABCPATH ABC Path
|
0 / 0 |
(None) |
|
|
2536 |
spoj#ABSHIP Advanced Battleships
|
0 / 0 |
(None) |
|
|
2861 |
spoj#ABSP1 abs(a-b) I
|
0 / 0 |
(None) |
|
|
1314 |
spoj#ABSURD Absurd prices
|
0 / 0 |
(None) |
|
|
614 |
spoj#ABSYS Anti-Blot System
|
0 / 0 |
(None) |
|
|
133 |
spoj#ABWORDS AB-words
|
0 / 0 |
(None) |
|
|
1353 |
spoj#ACAB Police Business
|
0 / 0 |
(None) |
|
|
1833 |
spoj#ACANVAS A Canvas Building
|
0 / 0 |
(None) |
|
|
548 |
spoj#ACARGO Accumulate Cargo
|
0 / 0 |
(None) |
|
|
3804 |
spoj#ACC A Complex Cone
|
0 / 0 |
(None) |
|
|
564 |
spoj#ACFRAC Another Continuous Fractions Problem
|
0 / 0 |
(None) |
|
|
1912 |
spoj#ACHESS Adventurous Chess Masters
|
0 / 0 |
(None) |
|
|
477 |
spoj#ACMAKER ACM (ACronymMaker)
|
0 / 0 |
(None) |
|
|
3217 |
spoj#ACMT Acm Teams
|
0 / 0 |
(None) |
|
|
255 |
spoj#ACODE Alphacode
|
0 / 0 |
(None) |
|
|
1541 |
spoj#ACPC10A What’s Next
|
0 / 0 |
(None) |
|
|
1543 |
spoj#ACPC10B Sum the Square
|
0 / 0 |
(None) |
|
|
1567 |
spoj#ACPC10C Normalized Form
|
0 / 0 |
(None) |
|
|
1542 |
spoj#ACPC10D Tri graphs
|
0 / 0 |
(None) |
|
|
1540 |
spoj#ACPC10E Sometimes, a penalty is good!
|
0 / 0 |
(None) |
|
|
1539 |
spoj#ACPC10F World of cubes
|
0 / 0 |
(None) |
|
|
1536 |
spoj#ACPC10G A Knights’ Tale
|
0 / 0 |
(None) |
|
|
1537 |
spoj#ACPC10H Jumping Beans
|
0 / 0 |
(None) |
|
|
1538 |
spoj#ACPC10I The Cyber Traveling Salesman
|
0 / 0 |
(None) |
|
|
1967 |
spoj#ACPC11B Between the Mountains
|
0 / 0 |
(None) |
|
|
1968 |
spoj#ACPC11C Circleland
|
0 / 0 |
(None) |
|
|
1969 |
spoj#ACPC11D Dice on a Board
|
0 / 0 |
(None) |
|
|
3073 |
spoj#ACPC13 Increasing Shortest Path
|
0 / 0 |
(None) |
|
|
2599 |
spoj#ACQUIRE Land Acquisition
|
0 / 0 |
(None) |
|
|
3903 |
spoj#ACRYM Acronym
|
0 / 0 |
(None) |
|
|
3912 |
spoj#ACRYM2 Acronym II
|
0 / 0 |
(None) |
