개발생각

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		char ch = sc.next().charAt(0);
		int num = (int) ch;
		
		System.out.println(num);
	}

}

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 n = sc.nextInt();
		String str = sc.next();
		
		int result = 0; 
		
		for(int i=0;i<str.length();i++) {
			result += (int)str.charAt(i) - '0';
		}
		
		System.out.println(result);
	}

}

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 n = sc.nextInt();
		
		long[] dp = new long[1001];
		
		dp[0] = 1;
		dp[1] = 1;
		
		for(int i=2;i<=n;i++) {
			dp[i] = dp[i-1] + dp[i-2];
			dp[i] = dp[i]%10007;
		}

		if(n == 0) {
			System.out.println(0);
			return;
		} else {
			System.out.println(dp[n]);
		}
	}
}

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		
		long n = sc.nextInt();
		long sum = 0;
	
		long[] p = new long[1000001];
		
		for(int i=0;i<n;i++){
			p[i] = sc.nextInt();
		}
		
		int b = sc.nextInt(); // 총 감독관
		int c = sc.nextInt(); // 부 감독관
		
		for(int i=0;i<n;i++){
			if(p[i] > b){
				long temp = p[i] - b;
				sum+=1;
				if(temp%c == 0){
					sum+=temp/c;
				}else{
					sum+=temp/c+1;
				}
			}else{
				sum+=1;
			}
		}
		
		System.out.println(sum);
		
	}
	
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.LinkedList;
import java.util.Queue;

class Point{
   int rx, ry, bx, by, count;
   
   Point(int rx, int ry, int bx, int by, int count){
      this.rx = rx;
      this.ry = ry;
      this.bx = bx;
      this.by = by;
      this.count = count;
   }
}

public class Main {
   static int[] dx = {1, 0 ,-1 ,0}; // 0 right 1 down 2 left 3 up
   static int[] dy = {0, 1, 0, -1};
   static char[][] map;
   static int N, M;
   
   public static void main(String[] args) throws IOException{
      BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
      String[] s = br.readLine().split(" ");
      N = Integer.parseInt(s[0]);
      M = Integer.parseInt(s[1]);
      map = new char[N][M];
      int rx, ry, bx, by;
      rx = ry = bx = by = 0;
      
      for(int i = 0; i < N; i++){
         String m = br.readLine();
         map[i] = m.toCharArray();
         
         for(int j = 0; j < M; j++){
            if(map[i][j] == 'R'){
               rx = j;
               ry = i;
            }else if(map[i][j] == 'B'){
               bx = j;
               by = i;
            }
         }
      }
      
      Queue<Point> q = new LinkedList<>();
      q.add(new Point(rx, ry, bx, by, 0));
      
      while(!q.isEmpty()){
         Point now = q.poll();
         
         if(now.count == 10) break;
         
         for(int i = 0; i < 4; i++){
            int nrx = now.rx;
            int nry = now.ry;
            int nbx = now.bx;
            int nby = now.by;
            
            while(map[nry + dy[i]][nrx + dx[i]] != '#'){
               nrx += dx[i];
               nry += dy[i];
 
               if(map[nry][nrx] == 'O')
                  break;
            }
            
            while(map[nby + dy[i]][nbx + dx[i]] != '#'){
               nbx += dx[i];
               nby += dy[i];
              
               if(map[nby][nbx] == 'O')
                  break;
            }
            
            if(map[nby][nbx] == 'O')
               continue;
            
            if(map[nry][nrx] == 'O'){
               System.out.println(now.count + 1);
               return;
            }
            
            // 0 right 1 down 2 left 3 up
            if(nrx == nbx && nry == nby){
               if(i == 0){
                  if(now.rx > now.bx)
                     nbx--;
                  else
                     nrx--;
               }else if(i == 1){
                  if(now.ry > now.by)
                     nby--;
                  else
                     nry--;
               }else if(i == 2){
                  if(now.rx < now.bx)
                     nbx++;
                  else
                     nrx++;
               }else{
                  if(now.ry < now.by)
                     nby++;
                  else
                     nry++;
               }
            }
            
            q.add(new Point(nrx, nry, nbx, nby, now.count + 1));
         }
      }
      
      System.out.println("-1");
   }
}