Submission details
Task:Sorting books
Sender:aalto26dw_008
Submission time:2026-09-23 17:50:25 +0300
Language:C
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#110.00 sdetails
#12ACCEPTED0.00 sdetails
#130.00 sdetails
#140.00 sdetails
#15ACCEPTED0.00 sdetails
#160.00 sdetails
#17ACCEPTED0.00 sdetails
#180.00 sdetails
#190.00 sdetails
#200.00 sdetails
#21ACCEPTED0.00 sdetails
#220.00 sdetails
#230.00 sdetails
#240.00 sdetails
#250.00 sdetails
#260.00 sdetails
#270.00 sdetails
#280.00 sdetails
#290.00 sdetails
#300.00 sdetails
#310.00 sdetails
#320.00 sdetails
#330.00 sdetails
#340.00 sdetails
#350.00 sdetails
#360.00 sdetails
#370.00 sdetails
#380.00 sdetails
#390.00 sdetails
#400.00 sdetails
#410.00 sdetails
#420.00 sdetails
#430.00 sdetails
#440.00 sdetails
#450.00 sdetails
#460.00 sdetails
#470.00 sdetails
#480.00 sdetails
#490.00 sdetails
#500.00 sdetails
#510.01 sdetails
#520.00 sdetails
#530.00 sdetails
#540.01 sdetails
#550.01 sdetails
#560.01 sdetails
#570.01 sdetails
#580.01 sdetails
#590.00 sdetails
#600.01 sdetails
#61--details
#62--details
#63--details
#64--details
#65--details
#66--details
#67--details
#68--details
#69--details
#70--details
#71ACCEPTED0.02 sdetails

Code

#include <stdio.h>
#include <stdlib.h>

#define MAX(X, Y) (((X) > (Y)) ? (X) : (Y))
#define MIN(X, Y) (((X) < (Y)) ? (X) : (Y))

void readInt(int *i) {
    if (scanf("%d", i) != 1)
        printf("Trouble reading int!\n");
}

void readIntArr(int *arr, int size) {
    for (int i = 0; i < size; i++)
        if (scanf("%d", &arr[i]) != 1)
            printf("Trouble reading int array!\n");
}


