8000
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent cf709d9 commit 2e16942Copy full SHA for 2e16942
src/main/java/com/fishercoder/solutions/_1862.java
@@ -16,7 +16,7 @@ public int sumOfFlooredPairs(int[] nums) {
16
}
17
List<Integer> list = new ArrayList<>(map.keySet());
18
int mod = 1000000007;
19
- long sum = 0l;
+ long sum = 0L;
20
for (int i = list.size() - 1; i >= 0; i--) {
21
for (int j = i; j >= 0; j--) {
22
sum += (list.get(i) / list.get(j)) * map.get(list.get(j)) * map.get(list.get(i));
0 commit comments