Probleme
Quick Answer#1371
Foarte ușor · Disjoint set union
Lucky Numbers#1372
Foarte ușor · Math · Brute force
GCD Determinant#1373
Ușor · Number theory · Math
Internet Service Providers#1374
Ușor · Optimization
Base -2#1375
Foarte ușor · Number theory
The Bases Are Loaded#1376
Ușor · Number theory
What Base Is This?#1377
Mediu · Number theory
Fibonaccimal Base#1378
Foarte ușor · Number theory
Palindometer#1380
Foarte ușor · Brute force
Balloons#1381
Ușor · Greedy algorithms
Selling Cells#1382
Mediu · Geometry · Implementation
Not One Bit More#1383
Mediu · Binary Search
Abstract Extract#1384
Foarte ușor · Implementation
Roller Coaster#1385
Foarte ușor · Dynamic programming
Spy Cam#1386
Ușor · Implementation
Underground Cables#1387
Mediu · Greedy algorithms · Disjoint set union · Sorting · Geometry
Petrol Stations#1388
Mediu · Shortest paths · Dijkstra algorithm
Buses#1389
Foarte ușor · Shortest paths
Car race#1390
Foarte ușor · Graphs
Recursion#1391
Foarte dificil · Depth-first Search · Expression parsing
Wave traversal of a graph#1392
Mediu · Graphs
The Table#1393
Ușor · String suffix structures
Calculator#1394
Dificil · Implementation
Largest Empty Circle on a Segment#1395
Ușor · Geometry
Problemsetting#1396
Ușor · Graphs