結果

問題 No.1658 Product / Sum
ユーザー nishi5451nishi5451
提出日時 2021-09-07 17:41:10
言語 Java21
(openjdk 21)
結果
AC  
実行時間 146 ms / 2,000 ms
コード長 2,638 bytes
コンパイル時間 2,127 ms
コンパイル使用メモリ 79,796 KB
実行使用メモリ 41,264 KB
最終ジャッジ日時 2024-06-06 04:06:40
合計ジャッジ時間 5,705 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 70 ms
37,980 KB
testcase_01 AC 73 ms
38,040 KB
testcase_02 AC 66 ms
37,964 KB
testcase_03 AC 71 ms
39,240 KB
testcase_04 AC 70 ms
37,828 KB
testcase_05 AC 131 ms
39,948 KB
testcase_06 AC 146 ms
41,192 KB
testcase_07 AC 116 ms
40,540 KB
testcase_08 AC 127 ms
40,612 KB
testcase_09 AC 105 ms
40,524 KB
testcase_10 AC 107 ms
38,464 KB
testcase_11 AC 107 ms
40,696 KB
testcase_12 AC 106 ms
39,696 KB
testcase_13 AC 112 ms
39,272 KB
testcase_14 AC 139 ms
41,264 KB
testcase_15 AC 119 ms
40,492 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

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

public class Main {
	static final int INF = 1<<30;
	static final long INFL = 1L<<60;
	static final int MOD = 1000000007;
	static final int MOD2 = 998244353;
	static List<List<Integer>> g;
	
	public static void main(String[] args) {
		FastScanner fs = new FastScanner();
		PrintWriter pw = new PrintWriter(System.out);
		// A = {s,t,1,1,...}
		// st = K*(s+t+N-2);
		// st-K*(s+t)+K^2 = K^2+K*(N-2)
		// (s-K)*(t-K) = K(K+N-2)
		// s = 2*K, t = 2*K+N-2
		int n = fs.nextInt();
		int k = fs.nextInt();
		pw.print(2*k + " " + (2*k+n-2));
		for(int i = 2; i < n; i++){
			pw.print(" " + 1);
		}
		pw.println();
		pw.close();
	}
}

class FastScanner {
	private InputStream in = System.in;
	private byte[] buffer = new byte[1024];
	private int length = 0, p = 0;
	private boolean hasNextByte() {
		if (p < length) return true;
		else{
			p = 0;
			try{
				length = in.read(buffer);
			}catch(Exception e){
				e.printStackTrace();
			}
			if(length == 0) return false;
		}
		return true;
	}
	private int readByte() {
		if (hasNextByte() == true) return buffer[p++];
		return -1;
	}
	private static boolean isPrintable(int n) {
		return 33 <= n && n <= 126;
	}
	private void skip() {
		while (hasNextByte() && !isPrintable(buffer[p])) p++;
	}
	public boolean hasNext() {
		skip();
		return hasNextByte();
	}
	public String next() {
		if(!hasNext()) throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int temp = readByte();
		while (isPrintable(temp)) {
			sb.appendCodePoint(temp);
			temp = readByte();
		}
		return sb.toString();
	}
	public int nextInt() {
		return Math.toIntExact(nextLong());
	}
	public int[] nextInts(int n) {
		int[] ar = new int[n];
		for (int i = 0; i < n; i++) ar[i] = nextInt();
		return ar;
	}
	public long[] nextLongs(int n) {
		long[] ar = new long[n];
		for (int i = 0; i < n; i++) ar[i] = nextLong();
		return ar;
	}
	public long nextLong() {
		if(!hasNext()) throw new NoSuchElementException();
		boolean minus = false;
		int temp = readByte();
		if (temp == '-') {
			minus = true;
			temp = readByte();
		}
		if (temp < '0' || '9' < temp) throw new NumberFormatException();
		long n = 0;
		while (isPrintable(temp)) {
			if ('0' <= temp && temp <= '9') {
				n *= 10;
				n += temp - '0';
			}
			temp = readByte();
		}
		return minus ? -n : n;
	}
	public char[] nextChars() {
		String s = next();
		return s.toCharArray();
	}
	public char[][] nextCharMat(int h, int w) {
		char[][] ar = new char[h][w];
		for(int i = 0; i < h; i++){
			String s = next();
			for(int j = 0; j < w; j++){
				ar[i][j] = s.charAt(j);
			}
		}
		return ar;
	}
}
0