LightOJ – Efficient Pseudo Code
Problem Name: Efficient Pseudo Code
Judge: LightOJ
Algorithms & DS: Prime Factorization, Modular Arithmetics, Big Mod. Mod Inverse
Problem Name: Efficient Pseudo Code
Judge: LightOJ
Algorithms & DS: Prime Factorization, Modular Arithmetics, Big Mod. Mod Inverse
Problem Name: Solutions to an Equation
Judge: LightOJ
Algorithms & DS: Linear Diophantine Equation, Extended Euclid
Problem Name: Intelligent Factorial Factorization
Judge: LightOJ
Algorithms & DS: Prime Factorization
Problem Name: Trailing Zeroes (I)
Judge: LightOJ
Algorithms & DS: NOD(Number of Divisors)
Problem Name: Iftar Party
Judge: LightOJ
Algorithms & DS: Divisors
Problem Name: Mathematically Hard
Judge: LightOJ
Algorithms & DS: Euler Phi
Problem Name: Problem Makes Problem
Judge: LightOJ
Algorithms & DS: Combinatorics, Modular Arithmatics
Problem Name: Combinations
Judge: LightOJ
Algorithms & DS: Combinatorics, Modular Arithmetics
Problem Name: Eid
Judge: LightOJ
Algorithms & DS: LCM(Euclid), Big Integer
Problem Name: Knights in Chessboard
Judge: LightOJ
Algorithms & DS: Adhoc, Basic Math