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 results6,410 problems
| Title | Level | Topics | Solved | Time limit | Memory limit | Judge |
|---|---|---|---|---|---|---|
| Fermat's Last TheoremOrder all positive quadruples (a,b,c,n) with n>=3 by max element then lexicographically, and print the sign of a^n+b^n compared to c^n for positions l through r. | Hard9 | MathCombinatorics+2 | No attempts yet | 2s | 512 MB | Judgeable |
| Coalescing ContinentsGiven K rectangles with total area 25 on a 20x20 grid, decide if they can be translated to tile a square, and find the minimum total moves. | Hard10 | Brute forceMath+2 | No attempts yet | 1s | 128 MB | Judgeable |
| GeneratorRead an index 0 to 10 and output the exact contents of the matching recovered file gen_i.out from the archive. | Hard10 | ImplementationString+2 | No attempts yet | 2s | 256 MB | Judgeable |
| LogoGiven up to five polyomino patch shapes (each a subset of a 3x3 grid, flippable and rotatable) and up to three grid designs up to 55x5, decide if each design can be tiled exactly by non-overlapping patches and find the minimum patch count, or report NIE. | Hard10 | Dynamic programmingBit manipulation+2 | No attempts yet | 1s | 128 MB | Judgeable |
| String Palindrome QueriesMaintain a lowercase string under block moves, reversals, and single-character insertions, answering after each change whether a given substring reads the same forwards and backwards. | Hard10 | StringString matching+1 | No attempts yet | 2s | 256 MB | Judgeable |
| RobotsDesign two robots' instruction tables so they classify a binary string as fine or coarse from its middle third's A and B counts, using four-bit memories, exact-then-wildcard dispatch, and 1000n steps. | Hard10 | ImplementationBit manipulation+2 | No attempts yet | 2s | 512 MB | Judgeable |
| Natural ParkReconstruct the exact edge set of a sparse connected graph with degree at most 7 using at most 45,000 connectivity queries over chosen subsets. | Hard10 | GraphBFS+2 | No attempts yet | 2s | 512 MB | Judgeable |
| Dungeon 2Explore an unknown connected graph through a move-and-color oracle and report, for each i, how many room pairs have shortest-path distance exactly i. | Hard10 | GraphBFS+2 | No attempts yet | 1s | 256 MB | Judgeable |
| Shadow CompanionConstruct a fixed program over a bit tape with a shadow that transforms every input n < 2^10 into n squared. | Hard10 | SimulationBit manipulation+2 | No attempts yet | 2s | 512 MB | Judgeable |
| Delightful (Easy)Write a program of at most 100 commands for a ternary computer with 26 40-trit registers that computes the length of the longest non-decreasing prefix of the input in register X and leaves the answer in Y. | Hard10 | ImplementationSimulation+2 | No attempts yet | 1s | 512 MB | Judgeable |