백준2164 카드2

문제 출처: www.acmicpc.net/problem/2164

import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;

public class bj2164카드2 {
	static Queue <Integer> q;
	static int N, next, trash;
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		q = new LinkedList<Integer>();
		
		N = sc.nextInt();
		
		for (int i = 1; i <= N; i++) {
			q.offer(i);
		}
		
		next = 0;
		trash = 0;
		
		while(q.size() > 1) {
			q.poll();
			next = q.poll();
			q.add(next);
		}
		
		System.out.println(q.poll());
	}
}

  

큐를 사용하면 무난한 문제였다.