overnew

#include<iostream>
#include<vector>
using namespace std;

int row,column;
int MaxTet=0;
vector<vector<int>> board;

int tetrominoModel[19][3][2]={     /* (0,0)의 현재 위치로 부터 상대적인 위치 */
  {{0,1},{0,2},{0,3}}, 

overnew

#include<iostream>
#include<vector>
#include<cmath>
using namespace std;

int N;
int countDescendNum=9;
vector<long long> descendNumberSet;

void FindDescendNumber(int cnt){

overnew

#include<iostream>
#include<vector>
#include<string.h>
#include<cmath>
using namespace std;

int row,col;
int attackRange;
vector<vector<int>> board;
vector<bool> isArcherPosition;

overnew

#include <iostream>
#include<string>
using namespace std;

int main() {
  string document;
  string word;
  int count=0;

  getline(cin,document);

overnew

#include <iostream>
using namespace std;

const int boardSize = 10;
int board[10][10];
int minUsedPaperNum=25;   //최대 사용개수는 25
int remainedColoredPaper[6] = {0,5,5,5,5,5};

bool CheckPosFill(int paperSize, int r, int c){
  for(int i=r; i<r+paperSize ; ++i)

overnew

#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

#include <iostream>
#include<string>
using namespace std;

string Decompress(string ori){
  if(ori[0] != 'x'){
    return ori;
  }

  int subStrOrder=0;

overnew

#include <iostream>
#include<vector>
#include<string>
using namespace std;

int paper_size;
int paper_count[3]; // -1 => [0], 0=>[1] , 1=>[2]에 저장
vector<vector<int>> origin_paper;

int CountPaperValue(int size,int row,int col){

overnew

#include <iostream>
#include<vector>
using namespace std;

int matrix_size;
long long B;
vector<vector<int>> matrix_A;

vector<vector<int>> multiplyMatrix(const vector<vector<int>>& matrix_left,const vector<vector<int>>& matrix_right ){
  vector<vector<int>> result_matrix;

overnew

#include <iostream>
#include<algorithm>
using namespace std;

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);

  int N;
  pair<int,int> points[1000000];