Submission #916579
Source Code Expand
import java.io.IOException; import java.io.InputStream; import java.io.OutputStream; import java.io.PrintWriter; import java.util.NoSuchElementException; /** * Created by jaga on 9/22/16. */ public class Main { public static void solve(PrintWriter out, FastScanner in){ String s = in.next(); String a = "CODEFESTIVAL2016"; int count = 0; for(int i = 0;i < s.length();i ++) { if (s.charAt(i) != a.charAt(i)) { count++; } } out.println(count); } static class Pair implements Comparable { int first, second; Pair(int a, int b) { first = a; second = b; } public int compareTo(Object other) { Pair p1 = (Pair) other; return this.first - ((Pair) other).first; // IDの値に従い昇順で並び替えたい場合 // return -(this.first - ((Pair) other).first); // IDの値に従い降順で並び替えたい場合 } } /*以下はテンプレ*/ public static void main(String args[]) { OutputStream outputStream = System.out; PrintWriter out = new PrintWriter(outputStream); FastScanner in = new FastScanner(); solve(out, in); out.close(); } public static class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int bufferLength = 0; private boolean hasNextByte() { if (ptr < bufferLength) { return true; } else { ptr = 0; try { bufferLength = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (bufferLength <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } private void skipUnprintable() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; } boolean hasNext() { skipUnprintable(); return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while (true) { if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; } else if (b == -1 || !isPrintableChar(b)) { return minus ? -n : n; } else { throw new NumberFormatException(); } b = readByte(); } } double nextDouble() { return Double.parseDouble(next()); } double[] nextDoubleArray(int n) { double[] array = new double[n]; for (int i = 0; i < n; i++) { array[i] = nextDouble(); } return array; } double[][] nextDoubleMap(int n, int m) { double[][] map = new double[n][]; for (int i = 0; i < n; i++) { map[i] = nextDoubleArray(m); } return map; } public int nextInt() { return (int) nextLong(); } public int[] nextIntArray(int n) { int[] array = new int[n]; for (int i = 0; i < n; i++) array[i] = nextInt(); return array; } public long[] nextLongArray(int n) { long[] array = new long[n]; for (int i = 0; i < n; i++) array[i] = nextLong(); return array; } public String[] nextStringArray(int n) { String[] array = new String[n]; for (int i = 0; i < n; i++) array[i] = next(); return array; } public char[][] nextCharMap(int n) { char[][] array = new char[n][]; for (int i = 0; i < n; i++) array[i] = next().toCharArray(); return array; } public int[][] nextIntMap(int n, int m) { int[][] map = new int[n][]; for (int i = 0; i < n; i++) { map[i] = nextIntArray(m); } return map; } } }
Submission Info
Submission Time | |
---|---|
Task | A - Signboard |
User | jaga810 |
Language | Java8 (OpenJDK 1.8.0) |
Score | 100 |
Code Size | 5354 Byte |
Status | AC |
Exec Time | 100 ms |
Memory | 8276 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, s1.txt, s2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 97 ms | 8148 KB |
02.txt | AC | 94 ms | 8276 KB |
03.txt | AC | 95 ms | 8016 KB |
04.txt | AC | 94 ms | 8276 KB |
05.txt | AC | 95 ms | 8016 KB |
06.txt | AC | 94 ms | 8140 KB |
07.txt | AC | 95 ms | 8016 KB |
08.txt | AC | 100 ms | 8148 KB |
09.txt | AC | 96 ms | 8012 KB |
s1.txt | AC | 95 ms | 8012 KB |
s2.txt | AC | 94 ms | 8144 KB |