Submission #1035403
Source Code Expand
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintWriter; import java.util.*; public class Main { void solve() throws IOException { int n = ni(), x = ni(); out.println(540 * x + 525 * (n - x)); } String ns() throws IOException { while (!tok.hasMoreTokens()) { tok = new StringTokenizer(in.readLine(), " "); } return tok.nextToken(); } int ni() throws IOException { return Integer.parseInt(ns()); } long nl() throws IOException { return Long.parseLong(ns()); } double nd() throws IOException { return Double.parseDouble(ns()); } String[] nsa(int n) throws IOException { String[] res = new String[n]; for (int i = 0; i < n; i++) { res[i] = ns(); } return res; } int[] nia(int n) throws IOException { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = ni(); } return res; } long[] nla(int n) throws IOException { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nl(); } return res; } class INA { int[][] a; INA(int n, int m) throws IOException { this(n, m, -1); } INA(int n, int m, int t) throws IOException { a = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { a[j][i] = ni() + t; } } } int[] get(int i) { return a[i - 1]; } } static BufferedReader in; static PrintWriter out; static StringTokenizer tok; public static void main(String[] args) throws IOException { in = new BufferedReader(new InputStreamReader(System.in)); out = new PrintWriter(System.out); tok = new StringTokenizer(""); Main main = new Main(); main.solve(); out.close(); } }
Submission Info
Submission Time | |
---|---|
Task | A - プレミアム会員 |
User | CrazyBBB |
Language | Java (OpenJDK 1.7.0) |
Score | 100 |
Code Size | 2182 Byte |
Status | AC |
Exec Time | 222 ms |
Memory | 19304 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask1_random01.txt, subtask1_random02.txt, subtask1_random03.txt, subtask1_random04.txt, subtask1_random05.txt, subtask1_random06.txt, subtask1_random07.txt, subtask1_random08.txt, subtask1_random09.txt, subtask1_random10.txt, subtask1_random11.txt, subtask1_random12.txt, subtask1_random13.txt, subtask1_random14.txt, subtask1_random15.txt, subtask1_random16.txt, subtask1_random17.txt, subtask1_random18.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 202 ms | 19268 KB |
subtask0_sample_02.txt | AC | 199 ms | 19272 KB |
subtask0_sample_03.txt | AC | 200 ms | 19264 KB |
subtask0_sample_04.txt | AC | 200 ms | 19268 KB |
subtask1_random01.txt | AC | 196 ms | 19272 KB |
subtask1_random02.txt | AC | 196 ms | 19300 KB |
subtask1_random03.txt | AC | 198 ms | 19260 KB |
subtask1_random04.txt | AC | 197 ms | 19260 KB |
subtask1_random05.txt | AC | 199 ms | 19192 KB |
subtask1_random06.txt | AC | 201 ms | 19260 KB |
subtask1_random07.txt | AC | 202 ms | 19264 KB |
subtask1_random08.txt | AC | 202 ms | 19268 KB |
subtask1_random09.txt | AC | 200 ms | 19272 KB |
subtask1_random10.txt | AC | 202 ms | 19304 KB |
subtask1_random11.txt | AC | 200 ms | 19264 KB |
subtask1_random12.txt | AC | 202 ms | 19268 KB |
subtask1_random13.txt | AC | 212 ms | 19276 KB |
subtask1_random14.txt | AC | 220 ms | 19256 KB |
subtask1_random15.txt | AC | 201 ms | 19264 KB |
subtask1_random16.txt | AC | 201 ms | 19192 KB |
subtask1_random17.txt | AC | 222 ms | 19304 KB |
subtask1_random18.txt | AC | 202 ms | 19268 KB |