結果

問題 No.434 占い
ユーザー tanzakutanzaku
提出日時 2016-10-14 23:33:46
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 6,848 bytes
コンパイル時間 3,297 ms
コンパイル使用メモリ 85,272 KB
実行使用メモリ 62,104 KB
最終ジャッジ日時 2024-11-22 06:28:34
合計ジャッジ時間 9,404 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 131 ms
52,200 KB
testcase_01 AC 131 ms
52,368 KB
testcase_02 AC 130 ms
52,024 KB
testcase_03 AC 133 ms
52,192 KB
testcase_04 WA -
testcase_05 AC 132 ms
52,260 KB
testcase_06 AC 141 ms
52,720 KB
testcase_07 AC 134 ms
52,144 KB
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 143 ms
52,824 KB
testcase_12 AC 159 ms
52,816 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 AC 298 ms
62,104 KB
testcase_21 WA -
testcase_22 WA -
testcase_23 AC 129 ms
52,048 KB
testcase_24 WA -
testcase_25 AC 151 ms
52,820 KB
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.math.*;
import java.util.*;

import static java.util.Arrays.*;

public class Main {
	private static final int mod = (int)1e9+7;

	final Random random = new Random(0);
	final IOFast io = new IOFast();

	/// MAIN CODE
	public void run() throws IOException {
		List<Integer>[] comb = new List[100000];
		for(int i = 0; i < comb.length; i++) {
			comb[i] = new ArrayList<>();
			comb[i].add(0*9+1);
			if(i != 0) {
				int p = -1;
				for(int c : comb[i-1]) {
					if(p != -1) {
						int idx = c / 9;
						if(p / 9 + 1 == idx) {
							int v = (p + c) % 9;
							if(v != 0) comb[i].add(idx*9+v);
						}
					}
					p = c;
				}
				comb[i].add(i*9+1);
			}
//			if(i < 10) dump(comb[i]);
//			comb[i][0] = comb[i][i] = 1;
//			for(int j = 1; j < i; j++) {
//				comb[i][j] = comb[i-1][j-1] + comb[i-1][j];
//				if(comb[i][j] >= 9) comb[i][j] -= 9;
//			}
//			dump(i, comb[i]);
		}
//		if(true) return;
//		int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
		int TEST_CASE = 1;
		while(TEST_CASE-- != 0) {
			int n = io.nextInt();
			for(int t = 0; t < n; t++) {
				char[] cs = io.next();
				long sum = 0;
				for(int i = 0; i < cs.length; i++) cs[i] -= '0';
				for(int c : comb[cs.length - 1]) {
					int idx = c / 9;
					int v = c % 9;
					sum += cs[idx] * v;
//					dump(idx, v);
					cs[idx] = 10;
				}
				int big = sum >= 9 ? 1 : 0;
				for(char c : cs) if(c != 10) big = 1;
//				dump(t, big, sum);
				io.out.println((sum - big) % 9 + big);
			}
		}
	}
	
	// 3+15+24+2=44=8
	
	// 1,1,1,1,1,1,1,1,1,1
	// 1,2,2,2,2,2,2,2,2,1
	// 1,
	
	// a,b,c,d,e,f
	// a+b,b+c,c+d,d+e,e+f
	// a+2b+c,b+2c+d,c+2d+e,d+2e+f
	// a+3b+3c+d,b+3c+3d+e,c+3d+3e+f
	// C(i,j), 1, 3+1, 3+3+1, 1+3+3+1, 1+3+3+1, ..., 1+3+3, 1+3, 1
	// 1,3,4,3,1
	// 1,3,4,4,3,1
	// 
	
	
	/// TEMPLATE
	static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
	static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
	
	static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
	static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }

	void printArrayLn(int[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
	void printArrayLn(long[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
	
	static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); } 
	
	void main() throws IOException {
		//		IOFast.setFileIO("rle-size.in", "rle-size.out");
		try { run(); }
		catch (EndOfFileRuntimeException e) { }
		io.out.flush();
	}
	public static void main(String[] args) throws IOException { new Main().main(); }
	
	static class EndOfFileRuntimeException extends RuntimeException {
		private static final long serialVersionUID = -8565341110209207657L; }

	static
	public class IOFast {
		private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		private PrintWriter out = new PrintWriter(System.out);

		void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }
		void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }
		void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }

		private static int pos, readLen;
		private static final char[] buffer = new char[1024 * 8];
		private static char[] str = new char[500*8*2];
		private static boolean[] isDigit = new boolean[256];
		private static boolean[] isSpace = new boolean[256];
		private static boolean[] isLineSep = new boolean[256];

		static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
		public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }
		public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
		int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
		public String nextString() throws IOException { return new String(next()); }
		public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
//		public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
		public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
		public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
		public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
		public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
		public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
		public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
	}
}
0