BOJ

알고리즘 문제 풀이/1DP_과제(~180615)

171228_2167_2차원 배열의 합

//https://www.acmicpc.net/problem/2167 #include using namespace std;int arr[301][301]; int main(){ int n, m, k, dp; cin >> n >> m; for(int i=1; i arr[i][j]; cin >> k; for(int a=0; a> i >> j >> x >> y; int sum=0; for(int b=i; b

알고리즘 문제 풀이/1DP_과제(~180615)

171227_2563_색종이

//https://www.acmicpc.net/problem/2563#include using namespace std;bool paper[100][100]; int main(){ int n,ans,x,y; cin >> n; ans=0; for(int i=0 ; i> x >> y; for(int j=0; j

알고리즘 문제 풀이/1DP_과제(~180615)

171226_2998_8진수

//https://www.acmicpc.net/problem/2998 #include #include using namespace std; int main() { string bin; cin >> bin; int l=bin.size(); int x; int r=l%3; if(r==1) cout

알고리즘 문제 풀이/1DP_과제(~180615)

171225_12790_Mini Fantasy War

//https://www.acmicpc.net/problem/12790 #include using namespace std; int main(){ int T; cin >> T; int hp, mp, atk,def; int a,b,c,d,ans; for(int i=0; i> hp >> mp >> atk >> def >> a >> b >> c >> d; hp+=a; mp+=b; atk+=c; def+=d; if(hp

bong sue
'BOJ' 태그의 글 목록 (19 Page)