Given an unsorted array A and a number k, find the maximum sum sub string in the array such that its sum is divisible by k.
eg. k=3 arr[1,2,3,-3,-4,1,0,-2,5,4,5]
ans=12 sum from [-2,5,4,5]
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3857 |
| 2 | jiangly | 3747 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3591 |
| 6 | gamegame | 3477 |
| 7 | Benq | 3468 |
| 8 | Radewoosh | 3463 |
| 9 | ecnerwala | 3451 |
| 10 | heuristica | 3431 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | -is-this-fft- | 162 |
| 3 | Dominater069 | 160 |
| 4 | Um_nik | 158 |
| 4 | atcoder_official | 158 |
| 6 | Qingyu | 156 |
| 7 | djm03178 | 151 |
| 7 | adamant | 151 |
| 7 | luogu_official | 151 |
| 10 | awoo | 146 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Feb/25/2025 00:46:28 (l3).
Desktop version, switch to mobile version.
Supported by
