|
3923 |
codeforces#P1165E Two Arrays and Sum of Functions
|
0 / 0 |
5 |
|
3875 |
codeforces#P1175B Catch Overflow!
|
0 / 0 |
5 |
|
3874 |
codeforces#P1175C Electrification
|
0 / 0 |
5 |
|
3819 |
codeforces#P1184C1 Heidi and the Turing Test (Easy)
|
0 / 0 |
5 |
|
3816 |
codeforces#P1184D1 Parallel Universes (Easy)
|
0 / 0 |
5 |
|
3790 |
codeforces#P1188A1 Add on a Tree
|
0 / 0 |
5 |
|
3749 |
codeforces#P1196D2 RGB Substring (hard version)
|
0 / 0 |
5 |
|
3740 |
codeforces#P1198A MP3
|
0 / 0 |
5 |
|
3739 |
codeforces#P1198B Welfare State
|
0 / 0 |
5 |
|
3711 |
codeforces#P1203D1 Remove the Substring (easy version)
|
0 / 0 |
5 |
|
3646 |
codeforces#P1213D2 Equalizing by Division (hard version)
|
0 / 0 |
5 |
|
3620 |
codeforces#P1217B Zmei Gorynich
|
0 / 0 |
5 |
|
3588 |
codeforces#P1223C Save the Nature
|
0 / 0 |
5 |
|
3580 |
codeforces#P1225C p-binary
|
0 / 0 |
5 |
|
3572 |
codeforces#P1227D1 Optimal Subsequences (Easy Version)
|
0 / 0 |
5 |
|
3552 |
codeforces#P1234D Distinct Characters Queries
|
0 / 0 |
5 |
|
3532 |
codeforces#P1238C Standard Free2play
|
0 / 0 |
5 |
|
3513 |
codeforces#P1243B2 Character Swap (Hard Version)
|
0 / 0 |
5 |
|
3470 |
codeforces#P1251C Minimize The Integer
|
0 / 0 |
5 |
|
3463 |
codeforces#P1252C Even Path
|
0 / 0 |
5 |
|
3439 |
codeforces#P1255C League of Leesins
|
0 / 0 |
5 |
|
3326 |
codeforces#P1281B Azamon Web Services
|
0 / 0 |
5 |
|
3323 |
codeforces#P1282B2 K for the Price of One (Hard Version)
|
0 / 0 |
5 |
|
3311 |
codeforces#P1284C New Year and Permutation
|
0 / 0 |
5 |
|
3289 |
codeforces#P1288C Two Arrays
|
0 / 0 |
5 |
|
3285 |
codeforces#P1290A Mind Control
|
0 / 0 |
5 |
|
3265 |
codeforces#P1294D MEX maximizing
|
0 / 0 |
5 |
|
3260 |
codeforces#P1295C Obtain The String
|
0 / 0 |
5 |
|
3215 |
codeforces#P1303C Perfect Keyboard
|
0 / 0 |
5 |
|
3201 |
codeforces#P1305C Kuroni and Impossible Calculation
|
0 / 0 |
5 |
|
3147 |
codeforces#P1321C Remove Adjacent
|
0 / 0 |
5 |
|
3115 |
codeforces#P1327C Game with Chips
|
0 / 0 |
5 |
|
3074 |
codeforces#P1334C Circle of Monsters
|
0 / 0 |
5 |
|
3062 |
codeforces#P1336A Linova and Kingdom
|
0 / 0 |
5 |
|
3036 |
codeforces#P1342C Yet Another Counting Problem
|
0 / 0 |
5 |
|
3026 |
codeforces#P1344A Hilbert's Hotel
|
0 / 0 |
5 |
|
3016 |
codeforces#P1346C Spring Cleaning
|
0 / 0 |
5 |
|
3015 |
codeforces#P1346D Constructing the Dungeon
|
0 / 0 |
5 |
|
3007 |
codeforces#P1348C Phoenix and Distribution
|
0 / 0 |
5 |
|
3003 |
codeforces#P1349A Orac and LCM
|
0 / 0 |
5 |
|
2985 |
codeforces#P1352G Special Permutation
|
0 / 0 |
5 |
|
2981 |
codeforces#P1353D Constructing the Array
|
0 / 0 |
5 |
|
2934 |
codeforces#P1358C Celex Update
|
0 / 0 |
5 |
|
2905 |
codeforces#P1363C Game On Leaves
|
0 / 0 |
5 |
|
2899 |
codeforces#P1364C Ehab and Prefix MEXs
|
0 / 0 |
5 |
|
2850 |
codeforces#P1371D Grid-00100
|
0 / 0 |
5 |
|
2837 |
codeforces#P1373D Maximum Sum on Even Positions
|
0 / 0 |
5 |
|
2829 |
codeforces#P1374E1 Reading Books (easy version)
|
0 / 0 |
5 |
|
2766 |
codeforces#P1389B Array Walk
|
0 / 0 |
5 |
|
2733 |
codeforces#P1395C Boboniu and Bit Operations
|
0 / 0 |
5 |
|
2732 |
codeforces#P1396A Multiples of Length
|
0 / 0 |
5 |
|
2723 |
codeforces#P1398C Good Subarrays
|
0 / 0 |
5 |
|
2678 |
codeforces#P1407C Chocolate Bunny
|
0 / 0 |
5 |
|
2592 |
codeforces#P1423K Lonely Numbers
|
0 / 0 |
5 |
|
2546 |
codeforces#P1431C Black Friday
|
0 / 0 |
5 |
|
2521 |
codeforces#P1437D Minimal Height Tree
|
0 / 0 |
5 |
|
2457 |
codeforces#P1452D Radio Towers
|
0 / 0 |
5 |
|
2438 |
codeforces#P1455D Sequence and Swaps
|
0 / 0 |
5 |
|
2433 |
codeforces#P1458A Row GCD
|
0 / 0 |
5 |
|
2422 |
codeforces#P1461D Divide and Summarize
|
0 / 0 |
5 |
|
2381 |
codeforces#P1468K The Robot
|
0 / 0 |
5 |
|
2375 |
codeforces#P1469C Building a Fence
|
0 / 0 |
5 |
|
2339 |
codeforces#P1475E Advertising Agency
|
0 / 0 |
5 |
|
2334 |
codeforces#P1476C Longest Simple Cycle
|
0 / 0 |
5 |
|
2310 |
codeforces#P1481C Fence Painting
|
0 / 0 |
5 |
|
2304 |
codeforces#P1482C Basic Diplomacy
|
0 / 0 |
5 |
|
2290 |
codeforces#P1486C1 Guessing the Greatest (easy version)
|
0 / 0 |
5 |
|
2224 |
codeforces#P1497C2 k-LCM (hard version)
|
0 / 0 |
5 |
|
2218 |
codeforces#P1498C Planar Reflections
|
0 / 0 |
5 |
|
2199 |
codeforces#P1503A Balance the Bits
|
0 / 0 |
5 |
|
2190 |
codeforces#P1505B DMCA
|
0 / 0 |
5 |
|
2152 |
codeforces#P1511D Min Cost String
|
0 / 0 |
5 |
|
2144 |
codeforces#P1512E Permutation by Sum
|
0 / 0 |
5 |
|
2139 |
codeforces#P1513C Add One
|
0 / 0 |
5 |
|
2133 |
codeforces#P1514C Product 1 Modulo N
|
0 / 0 |
5 |
|
2105 |
codeforces#P1519D Maximum Sum of Products
|
0 / 0 |
5 |
|
2097 |
codeforces#P1520F1 Guess the K-th Zero (Easy version)
|
0 / 0 |
5 |
|
2087 |
codeforces#P1523C Compression and Expansion
|
0 / 0 |
5 |
|
2072 |
codeforces#P1526C2 Potions (Hard Version)
|
0 / 0 |
5 |
|
2065 |
codeforces#P1527C Sequence Pair Weight
|
0 / 0 |
5 |
|
2062 |
codeforces#P1528A Parsa's Humongous Tree
|
0 / 0 |
5 |
|
2051 |
codeforces#P1530D Secret Santa
|
0 / 0 |
5 |
|
2005 |
codeforces#P1537E1 Erase and Extend (Easy Version)
|
0 / 0 |
5 |
|
1992 |
codeforces#P1539D PriceFixed
|
0 / 0 |
5 |
|
1979 |
codeforces#P1542C Strange Function
|
0 / 0 |
5 |
|
1905 |
codeforces#P1555D Say No to Palindromes
|
0 / 0 |
5 |
|
1856 |
codeforces#P1566D2 Seating Arrangements (hard version)
|
0 / 0 |
5 |
|
1849 |
codeforces#P1567C Carrying Conundrum
|
0 / 0 |
5 |
|
1769 |
codeforces#P1582D Vupsen, Pupsen and 0
|
0 / 0 |
5 |
|
1728 |
codeforces#P1593E Gardener and Tree
|
0 / 0 |
5 |
|
1689 |
codeforces#P1603B Moderate Modular Mode
|
0 / 0 |
5 |
|
1666 |
codeforces#P1607E Robot on the Board 1
|
0 / 0 |
5 |
|
1652 |
codeforces#P1609D Social Network
|
0 / 0 |
5 |
|
1645 |
codeforces#P1610C Keshi Is Throwing a Party
|
0 / 0 |
5 |
|
1627 |
codeforces#P1612D X-Magic Pair
|
0 / 0 |
5 |
|
1609 |
codeforces#P1615C Menorah
|
0 / 0 |
5 |
|
1556 |
codeforces#P1622C Set or Decrease
|
0 / 0 |
5 |
|
1550 |
codeforces#P1623C Balanced Stone Heaps
|
0 / 0 |
5 |
|
1503 |
codeforces#P1632C Strange Test
|
0 / 0 |
5 |
|
1496 |
codeforces#P1633D Make Them Equal
|
0 / 0 |
5 |