Submission #992148


Source Code Expand

#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <string>
#include <array>
#include <deque>
#include <iomanip>
#include <bitset>
#include <complex>
#include <sstream>
#include <algorithm>
#include <limits>
#include <cmath>
#include <utility>
#include <tuple>
#include <numeric>
#include <cassert>
using namespace std;

using ll = long long;
using ld = long double;
using P = pair<int, int>;

template <typename T>
constexpr T INF = "Undefined";
template <>
constexpr int INF<int> = 1e9;
template <>
constexpr ll INF<ll> = 1e18;
template <>
constexpr ld INF<ld> = 1e30;

constexpr int mod = 1e9+7;
constexpr ld eps = 1e-10;
constexpr ld pi = acos(-1.0);

#define DUMP(a) cout << #a << ": " << (a) << endl


int main() {
    int N;
    cin >> N;
    vector<int> res;
    for(int i=1; i<=N; ++i) {
        int n = i*(i+1)/2;
        if(n >= N) {
            int a = n - N;
            for(int j=1; j<=i; ++j) {
                if(j == a) {
                    continue;
                }
                res.push_back(j);
            }
            break;
        }
    }
    for(auto x : res) {
        cout << x << endl;
    }
}

Submission Info

Submission Time
Task B - Exactly N points
User Suibaka
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1273 Byte
Status AC
Exec Time 21 ms
Memory 256 KB

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 200 / 200 100 / 100
Status
AC × 3
AC × 13
AC × 21
Set Name Test Cases
sample sample-01.txt, sample-02.txt, sample-03.txt
dataset1 sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt
dataset2 sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt
Case Name Status Exec Time Memory
01-01.txt AC 2 ms 256 KB
01-02.txt AC 3 ms 256 KB
01-03.txt AC 3 ms 256 KB
01-04.txt AC 3 ms 256 KB
01-05.txt AC 3 ms 256 KB
01-06.txt AC 3 ms 256 KB
01-07.txt AC 3 ms 256 KB
01-08.txt AC 3 ms 256 KB
01-09.txt AC 3 ms 256 KB
01-10.txt AC 3 ms 256 KB
02-01.txt AC 21 ms 256 KB
02-02.txt AC 21 ms 256 KB
02-03.txt AC 21 ms 256 KB
02-04.txt AC 21 ms 256 KB
02-05.txt AC 21 ms 256 KB
02-06.txt AC 12 ms 256 KB
02-07.txt AC 9 ms 256 KB
02-08.txt AC 20 ms 256 KB
sample-01.txt AC 3 ms 256 KB
sample-02.txt AC 3 ms 256 KB
sample-03.txt AC 3 ms 256 KB