Skip to content

Instantly share code, notes, and snippets.

#include <iostream>
#include <string.h>
using namespace std;
int board[9][9];
bool printed = false; //전체 재귀의 종료 여부
void PrintBoard(){
for(int i=0; i<9 ; ++i){
for(int j=0; j<9 ; ++j){
@overnew
overnew / 벽 부수고 이동하기.cpp
Created September 5, 2020 02:28
Bfs 문제풀이
#include <iostream>
#include<queue>
#include<string>
#include<string.h>
using namespace std;
int N,M;
int map[1001][1001];
int short_cut[1001][1001][2]; //벽을 뚤은 경우와 안 뚤은 경우 두가지를 서로 다르게 저장
int ch_r[4] = {1,0,-1,0};
@overnew
overnew / 부분수열의 합.cpp
Created September 5, 2020 07:26
백트래킹
#include <iostream>
#include <string.h>
using namespace std;
int N,S;
int arr[20];
bool selected[20];
int count =0;
void Recursive(int n,int cnt,int sum,int idx){
@overnew
overnew / FESTIVAL.cpp
Created October 11, 2020 14:09
FESTIVAL 정답 코드
#include<iostream>
using namespace std;
int borrowCost[1000];
int main(){
int numTest;
int maxDays,numTeam;
double minCost;
double divResult;
@overnew
overnew / BOGGLE.cpp
Created October 14, 2020 10:10
BOGGLE 코드
#include<iostream>
#include<string>
#include<string.h>
using namespace std;
char board[5][5];
bool posAlphabet[5][5][10];
int wordNum;
string words[10];
bool isPosWords[10];
@overnew
overnew / PICNIC.cpp
Last active October 14, 2020 14:23
알고스팟 picnic - 소풍 정답코드
#include<iostream>
#include<string.h>
using namespace std;
int studentNum;
int partnerNum;
int totalPairNum;
bool partnerBoard[45][45];
bool isPosMatch[10];
@overnew
overnew / BOARDCOVER.cpp
Created October 16, 2020 13:57
BOARDCOVER 해답 코드
#include<iostream>
#include<string.h>
using namespace std;
char board[20][20];
int height, width;
int whiteNum;
int blockModel[4][2][2] ={{{1,0},{1,1}}, {{0,1},{1,1}},{{1,-1},{1,0}},{{0,1},{1,0}} }; //row, column순
@overnew
overnew / BOARDCOVER.cpp
Created October 16, 2020 14:05
알고스팟 보드게임 정답 코드
#include<iostream>
#include<string.h>
using namespace std;
char board[20][20];
int height, width;
int whiteNum;
int blockModel[4][2][2] ={{{1,0},{1,1}}, {{0,1},{1,1}},{{1,-1},{1,0}},{{0,1},{1,0}} }; //row, column순
@overnew
overnew / CLOCKSYNC.cpp
Created October 18, 2020 07:58
CLOCKSYNC 정답 코드
#include<iostream>
#include<vector>
#include<string.h>
using namespace std;
int pushedNum[10]; //누른 스위치의 위치에 그 횟수를 저장
int clockState[16];
vector<vector<int>> clockSwitch;
int minimum =INT32_MAX;
@overnew
overnew / 2048 (Easy).cpp
Created October 19, 2020 10:35
2048 (Easy) 정답 코드
#include<iostream>
#include<vector>
#include<string.h>
using namespace std;
int boardSize;
int maxBlock =0;
void MoveDown(vector<vector<int>> &board){
for(int row=boardSize-1; row>0 ; --row)