Submission #991817


Source Code Expand

#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <functional>
#include <utility>
#include <queue>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef long long int ll;
const ll  MOD = 1000000007;
typedef pair<int,int> P;

int N;
int sum=0;
int main(){
  cin >> N;
  int m;
  for(int i=1;i<=N;i++){
    sum += i;
    if(sum >= N){
      m=i;
      break;
    }
  }
  int t=sum-N;
  for(int i=1;i<=m;i++){
    if(i!=t) cout << i << endl;
  }
}

Submission Info

Submission Time
Task B - Exactly N points
User gamelove765
Language C++14 (GCC 5.4.1)
Score 300
Code Size 542 Byte
Status AC
Exec Time 17 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 2 ms 256 KB
01-03.txt AC 2 ms 256 KB
01-04.txt AC 2 ms 256 KB
01-05.txt AC 2 ms 256 KB
01-06.txt AC 2 ms 256 KB
01-07.txt AC 2 ms 256 KB
01-08.txt AC 2 ms 256 KB
01-09.txt AC 2 ms 256 KB
01-10.txt AC 2 ms 256 KB
02-01.txt AC 17 ms 256 KB
02-02.txt AC 17 ms 256 KB
02-03.txt AC 17 ms 256 KB
02-04.txt AC 17 ms 256 KB
02-05.txt AC 17 ms 256 KB
02-06.txt AC 10 ms 256 KB
02-07.txt AC 8 ms 256 KB
02-08.txt AC 17 ms 256 KB
sample-01.txt AC 2 ms 256 KB
sample-02.txt AC 2 ms 256 KB
sample-03.txt AC 2 ms 256 KB