chaesoo
so0ob
chaesoo
전체 방문자
오늘
어제
  • 분류 전체보기 (169)
    • 알고리즘 (157)
      • 백준 다시풀기 (8)
      • solved.ac (137)
      • 백준 알고리즘 공부 (12)
    • 활동일지 (5)
    • 개발 (5)
      • Unity (4)
    • 책 공부 (2)
      • clean code (2)

블로그 메뉴

  • 홈
  • 태그
  • 방명록

공지사항

인기 글

태그

  • 로스트아크 디코 봇
  • 게임개발
  • 다익스트라
  • 유니티
  • 최단거리알고리즘
  • 백준미세먼지안녕!
  • 정보처리기사 2021 합격률
  • 분할정복
  • BFS
  • 백준
  • DP
  • 알고리즘
  • 구현
  • 플로이드-와샬
  • 백준2448
  • SW마에스트로 13기
  • 문자열
  • C++
  • 소마13기
  • 디스코드 봇 파이썬
  • 클린코드2장
  • 디코 봇
  • 다시풀기
  • 분할정복거듭제곱
  • solved.ac
  • 자료구조
  • 클린코드
  • 로아 디코봇
  • dfs
  • 디코봇 파이썬

최근 댓글

최근 글

티스토리

hELLO · Designed By 정상우.
chaesoo

so0ob

알고리즘/solved.ac

[class2] (백준 1259) 팰린드롬수

2021. 9. 25. 17:02

문제

어떤 단어를 뒤에서부터 읽어도 똑같다면 그 단어를 팰린드롬이라고 한다. 'radar', 'sees'는 팰린드롬이다.

수도 팰린드롬으로 취급할 수 있다. 수의 숫자들을 뒤에서부터 읽어도 같다면 그 수는 팰린드롬수다. 121, 12421 등은 팰린드롬수다. 123, 1231은 뒤에서부터 읽으면 다르므로 팰린드롬수가 아니다. 또한 10도 팰린드롬수가 아닌데, 앞에 무의미한 0이 올 수 있다면 010이 되어 팰린드롬수로 취급할 수도 있지만, 특별히 이번 문제에서는 무의미한 0이 앞에 올 수 없다고 하자.

입력

입력은 여러 개의 테스트 케이스로 이루어져 있으며, 각 줄마다 1 이상 99999 이하의 정수가 주어진다. 입력의 마지막 줄에는 0이 주어지며, 이 줄은 문제에 포함되지 않는다.

출력

각 줄마다 주어진 수가 팰린드롬수면 'yes', 아니면 'no'를 출력한다.

제한

예제 입력 1

121
1231
12421
0

예제 출력 1

yes
no
yes

힌트

