This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
#include <algorithm> | |
#include <string.h> | |
using namespace std; | |
int n = 0; | |
int dp[1500010]; | |
int input[1500010][2]; | |
int recur(int curr) { | |
if (curr == n) return 0; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
using namespace std; | |
int n = 0; | |
long long dp[91][2]; | |
int main(void) { | |
int n = 0; | |
cin >> n; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
using namespace std; | |
int n = 0; | |
int dp[1001] = { 0 }; | |
int main(void) { | |
int n = 0; | |
cin >> n; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
using namespace std; | |
int n = 0; | |
int dp[1001] = { 0 }; | |
int main(void) { | |
int n = 0; | |
cin >> n; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
using namespace std; | |
int dp[11]; | |
int main(void) { | |
dp[1] = 1; | |
dp[2] = 2; | |
dp[3] = 4; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
#include <queue> | |
using namespace std; | |
int dp[1000001]; | |
int main(void) { | |
int n = 0; | |
cin >> n; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
//5:50 - | |
#include <iostream> | |
#include <queue> | |
#include <stack> | |
using namespace std; | |
int n, k; | |
int map[13][13]; | |
//우 좌 위 아래 | |
int dx[4] = { 0,0,-1, 1 }; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// 02:08 - 03:12 | |
#include <iostream> | |
#include <string.h> | |
using namespace std; | |
int n, m, t; | |
int map[51][51]; | |
bool visited[51][51]; | |
int x[51]; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
#include <string.h> | |
using namespace std; | |
int n,m,t; | |
int map[51][51]; | |
int dust[51][51]; | |
pair<int, int> u = { -1,-1 }; | |
pair<int, int> d = { -1,-1 }; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
#include <vector> | |
#include <queue> | |
#include <tuple> | |
using namespace std; | |
int n=0, m=0,k=0, dist=1; | |
int map[1000][1000]; | |
bool visited[1000][1000][11][2]; | |
int dx[4] ={0,0,1,-1}; |