Opening the reading…

Check if Two Numbers Are Co-Prime — drill-1 — LearnYard

03 Dsa FundamentalsMath BasicsCheck if Two Numbers are Co-Prime

Lesson · no judge

1 of 4 parts done

1/4

DSA FUNDAMENTALS › MATH BASICS

Write it, run it, read the output

Reading · 4 minQuiz · 5 questions2 code drills · run only

This is a scratch drill — your code runs, nothing is graded or recorded. No test cases, no expected output, no verdict.

TASK

Complete the C++ function so it computes the GCD of 14 and 25 once and prints "Co-prime" when that GCD equals 1.

C++

Loading editor…

OUTPUT

Sample

Co-prime

What a finished answer prints, from the lesson. Nothing has run yet — press Run and this is replaced by your program’s own output.

Previous · Check if a Number is Prime without using the Sieve of Eratosthenes3 parts left before this item is marked done.Next part · Code drill 2

AI TUTORTalk to tutor

Scoped to Check if Two Numbers are Co-Prime. The tutor can see the reading, its checkpoints and your drill code.

The tutor reads this lesson alongside you and answers questions about it — nudging you towards the answer rather than handing it over.

Sign in to use the tutor

The tutor will not answer a quiz question for you, and it will not paste a working drill. It explains the reading it can see.