Help In Math Problem 
Difference between en1 and en2, changed 27 character(s)
Given n , k , find the number of pairs (i,j) such that 0<=i<j<=n and k divides (j-i)↵
Testcases up to 1e5 , (k<=n) up to 1e9 ↵
Sample:-↵
input 
: ↵
2↵
3 1↵
5 2↵
output : ↵
6↵
(5,2) , output 6

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English TheSleepyDevil 2024-06-24 22:36:12 27 Tiny change: ':-\ninput : \n2\n3 1\n5 2\noutput : \n6\n6' -> ':-\ninput (5,2) , output 6'
en1 English TheSleepyDevil 2024-06-24 22:35:02 196 Initial revision (published)