제출 #114323

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
114323		caoash	Nadan (COCI18_nadan)	Java	0 / 50	86 ms	9980 KiB

nadan

package problems;

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

/*
Solution Sketch:
*/

public class nadan {

    static final boolean stdin = true;
    static final String filename = "";
    static FastScanner br;
    static PrintWriter pw;

    public static void main(String[] args) throws IOException {

        if (stdin) {
            br = new FastScanner();
            pw = new PrintWriter(new OutputStreamWriter(System.out));
        } else {
            br = new FastScanner(filename + ".in");
            pw = new PrintWriter(new FileWriter(filename + ".out"));
        }

        X solver = new X();
        solver.solve(br, pw);
    }

    static class X {
        public void solve(FastScanner br, PrintWriter pw) throws IOException {
            int N = br.nextInt(); int K = br.nextInt();
            for(int i = 1; i < N; i++){
                pw.println(i);
                K -= i;
            }
            pw.println(K);
            pw.close();
        }

    }

    //fastscanner class
    public static class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner(String s) {
            try {
                br = new BufferedReader(new FileReader(s));
            } catch (FileNotFoundException e) {
                // TODO Auto-generated catch block
                e.printStackTrace();
            }
        }

        public FastScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String nextToken() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    // TODO Auto-generated catch block
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(nextToken());
        }

        long nextLong() {
            return Long.parseLong(nextToken());
        }

        double nextDouble() {
            return Double.parseDouble(nextToken());
        }
    }

}
 

• Subtask 1: 0 / 50