본문 바로가기
Programming/>> Algorithm

[Lucky Algorithm] Compare the Triplets

by 니키ᕕ( ᐛ )ᕗ 2017. 10. 3.

Alice and Bob each created one problem for HackerRank. A reviewer rates the two challenges, awarding points on a scale from  to  for three categories: problem clarityoriginality, and difficulty.

We define the rating for Alice's challenge to be the triplet , and the rating for Bob's challenge to be the triplet .

Your task is to find their comparison points by comparing  with  with , and  with .

  • If , then Alice is awarded  point.
  • If , then Bob is awarded  point.
  • If , then neither person receives a point.

Comparison points is the total points a person earned.

Given  and , can you compare the two challenges and print their respective comparison points?

Input Format

The first line contains  space-separated integers, , and , describing the respective values in triplet 
The second line contains  space-separated integers, , and , describing the respective values in triplet .

Constraints

Output Format

Print two space-separated integers denoting the respective comparison points earned by Alice and Bob.


import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static int[] solve(int a0, int a1, int a2, int b0, int b1, int b2){
        // Complete this function
        int a = 0;
        int b = 0;
        
        if(a0 > b0){
            a += 1;  
        } else if(b0 > a0){
            b += 1;
        }   
        
        if(a1 > b1){
            a += 1;  
        } else if(b1 > a1){
            b += 1;
        }   
        
        if(a2 > b2){
            a += 1;  
        } else if(b2 > a2){
            b += 1;
        }   
        
        return new int[] {a, b};
     
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int a0 = in.nextInt();
        int a1 = in.nextInt();
        int a2 = in.nextInt();
        int b0 = in.nextInt();
        int b1 = in.nextInt();
        int b2 = in.nextInt();
        int[] result = solve(a0, a1, a2, b0, b1, b2);
        for (int i = 0; i < result.length; i++) {
            System.out.print(result[i] + (i != result.length - 1 ? " " : ""));
        }
        System.out.println("");
        

    }
}


'Programming > >> Algorithm' 카테고리의 다른 글

[Lucky Algorithm] Diagonal Difference  (0) 2017.10.03
[Lucky Algorithm] A Very Big Sum  (0) 2017.10.03
[Lucky Algorithm] Simple Array Sum  (0) 2017.10.03
[Lucky Algorithm] Mini-Max Sum  (0) 2017.10.03
[Lucky Algorithm] Grading Students  (0) 2017.09.27

댓글