'Quiz/Try-catch'에 해당되는 글 10건

import java.util.Scanner;

public class Main{

public static void main(String[] args){

Scanner in = new Scanner(System.in);

String[] a = in.nextLine().split(" ");

for(int i=0;i<a.length;i++){

System.out.print(Integer.parseInt(a[i])+1 +(i==a.length-1 ? "":" "));

}

}

}

import java.util.Arrays;

import java.util.Scanner;

public class Main {

public static void main(String[] args){

Scanner in = new Scanner(System.in);

String[] arr = in.nextLine().split(" ");

Arrays.sort(arr);

System.out.println(arr[0]);

}

}

import java.util.Scanner;

public class Main {

public static void main(String[] args){

Scanner in = new Scanner(System.in);

char[] a = in.next().toCharArray();

int b=0;

boolean t = true;

for(int i=0;i<a.length&&t;i++){

if('A'<=a[i] && a[i]<='Z'){

b=i;

t=false;

}

}

System.out.println(a[b]);

}

}

import java.util.Scanner;

public class Main {

public static void main(String[] args){

Scanner in = new Scanner(System.in);

String[] arr = in.nextLine().split(" ");

int num = Integer.parseInt(arr[0], 2)*Integer.parseInt(arr[1], 2);

System.out.println(Integer.toBinaryString(num));

}

}

import java.util.ArrayList;

import java.util.List;

import java.util.Scanner;

public class Fibonacci {

/*

public static void main(String[] args){

Scanner in = new Scanner(System.in);

int n = in.nextInt();

int first = 1;

int second = 0;

int temp = 0;

for(int i=1 ; i<n ; i++){

temp = first;

first = first+second;

second = temp;

}

System.out.println(first);

}

*/

public static void main(String[] args){

Scanner in = new Scanner(System.in);

List<Integer> arr = new ArrayList();

arr.add(1);

arr.add(arr.get(0));

int n = in.nextInt();

for(int i=2 ; i<n ; i++){

arr.add(arr.get(i-1)+arr.get(i-2));

}

System.out.println(arr.get(n-1));

}

}

import java.util.Scanner;

public class Main {

public static void main(String[] args){

Scanner in = new Scanner(System.in);

int get = in.nextInt();

int floor = get/2+1;

for(int i=0;i<get;i++){

floor--;

for(int j=0;j<get-Math.abs(floor);j++){

System.out.print(Math.abs(floor)<=j ? "*":" ");

}

System.out.println();

}

}

}

import java.util.Scanner;

public class Main {

public static void main(String[] args){

Scanner in = new Scanner(System.in);

String a = in.nextLine();

String b = in.nextLine();

String max = "";              //가장 긴 문자열

String temp = "";            //뽑은 같은 문자열

for(int i=0 ; i<a.length() && max.length()<(a.length()-i) ; i++){

for(int j=i+1 ; j<a.length(); j++){

temp = maxString(a.substring(i,j),b);

if(temp.equals("")){            //이 다음 문자열은 어차피 다르기 때문에 더 이상 실행하지 않음

break;

}

if(temp.length() > max.length()){    //기존 문자열보다 길면 max에 집어넣음

max = temp;    

}

}

}

System.out.println(max);

}

public static String maxString(String a, String b){

String MS = "";

boolean t = false;            //도중에 문자가 틀리면 다음 문자열과 비교

for(int i=0 ; i<b.length()-a.length()&& !t; i++){    //마지막에 a길이와 같을 수 있도록 b길이-a길이

t=true;

for(int j=0;j<a.length() && t;j++){

if(b.charAt(i+j) != a.charAt(j)){

t = false;

}

}

}

if(t){

MS=a;

}

return MS;

}

}

import java.util.Scanner;

public class Main {

public static void main(String[] args){

Scanner in = new Scanner(System.in);

String[] a = in.nextLine().split(" ");

double a1 = Double.parseDouble(a[0]);

double a2 = Double.parseDouble(a[1]);

System.out.println(Math.round(Math.pow(a1,a2)*1000d)/1000d);

}

}

import java.util.Scanner;

public class Main {

public static void main(String[] args){

Scanner in = new Scanner(System.in);

String[] a = in.nextLine().split(" ");

String[] b = in.nextLine().split(" ");

int[] c = new int[a.length]; 

for(int i=0 ; i<a.length ; i++){

c[i] = Integer.parseInt(a[i]) + Integer.parseInt(b[i]);

}

for(int i=0 ; i<c.length ; i++){

System.out.print(i==0 ? c[i] : " "+c[i]);

}

}

}

import java.util.Scanner;

public class Main {

/*public static void main(String[] args){

Scanner in = new Scanner(System.in);

String palindrome = in.nextLine().replaceAll(" ", ""); //공백 제거

int size = s.length(); //문자열 길이

boolean palindromeCheck = true;

for(int i=0 ; i<size && palindromeCheck ; i++){

//n번째 문자

if(palindrome.charAt((size-1)-i) != palindrome.charAt(i)){

palindromeCheck  = false;

}

}

System.out.println(palindromeCheck ? "TRUE" : "FALSE");

}*/

public static void main(String[] args){

Scanner in = new Scanner(System.in);

byte[] palindrome = in.nextLine().replaceAll(" ", "").getBytes();

int size = a.length;

boolean palindromeCheck = true;

for(int i=0 ; i<size/2 && palindromeCheck ; i++){

if(palindrome[(size-1)-i] == palindrome[i]){

palindromeCheck = false;

}

}

System.out.println(palindromeCheck ? "TRUE" : "FALSE");

}

}