Explore the Euclidean Algorithm for computing the GCD of integers 'm' and 'n'. The script demonstrates step-by-step calculations, ensuring consistent formatting with leading zeros. Users can input values and view GCD results, supported by input validation.
active 2024-01-23 → 2024-08-26 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 217 days from 2024-01-23 to 2024-08-26. Pushes: 8 total, peak 8 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 5 total, peak 4 in a day. Comments: 2 total, peak 2 in a day. Stars: 7 total, peak 3 in a day.
- Pushes
- Pull requests
- Issues
- Comments
- Stars
Top contributors
Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity
| Contributor | Contributions | Pushes | PRs | Comments |
|---|---|---|---|---|
| ReuAzel181 | 15 | 8 | 0 | 2 |
Recent activity
Latest issues, pull requests and releases
Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 7 stars here means stars gained during the window, not the repo's star count.