結果

問題 No.653 E869120 and Lucky Numbers
ユーザー uwiuwi
提出日時 2018-02-23 22:29:49
言語 Java21
(openjdk 21)
結果
AC  
実行時間 223 ms / 2,000 ms
コード長 3,747 bytes
コンパイル時間 6,290 ms
コンパイル使用メモリ 82,280 KB
実行使用メモリ 55,344 KB
最終ジャッジ日時 2024-09-13 18:15:01
合計ジャッジ時間 7,841 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
50,200 KB
testcase_01 AC 107 ms
52,428 KB
testcase_02 AC 97 ms
52,180 KB
testcase_03 AC 120 ms
52,476 KB
testcase_04 AC 81 ms
51,788 KB
testcase_05 AC 84 ms
51,924 KB
testcase_06 AC 91 ms
52,160 KB
testcase_07 AC 58 ms
50,444 KB
testcase_08 AC 135 ms
52,524 KB
testcase_09 AC 54 ms
50,056 KB
testcase_10 AC 54 ms
50,368 KB
testcase_11 AC 55 ms
50,508 KB
testcase_12 AC 54 ms
50,396 KB
testcase_13 AC 54 ms
50,472 KB
testcase_14 AC 54 ms
50,420 KB
testcase_15 AC 54 ms
50,288 KB
testcase_16 AC 53 ms
50,192 KB
testcase_17 AC 54 ms
50,408 KB
testcase_18 AC 54 ms
50,188 KB
testcase_19 AC 54 ms
50,576 KB
testcase_20 AC 54 ms
50,444 KB
testcase_21 AC 55 ms
50,292 KB
testcase_22 AC 54 ms
50,512 KB
testcase_23 AC 54 ms
50,136 KB
testcase_24 AC 55 ms
50,440 KB
testcase_25 AC 53 ms
50,360 KB
testcase_26 AC 54 ms
50,408 KB
testcase_27 AC 54 ms
50,424 KB
testcase_28 AC 222 ms
55,208 KB
testcase_29 AC 223 ms
55,076 KB
testcase_30 AC 222 ms
55,344 KB
testcase_31 AC 54 ms
50,280 KB
testcase_32 AC 54 ms
50,416 KB
testcase_33 AC 55 ms
50,460 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest180223;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.InputMismatchException;

public class C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		String s = ns();
		if(s.length() == 1){
			out.println("No");
			return;
		}
		BigInteger x = new BigInteger(s);
		char[] six;
		if(s.charAt(0) >= '6'){
			six = new char[s.length()];
			Arrays.fill(six, '6');
		}else{
			six = new char[s.length()-1];
			Arrays.fill(six, '6');
		}
		BigInteger y = x.subtract(new BigInteger(new String(six)));
		String ys = y.toString();
		int state = 0;
		for(int i = 0;i < ys.length();i++){
			int c = ys.charAt(i)-'0';
			if(state == 0 && (c == 0 || c == 1)){
				continue;
			}else if((c == 6 || c == 7 || c == 8)){
				state = 1;
				continue;
			}
			out.println("No");
			return;
		}
		if(state == 1){
			out.println("Yes");
		}else{
			out.println("No");
		}
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new C().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0