Submission #1831979


Source Code Expand

#include <cstdio>

#define fr first
#define sc second
#define mk make_pair
#define pb push_back
#define OK puts("OK");
#define sz(s) (int)s.size()
#define all(s) s.begin(), s.end()

using namespace std;

const int N = 2e5 + 10;
const int inf = 1e9 + 7;
int n, u[N];

void find2( int sum )
{
    if( sum == 0 )
        return;
    for( int i = 1; i <= sum; i++ )
    {
        if( (i * (i + 1) ) >> 1 >= sum && sum - i >= 0 && !u[i] )
        {
            printf("%d\n", i);
            sum -= i;
            u[i] = 1;
            find2(sum);
            return ;
        }
    }
    if( sum > 0 )
        printf("%d", sum);
}

main()
{
    scanf("%d", &n);
    int sum = n;
    find2(sum);
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:38:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^

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 128 KB
01-02.txt AC 1 ms 128 KB
01-03.txt AC 1 ms 128 KB
01-04.txt AC 1 ms 128 KB
01-05.txt AC 1 ms 128 KB
01-06.txt AC 1 ms 128 KB
01-07.txt AC 1 ms 128 KB
01-08.txt AC 1 ms 128 KB
01-09.txt AC 1 ms 128 KB
01-10.txt AC 1 ms 128 KB
02-01.txt AC 11 ms 256 KB
02-02.txt AC 11 ms 256 KB
02-03.txt AC 11 ms 256 KB
02-04.txt AC 11 ms 256 KB
02-05.txt AC 11 ms 256 KB
02-06.txt AC 4 ms 128 KB
02-07.txt AC 2 ms 128 KB
02-08.txt AC 10 ms 256 KB
sample-01.txt AC 1 ms 128 KB
sample-02.txt AC 1 ms 128 KB
sample-03.txt AC 1 ms 128 KB