Daffodil International University
Judge online · C (gcc / clang)
DIU
ContestHub
C practice · live contests
Problems
Leaderboard
Contests
Log in
Register
Sets
/
Set 17
Set 17
Advanced Number Theory
Seven problems, ramping from Very Easy to Extreme.
Progress · 0/7 solved
Q1
Sum of Divisors Function
VERY EASY
Q2
Euler's Totient Function
EASY
Q3
Modular Inverse
MEDIUM
Q4
Count Pairs with a Given GCD
MEDIUM-HARD
Q5
Maximum GCD Subsequence of Length K (full version)
HARD
Q6
Sum of GCDs of All Subarrays
VERY HARD
Q7
Smallest Multiple With Only Digits 0 and 1 (BFS on remainders)
EXTREME
← Set 16
Set 18 →
Set 17 · Advanced Number Theory · DIU ContestHub