Submission #1678102


Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main(){
  int n;
  cin >> n;

  int count = 0;
  int i;
  vector<bool> list(1e6, false);
  for(i=1; count<n; i++){
    count+=i;
    list[i]=true;
  }

  int diff = count-n;
  for(int j=i; j>0; j--){
    if(j<=diff){
      diff -= j;
      list[j] = false;
    }
    if(diff==0) break;
  }

  for(int j=1; j<i; j++){
    if(list[j]){
      cout << j << endl;
    }
  }
  
  return 0;
}

Submission Info

Submission Time
Task B - Exactly N points
User syl659
Language C++14 (GCC 5.4.1)
Score 300
Code Size 505 Byte
Status AC
Exec Time 8 ms
Memory 384 KB

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 200 / 200 100 / 100
Status
AC × 3
AC × 13
AC × 24
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 384 KB
01-02.txt AC 1 ms 384 KB
01-03.txt AC 1 ms 384 KB
01-04.txt AC 1 ms 384 KB
01-05.txt AC 1 ms 384 KB
01-06.txt AC 1 ms 384 KB
01-07.txt AC 1 ms 384 KB
01-08.txt AC 2 ms 384 KB
01-09.txt AC 2 ms 384 KB
01-10.txt AC 2 ms 384 KB
02-01.txt AC 8 ms 384 KB
02-02.txt AC 8 ms 384 KB
02-03.txt AC 8 ms 384 KB
02-04.txt AC 8 ms 384 KB
02-05.txt AC 8 ms 384 KB
02-06.txt AC 5 ms 384 KB
02-07.txt AC 4 ms 384 KB
02-08.txt AC 8 ms 384 KB
sample-01.txt AC 1 ms 384 KB
sample-02.txt AC 1 ms 384 KB
sample-03.txt AC 1 ms 384 KB