목록전체 글 (253)
bdfgdfg
#include #include using namespace std; bool IsPrime(int num) { for(int prime = 2; prime < num; ++prime) { if(num % prime == 0) return false; } return true; } int solution(vector nums) { int answer = 0; int len = nums.size(); // 2 3 5 7 int i,j,k,num; for(i = 0; i < len; ++i) { for(j = i + 1; j < len; ++j) { for(k = j + 1; k < len; ++k) { if(IsPrime(num = nums[i] + nums[j] + nums[k])) ++answer; }..
#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