#933952 (C++14) No.2560 A_1 < A_2 < ... < A_N

• 問題: No.2560 A_1 < A_2 < ... < A_N
• ユーザー: tenba
• 提出日時: 2023-12-02 14:46:06
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 138 ms / 2,000 ms
• コード長: 2,233 bytes
• コンパイル時間: 805 ms
• コンパイル使用メモリ: 99,900 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-26 17:19:40
• 合計ジャッジ時間: 2,747 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

ファイルパターン	結果
sample	AC * 1
other	AC * 15

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
//(・ω・)
#include <stdio.h>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, atoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <iomanip> //setprecision
#include <limits>
#include <sstream> //istringstream
#include <stdlib.h>
#include <list>
#include <iterator>//std::advance()
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define SZ(x) ((int)(x).size());
#define vec vector
template <class T>
using v = vector<T>;
template <class T>
using vv = v< v<T> >;
template <class T>
using vvv = v< vv<T> >;
#define el '\n'
#define vl v<ll>
#define vvl vv<ll>
#define pl pair<ll, ll>
#define repab(i, a, b) for(ll i = a; a < (ll)(b); ++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); ++i)
#define rep1(i, n) for(ll i = 1; i <= (ll)(n); ++i)
#define rrep(i, n) for(ll i = ((ll)(n) - 1); i >= 0; --i)
#define rrep1(i, n) for(ll i = ((ll)(n)); i > 0; --i)
#define YN(x) cout << ((x) ? "YES\n" : "NO\n");
#define Yn(x) cout << ((x) ? "Yes\n" : "No\n");
#define yn(x) cout << ((x) ? "yes\n" : "no\n");
#define COUT(x) cout << (x) << el;
const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
ll gcd(ll a, ll b){return b ? gcd(b, a % b) : a;}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main(){
    int t;
    cin >> t;
    rep(i, t){
        long long n,x;
        cin >> n >> x;
        if(x < (n + 1) * n / 2){
            cout << -1 << endl;
            continue;
        }else{
            rep(j, n - 1){
                cout << j + 1 << " ";
                x -= (j + 1);
            }
            cout << x << endl;
        }
    }
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX