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 results14,366 problems
| Topics | Judge | |||||
|---|---|---|---|---|---|---|
| ResistanceGiven three color names, map each to its digit or multiplier using a fixed table and print the resulting resistance value. | Easy1 | Hash mapImplementation | No attempts yet | 2s | 128 MB | Judgeable |
| Escape from a RectangleGiven a point inside an axis-aligned rectangle, compute the minimum distance from the point to the nearest side of the rectangle. | Easy1 | MathGeometry+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Print the AnswerPrint the fixed literal text "문제의 정답" with no input given. | Easy1 | Implementation | 1 solved50% accepted | 1s | 512 MB | Judgeable |
| Palindrome NumbersFor each integer up to 99999 in a terminated input list, print whether its decimal digits form a palindrome. | Easy1 | StringImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Counting VowelsFor each input line until a terminating '#', count how many letters are vowels regardless of case. | Easy1 | StringImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Compare Two NumbersRead two integers and print whether the first is greater than, less than, or equal to the second. | Easy1 | Implementation | No attempts yet | 1s | 512 MB | Judgeable |
| HexadecimalConvert a hexadecimal number of at most 6 digits into its decimal value and print it. | Easy1 | MathImplementation | No attempts yet | 2s | 128 MB | Judgeable |
| MooWrite a program that prints a fixed ASCII art cow exactly, with no input given. | Easy1 | Implementation | No attempts yet | 2s | 128 MB | Judgeable |
| Rugby ClubRead repeated name/age/weight lines until a sentinel and print whether each member is Senior or Junior based on simple thresholds. | Easy1 | Implementation | No attempts yet | 1s | 128 MB | Judgeable |
| Cutting ChocolateCompute the minimum number of straight cuts needed to divide an N by M chocolate bar into all 1x1 pieces. | Easy1 | MathImplementation | No attempts yet | 2s | 128 MB | Judgeable |
| QuackPrint a fixed ASCII-art duck exactly, matching every character and line with no input. | Easy1 | ImplementationString | No attempts yet | 1s | 128 MB | Judgeable |
| CrowingPrint a fixed ASCII art rooster with no input, matching the exact spacing and characters. | Easy1 | ImplementationString | No attempts yet | 1s | 128 MB | Judgeable |
| Livestock CountPrint a fixed, exact livestock count table with no computation involved. | Easy1 | Implementation | No attempts yet | 1s | 128 MB | Judgeable |
| Clay PotPrint a fixed ASCII-art shape of a clay pot exactly as specified, with no algorithmic content. | Easy1 | Implementation | No attempts yet | 1s | 128 MB | Judgeable |
| Print the Star PatternPrint a fixed, predetermined star pattern made only of periods and asterisks, with no input. | Easy1 | Implementation | No attempts yet | 1s | 128 MB | Judgeable |
| Dobby's English StudyFor each line, count how many times a given letter (case-insensitive) appears in a sentence until a line with only '#' ends input. | Easy1 | StringImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| HowlPrint a fixed wolf ASCII art picture exactly, with no input and no extra spaces. | Easy1 | ImplementationString | No attempts yet | 1s | 128 MB | Judgeable |
| RookPrint a fixed ASCII-art picture of a chess rook exactly as given, with no extra spaces or lines. | Easy1 | Implementation | No attempts yet | 1s | 128 MB | Judgeable |
| Safari WorldRead two integers and print the absolute value of their difference. | Easy1 | MathImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Star Printing - 1Given N, print a triangle pattern where line i contains exactly i stars. | Easy1 | Implementation | No attempts yet | 1s | 128 MB | Judgeable |
| Print Stars - 3Print N lines of stars where the count decreases from N down to 1. | Easy1 | Implementation | No attempts yet | 1s | 128 MB | Judgeable |
| Print Stars - 4Print a right-aligned triangle of stars with N stars on the first line decreasing to 1 star on the last line. | Easy1 | Implementation | No attempts yet | 1s | 128 MB | Judgeable |
| Print Stars - 5Print a centered pyramid of stars with N lines, where line i has 2i-1 stars padded with spaces. | Easy1 | ImplementationSimulation | No attempts yet | 1s | 128 MB | Judgeable |
| Star Printing 9Print an hourglass-shaped star pattern of stars and spaces based on an integer N. | Easy1 | Implementation | No attempts yet | 1s | 128 MB | Judgeable |
| Verification DigitCompute the check digit as the sum of squares of five given digits, mod 10. | Easy1 | MathImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Yutnori Throw ClassificationClassify three yut-stick throws into one of five results based on how many of four values equal 0. | Easy1 | Implementation | No attempts yet | 1s | 128 MB | Judgeable |
| Star Printing - 12Print a diamond-like pattern of N to 1 to N stars with leading spaces forming 2N-1 lines. | Easy1 | Implementation | No attempts yet | 1s | 128 MB | Judgeable |
| Star Printing - 13Given N, print a pyramid of stars that grows one star per line up to N then shrinks back down, using 2N-1 lines total. | Easy1 | ImplementationSimulation | No attempts yet | 1s | 128 MB | Judgeable |
| Oven ClockGiven a start time and a number of minutes to cook, compute and print the finishing time on a 24-hour clock. | Easy1 | MathSimulation | No attempts yet | 1s | 128 MB | Judgeable |
| Print the BirthdayPrint a fixed hardcoded birthday date in month/day format with no real input or logic. | Easy1 | Implementation | No attempts yet | 1s | 128 MB | Judgeable |
| Print an Asterisk SquareRead an integer N and print an N by N square made of asterisk characters. | Easy1 | Implementation | No attempts yet | 1s | 128 MB | Judgeable |
| Hello WorldPrint the fixed string 'Hello World!' with no input required. | Easy1 | Implementation | 1 solved100% accepted | 1s | 128 MB | Judgeable |
| Sum of Two Numbers - 2Read two single-digit integers from separate lines and print their sum. | Easy1 | MathImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Maximum ValueRead nine distinct natural numbers and print the maximum value along with its 1-based position. | Easy1 | ArrayImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Odd NumbersGiven seven natural numbers, print the sum of the odd ones and the smallest odd one, or -1 if none exist. | Easy1 | ArrayImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Average and MedianRead five natural numbers and print their average and median. | Easy1 | SortingArray+1 | No attempts yet | 1s | 128 MB | Judgeable |
| MultiplicationGiven two three-digit numbers, print the partial products from vertical multiplication and their total. | Easy1 | MathImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| String RepetitionGiven repeat count R and string S, output the string formed by repeating each character of S exactly R times in order. | Easy1 | StringImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Least Common Multiple and Greatest Common DivisorFor multiple integer pairs, compute and print each pair's least common multiple and greatest common divisor. | Easy1 | MathNumber theory | No attempts yet | 1s | 128 MB | Judgeable |
| Typo Man Go ChangyoungGiven a string and a 1-based position, output the string with that one character removed, for multiple test cases. | Easy1 | StringImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Matrix AdditionRead two N by M integer matrices and print their element-wise sum. | Easy1 | MatrixImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Multiplication TablePrint the multiplication table for a given integer N from N*1 to N*9 in the exact required format. | Easy1 | Implementation | No attempts yet | 1s | 128 MB | Judgeable |
| Print Numbers up to NRead an integer N and print every integer from 1 to N on separate lines. | Easy1 | Implementation | No attempts yet | 1s | 128 MB | Judgeable |
| Print N DownwardRead a number N and print integers from N down to 1, one per line. | Easy1 | Implementation | No attempts yet | 1s | 128 MB | Judgeable |
| Word LengthRead a word of at most 100 letters and print its length. | Easy1 | StringImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Toggle Alphabet CaseRead a word up to length 100 and print it with every letter's case swapped. | Easy1 | StringImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Fibonacci NumberCompute the nth Fibonacci number for n up to 45. | Easy1 | MathImplementation | 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 |
| Leap YearGiven a year, output 1 if it is a leap year according to the standard divisibility rule, otherwise output 0. | Easy1 | MathImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Grade Point CalculationRead a letter grade string and print its corresponding fixed grade point value from a lookup table. | Easy1 | ImplementationHash map | No attempts yet | 1s | 128 MB | Judgeable |
| Beautiful NumberFor each given integer, count how many distinct decimal digits it contains. | Easy1 | StringImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Study Abroad BanDelete every character in a given uppercase word that appears in the letters of 'CAMBRIDGE' and print the rest. | Easy1 | StringImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| After the PartyCompute actual attendees as L times P, then output the difference between each of five reported counts and that value. | Easy1 | MathImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| FBIGiven five agent codes, print the 1-based positions of those containing the substring FBI, or a fixed message if none do. | Easy1 | StringImplementation | No attempts yet | 0.25s | 128 MB | Judgeable |
| Alarm ClockGiven an alarm time in hours and minutes, compute and print the time 45 minutes earlier, wrapping around midnight if needed. | Easy1 | MathImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| SangsuReverse two given three-digit numbers digit by digit and print the larger reversed value. | Easy1 | MathImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Musical ScaleGiven a permutation of 1 through 8, print whether it is strictly ascending, strictly descending, or otherwise mixed. | Easy1 | ArrayImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Completing a Chess SetGiven counts of six white chess piece types, output how many of each must be added or removed to reach a complete 16-piece set. | Easy1 | ArrayImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Find R2Given R1 and the average S of two integers, compute and print the other integer R2. | Easy1 | MathImplementation | 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 |
| RemaindersRead ten nonnegative integers, compute each mod 42, and print how many distinct remainder values occur. | Easy1 | Hash mapImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Taxicab GeometryGiven radius R, compute and print the area of a Euclidean circle and a taxicab-metric circle. | Easy1 | MathGeometry+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Sum of Missing CharactersFor each string, sum the ASCII values of uppercase letters that never appear in it. | Easy1 | StringHash map+1 | No attempts yet | 1s | 128 MB | Judgeable |
| SharesFor repeated pairs N and S, print the largest integer x such that N times x does not exceed S. | Easy1 | MathImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Is the First Number Greater?For each pair of positive integers read until a 0 0 line, print Yes when the first is greater than the second, otherwise No. | Easy1 | Implementation | No attempts yet | 1s | 128 MB | Judgeable |
| The Good and the BadCount the letters g and b in each hero name, ignoring case, and print whether the name is GOOD, A BADDY, or NEUTRAL. | Easy1 | StringImplementation+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Capitalize the First LetterRead N sentences and print each one with its first letter changed to uppercase, leaving every other character as is. | Easy1 | StringImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Line NumbersRead N lines of text and print each one prefixed with its 1-based line number in the format "number. content". | Easy1 | ImplementationString | No attempts yet | 1s | 128 MB | Judgeable |
| The Navi-Computer is Down!Read pairs of 3D coordinates and system names, and print the Euclidean distance between each pair rounded to two decimals. | Easy1 | MathImplementation+1 | No attempts yet | 1s | 128 MB | Judgeable |
| No BrainerFor each zombie, compare the number of brains it eats X with the number it needs Y, and print whether X is at least Y. | Easy1 | ImplementationBrute force | No attempts yet | 1s | 128 MB | Judgeable |
| Speed LimitGiven segments of constant speed with cumulative elapsed times, compute the total distance for each data set until n equals -1. | Easy1 | ImplementationMath+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Clay BullyFor each class, read each student's block dimensions and name, then print the bully with the largest volume and the victim with the smallest volume. | Easy1 | ArrayImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| LunacyFor each non-negative Earth weight read until a negative sentinel, print a sentence giving the weight on the Moon at 0.167 times the Earth weight, both rounded to two decimals. | Easy1 | ImplementationMath | No attempts yet | 1s | 128 MB | Judgeable |
| Mirror, Oh! MirrorRead lines of ASCII text until a line of three asterisks, and print each line with its characters reversed. | Easy1 | StringImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Counting LinesRead all input lines, including empty ones, and print how many there are. | Easy1 | ImplementationString | No attempts yet | 1s | 128 MB | Judgeable |
| Spinner Lock SimulationGiven the starting digits of a spinner lock and a sequence of button labels, add each label's digits to the wheels modulo 10 and print the final readout. | Easy1 | SimulationImplementation+2 | No attempts yet | 1s | 128 MB | Judgeable |
| PhD ProgramRead N problems, output a+b for each addition line and 'skipped' for the line P=NP. | Easy1 | ImplementationString | No attempts yet | 1s | 128 MB | Judgeable |
| TGN Advertising DecisionFor each test case, compare the no-ad revenue r against e minus c, then print advertise, do not advertise, or does not matter. | Easy1 | ImplementationMath | 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 |
| Divisors and MultiplesFor each pair of numbers, print factor if the first divides the second, multiple if the first is a multiple of the second, or neither. | Easy1 | MathImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Sarah's ToysFor each night, subtract the toys left around the house from the total, then report how many pairs and whether one group of 3 is formed. | Easy1 | MathImplementation+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Pair SumThis is a straightforward simulation task where numbers in each test case are used to enumerate pairs. For each input n, all pairs of distinct natural numbers with sum n are printed in lexicographic order. Because n is at most 12, iterating all possible a and b values directly works. Implemented with simple loops, this problem is a typical warm-up exercise. | Easy1 | SimulationBrute force+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Even Sum Versus Odd SumFor each of up to 50 sequences, add the even numbers and the odd numbers separately and print EVEN, ODD, or TIE based on which sum is larger. | Easy1 | ArrayImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| WelcomePrint the three-line ASCII art that spells the word Welcome, matching every space and symbol exactly. | Easy1 | ImplementationString | No attempts yet | 1s | 128 MB | Judgeable |
| Call CenterPrint a fixed piece of ASCII art of C3PO sitting at a call center, matching the example exactly. | Easy1 | ImplementationString | No attempts yet | 1s | 128 MB | Judgeable |
| PyramidsFor each positive base size n until a terminating 0, print the total number of blocks in a pyramid whose layers count down from n to 1. | Easy1 | MathImplementation+2 | No attempts yet | 1s | 128 MB | Judgeable |
| BillingRead item names until EOI and print the total cost of all listed supplies with a dollar sign and two decimals. | Easy1 | Hash mapImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Battle Droid PriceFor each test case, multiply five part quantities by fixed prices, sum them, and print the total with a dollar sign and two decimals. | Easy1 | MathImplementation+2 | No attempts yet | 1s | 128 MB | Judgeable |
| Card GameRead five round scores and print their sum. | Easy1 | ArrayImplementation | No attempts yet | 1s | 256 MB | Judgeable |
| Match ResultsRead N rounds of scores for A and B, and report how many rounds each player won. | Easy1 | ImplementationSimulation | No attempts yet | 1s | 256 MB | Judgeable |
| Entry Log ManagementRead N names and print each one converted to lowercase, one per line. | Easy1 | StringImplementation | No attempts yet | 1s | 256 MB | Judgeable |
| SanggeunaldGiven prices for three burgers and two drinks, print the lowest cost of one burger plus one drink minus a 50 won combo discount. | Easy1 | ImplementationMath+2 | No attempts yet | 1s | 128 MB | Judgeable |
| The Errand RouteAdd four travel times given in seconds and print the total split into minutes on the first line and seconds on the second. | Easy1 | MathImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| ReceiptGiven the total price of 10 books and the prices of 9 of them, find the missing book's price. | Easy1 | MathImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| JOI and IOICount how many length-3 windows of a string equal JOI and how many equal IOI, including overlaps. | Easy1 | StringBrute force+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Exam ScoresGiven the four subject scores of two students, print the larger of the two totals, or Minguk's total when they tie. | Easy1 | ImplementationMath | No attempts yet | 1s | 128 MB | Judgeable |
| Find the Students Who Didn't SubmitGiven 28 distinct attendance numbers from 1 to 30, print the two missing numbers in increasing order. | Easy1 | ArrayImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Hot DogsRead pairs of integers H and P until end of file and print H/P rounded to exactly two decimal places. | Easy1 | MathImplementation | No attempts yet | 1s | 128 MB | Judgeable |
| Sanggeun's FriendsFor each test case, read the counts of male and female friends and print their sum; stop at the two zeros line. | Easy1 | MathImplementation | No attempts yet | 1s | 128 MB | Judgeable |