Submission #11688646


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
#define all(x) (x).begin(), (x).end()
#define fsp(x) cout << fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = acos(-1);
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout << "YES" << endl;}
void NO() {cout << "NO" << endl;}

int main() {
  ll n;
  cin >> n;
  for (ll i = 1; i <= n; i++) {
    if (n - i >= i + 1) {
      cout << i << endl;
      n -= i;
    }
    else {
      cout << n << endl;
      break;
    }
  }
}

Submission Info

Submission Time
Task B - Exactly N points
User piddy
Language C++14 (GCC 5.4.1)
Score 0
Code Size 600 Byte
Status WA
Exec Time 8 ms
Memory 256 KB

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 0 / 200 0 / 100
Status
AC × 3
AC × 7
WA × 6
AC × 12
WA × 12
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, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
01-01.txt AC 1 ms 256 KB
01-02.txt AC 1 ms 256 KB
01-03.txt WA 1 ms 256 KB
01-04.txt WA 1 ms 256 KB
01-05.txt WA 1 ms 256 KB
01-06.txt WA 1 ms 256 KB
01-07.txt AC 1 ms 256 KB
01-08.txt WA 1 ms 256 KB
01-09.txt AC 1 ms 256 KB
01-10.txt WA 1 ms 256 KB
02-01.txt WA 8 ms 256 KB
02-02.txt AC 8 ms 256 KB
02-03.txt AC 8 ms 256 KB
02-04.txt WA 8 ms 256 KB
02-05.txt WA 8 ms 256 KB
02-06.txt WA 5 ms 256 KB
02-07.txt WA 4 ms 256 KB
02-08.txt WA 8 ms 256 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB
sample-03.txt AC 1 ms 256 KB