airad's blog

By airad, history, 3 months ago, translation, In English

Hello to Codeforces community! I'm interested in how to count quickly all divisors of a: 1) a number (<=10^9) 2) a multiplication of several numbers (each approximately <= 10^5) Thank you all a lot in advance!

Read more »

 
 
 
 
  • Vote: I like it
  • +9
  • Vote: I do not like it