W3sicHJvYmxlbV9pZCI6IjEyNTkiLCJwcm9ibGVtX2xhbmciOiIwIiwidGl0bGUiOiJcdWQzMzBcdWI5YjBcdWI0ZGNcdWI4NmNcdWMyMTgiLCJkZXNjcmlwdGlvbiI6IjxwPlx1YzViNFx1YjVhNCBcdWIyZThcdWM1YjRcdWI5N2MgXHViNGE0XHVjNWQwXHVjMTFjXHViZDgwXHVkMTMwIFx1Yzc3ZFx1YzViNFx1YjNjNCBcdWI2MTFcdWFjMTlcdWIyZTRcdWJhNzQgXHVhZGY4IFx1YjJlOFx1YzViNFx1Yjk3YyBcdWQzMzBcdWI5YjBcdWI0ZGNcdWI4NmNcdWM3NzRcdWI3N2NcdWFjZTAgXHVkNTVjXHViMmU0LiAmIzM5O3JhZGFyJiMzOTssICYjMzk7c2VlcyYjMzk7XHViMjk0IFx1ZDMzMFx1YjliMFx1YjRkY1x1Yjg2Y1x1Yzc3NFx1YjJlNC48XC9wPlxyXG5cclxuPHA+XHVjMjE4XHViM2M0IFx1ZDMzMFx1YjliMFx1YjRkY1x1Yjg2Y1x1YzczY1x1Yjg1YyBcdWNkZThcdWFlMDlcdWQ1NjAgXHVjMjE4IFx1Yzc4OFx1YjJlNC4gXHVjMjE4XHVjNzU4IFx1YzIyYlx1Yzc5MFx1YjRlNFx1Yzc0NCBcdWI0YTRcdWM1ZDBcdWMxMWNcdWJkODBcdWQxMzAgXHVjNzdkXHVjNWI0XHViM2M0IFx1YWMxOVx1YjJlNFx1YmE3NCBcdWFkZjggXHVjMjE4XHViMjk0IFx1ZDMzMFx1YjliMFx1YjRkY1x1Yjg2Y1x1YzIxOFx1YjJlNC4gMTIxLCAxMjQyMSBcdWI0ZjFcdWM3NDAgXHVkMzMwXHViOWIwXHViNGRjXHViODZjXHVjMjE4XHViMmU0LiAxMjMsIDEyMzFcdWM3NDAgXHViNGE0XHVjNWQwXHVjMTFjXHViZDgwXHVkMTMwIFx1Yzc3ZFx1YzczY1x1YmE3NCBcdWIyZTRcdWI5NzRcdWJiYzBcdWI4NWMgXHVkMzMwXHViOWIwXHViNGRjXHViODZjXHVjMjE4XHVhYzAwIFx1YzU0NFx1YjJjOFx1YjJlNC4gXHViNjEwXHVkNTVjIDEwXHViM2M0IFx1ZDMzMFx1YjliMFx1YjRkY1x1Yjg2Y1x1YzIxOFx1YWMwMCBcdWM1NDRcdWIyY2NcdWIzNzAsIFx1YzU1ZVx1YzVkMCBcdWJiMzRcdWM3NThcdWJiZjhcdWQ1NWMgMFx1Yzc3NCBcdWM2MmMgXHVjMjE4IFx1Yzc4OFx1YjJlNFx1YmE3NCAwMTBcdWM3NzQgXHViNDE4XHVjNWI0IFx1ZDMzMFx1YjliMFx1YjRkY1x1Yjg2Y1x1YzIxOFx1Yjg1YyBcdWNkZThcdWFlMDlcdWQ1NjAgXHVjMjE4XHViM2M0IFx1Yzc4OFx1YzljMFx1YjljYywgXHVkMmI5XHViY2M0XHVkNzg4IFx1Yzc3NFx1YmM4OCBcdWJiMzhcdWM4MWNcdWM1ZDBcdWMxMWNcdWIyOTQgXHViYjM0XHVjNzU4XHViYmY4XHVkNTVjIDBcdWM3NzQgXHVjNTVlXHVjNWQwIFx1YzYyYyBcdWMyMTggXHVjNWM2XHViMmU0XHVhY2UwIFx1ZDU1OFx1Yzc5MC48XC9wPlxyXG4iLCJpbnB1dCI6IjxwPlx1Yzc4NVx1YjgyNVx1Yzc0MCBcdWM1ZWNcdWI3ZWMgXHVhYzFjXHVjNzU4IFx1ZDE0Y1x1YzJhNFx1ZDJiOCBcdWNmMDBcdWM3NzRcdWMyYTRcdWI4NWMgXHVjNzc0XHViOGU4XHVjNWI0XHVjODM4IFx1Yzc4OFx1YzczY1x1YmE3MCwgXHVhYzAxIFx1YzkwNFx1YjljOFx1YjJlNCAxIFx1Yzc3NFx1YzBjMSA5OTk5OSBcdWM3NzRcdWQ1NThcdWM3NTggXHVjODE1XHVjMjE4XHVhYzAwIFx1YzhmY1x1YzViNFx1YzljNFx1YjJlNC4gXHVjNzg1XHViODI1XHVjNzU4IFx1YjljOFx1YzljMFx1YjljOSBcdWM5MDRcdWM1ZDBcdWIyOTQgMFx1Yzc3NCBcdWM4ZmNcdWM1YjRcdWM5YzBcdWJhNzAsIFx1Yzc3NCBcdWM5MDRcdWM3NDAgXHViYjM4XHVjODFjXHVjNWQwIFx1ZDNlY1x1ZDU2OFx1YjQxOFx1YzljMCBcdWM1NGFcdWIyOTRcdWIyZTQuPFwvcD5cclxuIiwib3V0cHV0IjoiPHA+XHVhYzAxIFx1YzkwNFx1YjljOFx1YjJlNCBcdWM4ZmNcdWM1YjRcdWM5YzQgXHVjMjE4XHVhYzAwIFx1ZDMzMFx1YjliMFx1YjRkY1x1Yjg2Y1x1YzIxOFx1YmE3NCAmIzM5O3llcyYjMzk7LCBcdWM1NDRcdWIyYzhcdWJhNzQgJiMzOTtubyYjMzk7XHViOTdjIFx1Y2Q5Y1x1YjgyNVx1ZDU1Y1x1YjJlNC48XC9wPlxyXG4iLCJoaW50IjoiIiwib3JpZ2luYWwiOiIwIiwiaHRtbF90aXRsZSI6IjAiLCJwcm9ibGVtX2xhbmdfdGNvZGUiOiJLb3JlYW4ifSx7InByb2JsZW1faWQiOiIxMjU5IiwicHJvYmxlbV9sYW5nIjoiMSIsInRpdGxlIjoiUGFsaW5kcm9tZSBOdW1iZXJzIiwiZGVzY3JpcHRpb24iOiI8cD5BIHdvcmQgaXMgYSBwYWxpbmRyb21lIGlmIGl0IHJlYWRzIHRoZSBzYW1lIGJhY2t3YXJkcyBhcyBpdCBkb2VzIGZvcndhcmRzLiBGb3IgZXhhbXBsZSwgd29yZHMgc3VjaCBhcyAmbHNxdW87cmFkYXImcnNxdW87IGFuZCAmbHNxdW87c2VlcyZyc3F1bzsgYXJlIHBhbGluZHJvbWVzLjxcL3A+XHJcblxyXG48cD5NcnMgSm9uZXMsIGEgcHJpbWFyeSBzY2hvb2wgdGVhY2hlciwgdGhvdWdodCBpdCB3b3VsZCBiZSBnb29kIGZvciBoZXIgcHVwaWxzIGlmIHRoZXkgY291bGQgdGVsbCBoZXIgd2hldGhlciBhIG51bWJlciBoYWQgdGhlIHNhbWUgcHJvcGVydHksIGkuZS4sIGl0IHJlYWQgdGhlIHNhbWUgYmFja3dhcmRzIGFzIGl0IGRpZCBmb3J3YXJkcy4gTnVtYmVycyBsaWtlIDEyMSBvciAxMjQyMSB3b3VsZCBxdWFsaWZ5LCBudW1iZXJzIGxpa2UgMTIzIG9yIDEyMzEgd291bGQgbm90LiBOdW1iZXJzIGxpa2UgMTAgd291bGQgYWxzbyBub3QgcXVhbGlmeSZtZGFzaDtldmVuIHRob3VnaCAxMCBjYW4gYmUgd3JpdHRlbiBwYWxpbmRyb21pY2FsbHkgYXMgMDEwLCBNcnMgSm9uZXMgaXMgcmVzdHJpY3RpbmcgdGhpcyB0byBudW1iZXJzIHdyaXR0ZW4gaW4gdGhlIG5vcm1hbCBkZWNpbWFsIHdheSwgd2l0aCBubyBsZWFkaW5nIHplcm9zLjxcL3A+XHJcblxyXG48cD5UaGlzIHByb2JsZW0gYXNrcyB5b3UgdG8gcGVyZm9ybSB0aGlzIHRhc2sgb24gZWFjaCBvZiBhIHNlcmllcyBvZiBudW1iZXJzLjxcL3A+XHJcbiIsImlucHV0IjoiPHA+SW5wdXQgdG8gdGhpcyBwcm9ibGVtIGlzIGEgc2VyaWVzIG9mIGludGVnZXJzIChhbGwgYmV0d2VlbiAxIGFuZCA5OTk5OSkgZWFjaCBvbiBhIHNlcGFyYXRlIGxpbmUuIFRoZSBudW1iZXIgMCB3aWxsIGJlIHRoZSBsYXN0IGxpbmUgb2YgaW5wdXQgYW5kIHNob3VsZCBub3QgYmUgcHJvY2Vzc2VkLjxcL3A+XHJcbiIsIm91dHB1dCI6IjxwPk91dHB1dCB3aWxsIGJlIG9uZSBsaW5lIGZvciBlYWNoIGxpbmUgb2YgaW5wdXQsIGNvbnRhaW5pbmcganVzdCB0aGUgd29yZCAmbHNxdW87eWVzJnJzcXVvOyBpZiB0aGUgbnVtYmVyIHF1YWxpZmllcyBhcyBhIHBhbGluZHJvbWUgbnVtYmVyLCAmbHNxdW87bm8mcnNxdW87IGlmIGl0IGRvZXMgbm90LjxcL3A+XHJcbiIsImhpbnQiOiIiLCJvcmlnaW5hbCI6IjEiLCJodG1sX3RpdGxlIjoiMCIsInByb2JsZW1fbGFuZ190Y29kZSI6IkVuZ2xpc2gifV0=

