Submission #7975745
Source Code Expand
import java.io.*; import java.lang.reflect.Array; import java.util.*; @SuppressWarnings("unused") public class Main { private FastScanner in = new FastScanner(System.in); private PrintWriter out = new PrintWriter(System.out); final int MOD = (int)1e9+7; long ceil(long a, long b){return (a + b - 1) / b;} void solve() throws Exception{ Scanner sc = new Scanner(System.in); String line = sc.nextLine(); line = line.replace("Left", "<"); line = line.replace("Right", ">"); line = line.replace("AtCoder", "A"); out.println(line); } //end solve public static void main(String[] args) throws Exception { new Main().m(); } private void m() throws Exception { solve(); out.flush(); } static class FastScanner { Reader input; FastScanner() {this(System.in);} FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));} int nextInt() {return (int) nextLong();} long nextLong() { try { int sign = 1; int b = input.read(); while ((b < '0' || '9' < b) && b != '-' && b != '+') { b = input.read(); } if (b == '-') { sign = -1; b = input.read(); } else if (b == '+') { b = input.read(); } long ret = b - '0'; while (true) { b = input.read(); if (b < '0' || '9' < b) return ret * sign; ret *= 10; ret += b - '0'; } } catch (IOException e) { e.printStackTrace(); return -1; } } double nextDouble() { try { double sign = 1; int b = input.read(); while ((b < '0' || '9' < b) && b != '-' && b != '+') { b = input.read(); } if (b == '-') { sign = -1; b = input.read(); } else if (b == '+') { b = input.read(); } double ret = b - '0'; while (true) { b = input.read(); if (b < '0' || '9' < b) break; ret *= 10; ret += b - '0'; } if (b != '.') return sign * ret; double div = 1; b = input.read(); while ('0' <= b && b <= '9') { ret *= 10; ret += b - '0'; div *= 10; b = input.read(); } return sign * ret / div; } catch (IOException e) { e.printStackTrace(); return Double.NaN; } } char nextChar() { try { int b = input.read(); while (Character.isWhitespace(b)) { b = input.read(); } return (char) b; } catch (IOException e) { e.printStackTrace(); return 0; } } String nextStr() { try { StringBuilder sb = new StringBuilder(); int b = input.read(); while (Character.isWhitespace(b)) { b = input.read(); } while (b != -1 && !Character.isWhitespace(b)) { sb.append((char) b); b = input.read(); } return sb.toString(); } catch (IOException e) { e.printStackTrace(); return ""; } } public int[] nextIntArray(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt(); } return res; } public int[] nextIntArrayDec(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt() - 1; } return res; } public int[] nextIntArray1Index(int n) { int[] res = new int[n + 1]; for (int i = 0; i < n; i++) { res[i + 1] = nextInt(); } return res; } public long[] nextLongArray(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong(); } return res; } public long[] nextLongArrayDec(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong() - 1; } return res; } public long[] nextLongArray1Index(int n) { long[] res = new long[n + 1]; for (int i = 0; i < n; i++) { res[i + 1] = nextLong(); } return res; } public double[] nextDoubleArray(int n) { double[] res = new double[n]; for (int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; } } }
Submission Info
Submission Time | |
---|---|
Task | A - スペース高橋君 |
User | Oland |
Language | Java8 (OpenJDK 1.8.0) |
Score | 100 |
Code Size | 5671 Byte |
Status | AC |
Exec Time | 93 ms |
Memory | 23764 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example_0.txt, example_1.txt, example_2.txt |
All | corner_0.txt, corner_1.txt, corner_2.txt, example_0.txt, example_1.txt, example_2.txt, maxrand_0.txt, maxrand_1.txt, maxrand_2.txt, random_0.txt, random_1.txt, random_2.txt, random_3.txt, random_4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
corner_0.txt | AC | 91 ms | 19924 KB |
corner_1.txt | AC | 91 ms | 23764 KB |
corner_2.txt | AC | 91 ms | 19796 KB |
example_0.txt | AC | 92 ms | 20560 KB |
example_1.txt | AC | 90 ms | 18640 KB |
example_2.txt | AC | 92 ms | 19796 KB |
maxrand_0.txt | AC | 93 ms | 19668 KB |
maxrand_1.txt | AC | 92 ms | 21204 KB |
maxrand_2.txt | AC | 92 ms | 21716 KB |
random_0.txt | AC | 93 ms | 20820 KB |
random_1.txt | AC | 91 ms | 19796 KB |
random_2.txt | AC | 90 ms | 20816 KB |
random_3.txt | AC | 92 ms | 19664 KB |
random_4.txt | AC | 92 ms | 18900 KB |