๐Ÿ˜Š1436๋ฒˆ. ์˜ํ™”๊ฐ๋… ์ˆŒ. string find!

phoenixKimยท2022๋…„ 9์›” 3์ผ
0

๋ฐฑ์ค€ ์•Œ๊ณ ๋ฆฌ์ฆ˜

๋ชฉ๋ก ๋ณด๊ธฐ
101/174

string์—์„œ์˜ find

: ์ผ๋ฐ˜ ์ปจํ…Œ์ด๋„ˆ์˜ find๋Š” end()๊ฐ’์œผ๋กœ ์ฒ˜๋ฆฌ๋ฅผ ํ•˜์ง€๋งŒ,

  • string์˜ find๋Š” ์ฐพ๊ฒŒ๋˜๋ฉด, ์ฒซ๋ฒˆ์งธ ์ธ๋ฑ์Šค๋ฅผ ๋ฐ˜ํ™˜ํ•จ.
    ๋ชป์ฐพ์œผ๋ฉด, string::npos๋ฅผ ๋ฐ˜ํ™˜ํ•จ.
    https://velog.io/@kwt0124/find-%ED%95%A8%EC%88%98

๊ฐœ์„ ํ•  ์ .

1) ๋ฌด์‹ํ•˜๊ฒŒ ํ’€์–ด๋ณด๋„๋ก ํ•˜์ž.
2) ๋‹ค๋ฅธ ๋ฐฉ๋ฒ•์ด ์žˆ๋Š”์ง€ ์ฐพ์•„๋ณด์ž.

์ฝ”๋“œ

#include <iostream>
#include <list>
using namespace std;
#include <map>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>


// 1436๋ฒˆ. ์˜ํ™”๊ฐ๋… ์ˆŒ
// 17:55 ~ 

int main()
{
	
	int n;
	cin >> n;

	int num = 666;
	int cnt = 0;
	while (1)
	{
		string word = to_string(num);

		if (word.find("666") != string::npos)
		{
			//cout << word << endl;

			++cnt;
		}

		if (cnt == n)
			break;
		++num;

	}
	cout << num;
}

profile
๐Ÿ”ฅ๐Ÿ”ฅ๐Ÿ”ฅ

0๊ฐœ์˜ ๋Œ“๊ธ€

๊ด€๋ จ ์ฑ„์šฉ ์ •๋ณด