Registration open — 2026 cycle

Tanzania's next generation
of engineers starts here.

A national competition identifying the country's sharpest young problem-solvers, and preparing them to represent Tanzania on the international stage.

Problem archive

Solve real algorithmic challenges.

Every round draws from a growing archive of original problems, built around Tanzanian geography, systems, and data.

Kilimanjaro Routes

Find the shortest supply route across a weighted network of mountain trading posts.

Graph Theory

Medium

Try this problem

func solve(n int) int { dp := make([]int, n+1) dp[0], dp[1] = 0, 1 for i := 2; i <= n; i++ { dp[i] = dp[i-1]+dp[i-2] } return dp[n] } class Graph: def __init__(self): self.adj = {} def bfs(self, start): visited = set([start]) queue = [start] def shortest_path(grid): dist = [[inf]*cols for _ in range(rows)]

🔒

+49 more problems Unlocks when you register

The competition

Built like an international olympiad, from day one.

Structured rounds, real problem sets, and a scoring system designed to match the standard of IOI, PAIO, and AOAI — so students arrive prepared, not surprised.

See the format

Training

A clear path from first line of code to national team.

Beginner, intermediate, and advanced tracks covering algorithms, data structures, and competitive programming — built for students starting from zero.

Explore training