//https://www.acmicpc.net/problem/14501 #include #include using namespace std; int N; int counsel[16][2];int dp[16]; void input();void solve(int today, int earn); int main(){ cin >> N; input(); solve(counsel[1][0], counsel[1][1]); solve(1, 0); cout counsel[i][0] >> counsel[i][1];} void solve(int today, int earn){ if(today=N){ return; } solve(today+counsel[today+1][0], earn+counsel[today+1][1]); ..
//https://www.acmicpc.net/problem/14500 #include #include using namespace std; int map[500][500];bool visited[500][500]; int dy[4]={0,0,1,-1};int dx[4]={1,-1,0,0};int N, M;int mx=0; void solve(int y, int x, int now);void dfs(int y, int x, int now, int depth); int main(){ cin >> N >> M; for(int i=0; i map[i][j]; } } for(int i=0; i
//https://www.acmicpc.net/problem/14499 #include using namespace std;#define east 1#define west 2#define north 3#define south 4 int map[20][20];class dice{public: int U;//up int B;//bottom int E;//east int W;//west int N;//north int S;//south int y; int x; dice(int _U=0, int _B=0, int _E=0, int _W=0, int _N=0, int _S=0): U(_U), B(_B), E(_E), W(_W), N(_N), S(_S) {}};int dy[5]={0, 0, 0, -1, 1};int..
//https://www.acmicpc.net/problem/2810#include using namespace std; int main(){ int N; char chair[50]; cin >> N; int ans=1; bool chk=0; for(int i=0; i> chair[i]; if(chair[i]=='S') ans++; if(chair[i]=='L'){ if(!chk) chk=1; else { ans++; chk=0; } } } if(ans
