Submission #928767
Source Code Expand
import java.util.ArrayList; import java.util.Arrays; import java.util.HashSet; import java.util.Scanner; import java.util.function.BiFunction; public class Main { Scanner sc = new Scanner(System.in); public static void main(String[] args) { new Main().run(); } void run() { HashSet<Integer> set = new HashSet<>(); for (int i = 0; i < 3; ++i) { set.add(ni()); } System.out.println(set.size()); } int ni() { return Integer.parseInt(sc.next()); } void debug(Object... os) { System.err.println(Arrays.deepToString(os)); } class BIT<T> { int n; ArrayList<T> bit; BiFunction<T, T, T> bif; BIT(int n, BiFunction<T, T, T> bif, T defaultValue) { this.n = n; bit = new ArrayList<>(n + 1); for (int i = 0; i < n + 1; ++i) { bit.add(defaultValue); } this.bif = bif; } void update(int i, T v) { for (int x = i; x <= n; x += x & -x) { bit.set(x, bif.apply(bit.get(x), v)); } } T reduce(int i, T defaultValue) { T ret = defaultValue; for (int x = i; x > 0; x -= x & -x) { ret = bif.apply(ret, bit.get(x)); } return ret; } } }
Submission Info
Submission Time | |
---|---|
Task | A - AtCoDeer and Paint Cans |
User | arukuka |
Language | Java8 (OpenJDK 1.8.0) |
Score | 100 |
Code Size | 1260 Byte |
Status | AC |
Exec Time | 115 ms |
Memory | 9684 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_000.txt, 0_001.txt |
All | 0_000.txt, 0_001.txt, 1_002.txt, 1_003.txt, 1_004.txt, 1_005.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_000.txt | AC | 114 ms | 9676 KB |
0_001.txt | AC | 114 ms | 9680 KB |
1_002.txt | AC | 114 ms | 9552 KB |
1_003.txt | AC | 115 ms | 9684 KB |
1_004.txt | AC | 114 ms | 9680 KB |
1_005.txt | AC | 115 ms | 9676 KB |