BOJ

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

180104_13116_30번

//https://www.acmicpc.net/problem/13116 #include #include using namespace std;int a[11];int b[11]; int main() { int T, A, B; bool chk; cin >> T; for(int tc=0 ; tc> A >> B; memset(a,0,11*sizeof(int)); memset(b,0,11*sizeof(int)); int j=0; for(int i=A; i>0; i/=2) a[j++]=i; j=0; for(int i=B; i>0; i/=2) b[j++]=i; chk=0; for(int i=0; i

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

180101_11047_동전0

//https://www.acmicpc.net/problem/11047#include using namespace std;int money[10]; int main() { int n,K,ans; cin >> n >> K; for(int i=0; i> money[i]; ans=0; for(int i=n-1; i>=0; i--) { if((K/money[i]) >0) ans+=K/money[i]; K%=money[i]; } cout

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

171230_2217_로프

//https://www.acmicpc.net/problem/2217#include #include using namespace std; int main() { int n,tmp; int rope[100001]; int ans=0; cin >> n; for(int i=1; i> rope[i]; sort(rope+1, rope+n+1); for(int i=1; i

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

171229_11399_ATM

//https://www.acmicpc.net/problem/11399#include #include using namespace std;int time1[1000]; int main() { int n,ans; cin >> n; for(int i=0; i> time1[i]; sort(time1, time1+n); ans=0; for(int i=0; i

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