[지코바] 7회차 문제풀이

1. 피보나치 함수

import java.util.Scanner;

public class fibonachi {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int T = sc.nextInt();
		int fibo[][] = new int[41][2];
		
		fibo[0][0] = 1;
		fibo[0][1] = 0;
		fibo[1][0] = 0;
		fibo[1][1] = 1;
		
		for(int i = 2; i <= 40; i++) {
			fibo[i][0] = fibo[i-1][0] + fibo[i-2][0];
			fibo[i][1] = fibo[i-1][1] + fibo[i-2][1];
		}
		for(int j = 0; j < T; j++) {
			int N = sc.nextInt();
			System.out.println(fibo[N][0] + " " + fibo[N][1]);
		}

	}
}

 

 

---

 

 

2.요세푸스

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

public class josepus {
	public static StringBuilder _makeList(LinkedList<Integer> list, int K) {
		StringBuilder sb = new StringBuilder();
		sb.append('<');
		
		int flag = 0;
		
		while(list.size() >1) {
			flag = (flag + (K-1))  % list.size();
			
			sb.append(list.remove(flag)).append(", ");
			
		}
		sb.append(list.remove()).append('>');
		
		return sb;
	}

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		LinkedList<Integer> list = new LinkedList<Integer>();
		
		int N = sc.nextInt();
		int K = sc.nextInt();
		
		for(int i = 1; i <=N; i++) {
			list.add(i);
		}
		
		StringBuilder output =  _makeList(list, K);
		System.out.println(output);
	}
}

 

 

---

 

 

3.나이순 정렬

import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;

public class sortAge {
	
	public static void _sortList(String[][] member) {
		Arrays.sort(member, new Comparator<String[]>() {
			@Override
			public int compare(String[] o1, String[] o2) {
				return Integer.parseInt(o1[0]) - Integer.parseInt(o2[0]);
			}
		});	
	}

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int N = sc.nextInt();
		String[][] member = new String[N][2];
		
		for(int i = 0; i < N; i++) {
			member[i][0] = sc.next();
			member[i][1] = sc.next();
		}
		
		_sortList(member);	
		
		for(int j = 0; j < N; j++) {
			System.out.println(member[j][0] + " " + member[j][1]);
		}
	}
}

 

 

---

 

4. 제로

import java.util.Scanner;

public class zero {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int  K = sc.nextInt();
		
		int[] list = new int[K];
		int flag = 0;
		
		for(int i = 0 ; i < K; i++) {
			int putNumber = sc.nextInt();
			if(putNumber != 0 ) {
				list[flag] = putNumber;
				flag++;
			}else {
				flag--;
			}		
		}
		
		int sum = 0;
		for(int j = 0; j < flag; j++) {
			sum += list[j];
		}
		System.out.println(sum);
	}
}