알고리즘 문제 풀이/1DP_과제(~180615)
2017.10.30
1234567891011121314151617181920212223242526272829303132333435363738#include #include using namespace std; int main(){ for(int i=1; i> dump; int box[100]; int sum=0; int max_idx, min_idx; int H_max=0; int H_min=101; for(int j=0; j> box[j]; if(H_max box[j]) {H_min=box[j]; min_idx=j;} } while(dump--) { box[max_idx]--; box[min_idx]++; H_max=0; H_min=10..
알고리즘 문제 풀이/1DP_과제(~180615)
2017.10.30
12345678910111213141516171819202122232425#include using namespace std;int max(int a,int b) {return a>b ? a:b;}int main(){ for(int i=0; i
알고리즘 문제 풀이/1DP_과제(~180615)
2017.10.30
123456789101112131415161718192021#include using namespace std; int main(){ int N; cin >> N; for(int i=1; i
알고리즘 문제 풀이/1DP_과제(~180615)
2017.10.28
1234567891011121314151617181920212223242526#include using namespace std; int main(){ int T; cin >> T; for(int i=1; i> N >> M; int map[15][15]; int max=0; for(int x=0; x map[x][y]; for(int x=0; x
