CSES - Datatähti Open 2019 - Results
Submission details
Task:Sum
Sender:muradeyn
Submission time:2019-01-20 10:20:43
Language:C++
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED100
Test results
testverdicttime
#1ACCEPTED0.03 sdetails
#2ACCEPTED0.01 sdetails
#3ACCEPTED0.02 sdetails
#4ACCEPTED0.02 sdetails
#5ACCEPTED0.02 sdetails
#6ACCEPTED0.01 sdetails
#7ACCEPTED0.01 sdetails
#8ACCEPTED0.01 sdetails
#9ACCEPTED0.02 sdetails
#10ACCEPTED0.01 sdetails
#11ACCEPTED0.02 sdetails
#12ACCEPTED0.02 sdetails
#13ACCEPTED0.01 sdetails
#14ACCEPTED0.02 sdetails
#15ACCEPTED0.01 sdetails
#16ACCEPTED0.02 sdetails
#17ACCEPTED0.02 sdetails
#18ACCEPTED0.03 sdetails
#19ACCEPTED0.02 sdetails
#20ACCEPTED0.03 sdetails
#21ACCEPTED0.03 sdetails
#22ACCEPTED0.05 sdetails
#23ACCEPTED0.04 sdetails
#24ACCEPTED0.05 sdetails
#25ACCEPTED0.07 sdetails
#26ACCEPTED0.07 sdetails
#27ACCEPTED0.09 sdetails
#28ACCEPTED0.12 sdetails

Code

/* Murad Eynizade */

#include <bits/stdc++.h>
#define intt long long
#define FAST_READ ios_base::sync_with_stdio(0);cin.tie(0);
#define SIZE 1000001
#define INF INT_MAX
#define F first
#define S second
#define in(a) scanf("%d",&a);
#define outn(a) printf("%d\n",&a);
#define outs(a) printf("%d ",&a);


using namespace std;

intt ans = 0;

set< pair<int , pair<int,int> > >st;

int main()
{
    FAST_READ;
    int n;
    cin>>n;
    for (int i = 1;i <= n - 2;i++) {
        for (int j = i;j <= n - 1;j++) {
           vector<int>v(3);
           v[0] = i;
           v[1] = j;
           v[2] = n - (i + j);
           if (v[2] <= 0)continue;
           if (v[0] == v[1] || v[1] == v[2] || v[0] == v[2])continue;
           sort(v.begin(),v.end());
           st.insert({v[0] , {v[1] , v[2]}});
        }
    }
    cout<<st.size()<<endl;
    return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
1

correct output
0

user output
0

Test 2

Verdict: ACCEPTED

input
2

correct output
0

user output
0

Test 3

Verdict: ACCEPTED

input
3

correct output
0

user output
0

Test 4

Verdict: ACCEPTED

input
4

correct output
0

user output
0

Test 5

Verdict: ACCEPTED

input
5

correct output
0

user output
0

Test 6

Verdict: ACCEPTED

input
6

correct output
1

user output
1

Test 7

Verdict: ACCEPTED

input
7

correct output
1

user output
1

Test 8

Verdict: ACCEPTED

input
8

correct output
2

user output
2

Test 9

Verdict: ACCEPTED

input
9

correct output
3

user output
3

Test 10

Verdict: ACCEPTED

input
10

correct output
4

user output
4

Test 11

Verdict: ACCEPTED

input
20

correct output
24

user output
24

Test 12

Verdict: ACCEPTED

input
30

correct output
61

user output
61

Test 13

Verdict: ACCEPTED

input
40

correct output
114

user output
114

Test 14

Verdict: ACCEPTED

input
50

correct output
184

user output
184

Test 15

Verdict: ACCEPTED

input
60

correct output
271

user output
271

Test 16

Verdict: ACCEPTED

input
70

correct output
374

user output
374

Test 17

Verdict: ACCEPTED

input
80

correct output
494

user output
494

Test 18

Verdict: ACCEPTED

input
90

correct output
631

user output
631

Test 19

Verdict: ACCEPTED

input
100

correct output
784

user output
784

Test 20

Verdict: ACCEPTED

input
200

correct output
3234

user output
3234

Test 21

Verdict: ACCEPTED

input
300

correct output
7351

user output
7351

Test 22

Verdict: ACCEPTED

input
400

correct output
13134

user output
13134

Test 23

Verdict: ACCEPTED

input
500

correct output
20584

user output
20584

Test 24

Verdict: ACCEPTED

input
600

correct output
29701

user output
29701

Test 25

Verdict: ACCEPTED

input
700

correct output
40484

user output
40484

Test 26

Verdict: ACCEPTED

input
800

correct output
52934

user output
52934

Test 27

Verdict: ACCEPTED

input
900

correct output
67051

user output
67051

Test 28

Verdict: ACCEPTED

input
1000

correct output
82834

user output
82834