๐Ÿ“– [๋ฐฑ์ค€์•Œ๊ณ ๋ฆฌ์ฆ˜ ํ’€์ด] Q.10988 ํŒฐ๋ฆฐ๋“œ๋กฌ์ธ์ง€ ํ™•์ธํ•˜๊ธฐ ๋ฌธ์ œ ํ’€์ด

๐Ÿ“– ๋ฌธ์ œ

https://www.acmicpc.net/problem/10988

์•ŒํŒŒ๋ฒณ ์†Œ๋ฌธ์ž๋กœ๋งŒ ์ด๋ฃจ์–ด์ง„ ๋‹จ์–ด๊ฐ€ ์ฃผ์–ด์ง„๋‹ค. ์ด๋•Œ, ์ด ๋‹จ์–ด๊ฐ€ ํŒฐ๋ฆฐ๋“œ๋กฌ์ธ์ง€ ์•„๋‹Œ์ง€ ํ™•์ธํ•˜๋Š” ํ”„๋กœ๊ทธ๋žจ์„ ์ž‘์„ฑํ•˜์‹œ์˜ค.

ํŒฐ๋ฆฐ๋“œ๋กฌ์ด๋ž€ ์•ž์œผ๋กœ ์ฝ์„ ๋•Œ์™€ ๊ฑฐ๊พธ๋กœ ์ฝ์„ ๋•Œ ๋˜‘๊ฐ™์€ ๋‹จ์–ด๋ฅผ ๋งํ•œ๋‹ค.

level, noon์€ ํŒฐ๋ฆฐ๋“œ๋กฌ์ด๊ณ , baekjoon, online, judge๋Š” ํŒฐ๋ฆฐ๋“œ๋กฌ์ด ์•„๋‹ˆ๋‹ค.

์ž…๋ ฅ

์ฒซ์งธ ์ค„์— ๋‹จ์–ด๊ฐ€ ์ฃผ์–ด์ง„๋‹ค. ๋‹จ์–ด์˜ ๊ธธ์ด๋Š” 1๋ณด๋‹ค ํฌ๊ฑฐ๋‚˜ ๊ฐ™๊ณ , 100๋ณด๋‹ค ์ž‘๊ฑฐ๋‚˜ ๊ฐ™์œผ๋ฉฐ, ์•ŒํŒŒ๋ฒณ ์†Œ๋ฌธ์ž๋กœ๋งŒ ์ด๋ฃจ์–ด์ ธ ์žˆ๋‹ค.

์ถœ๋ ฅ

์ฒซ์งธ ์ค„์— ํŒฐ๋ฆฐ๋“œ๋กฌ์ด๋ฉด 1, ์•„๋‹ˆ๋ฉด 0์„ ์ถœ๋ ฅํ•œ๋‹ค.

๐Ÿ” ์ ‘๊ทผ๋ฒ•

Q.10988 ํŒฐ๋ฆฐ๋“œ๋กฌ์ธ์ง€ ํ™•์ธํ•˜๊ธฐ ๋ฌธ์ œ ํ’€์ด์ž…๋‹ˆ๋‹ค.

๋ฌธ์ œ์—์„œ ์ฃผ์–ด์ง„ ์˜ˆ์‹œ์ฒ˜๋Ÿผ ๋‹จ์–ด๊ฐ€ ํŒฐ๋ฆฐ๋“œ๋กฌ์ธ์ง€ ํ™•์ธํ•˜๋ฉด ๋˜๋Š” ๊ฒƒ์ž…๋‹ˆ๋‹ค.

์•ž์œผ๋กœ ์ฝ์œผ๋•Œ ๊ฑฐ๊พธ๋กœ ์ฝ์„๋•Œ ๋ชจ๋‘ ๊ฐ™์•„์•ผ ํ•˜๋ฏ€๋กœ

๋‹จ์–ด ๊ธธ์ด๊ฐ€ n์ด๋ผ๊ณ  ํ•˜๊ณ  ๋‹จ์–ด์˜ ์ธ๋ฑ์Šค๋ฅผ i๋ผ๊ณ  ํ•  ๋•Œ

๋‹จ์–ด์˜ ์•ž์—์„œ i๋ฒˆ์งธ ๋ฌธ์ž์™€ ๋’ค์—์„œ์˜ i๋ฒˆ์งธ์˜ ๋ฌธ์ž๊ฐ€ ๊ฐ™์œผ๋ฉด ํŒฐ๋ฆฐ๋“œ๋กฌ ๋‹จ์–ด๊ฐ€ ๋ฉ๋‹ˆ๋‹ค.

๊ฐ๊ฐ ์•ž์—์„œ ๋’ค์—์„œ i๋ฒˆ์งธ ์ˆ˜๋ฅผ ๋™์‹œ์— ํ™•์ธํ•  ๊ฒƒ ์ด๋ฏ€๋กœ

i๋Š” ๋‹จ์–ด์˜ ๊ธธ์ด/2 ๊นŒ์ง€๋งŒ ํ™•์ธํ•˜๋ฉด ๋ฉ๋‹ˆ๋‹ค. (word.length()/2)

์•ž์—์„œ i๋ฒˆ์งธ ๋’ค์—์„œ i๋ฒˆ์งธ ๋ฌธ์ž๋“ค์„ ๋น„๊ตํ•˜์—ฌ

๋‹ค๋ฅธ ๊ฒฝ์šฐ๊ฐ€ ๋‚˜์˜ค๋ฉด 0์„ ์ถœ๋ ฅํ•˜๊ณ 

๋ชจ๋“  ์•ž์—์„œ i๋ฒˆ์งธ์™€ ๋’ค์—์„œ 1๋ฒˆ์งธ์˜ ๋ฌธ์ž๊ฐ€ ๊ฐ™๋‹ค๋ฉด 1์„ ์ถœ๋ ฅํ•ด์ค๋‹ˆ๋‹ค.

noon

LEVEL

๐Ÿ’ป ์ฝ”๋“œ

package problem.string;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

public class Main_10988 {

    static String word;

    public static void main(String[] args) throws IOException {
        input();
        solve();
    }

    public static void input() throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        word = br.readLine();
        br.close();
    }

    public static void solve() {
        for(int i=0; i< word.length()/2; i++){
            if(word.charAt(i) != word.charAt(word.length()-1-i)){
                System.out.println(0);
                return;
            }
        }
        System.out.println(1);
    }
}
Written on February 14, 2021