Submission #991826


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long LL;
#define MAX_N 10000009
LL N;

void input()
{
  cin >> N;
}

int main()
{
  input();

  LL l = 0, r = MAX_N;
  while(r-l > 1){
    LL mid = (l+r)/2;
    if(mid*(mid+1)/2 >= N){
      r = mid;
    }
    else{
      l = mid;
    }
  }

  LL sum = 0;

  for (int i = r; 0 < i; i--) {
    if(sum + i <= N){
      cout << i << endl;
      sum += i;
    }
  }

  return 0;
}

Submission Info

Submission Time
Task B - Exactly N points
User takoshi
Language C++14 (GCC 5.4.1)
Score 300
Code Size 477 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 2 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 2 ms 256 KB