| Problem name | | In short | Forum |
| 50261 - Roads |
 |
|
Discussion (1) » |
| 50697 - Base Stations |
|
|
Clarifications (2) » |
| 50695 - Longest link between neurons |
|
|
Clarifications (1) » |
| 50414 - Traffic |
|
Determine if it is possible to convert all the roads to directed roads |
Clarifications (1) » |
| 50698 - Ayran Delivery |
|
|
Clarifications (7) » |
| 50700 - Candidates for the Mayor |
|
|
|
| 50978 - Albanian Coders |
|
|
Clarifications (6) » |
| 50699 - Fighting Vampires |
|
|
Clarifications (1) » |
| 50692 - How much money? |
|
|
Clarifications (1) » |
| 50694 - The Cheapest Flight |
|
|
Clarifications (1) » |
| 50841 - My grand-grand-grandfather |
|
|
Clarifications (2) » |
| 51076 - Key person |
|
|
Clarifications (2) » |
| 51080 - Deepest Point |
|
|
Clarifications (2) » |
| 51079 - Key person - 2 |
|
|
Clarifications (1) » |
| 50857 - Nine-Stones Game |
|
|
|
| 50929 - Present from your uncles |
|
|
Clarifications (2) » |
| 50703 - The Shortest Path |
|
|
Clarifications (1) » |
| 50704 - Connected? |
|
Is there a path between the two graph nodes? |
Clarifications (1) » |
| 50705 - Student Clubs |
|
Determine the number of diffrent school clubs. |
Clarifications (1) » |
| 50464 - From Tirana to Durres |
 |
Write a program that finds the shortest path. |
Clarifications (1) » |
| 50701 - Cell Removal |
|
Return the number of cells the mature form of this organism would have |
Discussion (1) » |
| 50691 - The traveling salesman problem |
 |
Bypass all the vertices once |
Discussion (1) » |
| 50690 - Parliament |
 |
Split the insulted deputies into few groups |
Discussion (1) » |
| 50255 - Bishops |
 |
Find the max number of bishops that can be placed on the chessboard |
Discussion (1) » |