Modulo Seven of Weighted Sum
Programming Basics · Java
TASK
Problem
Given two integers `a` and `b`, compute the weighted value 2a + 3b, then print the non-negative remainder modulo 7.
EXAMPLE
Example
7 3
2
LIMITS
Constraints
-1000 ≤ a, b ≤ 1000
LEARN
Theory for this problem
+
The core idea of **Modulo Seven of Weighted Sum** is to model the requested operation directly: Given two integers `a` and `b`, compute the weighted value 2a + 3b, then print the non-negative remainder modulo 7. The reference solution uses `Scanner` for input. Keep only the state needed for this result, choose numeric types that cover the stated bounds, and preserve the exact input/output contract. This makes the solution easier to verify on boundary cases and avoids unrelated work.
NEED HELP?
Hints
+
['First compute `2 * a + 3 * b` and store it as the intermediate result.', 'Then apply `Math.floorMod(result, 7)` to that result and print only the final value.']
ANSWER
Solution
+
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long a = sc.nextLong();
long b = sc.nextLong();
long result = 2 * a + 3 * b;
long answer = Math.floorMod(result, 7);
System.out.println(answer);
}
}