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 6
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
Help In Math Problem
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 6
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | 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 | TheSleepyDevil | 2024-06-24 22:35:02 | 196 | Initial revision (published) |
Name |
---|