Problems
Pick a problem and write your solution in the built-in editor. The judge runs it against real test cases while you watch, and the wider archive is open to read whenever you like.
Total results2,729 problems
| Title | Level | Topics | Solved | Time limit | Memory limit | Judge |
|---|---|---|---|---|---|---|
| Average and MedianRead five natural numbers and print their average and median. | Easy1 | SortingArray+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Sort NumbersRead N integers and print them sorted in ascending order, one per line. | Easy1 | Sorting | No attempts yet | 1s | 128 MB | Judgeable |
| Sorting Three NumbersRead three distinct integers and print them sorted from smallest to largest. | Easy1 | Sorting | No attempts yet | 1s | 128 MB | Judgeable |
| ABCSort three distinct numbers into A, B, C and print them in an order given by a 3-letter permutation string. | Easy1 | SortingImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Triangle and Its Three SidesRead triples of positive integers until 0 0 0, and for each print Equilateral, Isosceles, Scalene, or Invalid based on equal sides and the triangle inequality. | Easy1 | ImplementationMath+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Score TallyDrop the highest and lowest of five judge scores, print KIN when the remaining three span 4 or more, else print their sum. | Easy1 | SortingImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Right TriangleGiven three side lengths per test case in any order, decide whether they form a right triangle. | Easy1 | MathSorting | No attempts yet | 1s | 128 MB | Judgeable |
| Three NumbersPrint the median of three given integers between 1 and 100. | Easy1 | Sorting | No attempts yet | 1s | 256 MB | Judgeable |
| Extreme SortCheck whether the given numbers are in non-decreasing order and print yes or no. | Easy1 | ArraySorting | No attempts yet | 1s | 256 MB | Judgeable |
| Choosing subjectsPick the three highest scores among the four science subjects and the higher of history and geography, then print their sum. | Easy1 | GreedySorting | No attempts yet | 2s | 512 MB | Judgeable |
| A debugging life that starts with std::sortPrint N = 2 and the two points (1, 0) and (0, 1), a fixed counterexample for a broken comparator in std::sort. | Easy1 | ImplementationSorting+2 | No attempts yet | 2s | 512 MB | Judgeable |
| Passionate SortingRead N numbers and print them in ascending order separated by spaces. | Easy1 | SortingImplementation | No attempts yet | 1s | 512 MB | Judgeable |
| ExamRead three scores and print the sum of the two largest. | Easy1 | ArrayImplementation+1 | No attempts yet | 2s | 512 MB | Judgeable |
| Word SortingDeduplicate a list of words and sort them first by length, then lexicographically. | Easy2 | SortingString | No attempts yet | 2s | 256 MB | Judgeable |
| Sort Digits DescendingRearrange the digits of a given natural number so they appear in descending order and print the result. | Easy2 | SortingString+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Dobby's Case-Insensitive Word TestFor each test case, output the original-cased word that is smallest in dictionary order when comparisons ignore letter case. | Easy2 | StringSorting+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Third Largest NumberFor each test case of 10 positive integers, output the third largest distinct-position value in the array. | Easy2 | SortingArray | No attempts yet | 1s | 32 MB | Judgeable |
| Sort Numbers 2Read up to one million distinct integers and print them in ascending order. | Easy2 | SortingImplementation | No attempts yet | 2s | 256 MB | Judgeable |
| Score CalculationGiven 8 distinct problem scores, output the sum of the top 5 and their original indices in increasing order. | Easy2 | SortingArray+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Sorting Wooden PiecesSimulate repeated bubble-sort passes on five labeled pieces, printing the arrangement after every swap until sorted. | Easy2 | SimulationSorting+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Equal-Size Interval ClusteringSort points lexicographically, split them into K consecutive groups of nearly equal size, and print each group's coordinate average. | Easy2 | SortingArray+1 | No attempts yet | 5s | 128 MB | Judgeable |
| Right TriangleRead triples of side lengths until 0 0 0, and print right if the squares of the two shorter sides sum to the square of the longest, else wrong. | Easy2 | MathImplementation+2 | No attempts yet | 1s | 128 MB | Judgeable |
| Gnome SequencingFor each of N triples of beard lengths, decide whether the three values are strictly increasing or strictly decreasing, then print Ordered or Unordered. | Easy2 | ImplementationSorting+2 | No attempts yet | 1s | 128 MB | Judgeable |
| ICPC Score Totalizer SoftwareFor each contestant, drop one highest and one lowest judge score, then output the truncated average of the rest. | Easy2 | ImplementationSorting+2 | No attempts yet | 1s | 128 MB | Judgeable |
| LeagueGiven every match result in a round-robin soccer league, compute each team's total points and print its rank, where tied teams share the best rank. | Easy2 | ImplementationArray+2 | No attempts yet | 1s | 128 MB | Judgeable |
| ContestGiven 20 scores, split into two groups of 10, output each group's sum of its top 3 scores. | Easy2 | SortingImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| BirthdayGiven each student's name and birthday, print the name of the youngest student, then the oldest. | Easy2 | ImplementationSorting+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Grade StatisticsFor each class, read the scores, then report the maximum, the minimum, and the largest gap between neighboring scores after sorting in descending order. | Easy2 | SortingImplementation+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Scavenger HuntList every pair (x, y) where x divides P and y divides Q, sorted by x then y. | Easy2 | MathBrute force+1 | No attempts yet | 1s | 128 MB | Judgeable |
| StatisticsRead N integers, print their mean and median rounded to six decimal places. | Easy2 | ArraySorting+2 | No attempts yet | 1s | 128 MB | Judgeable |
| Time on TaskGiven a time limit and chore durations, find the largest number of chores that can be completed in any order. | Easy2 | GreedySorting | No attempts yet | 1s | 128 MB | Judgeable |
| Computer PurchaseGiven n computers with RAM, CPU speed, and disk values, sort by the score 2R + 3S + D and print the top two names, breaking ties by smaller name. | Easy2 | SortingImplementation | No attempts yet | 2s | 512 MB | Judgeable |
| Who is in the middle?Given the weights of three bowls, print the middle value among the three weights. | Easy2 | SortingImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Anagram CheckerDecide whether two phrases are anagrams, ignoring spaces and letters only. | Easy2 | Hash mapString+1 | No attempts yet | 1s | 128 MB | Judgeable |
| AnagramsGiven two lowercase words, decide whether one can be rearranged into the other, and print the result with the words. | Easy2 | StringHash map+1 | No attempts yet | 1s | 128 MB | Judgeable |
| NumbersGiven three distinct digits and one of their six permutations, find that number's 1-based rank when all six permutations are sorted ascending. | Easy2 | MathSorting+2 | No attempts yet | 1s | 1024 MB | Judgeable |
| Right Triangle CheckFor each of n triples of side lengths, decide whether the triangle is right by checking if the largest side squared equals the sum of the other two squared. | Easy2 | MathGeometry+2 | No attempts yet | 1s | 128 MB | Judgeable |
| MP3 SongsRead several lists of tune names and print each list sorted alphabetically while ignoring case and keeping input order for ties. | Easy2 | SortingString+1 | No attempts yet | 1s | 128 MB | Judgeable |
| AAAAHH! Overbooked!Given N event time ranges in hh:mm-hh:mm format, check whether any two events overlap in time. | Easy2 | IntervalsSorting | No attempts yet | 1s | 128 MB | Judgeable |
| Closing the CircuitShift every given upper pair forward by one position modulo n and print the sorted lower pairs after TAK. | Easy2 | ImplementationSorting+1 | No attempts yet | 3s | 128 MB | Judgeable |
| Olympic Country RankingCount how many countries beat country K on gold, then silver, then bronze medals, and report its rank. | Easy2 | SortingArray | No attempts yet | 1s | 128 MB | Judgeable |
| ClockFind the time with the median clock-hand angle among five given times, breaking angle ties by earlier time. | Easy2 | MathSorting+1 | No attempts yet | 1s | 128 MB | Judgeable |
| The Friend of My Enemy Is My EnemyPrint the direct friends of suspect s in increasing order for each network. | Easy2 | GraphSorting | No attempts yet | 1s | 128 MB | Judgeable |
| Length and Frequency of SentencesCount the words in each of N sentences and report how often each length occurs in ascending order. | Easy2 | StringHash map+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Divide the land into trianglesSort all pegs by x then y, split the order into consecutive triples, and print each triple's input numbers in increasing order. | Easy2 | Sorting | No attempts yet | 1s | 16 MB | Judgeable |
| Distribution in MetagoniaRepeatedly peel off 2^a times the largest power of 3 fitting the odd part of the remainder until it hits zero, then print the pieces sorted. | Easy2 | SimulationMath+1 | No attempts yet | 2s | 256 MB | Judgeable |
| A Towering ProblemSplit six distinct box heights into two triples matching the two given tower heights and print each triple in decreasing order. | Easy2 | Brute forceSorting | No attempts yet | 1s | 256 MB | Judgeable |
| Moist's Card SortingCount the cards a robot moves while it insertion sorts each deck of names into lexicographic order. | Easy2 | SimulationSorting | No attempts yet | 5s | 512 MB | Judgeable |
| Second Cheapest PresentGiven a list of distinct prices, print the second cheapest one, formatted with two decimal places. | Easy2 | SortingImplementation | No attempts yet | 2s | 512 MB | Judgeable |
| Country Leader (Small)For each test case, find the name with the most distinct letters, breaking ties by ASCII alphabetical order, and print it. | Easy2 | StringImplementation+2 | No attempts yet | 5s | 512 MB | Judgeable |
| Country LeaderFor each test case, pick the name with the most distinct letters, breaking ties by lexicographic order where a space sorts before any letter. | Easy2 | StringSorting+2 | No attempts yet | 5s | 512 MB | Judgeable |
| 2017 Ajou University Programming Contest (Small)Given up to three contestants' scores, submission counts, and last scoring upload times, output the number of the top-ranked contestant by the tie-break rules. | Easy2 | SortingImplementation | No attempts yet | 1s | 512 MB | Judgeable |
| 2017 Ajou Programming Contest (Large)Given each contestant's score, submission count, and last scoring upload time, print the number of the first-place contestant. | Easy2 | Sorting | No attempts yet | 1s | 512 MB | Judgeable |
| Stacking CupsRead each cup's message, recover its radius from either token order, then print colors from smallest to largest cup. | Easy2 | SortingImplementation | No attempts yet | 1s | 512 MB | Judgeable |
| Qualifiers for the Next PhaseGiven N scores and a minimum cutoff rank K, count how many competitors advance when ties at the K-th score also qualify. | Easy2 | SortingArray+1 | No attempts yet | 1s | 1024 MB | Judgeable |
| What Is Your HandleSort N distinct handles by ASCII dictionary order and print the I-th one. | Easy2 | SortingString+1 | No attempts yet | 1s | 512 MB | Judgeable |
| Buying SnacksGiven price and weight for three snacks, print the name of the one whose 10-bag weight per discounted price is highest. | Easy2 | ImplementationMath+2 | No attempts yet | 1s | 1024 MB | Judgeable |
| BagsGiven n waste pieces with identifiers, find the minimum number of bags so that each bag holds pieces of only one identifier. | Easy2 | Hash mapImplementation+2 | No attempts yet | 1s | 512 MB | Judgeable |
| What Is My Grade?Given 50 distinct scores sorted in descending order and Hongik's score, print the letter grade matching his rank using the fixed cutoffs. | Easy2 | ArrayImplementation+2 | No attempts yet | 1s | 256 MB | Judgeable |
| This Problem’s a Slam DunkGiven the heights of five players on each of two teams, count how many State U players are taller than the opponent they guard after sorting both teams by height. | Easy2 | SortingArray+1 | No attempts yet | 1s | 512 MB | Judgeable |
| MergeMerge two sorted sequences into one sorted sequence using the given tie-breaking rule, which takes from A when the front elements are equal. | Easy2 | Two pointersImplementation+2 | No attempts yet | 2s | 512 MB | Judgeable |
| A Problem for Testing a New Regrade MethodRead two integers A and B, print their sum, then read N numbers and print them sorted in ascending order. | Easy2 | SortingImplementation | No attempts yet | 5s | 512 MB | Judgeable |
| TreasureGiven two arrays A and B, rearrange A (B stays fixed) to minimize the sum of elementwise products, using the sorted pairing strategy. | Easy3 | GreedySorting+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Symmetric DifferenceGiven two sets of natural numbers, compute the size of their symmetric difference. | Easy3 | Hash mapArray+1 | No attempts yet | 2s | 256 MB | Judgeable |
| BestsellerGiven N book titles sold in a day, find the most frequent title, breaking ties by lexicographically smallest. | Easy3 | Hash mapSorting+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Serial NumbersSort serial numbers by length, then digit-sum, then a custom lexicographic rule where digits precede letters. | Easy3 | SortingString+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Repairing Pipe LeaksGiven leak positions and a fixed tape length, compute the minimum number of length-L tapes needed so each leak is covered with at least 0.5 margin on both sides. | Easy3 | GreedySorting+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Seongjun and ChocolateGiven chocolate and coffee doses with time-decaying effect radii, sum the positive radii (minimum 1) for each query time. | Easy3 | SimulationBrute force+2 | No attempts yet | 1s | 128 MB | Judgeable |
| Number Word SortSort integers from M to N by comparing their digits spelled out as English words rather than by numeric value, then print 10 per line. | Easy3 | SortingString+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Common NamesGiven two lists of unique lowercase names, find and print the count and sorted list of names common to both. | Easy3 | Hash mapSorting+1 | No attempts yet | 2s | 256 MB | Judgeable |
| Set DifferenceGiven two sets of up to 500,000 natural numbers each, output the count and sorted list of elements present in A but not in B. | Easy3 | Hash mapSorting+1 | No attempts yet | 2s | 256 MB | Judgeable |
| Median FilterApply a 3x3 median filter over an image and count filtered pixels whose median value is at least a given threshold. | Easy3 | MatrixSorting+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Finding NumbersGiven N integers and M queries, output for each query whether it exists in the array, requiring an efficient lookup method. | Easy3 | Binary searchSorting+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Find Prime NumbersPrint all prime numbers between two given bounds M and N, one per line, using an efficient sieve up to 1,000,000. | Easy3 | MathNumber theory+1 | No attempts yet | 2s | 256 MB | Judgeable |
| Meeting Room SchedulingGiven N meetings with start and end times, select the maximum number of non-overlapping meetings using a classic greedy interval scheduling approach. | Easy3 | GreedySorting+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Jumong's Armor MaterialsCount how many pairs of given numbers sum to a target value M, using each material at most once per pair. | Easy3 | Two pointersArray+1 | No attempts yet | 2s | 128 MB | Judgeable |
| StatisticsGiven N odd integers, compute and print the rounded mean, median, mode (second smallest if tied), and range. | Easy3 | ArraySorting+1 | No attempts yet | 2s | 256 MB | Judgeable |
| Drawing LinesGiven N line segments on a number line, compute the total length covered by at least one segment, merging overlaps. | Easy3 | IntervalsSorting+1 | No attempts yet | 1s | 192 MB | Judgeable |
| RopesChoose a subset of ropes so that each rope's capacity times the count of chosen ropes is maximized, to find the greatest liftable weight. | Easy3 | SortingGreedy | No attempts yet | 2s | 192 MB | Judgeable |
| AuctionGiven a sequence of bids, find the least-frequent price (lowest if tied) and output the name of the first bidder who offered that price. | Easy3 | Hash mapImplementation+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Seven DwarfsGiven nine distinct heights, find seven that sum to exactly 100 and print them in ascending order. | Easy3 | Brute forceArray+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Asian Informatics OlympiadSort students by descending score and pick the top three medalists while capping each country to at most two medals. | Easy3 | SortingGreedy+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Representative Natural NumberFind the smallest integer minimizing the sum of absolute differences to a list of numbers, which is the lower median. | Easy3 | SortingMath+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Two Representative Natural NumbersGiven up to 5,000,000 integers from 1 to 10,000, output the median (smallest if tie) and the rounded mean as representatives. | Easy3 | MathSorting+1 | No attempts yet | 2s | 256 MB | Judgeable |
| Paper CuttingGiven a rectangular sheet and a series of horizontal or vertical cuts along grid lines, compute the area of the largest resulting piece. | Easy3 | SortingArray+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Memory MasterFor each queried integer, check whether it exists in a large set of stored integers and print 1 or 0 for up to a million queries per test case. | Easy3 | Hash mapArray+1 | No attempts yet | 2s | 256 MB | Judgeable |
| BlackjackGiven N card values and a target M, find the maximum sum of three distinct cards not exceeding M. | Easy3 | Brute forceTwo pointers+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Math HomeworkExtract every maximal run of digits from up to 100 strings, strip leading zeros, and print all extracted numbers sorted nondecreasing. | Easy3 | StringSorting+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Most Visited DomainsParse a list of URLs to extract each domain suffix and print the maximum visit count along with all domains that reach it, sorted alphabetically. | Easy3 | StringHash map+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Journey with PigsGiven pig weights and per-village net price coefficients, assign pigs to villages one-to-one to maximize total revenue (sort and multiply greedily). | Easy3 | GreedySorting+1 | No attempts yet | 2s | 64 MB | Judgeable |
| Control PointsGiven sorted coordinates of control points, find the minimum number of length-1 half-open intervals needed to cover all points using a greedy sweep. | Easy3 | GreedySorting+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Mowing the LawnDetermine if sorted mower path coordinates with a given strip width fully cover a 75x100 rectangle in both directions, across multiple test cases until a terminator line. | Easy3 | SortingSimulation+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Memorable Phone NumbersNormalize each listed phone number to seven digits and report those appearing more than once, sorted, with their counts. | Easy3 | StringHash map+2 | No attempts yet | 1s | 128 MB | Judgeable |
| Conformity PrizeCanonicalize each frosh's five courses, count how many frosh share each set, then output the total over all sets with the maximum count. | Easy3 | Hash mapSorting+2 | No attempts yet | 1s | 128 MB | Judgeable |
| EcologyCount how many times each tree species line appears, then print each species in lexicographic order with its share of the total, rounded to four decimals. | Easy3 | Hash mapString+1 | No attempts yet | 1s | 256 MB | Judgeable |
| ForestsCount how many distinct nonempty sets of trees appear among the (person, tree) pairs; people who heard nothing are excluded. | Easy3 | Hash mapSorting+2 | No attempts yet | 1s | 128 MB | Judgeable |
| Zipf's LawFor each test case, count the words in a book body and print the words that appear exactly n times, in lowercase alphabetical order. | Easy3 | Hash mapString+2 | No attempts yet | 1s | 128 MB | Judgeable |
| Request for ProposalGiven a set of requirements, score each proposal by how many requirements it meets, then pick the best one by compliance and price. | Easy3 | Hash mapString+2 | No attempts yet | 1s | 128 MB | Judgeable |
| Rout 66Simulate an invader whose strength drops after each stronghold it breaks, processing strongholds nearest first, and report whether all fall. | Easy3 | SimulationSorting+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Symmetric OrderGiven a list of names sorted by length, rearrange them so shorter names sit at the top and bottom and longer ones in the middle, pairing names from the start. | Easy3 | ArrayImplementation+2 | No attempts yet | 1s | 128 MB | Judgeable |