Algoritm/Quiz-Solutions

[λ°±μ€€ 15953] μƒκΈˆν—Œν„° (JAVA)

πŸ’œautumn 2020. 5. 2. 18:44

[문제링크]

https://www.acmicpc.net/problem/15953

 

15953번: μƒκΈˆ ν—Œν„°

첫 번째 쀄에 μ œμ΄μ§€κ°€ 상상λ ₯을 λ°œνœ˜ν•˜μ—¬ κ°€μ •ν•œ 횟수 T(1 ≤ T ≤ 1,000)κ°€ μ£Όμ–΄μ§„λ‹€. λ‹€μŒ T개 μ€„μ—λŠ” ν•œ 쀄에 ν•˜λ‚˜μ”© μ œμ΄μ§€κ°€ ν•΄λ³Έ 가정에 λŒ€ν•œ 정보가 μ£Όμ–΄μ§„λ‹€. 각 μ€„μ—λŠ” 두 개의 음이 μ•„λ‹Œ μ •μˆ˜ a(0 ≤ a ≤ 100)와 b(0 ≤ b ≤ 64)κ°€ 곡백 ν•˜λ‚˜λ₯Ό μ‚¬μ΄λ‘œ 두고 μ£Όμ–΄μ§„λ‹€.

www.acmicpc.net

 

[ν’€μ΄μ†ŒμŠ€]

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
package Algorithm;
 
 
public class KakaoFestival {
    public static int[] prize2017= {500,300,200,50,30,10};
    public static int[] prize2018= {512,256,128,64,32};
    
    public static void main(String[] args) throws IOException {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st=null;
        StringBuilder sb=new StringBuilder();
        
        int testcase=Integer.parseInt(br.readLine());
        
        for (int i=0;i<testcase;i++) {
            st=new StringTokenizer(br.readLine());
            int rank2017=Integer.parseInt(st.nextToken());
            int rank2018=Integer.parseInt(st.nextToken());
            
            int total=calcPrize(rank2017, rank2018);
            
            sb.append(total+"\n");
        }
        
        System.out.println(sb);
    }
    
    public static int calcPrize(int rank2017, int rank2018) {
        int reward2017=0;
        int reward2018=0;s
        int total=0;
        
        if (rank2017>0 && rank2017<22) {
            for(int i=1; i<=6; i++) {
                rank2017-=i;
                if((rank2017)<=0) {
                    reward2017=prize2017[i-1];
                }
                if (reward2017!=0break;
            }
        }
        
        if (rank2018>0 && rank2018<32) {
            for(int i=0; i<=4; i++) {
                rank2018-=Math.pow(2, i);
                if(rank2018<=0) {
                    reward2018=prize2018[i];
                }
                if (reward2018!=0break;
            }
        }
        total=reward2017+reward2018;
        return total*10000;
    }
    
 
}
 
http://colorscripter.com/info#e" target="_blank" style="color:#4f4f4ftext-decoration:none">Colored by Color Scripter

 

[λŠλ‚€μ ]

  - μž…λ ₯처리 곡뢀 

  - μž¬κ·€ν•¨μˆ˜ μ‚¬μš©

  - 쑰건문이 λ„ˆλ¬΄ λ§Žμ€κ²ƒκ°™μŒ

  - λ‹€λ₯Έμ‚¬λžŒλ“€μ΄ ν’€μ΄ν•œκ±Έ λ³΄λ‹ˆ λ°°μ—΄λ‘œ λͺ¨λ“  값듀을 ν™œμš©ν•˜λŠ”κ²ƒμ΄ λ§Žμ•˜μŒ

     → λ‚˜λŠ” κ·œμΉ™μ„ μ°Ύμ•„ κ·Έ 값을 κΌ­ λ§Œλ“€μ–΄λ‚΄λ €κ³  ν•˜λŠ”λ°, 

        μ‹œκ°„μ ˆμ•½μ„ μœ„ν•΄μ„œ μ•žμœΌλ‘œλŠ” ꡳ이 그럴 ν•„μš”κ°€ μ—†λ‹€λŠ” 것!