출처

ICPC > Regionals > South Pacific > South Pacific Region > New Zealand Programming Contest > NZPC 2006 B번

  • 문제를 번역한 사람: kks227
#include <iostream>
using namespace std;

int Reverse(int n)
{
	int result = 0;
	int powValue = 10000;
	int place = 1;
	bool isPlaceCheck = false;
	for (int i = 0; i < 5; i++)
	{
		if (n / powValue != 0)
		{
			isPlaceCheck = true;
			result += (n / powValue) * place;
			n %= powValue;
		}

		if (isPlaceCheck)
			place *= 10;

		powValue /= 10;
	}
	return result;
}
int main()
{
	int N;
	string result;
	while (1)
	{
		cin >> N;
		if (N == 0)
			return 0;
		result = N == Reverse(N) ? "yes" : "no";
		cout << result << endl;
	}

	return 0;
}

 

 

 

#include <iostream>
using namespace std;

int Reverse(int n)
{
	int result=0;
	while (n > 0)
	{
		result *= 10;
		result += n % 10;
		n /= 10;
	}
	return result;
}
int main()
{
	int N;
	string result;
	while (1)
	{
		cin >> N;
		if (N == 0)
			return 0;
		result = N == Reverse(N) ? "yes" : "no";
		cout << result << endl;
	}

	return 0;
}
728x90
반응형

'알고리즘 > solved.ac' 카테고리의 다른 글

[class2] (백준 2869) 달팽이는 올라가고 싶다.  (0) 2021.09.26
[class2] (백준 2839) 설탕 배달  (0) 2021.09.26
[class2] (백준 15829) Hashing  (0) 2021.09.25
[class2] (백준 1929) 소수 구하기  (1) 2021.09.24
[class2] (백준 2798) 블랙잭  (0) 2021.09.24
    '알고리즘/solved.ac' 카테고리의 다른 글
    • [class2] (백준 2869) 달팽이는 올라가고 싶다.
    • [class2] (백준 2839) 설탕 배달
    • [class2] (백준 15829) Hashing
    • [class2] (백준 1929) 소수 구하기
    chaesoo
    chaesoo

    티스토리툴바