int main() {
    int n;
    int *a;
    readInt(&n);

    a = calloc(n, sizeof(int));
    readIntArr(a, n);

    int inversions = 0;
    for (int i = 0; i < n; i++) {
        int before = inversions;
        for (int j = i+1; j < n; j++) {
            if (a[i] > a[j]) {
                inversions++;
            }
        }
        if(inversions == before)
            break;
    }

    printf("%d\n", inversions);
    free(a);
    return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
1
1 

correct output
0

user output
0

Test 2

Verdict: ACCEPTED

input
2
3 7 

correct output
0

user output
0

Test 3

Verdict: ACCEPTED

input
2
3 6 

correct output
0

user output
0

Test 4

Verdict: ACCEPTED

input
2
3 8 

correct output
0

user output
0

Test 5

Verdict: ACCEPTED

input
3
1 2 10 

correct output
0

user output
0

Test 6

Verdict: ACCEPTED

input
3
3 7 10 

correct output
0

user output
0

Test 7

Verdict: ACCEPTED

input
3
3 6 8 

correct output
0

user output
0

Test 8

Verdict: ACCEPTED

input
4
5 5 4 10 

correct output
2

user output
2

Test 9

Verdict: ACCEPTED

input
4
4 5 5 5 

correct output
0

user output
0

Test 10

Verdict: ACCEPTED

input
4
7 10 7 1 

correct output
4

user output
4

Test 11

Verdict:

input
5
6 6 8 9 7 

correct output
2

user output
0

Test 12

Verdict: ACCEPTED

input
5
5 10 8 10 1 

correct output
5

user output
5

Test 13

Verdict:

input
5
5 2 1 10 6 

correct output
4

user output
3

Test 14

Verdict:

input
5
6 1 8 9 3 

correct output
4

user output
2

Test 15

Verdict: ACCEPTED

input
5
10 10 6 2 10 

correct output
5

user output
5

Test 16

Verdict:

input
5
3 1 9 9 3 

correct output
3

user output
1

Test 17

Verdict: ACCEPTED

input
5
9 10 4 3 9 

correct output
6

user output
6

Test 18

Verdict:

input
5
1 3 8 4 5 

correct output
2

user output
0

Test 19

Verdict:

input
5
9 1 10 3 9 

correct output
4

user output
2

Test 20

Verdict:

input
5
1 4 6 5 5 

correct output
2

user output
0

Test 21

Verdict: ACCEPTED

input
10
6 6 8 9 7 9 6 9 5 7 

correct output
18

user output
18

Test 22

Verdict:

input
10
5 10 8 10 1 2 4 10 2 3 

correct output
25

user output
21

Test 23

Verdict:

input
10
5 2 1 10 6 10 5 5 5 4 

correct output
20

user output
4

Test 24

Verdict:

input
10
6 1 8 9 3 2 6 6 9 5 

correct output
18

user output
4

Test 25

Verdict:

input
10
10 10 6 2 10 9 8 7 7 6 

correct output
29

user output
15

Test 26

Verdict:

input
10
3 1 9 9 3 4 10 10 5 1 

correct output
17

user output
2

Test 27

Verdict:

input
10
9 10 4 3 9 1 1 4 2 10 

correct output
25

user output
24

Test 28

Verdict:

input
10
1 3 8 4 5 10 8 5 10 4 

correct output
12

user output
0

Test 29

Verdict:

input
10
9 1 10 3 9 4 6 9 3 5 

correct output
22

user output
6

Test 30

Verdict:

input
10
1 4 6 5 5 1 2 4 2 1 

correct output
25

user output
0

Test 31

Verdict:

input
100
589284012 636562060 767928734 ...

correct output
2843

user output
2521

Test 32

Verdict:

input
100
447773962 773442532 122816 137...

correct output
2446

user output
125

Test 33

Verdict:

input
100
468145963 198730372 27838076 5...

correct output
2158

user output
64

Test 34

Verdict:

input
100
591414747 75940263 760367935 9...

correct output
2298

user output
611

Test 35

Verdict:

input
100
967034924 587586158 185430194 ...

correct output
2580

user output
961

Test 36

Verdict:

input
100
238363353 59249204 934941692 8...

correct output
2578

user output
2230

Test 37

Verdict:

input
100
958701283 356460601 224848374 ...

correct output
2417

user output
223

Test 38

Verdict:

input
100
81935404 244103474 837431431 3...

correct output
2315

user output
525

Test 39

Verdict:

input
100
937837681 11934038 257096283 9...

correct output
2692

user output
95

Test 40

Verdict:

input
100
11139168 391337048 538883744 5...

correct output
2302

user output
203

Test 41

Verdict:

input
200
589284012 636562060 767928734 ...

correct output
10624

user output
10584

Test 42

Verdict:

input
200
447773962 773442532 122816 137...

correct output
9384

user output
241

Test 43

Verdict:

input
200
468145963 198730372 27838076 5...

correct output
8760

user output
7937

Test 44

Verdict:

input
200
591414747 75940263 760367935 9...

correct output
8939

user output
1204

Test 45

Verdict:

input
200
967034924 587586158 185430194 ...

correct output
9905

user output
9902

Test 46

Verdict:

input
200
238363353 59249204 934941692 8...

correct output
9851

user output
5432

Test 47

Verdict:

input
200
958701283 356460601 224848374 ...

correct output
10551

user output
9734

Test 48

Verdict:

input
200
81935404 244103474 837431431 3...

correct output
9163

user output
6927

Test 49

Verdict:

input
200
937837681 11934038 257096283 9...

correct output
9346

user output
9305

Test 50

Verdict:

input
200
11139168 391337048 538883744 5...

correct output
9982

user output
8695

Test 51

Verdict:

input
1000
589284012 636562060 767928734 ...

correct output
256701

user output
168326

Test 52

Verdict:

input
1000
447773962 773442532 122816 137...

correct output
243505

user output
1214

Test 53

Verdict:

input
1000
468145963 198730372 27838076 5...

correct output
252964

user output
108135

Test 54

Verdict:

input
1000
591414747 75940263 760367935 9...

correct output
246581

user output
170418

Test 55

Verdict:

input
1000
967034924 587586158 185430194 ...

correct output
241203

user output
208529

Test 56

Verdict:

input
1000
238363353 59249204 934941692 8...

correct output
251093

user output
169270

Test 57

Verdict:

input
1000
958701283 356460601 224848374 ...

correct output
256962

user output
218574

Test 58

Verdict:

input
1000
81935404 244103474 837431431 3...

correct output
250165

user output
249752

Test 59

Verdict:

input
1000
937837681 11934038 257096283 9...

correct output
246466

user output
91388

Test 60

Verdict:

input
1000
11139168 391337048 538883744 5...

correct output
249076

user output
155538

Test 61

Verdict:

input
200000
589284012 636562060 767928734 ...

correct output
9983154934

user output
(empty)

Test 62

Verdict:

input
200000
447773962 773442532 122816 137...

correct output
9998885834

user output
(empty)

Test 63

Verdict:

input
200000
468145963 198730372 27838076 5...

correct output
9995310844

user output
(empty)

Test 64

Verdict:

input
200000
591414747 75940263 760367935 9...

correct output
10000936270

user output
(empty)

Test 65

Verdict:

input
200000
967034924 587586158 185430194 ...

correct output
10002145347

user output
(empty)

Test 66

Verdict:

input
200000
238363353 59249204 934941692 8...

correct output
9989708150

user output
(empty)

Test 67

Verdict:

input
200000
958701283 356460601 224848374 ...

correct output
9997845631

user output
(empty)

Test 68

Verdict:

input
200000
81935404 244103474 837431431 3...

correct output
10016175198

user output
(empty)

Test 69

Verdict:

input
200000
937837681 11934038 257096283 9...

correct output
9983428867

user output
(empty)

Test 70

Verdict:

input
200000
11139168 391337048 538883744 5...

correct output
9971613818

user output
(empty)

Test 71

Verdict: ACCEPTED

input
200000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
0

user output
0