Hello World!

https://www.acmicpc.net/problem/1351 코드#include #include using namespace std;#define FASTIO ios::sync_with_stdio(false);cin.tie(NULL);typedef long long ll;unordered_map m; ll n, p, q;ll solve(ll now) { if (m[now] != 0) return m[now]; m[now] = solve(now / p) + solve(now / q); return m[now];}int main() { FASTIO; cin >> n >> p >> q; m[0] = 1; cout 설명재귀함수를 문제에서 제시된 식 형태로 계속 호출해나가며 답을 구해나간다. 느낀 점구현 자..

https://www.acmicpc.net/problem/3190 코드#include #include #include using namespace std;#define FASTIO ios::sync_with_stdio(false);cin.tie(NULL);#define MAX 101typedef pair dir;typedef pair pi;int n, k, l, ans = 1, arr[MAX][MAX], dirCnt, nowDir, x, y;bool isMeet() { if (nowDir == 0) { x++; if (x == n) return true; } else if (nowDir == 1) { y++; if (y == n) return true; } else if (nowDir == 2) ..