목록코딩테스트/프로그래머스 (64)
bdfgdfg
#include #include using namespace std; int solution(int n) { int answer = 0; for(int i = 2; i < n; ++i) { if(n % i == 1) { answer = i; break; } } return answer; }
#include #include using namespace std; int CalDistance(pair& handPos, pair& targetPos) { int dist = (handPos.first > targetPos.first) ? handPos.first - targetPos.first : targetPos.first - handPos.first; if (handPos.second == 1) // 2580 라인일때 return dist; return dist + 1; } void CheckHand(string& answer, pair& leftHandPos, pair& rightHandPos, pair targetPos,string& hand) { int left = CalDistance(l..
#include #include using namespace std; string solution(string new_id) { // . 은 처음과 끝 x 연속사용x string answer = ""; for (auto it = new_id.begin(); it != new_id.end();) { if (*it >= 'A' && *it = 'a' && *it = '0' && *it = 16) { new_id.resize(15); len = 15; if (new_id[14] == '.') { new_id.resize(14); len = 14; } } else if (len
#include #include #include using namespace std; vector solution(vector lottos, vector win_nums) { vector answer; answer.reserve(2); int high = 0, low = 0, cor = 0, cnt = 0; //sort(lottos.begin(), lottos.end()); //sort(win_nums.begin(), win_nums.end()); for (int i = 0; i < 6; ++i) { if (lottos[i] == 0) ++cnt; for (int j = 0; j < 6; ++j) { if (lottos[i] == win_nums[j]) ++cor; } } low = cor; high =..