Try

#include #include using namespace std; int solution(int n) { int answer = 0; int a = 0; int b = 1; int c = 0; for(int i = 1; i < n; i++){ c = (a + b) % 1234567; a = b; b = c; } return c; } 출처 https://programmers.co.kr/learn/courses/30/lessons/12945?language=cpp#

#include #include using namespace std; int GCD(int a, int b){ int c; while(b != 0){ c = a % b; a = b; b = c; } return a; } int LCM(int a, int b){ return a * b / GCD(a, b); } int solution(vector arr) { int answer = 0; int lcm = 1; for(int i = 0; i < arr.size(); i++){ lcm = LCM(lcm, arr[i]); } answer = lcm; return answer; } 출처 https://programmers.co.kr/learn/courses/30/lessons/12953

#include #include #include using namespace std; vector solution(vector heights) { vector answer; for(int i = heights.size()-1; i>=0; i--) { for(int j = i-1; j>=0; j--) { if(i == 0) { answer.push_back(0); break; } else if(heights[j] > heights[i] && i != j) { answer.push_back(j+1); break; } else if (j==0) { answer.push_back(0); break; } } } answer.push_back(0); reverse(answer.begin(), answer.end()..

출처 https://programmers.co.kr/learn/courses/30/lessons/12928 #include #include using namespace std; int solution(int n) { int answer = 0; for(int i = 1; i

https://programmers.co.kr/learn/courses/30/lessons/12916 #include #include using namespace std; bool solution(string s) { bool answer = true; int y_cnt = 0; int p_cnt = 0; for(int i = 0; i < s.size(); i++){ if(s[i] == 'p' || s[i] == 'P') p_cnt++; else if(s[i] == 'y' || s[i] == 'Y') y_cnt++; else continue; } if(p_cnt != y_cnt) answer = false; return answer; } 간단한것도 있었네요..