Who doesn't love short statements?
Sometimes I get bored reading long statements while practicing and feel the necessity of problems with short statements. So I filtered such problems and ordered them by their statement size. Here is the list. Hope it may help the lazy programmers like me.
Problems (Categorized by Difficulty):
1700
- 1325D - Ehab the Xorcist
- 578A - A Problem about Polyline
- 622C - Not Equal on a Segment
- 632C - The Smallest String Concatenation
- 900C - Remove Extra One
- 915C - Permute Digits
- 1268A - Long Beautiful Integer
- 1485C - Floor and Mod
- 1512G - Short Task
- 281B - Nearest Fraction
- 464A - No to Palindromes!
- 466C - Number of Ways
- 578B - "Or" Game
- 617D - Polyline
- 627A - XOR Equation
- 678D - Iterated Linear Function
- 691D - Swaps in Permutation
- 983A - Finite or not?
- 1000C - Covered Points Count
- 1051D - Bicolorings
- 1132C - Painting the Fence
- 20A - BerOS file system
- 305B - Continued Fractions
- 321A - Ciel and Robot
- 327C - Magic Five
- 32C - Flea
- 349B - Color the Fence
- 467C - George and Job
- 584C - Marina and Vasya
- 773A - Success Rate
- 919D - Substring
- 1061C - Multiplicity
- 1102E - Monotonic Renumeration
- 1144A - Diverse Strings
- 1148C - Crazy Diamond
- 1157E - Minimum Array
- 1168A - Increasing by Modulo
- 1219C - Periodic integer number
- 1253D - Harmonious Graph
- 1312D - Count the Arrays
- 1368D - AND, OR and square sum
- 140A - New Year Table
- 1451D - Circle Game
- 1467B - Hills And Valleys
- 14C - Four Segments
- 18B - Platforms
- 276D - Little Girl and Maximum XOR
- 288C - Polo the Penguin and XOR operation
- 53B - Blog Photo
- 582A - GCD Table
- 765D - Artsem and Saunders
- 895B - XK Segments
- 1185D - Extra Element
- 118D - Caesar's Legions
- 1329B - Dreamoon Likes Sequences
- 385C - Bear and Prime Numbers
- 797C - Minimal string
- 297A - Parity Game
1800
- 1225D - Power Products
- 1295D - Same GCDs
- 612D - The Union of k-Segments
- 652D - Nested Segments
- 7C - Line
- 802B - Heidi and Library (medium)
- 162C - Prime factorization
- 301A - Yaroslav and Sequence
- 470B - Hexakosioihexekontahexaphobia
- 663A - Rebus
- 846F - Random Query
- 888E - Maximum Subsequence
- 1030D - Vasya and Triangle
- 1042D - Petya and Array
- 1062D - Fun with Integers
- 1152C - Neko does Maths
- 1177B - Digits Sequence (Hard Edition)
- 1208C - Magic Grid
- 1213G - Path Queries
- 123B - Squares
- 1249D1 - Too Many Segments (easy version)
- 1249D2 - Too Many Segments (hard version)
- 132C - Logo Turtle
- 1355C - Count Triangles
- 1491D - Zookeeper and The Infinite Zoo
- 16C - Monitor
- 245H - Queries for Number of Palindromes
- 24C - Sequence of points
- 452B - 4-point polyline
- 459D - Pashmak and Parmida's problem
- 478C - Table Decorations
- 513B2 - Permutations
- 584D - Dima and Lisa
- 665D - Simple Subset
- 691C - Exponential notation
- 69E - Subsegments
- 883H - Palindromic Cut
- 926B - Add Points
- 95B - Lucky Numbers
- 963A - Alternating Sum
- 1034A - Enlarge GCD
- 1038D - Slime
- 1118F1 - Tree Cutting (Easy Version)
- 1326D2 - Prefix-Suffix Palindrome (Hard version)
- 1437C - Chef Monocarp
- 1500A - Going Home
- 220B - Little Elephant and Array
- 432C - Prime Swaps
- 440C - One-Based Arithmetic
- 49D - Game
- 513G1 - Inversions problem
- 683E - Hammer throwing
- 687B - Remainders Game
- 772B - Volatile Kite
- 776C - Molly's Chemicals
- 813B - The Golden Age
- 914C - Travelling Salesman and Special Numbers
- 939E - Maximize!
- 983B - XOR-pyramid
- 1267L - Lexicography
- 1327E - Count The Blocks
- 1396B - Stoned Game
- 1466E - Apollo versus Pan
- 1509C - The Sports Festival
- 257C - View Angle
- 300C - Beautiful Numbers
- 482B - Interesting Array
- 551B - ZgukistringZ
- 67B - Restoration of the Permutation
- 894B - Ralph And His Magic Field
- 911D - Inversion Counting
- 988D - Points and Powers of Two
- 1324F - Maximum White Subtree
- 1334D - Minimum Euler Cycle
- 255D - Mr. Bender and Square
- 899D - Shovel Sale
- 933A - A Twisty Movement
- 986B - Petr and Permutations
1900
- 552D - Vanya and Triangles
- 582B - Once Again...
- 660D - Number of Parallelograms
- 661F - Primes in Interval
- 1205B - Shortest Cycle
- 121C - Lucky Permutation
- 1272E - Nearest Opposite Parity
- 1285D - Dr. Evil Underscores
- 1400D - Zigzags
- 162D - Remove digits
- 20C - Dijkstra?
- 335B - Palindrome
- 470E - Chessboard
- 577B - Modulo Sum
- 597C - Subsequences
- 5C - Longest Regular Bracket Sequence
- 622D - Optimal Number Permutation
- 784F - Crunching Numbers Just for You
- 803C - Maximal GCD
- 1029D - Concatenated Multiples
- 1036C - Classy Numbers
- 1089F - Fractions
- 109B - Lucky Probability
- 111B - Petya and Divisors
- 1155D - Beautiful Array
- 1168B - Good Triple
- 1264B - Beautiful Sequence
- 134B - Pairs of Numbers
- 1430E - String Reversal
- 19B - Checkout Assistant
- 22D - Segments
- 279E - Beautiful Decomposition
- 319B - Psychos in a Line
- 359C - Prime Number
- 45D - Event Dates
- 463D - Gargari and Permutations
- 472D - Design Tutorial: Inverse the Problem
- 476D - Dreamoon and Sets
- 547B - Mike and Feet
- 552C - Vanya and Scales
- 599D - Spongebob and Squares
- 661B - Seasons
- 708B - Recover the String
- 808D - Array Division
- 862C - Mahmoud and Ehab and the xor
- 1060D - Social Circles
- 1303D - Fill The Bag
- 1444B - Divide and Sum
- 1492D - Genius's Gambit
- 223B - Two Strings
- 294C - Shaass and Lights
- 367B - Sereja ans Anagrams
- 388B - Fox and Minimal path
- 41E - 3-cycles
- 470C - Eval
- 470D - Caesar Cipher
- 540D - Bad Luck Island
- 55C - Pie or die
- 683G - The Fraction
- 691E - Xor-sequences
- 965D - Single-use Stones
- 1031D - Minimum path
- 1032D - Barcelonian Distance
- 1067A - Array Without Local Maximums
- 1081E - Missing Numbers
- 1095E - Almost Regular Bracket Sequence
- 1119E - Pavel and Triangles
- 1147B - Chladni Figure
- 1174D - Ehab and the Expected XOR Problem
- 1208D - Restore Permutation
- 1242B - 0-1 MST
- 1311F - Moving Points
- 1365E - Maximum Subsequence Value
- 1463D - Pairs
- 1488D - Problemsolving Marathon
- 16E - Fish
- 213B - Numbers
- 223C - Partial Sums
- 232B - Table
- 257D - Sum
- 27C - Unordered Subsequence
- 452D - Washer, Dryer, Folder
- 452D - Washer, Dryer, Folder
- 455B - A Lot of Games
- 459C - Pashmak and Buses
- 550D - Regular Bridge
- 739B - Alyona and a tree
- 959E - Mahmoud and Ehab and the xor-MST
- 1041E - Tree Reconstruction
- 1092F - Tree with Maximum Cost
- 1360G - A/B Matrix
- 730J - Bottles
- 959D - Mahmoud and Ehab and another array construction task
- 1508A - Binary Literature
- 457B - Distributed Join
- 999D - Equalize the Remainders
2000
- 1366D - Two Divisors
- 600D - Area of Two Circles' Intersection
- 1082E - Increasing Frequency
- 615D - Multipliers
- 900D - Unusual Sequences
- 961D - Pair Of Lines
- 1132F - Clear the String
- 1244E - Minimizing Difference
- 1288D - Minimax Problem
- 1294F - Three Paths on a Tree
- 1391D - 505
- 1416C - XOR Inverse
- 1493C - K-beautiful Strings
- 451D - Count Good Substrings
- 474E - Pillars
- 475D - CGCDSSQ
- 571B - Minimization
- 797E - Array Queries
- 803F - Coprime Subsequences
- 891B - Gluttony
- 895C - Square Subsets
- 963B - Destruction of a Tree
- 999E - Reachability from the Capital
- 1033D - Divisors
- 1088D - Ehab and another another xor problem
- 1200E - Compress Words
- 1311D - Three Integers
- 1416B - Make Them Equal
- 453B - Little Pony and Harmony Chest
- 468B - Two Sets
- 487B - Strip
- 490E - Restoring Increasing Sequence
- 578C - Weakness and Poorness
- 633D - Fibonacci-ish
- 774J - Stepan's Series
- 863E - Turn Off The TV
- 893E - Counting Arrays
- 899E - Segments Removal
- 920F - SUM and REPLACE
- 933B - A Determined Cleanup
- 940E - Cashback
- 1101D - GCD Counting
- 1147C - Thanos Nim
- 1156C - Match Points
- 1209E1 - Rotate Columns (easy version)
- 1354C2 - Not So Simple Polygon Embedding
- 1359D - Yet Another Yet Another Task
- 1359E - Modular Stability
- 1408D - Searchlights
- 1525C - Robot Collisions
- 432D - Prefixes and Suffixes
- 461B - Appleman and Tree
- 466B - Wonder Room
- 492E - Vanya and Field
- 509C - Sums of Digits
- 542C - Idempotent functions
- 721D - Maxim and Array
- 926F - Mobile Communications
- 997B - Roman Digits
- 1083B - The Fair Nut and Strings
- 1092E - Minimal Diameter Forest
- 1102F - Elongated Matrix
- 1157F - Maximum Balanced Circle
- 1385E - Directing Edges
- 1521C - Nastia and a Hidden Permutation
- 1536D - Omkar and Medians
- 501D - Misha and Permutations Summation
- 758D - Ability To Convert
- 792C - Divide by Three
- 1349B - Orac and Medians
- 1379C - Choosing flowers
- 1380D - Berserk And Fireball
- 1415D - XOR-gun
- 1513D - GCD and MST
- 965C - Greedy Arkady
- 1219G - Harvester
2100
- 1493D - GCD of an Array
- 1499D - The Number of Pairs
- 484B - Maximum Value
- 919E - Congruence Equation
- 955C - Sad powers
- 1510D - Digits
- 837D - Round Subset
- 1029E - Tree with Small Distances
- 1098B - Nice table
- 1433F - Zero Remainder Sum
- 1486D - Max Median
- 431D - Random Task
- 530H - Points in triangle
- 540E - Infinite Inversions
- 552E - Vanya and Brackets
- 609E - Minimum spanning tree for each edge
- 632D - Longest Subsequence
- 665E - Beautiful Subarrays
- 926J - Segments
- 992D - Nastya and a Game
- 1032E - The Unbearable Lightness of Weights
- 1146D - Frog Jumping
- 1151E - Number of Components
- 1167E - Range Deleting
- 1184A2 - Heidi Learns Hashing (Medium)
- 1207F - Remainder Problem
- 1217D - Coloring Edges
- 1312E - Array Shrinking
- 1322B - Present
- 1409F - Subsequences of Length Two
- 1411D - Grime Zoo
- 489F - Special Matrices
- 549H - Degenerate Matrix
- 551D - GukiZ and Binary Operations
- 576B - Invariance of Tree
- 576C - Points on Plane
- 762C - Two strings
- 837E - Vasya's Function
- 899F - Letters Removing
- 980D - Perfect Groups
- 988E - Divisibility by 25
- 1003E - Tree Constructing
- 1006F - Xor-Paths
- 1025D - Recovering BST
- 1027E - Inverse Coloring
- 1117D - Magic Gems
- 1158C - Permutation recovery
- 1364D - Ehab's Last Corollary
- 1366E - Two Arrays
- 1372D - Omkar and Circle
- 1387A - Graph
- 1419E - Decryption
- 1454F - Array Partition
- 1516D - Cut
- 441D - Valera and Swaps
- 466D - Increase Sequence
- 486D - Valid Sets
- 491B - New York Hotel
- 530G - Levenshtein distance
- 571A - Lengthening Sticks
- 771C - Bear and Tree Jumps
- 850B - Arpa and a list of numbers
- 920E - Connected Components?
- 960F - Pathwalks
- 498C - Array and Operations
- 587B - Duff in Beach
- 788B - Weird journey
- 799D - Field expansion
- 877D - Olya and Energy Drinks
- 954F - Runner's Problem
- 1355E - Restorer Distance
- 1213F - Unstable String Sort
2200
- 1070A - Find a Number
- 1156E - Special Segments of Permutation
- 1373E - Sum of Digits
- 1503C - Travelling Salesman Problem
- 903D - Almost Difference
- 1154G - Minimum Possible LCM
- 1166D - Cute Sequences
- 1168C - And Reachability
- 1389E - Calendar Ambiguity
- 1437E - Make It Increasing
- 616E - Sum of Remainders
- 617E - XOR and Favorite Number
- 915D - Almost Acyclic Graph
- 920G - List Of Integers
- 946E - Largest Beautiful Number
- 1034B - Little C Loves 3 II
- 1140E - Palindrome-less Arrays
- 1156D - 0-1-Tree
- 1175E - Minimal Segment Cover
- 1311E - Construct the Binary Tree
- 1428E - Carrots for Rabbits
- 1438D - Powerful Ksenia
- 1485D - Multiples and Power Differences
- 1486E - Paired Payment
- 1515E - Phoenix and Computers
- 612E - Square Root of Permutation
- 622E - Ants in Leaves
- 802E - Marmots (medium)
- 850C - Arpa and a game with Mojtaba
- 868D - Huge Strings
- 903E - Swapping Characters
- 903F - Clear The Matrix
- 1037E - Trips
- 1045G - AI robots
- 1155E - Guess the Root
- 1157G - Inverse of Rows and Columns
- 1196F - K-th Path
- 1333F - Kate and imperfection
- 1400E - Clear the Multiset
- 1407D - Discrete Centrifugal Jumps
- 1468A - LaIS
- 1470D - Strange Housing
- 1526D - Kill Anton
- 448E - Divisors
- 476E - Dreamoon and Strings
- 628D - Magic Numbers
- 768D - Jon and Orbs
- 773C - Prairie Partition
- 802H - Fake News (medium)
- 852F - Product transformation
- 908D - New Year and Arbitrary Arrangement
- 1059D - Nature Reserve
- 1097D - Makoto and a Blackboard
- 1110D - Jongmah
- 1110E - Magic Stones
- 1184C2 - Heidi and the Turing Test (Medium)
- 1328F - Make k Equal
- 1406D - Three Sequences
- 762E - Radio stations
- 774H - Repairing Of String
- 965E - Short Code
- 1136E - Nastya Hasn't Written a Legend
- 1215E - Marbles
- 1220E - Tourism
- 1234F - Yet Another Substring Reverse
- 1278E - Tests for problem D
- 1474D - Cleaning
- 785E - Anton and Permutation
- 804C - Ice cream coloring
- 906B - Seating of Students
- 1498D - Bananas in a Microwave
2300
- 1182E - Product Oriented Recurrence
- 1188B - Count Pairs
- 1198D - Rectangle Painting 1
- 1073E - Segment Sum
- 425D - Sereja and Squares
- 487C - Prefix Product Sequence
- 660E - Different Subsets For All Tuples
- 870E - Points, Lines and Ready-made Titles
- 888G - Xor-MST
- 915G - Coprime Arrays
- 1132E - Knapsack
- 1468M - Similar Sets
- 558E - A Simple Task
- 610D - Vika and Segments
- 641G - Little Artem and Graph
- 675E - Trains and Statistic
- 713C - Sonya and Problem Wihtout a Legend
- 762D - Maximum path
- 938E - Max History
- 1276C - Beautiful Rectangle
- 1404C - Fixed Point Removal
- 451E - Devu and Flowers
- 460D - Little Victor and Set
- 598C - Nearest vectors
- 690A2 - Collective Mindsets (medium)
- 803G - Periodic RMQ Problem
- 817F - MEX Queries
- 845G - Shortest Path Problem?
- 856B - Similar Words
- 993E - Nikita and Order Statistics
- 1015F - Bracket Substring
- 1046I - Say Hello
- 1101G - (Zero XOR Subset)-less
- 1167F - Scalar Queries
- 1204E - Natasha, Sasha and the Prefix Sums
- 1268C - K Integers
- 1270E - Divide Points
- 1476E - Pattern Matching
- 467E - Alex and Complicated Task
- 600E - Lomsat gelral
- 708C - Centroids
- 774E - Big Number and Remainder
- 808E - Selling Souvenirs
- 838E - Convex Countour
- 960E - Alternating Tree
- 995C - Leaving the Bar
- 1139D - Steps to One
- 1385F - Removing Leaves
- 1385G - Columns Swaps
- 1394B - Boboniu Walks on Graph
- 718C - Sasha and Array
- 772C - Vulnerable Kerbals
- 825E - Minimal Labels
- 891C - Envy
2400
- 1036E - Covered Points
- 932E - Team Work
- 1485F - Copy or Prefix Sum
- 1527D - MEX Tree
- 449D - Jzzhu and Numbers
- 912E - Prime Gift
- 915F - Imbalance Value of a Tree
- 1007B - Pave the Parallelepiped
- 1032F - Vasya and Maximum Matching
- 1051F - The Shortest Statement
- 1059E - Split the Tree
- 1132G - Greedy Subsequences
- 1182D - Complete Mirror
- 1187D - Subarray Sorting
- 1423J - Bubble Cup hypothesis
- 452E - Three strings
- 632F - Magic Matrix
- 665F - Four Divisors
- 802N - April Fools' Problem (medium)
- 865D - Buy Low Sell High
- 911F - Tree Destruction
- 922F - Divisibility
- 962F - Simple Cycles Edges
- 1036F - Relatively Prime Powers
- 1045B - Space Isaac
- 1083E - The Fair Nut and Rectangles
- 1093F - Vasya and Array
- 1107E - Vasya and Binary String
- 1114F - Please, another Queries on Array?
- 1142C - U2
- 1146E - Hot is Cold
- 1184E3 - Daleks' Invasion (hard)
- 1186F - Vus the Cossack and a Graph
- 1202E - You Are Given Some Strings...
- 1374F - Cyclic Shifts Sorting
- 1401E - Divide Square
- 1428F - Fruit Sequences
- 1455E - Four Points
- 1473E - Minimum Path
- 1482F - Useful Edges
- 1523D - Love-Hate
- 626E - Simple Skewness
- 632E - Thief in a Shop
- 720B - Cactusophobia
- 808F - Card Game
- 906C - Party
- 946F - Fibonacci String Subsequences
- 959F - Mahmoud and Ehab and yet another xor task
- 990G - GCD Counting
- 1000F - One Occurrence
- 1028E - Restore Array
- 1038E - Maximum Matching
- 1082G - Petya and Graph
- 1088E - Ehab and a component choosing problem
- 1093E - Intersection of Permutations
- 1096G - Lucky Tickets
- 1147D - Palindrome XOR
- 1163E - Magical Permutation
- 1401F - Reverse and Swap
- 1442C - Graph Transpositions
- 1491E - Fib-tree
- 1526E - Oolimry and Suffix Array
- 446C - DZY Loves Fibonacci Numbers
- 484D - Kindergarten
- 513G2 - Inversions problem
- 582C - Superior Periodic Subarrays
- 758F - Geometrical Progression
- 873F - Forbidden Indices
- 914E - Palindromes in a Tree
- 1027F - Session in BSU
- 1042F - Leaf Sets
- 1091E - New Year and the Acquaintance Estimation
- 1221F - Choose a Square
- 1469E - A Bit Similar
- 1494E - A-Z Graph
- 1499F - Diameter Cuts
Remember that a short statement doesn't mean a simple and clear statement.