dalcon10028

import java.math.BigInteger;
import java.util.*;

class Solution {
    public static int gcd(int a, int b){
        BigInteger b1 = BigInteger.valueOf(a);
        BigInteger b2 = BigInteger.valueOf(b);
        return b1.gcd(b2).intValue();
    }
	public long solution(int w,int h) {

dalcon10028

import java.util.*;
class Solution {
    public int solution(int bridge_length, int weight, int[] truck_weights) {
        int answer = 1; // 경과시간 1부터
        ArrayList<Integer> truck = new ArrayList<>(); // 대기 트럭
        ArrayList<int[]> onBridge = new ArrayList<>(); // 다리를 건너는 트럭, 트럭당 걸리는 시간
        for (int i : truck_weights) truck.add(i); // 트럭 무게를 대기 트럭 리스트에 넣기
        onBridge.add(new int[]{truck.get(0), bridge_length}); truck.remove(0); // 첫 번째 트럭이 다리에 들어서고 시작
        while(!onBridge.isEmpty()){ // 다리위에 트럭이 없을 때까지
            if(onBridge.get(0)[1]==1) // 다리에 있는 가장 먼저 들어간 트럭이 남은 거리가 1이면

dalcon10028

import java.util.*;
/**
 * Solution
 */
public class Solution {
    public static void main(String[] args) {
        int bridge_length = 2;
        int weight = 10;
        int[] truck_weights = {7, 4, 5, 6};
        System.out.print(solution(bridge_length, weight, truck_weights));

dalcon10028

import java.util.*;

public class Main {
	public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        sc.close();
        int i=2;
        while (N!=1) {
            if(N%i==0){

dalcon10028

import java.math.BigInteger;
import java.util.*;

public class Main {
	public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        BigInteger a = new BigInteger(sc.next());
        BigInteger b = new BigInteger(sc.next());
        sc.close();
        System.out.println(a.gcd(b));

dalcon10028

import java.math.BigInteger;
import java.util.*;

public class Main {
	public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        BigInteger firstRing = new BigInteger(sc.next()); // 첫 번째 링
        BigInteger[] num = new BigInteger[N-1];
        for (int i=0; i<N-1; i++) // 나머지 링

dalcon10028

import java.util.*;

public class Main {
	public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        sc.close();
        int i=0;
        int newNum = N;
        if(N<10){ // N이 10보다 작다면

dalcon10028

import java.util.*;

public class Main {
	public static void main(String args[]) {
      Scanner sc = new Scanner(System.in);
      int N = sc.nextInt();
      int[] realDivisor = new int[N];
      for(int i=0; i<N; i++)
         realDivisor[i] = sc.nextInt();
      sc.close(); Arrays.sort(realDivisor);

dalcon10028

import java.util.*;

public class Main {
   public static void main(String[] args) {
      Scanner sc = new Scanner(System.in);
      int N = sc.nextInt();
      double []num = new double[N];
      for(int i=0; i<N; i++) num[i]=sc.nextDouble();
      sc.close();
      

dalcon10028

#include <stdio.h>
#include <string.h>

int queue[2000001];
int front=0;
int rear=-1;

void clean(char arr[]); // 초기화용 함수
void push(int x);
void pop(void);