개발생각

import java.util.Scanner;

//Q) 스티커
//#9465
public class Main {


	
	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		int tc = sc.nextInt(); // Test Case
		int[] result = new int[tc];
		
		for(int i=0;i<tc;i++){
		
			int n = sc.nextInt();
			int[][] ar = new int[2][100001];
			int[][] dp = new int [2][100001];
			
			for(int j=0;j<2;j++){
				for(int k=1;k<=n;k++){
					ar[j][k] = sc.nextInt();
				}
			}//스티커 점수 입력
			
			dp[0][0]=0;
			dp[1][0]=0;
			dp[0][1] = ar[0][1];
			dp[1][1] = ar[1][1];
			
			//시작점은 항상 앞에 두개 중 하나
			for(int j=2;j<=n;j++){
				dp[0][j] = getMax(dp[1][j-1], dp[1][j-2]) +ar[0][j]; 
				dp[1][j] = getMax(dp[0][j-1], dp[0][j-2]) +ar[1][j];
			}
			
			//대각선 고려
			
			result[i] = getMax(dp[0][n], dp[1][n]);
			
		}//Test Case 종료
		
		for(int i=0;i<tc;i++){
			System.out.println(result[i]);
		}
	}
	
	public static int getMax(int a, int b){
		if(a>b){
			return a;
		}else{
			return b;
		}
		
	}

}

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner sc = new Scanner(System.in);
		
		int tc = sc.nextInt();
		String[] result = new String[tc];
		
		for(int i=0;i<tc; i++) {
			
			int idx = 0;
			int h = sc.nextInt();
			int w = sc.nextInt();
			int n = sc.nextInt();
			
			while(true) {
				if(idx * h >= n) {
					n = n - ((idx-1)*h);
				
					if(idx < 10) {
						result[i] = String.valueOf(n) + "0" + String.valueOf(idx);
						break;
					}else {
						result[i] = String.valueOf(n) + "" + String.valueOf(idx);
						break;
					}
				}else {
					idx++;
				}
			}
		}
		
		for(int i=0;i<result.length;i++) {
			System.out.println(result[i]);
		}
	}

}

import java.util.Scanner;

public class Main {

	static int[] a_cards = new int[10];
	static int[] b_cards = new int[10];
	static int answer_a = 0;
	static int answer_b = 0;
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		Scanner sc = new Scanner(System.in);
		
		for(int i=0;i<10;i++){
			a_cards[i] = sc.nextInt();
		}
		
		for(int i=0;i<10;i++) {
			b_cards[i] = sc.nextInt();
		}
		
		PlayGame();
		
		System.out.println(GetAnswer());
	}
	
	public static void PlayGame(){
		for(int i=0;i<10;i++) {
			if(a_cards[i] > b_cards[i]) {
				answer_a++;
			} else if(a_cards[i] < b_cards[i]) {
				answer_b++;
			}
		}
	}
	
	public static String GetAnswer() {
		if(answer_a > answer_b) return "A";
		else if(answer_b > answer_a) return "B";
		else return "D";
	}
}

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		Scanner sc = new Scanner(System.in);
		
		String s = sc.next();
		String[] alpha = {"a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z"};
		
		for(int i=0;i<alpha.length;i++) {
			System.out.print(s.indexOf(alpha[i]) + " ");
		}
	}

}

import java.util.ArrayList;
import java.util.Scanner;

public class Main {

	static int n;
	static int[] visit;
	static int[] parent;
	static ArrayList<Integer>[] ar;
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner sc = new Scanner(System.in);
		
		n = sc.nextInt();
		ar = new ArrayList[n+1];
		visit = new int[n+1];
		parent= new int[n+1];
		
		for(int i=1;i<=n;i++) {
			ar[i] = new ArrayList<Integer>();
		}
		
		for(int i=1;i<n;i++) {
			int x = sc.nextInt();
			int y = sc.nextInt();
			
			ar[x].add(y);
			ar[y].add(x);
		}

		for(int i=1;i<=n;i++) {
			if(visit[i] == 0) {
				getDfs(i);
			}
		}
		
		for(int i=2;i<=n;i++) {
			System.out.println(parent[i]);
		}
	}
	
	public static void getDfs(int node) {
		if(visit[node] == 1) return;
		
		visit[node] = 1;
		
		for(int y : ar[node]) {	
			if(visit[y] == 0) {
				parent[y] = node;
				getDfs(y);
			}
		}
	}
}