-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathMain.java
39 lines (30 loc) · 1.03 KB
/
Main.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
package io.github.tahanima.uva._11614;
import java.util.Scanner;
public class Main {
/**
* @param numberOfWarriors denotes an integer array containing
* the numbers of Etruscan warriors
* @return a long array containing the answers
*/
public static long[] solve(int[] numberOfWarriors) {
// Implement this method
return new long[0];
}
/**
* Takes care of the problem's input and output.
*/
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
StringBuilder stringBuilder = new StringBuilder();
int testCases = scanner.nextInt();
int[] numberOfWarriors = new int[testCases];
for (int cases = 0; cases < testCases; cases++) {
numberOfWarriors[cases] = scanner.nextInt();
}
long[] answer = solve(numberOfWarriors);
for (long n: answer) {
stringBuilder.append(String.format("%d%n", n));
}
System.out.print(stringBuilder);
}
}