Opening the reading…
Opening the reading…
DSA FUNDAMENTALS › MATH BASICS
This is a scratch drill — your code runs, nothing is graded or recorded. No test cases, no expected output, no verdict.
TASK
Write a C++ program that tests candidates only through the square root of 36. Collect each smaller divisor and its different partner, then print all divisors in ascending order without duplicating 6.
OUTPUT
Sample1 2 3 4 6 9 12 18 36
What a finished answer prints, from the lesson. Nothing has run yet — press Run and this is replaced by your program’s own output.