GiantStepDEV

문제

KOI μ „μžμ—μ„œλŠ” 건강에 μ’‹κ³  λ§›μžˆλŠ” ν›ˆμ œμ˜€λ¦¬κ΅¬μ΄ μš”λ¦¬λ₯Ό κ°„νŽΈν•˜κ²Œ λ§Œλ“œλŠ” 인곡지λŠ₯ μ˜€λΈμ„ κ°œλ°œν•˜λ €κ³  ν•œλ‹€. 인곡지λŠ₯ μ˜€λΈμ„ μ‚¬μš©ν•˜λŠ” 방법은 μ λ‹Ήν•œ μ–‘μ˜ 였리 ν›ˆμ œ 재료λ₯Ό 인곡지λŠ₯ μ˜€λΈμ— λ„£μœΌλ©΄ λœλ‹€. 그러면 인곡지λŠ₯ μ˜€λΈμ€ μ˜€λΈκ΅¬μ΄κ°€ λλ‚˜λŠ” μ‹œκ°„μ„ λΆ„ λ‹¨μœ„λ‘œ μžλ™μ μœΌλ‘œ κ³„μ‚°ν•œλ‹€. 

λ˜ν•œ, KOI μ „μžμ˜ 인곡지λŠ₯ 였븐 μ•žλ©΄μ—λŠ” μ‚¬μš©μžμ—κ²Œ ν›ˆμ œμ˜€λ¦¬κ΅¬μ΄ μš”λ¦¬κ°€ λλ‚˜λŠ” μ‹œκ°μ„ μ•Œλ € μ£ΌλŠ” λ””μ§€ν„Έ μ‹œκ³„κ°€ μžˆλ‹€. 

ν›ˆμ œμ˜€λ¦¬κ΅¬μ΄λ₯Ό μ‹œμž‘ν•˜λŠ” μ‹œκ°κ³Ό 였븐ꡬ이λ₯Ό ν•˜λŠ” 데 ν•„μš”ν•œ μ‹œκ°„μ΄ λΆ„λ‹¨μœ„λ‘œ μ£Όμ–΄μ‘Œμ„ λ•Œ, μ˜€λΈκ΅¬μ΄κ°€ λλ‚˜λŠ” μ‹œκ°μ„ κ³„μ‚°ν•˜λŠ” ν”„λ‘œκ·Έλž¨μ„ μž‘μ„±ν•˜μ‹œμ˜€.

μž…λ ₯

첫째 μ€„μ—λŠ” ν˜„μž¬ μ‹œκ°μ΄ λ‚˜μ˜¨λ‹€. ν˜„μž¬ μ‹œκ°μ€ μ‹œ A (0 ≤ A ≤ 23) 와 λΆ„ B (0 ≤ B ≤ 59)κ°€ μ •μˆ˜λ‘œ λΉˆμΉΈμ„ 사이에 두고 μˆœμ„œλŒ€λ‘œ μ£Όμ–΄μ§„λ‹€. 두 번째 μ€„μ—λŠ” μš”λ¦¬ν•˜λŠ” 데 ν•„μš”ν•œ μ‹œκ°„ C (0 ≤ C ≤ 1,000)κ°€ λΆ„ λ‹¨μœ„λ‘œ μ£Όμ–΄μ§„λ‹€. 

좜λ ₯

첫째 쀄에 μ’…λ£Œλ˜λŠ” μ‹œκ°μ˜ μ‹œμ™€ 뢄을 곡백을 사이에 두고 좜λ ₯ν•œλ‹€. (단, μ‹œλŠ” 0λΆ€ν„° 23κΉŒμ§€μ˜ μ •μˆ˜, 뢄은 0λΆ€ν„° 59κΉŒμ§€μ˜ μ •μˆ˜μ΄λ‹€. λ””μ§€ν„Έ μ‹œκ³„λŠ” 23μ‹œ 59λΆ„μ—μ„œ 1뢄이 μ§€λ‚˜λ©΄ 0μ‹œ 0뢄이 λœλ‹€.)

package λ°±μ€€2525번문제;
import java.util.Scanner;

public class BaekJoon2525 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.print("μ‹œ : ");
        int h = sc.nextInt();
        System.out.print("λΆ„ : ");
        int m = sc.nextInt();
        System.out.print("μ†Œμš” μ‹œκ°„ : ");
        int time = sc.nextInt();

        int tt = (h * 60) + m + time; //λͺ¨λ“  μ‹œκ°„μ„ λΆ„μœΌλ‘œ ν™˜μ‚°
        h = tt / 60;
        m = tt % 60; 
        if(h >= 24) h = h - 24;

        System.out.printf("%dμ‹œ %dλΆ„",h,m);
    }
}

 

profile

GiantStepDEV

@kongmi

ν¬μŠ€νŒ…μ΄ μ’‹μ•˜λ‹€λ©΄ "μ’‹μ•„μš”β€οΈ" λ˜λŠ” "κ΅¬λ…πŸ‘πŸ»" ν•΄μ£Όμ„Έμš”!