HexOps LogoGO CHECKPOINTSBY HEXOPS.PRO

Official 01-edu Go piscine roadmap & subject index powered by hexops.pro.

Math01-edu Subject ID: gcd

GCD (Greatest Common Divisor)

Compute the greatest common divisor of two non-negative integers using Euclidean algorithm.

View Subject on 01-edu GitHub

Checkpoint & XP Breakdown

CheckpointLevelXP per Exercise
Checkpoint 01Level 311.1k XP
Checkpoint 02Level 319.2k XP
Checkpoint 03Level 325.5k XP
Final CheckpointLevel 331.8k XP

Related Math Exercises

Rect Perimeter
Calculate and return the perimeter of a rectangle given length and width.
Digit Len
Calculate the total number of digits in an integer given a specific base.
Fish and Chips
Print "fish", "chips", or "fish and chips" depending on divisibility by 2 and 3.
Find Prev Prime
Find the largest prime number smaller than or equal to a given integer.
From To
Generate a formatted number sequence strictly stepping from start number to end number.
Add Prime Sum
Calculate the sum of all prime numbers less than or equal to a given positive integer.