#360262 (Java21) No.648 　お　や　す　み

提出ソース

結果

問題	No.648 　お　や　す　み
ユーザー	holeguma
提出日時	2019-07-17 19:55:56
言語	Java21 (openjdk 21)
結果	AC
実行時間	58 ms / 2,000 ms
コード長	3,364 bytes
コンパイル時間	2,360 ms
コンパイル使用メモリ	79,116 KB
実行使用メモリ	37,240 KB
最終ジャッジ日時	2024-12-23 05:57:14
合計ジャッジ時間	8,158 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	48 ms 36,664 KB
testcase_01	AC	48 ms 36,820 KB
testcase_02	AC	49 ms 37,068 KB
testcase_03	AC	50 ms 36,992 KB
testcase_04	AC	51 ms 36,800 KB
testcase_05	AC	49 ms 36,664 KB
testcase_06	AC	52 ms 37,008 KB
testcase_07	AC	50 ms 36,864 KB
testcase_08	AC	58 ms 36,800 KB
testcase_09	AC	49 ms 36,916 KB
testcase_10	AC	49 ms 36,664 KB
testcase_11	AC	48 ms 37,004 KB
testcase_12	AC	51 ms 36,800 KB
testcase_13	AC	48 ms 37,056 KB
testcase_14	AC	47 ms 36,664 KB
testcase_15	AC	47 ms 37,112 KB
testcase_16	AC	47 ms 36,940 KB
testcase_17	AC	49 ms 36,768 KB
testcase_18	AC	49 ms 36,956 KB
testcase_19	AC	49 ms 37,072 KB
testcase_20	AC	49 ms 36,552 KB
testcase_21	AC	50 ms 36,664 KB
testcase_22	AC	51 ms 36,864 KB
testcase_23	AC	48 ms 36,860 KB
testcase_24	AC	49 ms 36,956 KB
testcase_25	AC	49 ms 37,068 KB
testcase_26	AC	50 ms 37,132 KB
testcase_27	AC	50 ms 36,904 KB
testcase_28	AC	50 ms 37,068 KB
testcase_29	AC	48 ms 36,992 KB
testcase_30	AC	50 ms 37,068 KB
testcase_31	AC	47 ms 37,132 KB
testcase_32	AC	49 ms 36,800 KB
testcase_33	AC	48 ms 37,084 KB
testcase_34	AC	50 ms 36,640 KB
testcase_35	AC	50 ms 37,112 KB
testcase_36	AC	48 ms 36,552 KB
testcase_37	AC	49 ms 36,600 KB
testcase_38	AC	48 ms 36,956 KB
testcase_39	AC	47 ms 36,988 KB
testcase_40	AC	50 ms 36,940 KB
testcase_41	AC	48 ms 36,552 KB
testcase_42	AC	48 ms 37,132 KB
testcase_43	AC	54 ms 37,084 KB
testcase_44	AC	48 ms 36,904 KB
testcase_45	AC	49 ms 36,552 KB
testcase_46	AC	49 ms 36,956 KB
testcase_47	AC	49 ms 37,088 KB
testcase_48	AC	48 ms 36,956 KB
testcase_49	AC	50 ms 36,916 KB
testcase_50	AC	48 ms 36,956 KB
testcase_51	AC	49 ms 36,900 KB
testcase_52	AC	49 ms 37,016 KB
testcase_53	AC	47 ms 37,004 KB
testcase_54	AC	48 ms 36,864 KB
testcase_55	AC	55 ms 37,012 KB
testcase_56	AC	52 ms 36,848 KB
testcase_57	AC	49 ms 36,960 KB
testcase_58	AC	50 ms 36,552 KB
testcase_59	AC	51 ms 37,056 KB
testcase_60	AC	49 ms 36,664 KB
testcase_61	AC	50 ms 37,068 KB
testcase_62	AC	51 ms 36,768 KB
testcase_63	AC	50 ms 36,800 KB
testcase_64	AC	52 ms 37,112 KB
testcase_65	AC	49 ms 36,800 KB
testcase_66	AC	51 ms 36,800 KB
testcase_67	AC	52 ms 36,528 KB
testcase_68	AC	50 ms 37,056 KB
testcase_69	AC	50 ms 36,848 KB
testcase_70	AC	50 ms 36,664 KB
testcase_71	AC	51 ms 36,800 KB
testcase_72	AC	52 ms 37,116 KB
testcase_73	AC	49 ms 37,240 KB
testcase_74	AC	49 ms 36,928 KB
testcase_75	AC	48 ms 36,580 KB
testcase_76	AC	49 ms 36,916 KB
testcase_77	AC	49 ms 37,152 KB
testcase_78	AC	48 ms 36,932 KB
testcase_79	AC	49 ms 36,664 KB
testcase_80	AC	50 ms 36,552 KB
testcase_81	AC	51 ms 36,800 KB
testcase_82	AC	50 ms 37,040 KB
testcase_83	AC	50 ms 36,952 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {

	static PrintWriter out;
	static InputReader ir;

	static void solve() {
		long n = 2L * ir.nextLong();
		long ub = (long) Math.sqrt(Long.MAX_VALUE), lb = 0;
		while (ub - lb > 1) {
			long mid = (ub + lb) / 2;
			if (mid * (mid + 1) >= n) {
				ub = mid;
			} else {
				lb = mid;
			}
		}
		if (ub * (ub + 1) == n) {
			out.println("YES");
			out.println(ub);
		} else {
			out.println("NO");
		}
	}

	public static void main(String[] args) {
		ir = new InputReader(System.in);
		out = new PrintWriter(System.out);
		solve();
		out.flush();
	}

	static class InputReader {

		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;

		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}

		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}

		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}

		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}

		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}

		public boolean hasNext() {
			skip();
			return hasNextByte();
		}

		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public double nextDouble() {
			return Double.parseDouble(next());
		}

		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}

		public long[] nextLongArray(int n) {
			long[] a = new long[n];
			for (int i = 0; i < n; i++)
				a[i] = nextLong();
			return a;
		}

		public char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}

	static void tr(Object... o) {
		out.println(Arrays.deepToString(o));
	}
}

yukicoder

結果

テストケース

ソースコード