Commit 578209b3 authored by Nicolas Fella's avatar Nicolas Fella
Browse files

Translate russian comment to english

parent 60bcd6ba
Pipeline #225408 passed with stage
in 23 minutes and 25 seconds
// Euclid's algorithm for calculating the greatest common divisor
int main()
int i, j;
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment