[해커랭크] Compare the Triplets
https://www.hackerrank.com/challenges/compare-the-triplets/problem?isFullScreen=true
Compare the Triplets | HackerRank
Compare the elements in two triplets.
www.hackerrank.com
문제
Alice and Bob each created one problem for HackerRank. A reviewer rates the two challenges, awarding points on a scale from 1 to 100 for three categories: problem clarity, originality, and difficulty.
The rating for Alice's challenge is the triplet a = (a[0], a[1], a[2]), and the rating for Bob's challenge is the triplet b = (b[0], b[1], b[2]).
The task is to calculate their comparison points by comparing each category:
- If a[i] > b[i], then Alice is awarded 1 point.
- If a[i] < b[i], then Bob is awarded 1 point.
- If a[i] = b[i], then neither person receives a point.
Example
a = [1, 2, 3]
b = [3, 2, 1]
- For elements *0*, Bob is awarded a point because a[0] < b[0].
- For the equal elements a[1] and b[1], no points are earned.
- Finally, for elements 2, a[2] > b[2] so Alice receives a point.
The return array is [1, 1] with Alice's score first and Bob's second.
Function Description
Complete the function compareTriplets with the following parameter(s):
- int a[3]: Alice's challenge rating
- int b[3]: Bob's challenge rating
Returns
- int[2]: the first element is Alice's score and the second is Bob's score
Input Format
The first line contains 3 space-separated integers, a[0], a[1], and a[2], the respective values in triplet a.
The second line contains 3 space-separated integers, b[0], b[1], and b[2], the respective values in triplet b.
Constraints
- 1 ≤ a[i] ≤ 100
- 1 ≤ b[i] ≤ 100
Sample Input 0
5 6 7
3 6 10
Sample Output 0
1 1
Explanation 0
In this example:
Now, let's compare each individual score:
- , so Alice receives point.
- , so nobody receives a point.
- , so Bob receives point.
Alice's comparison score is , and Bob's comparison score is . Thus, we return the array .
Sample Input 1
17 28 30
99 16 8
Sample Output 1
2 1
Explanation 1
Comparing the elements, so Bob receives a point.
Comparing the and elements, and so Alice receives two points.
The return array is [2,1].
풀이
'알고리즘 단련장 > 해커랭크' 카테고리의 다른 글
[해커랭크] Plus Minus (1) | 2025.07.27 |
---|---|
[해커랭크] Diagonal Difference (1) | 2025.07.27 |
[해커랭크] A Very Big Sum (0) | 2025.07.27 |
[해커랭크] Simple Array Sum (0) | 2025.07.27 |
[해커랭크] 시작하기 (백준 프로그래머스와 차이점) (2) | 2025.07.27 |