알고리즘 문제 풀이/1DP_과제(~180615)
2018.01.19
//https://www.acmicpc.net/problem/1159#include using namespace std;int cntalphb[26]; int main() { int n; cin >> n; bool chk=0; for(int i=0; i> name; cntalphb[name[0]-'a']++; } for(int i=0; i=5) { chk=1; cout
알고리즘 문제 풀이/1DP_과제(~180615)
2018.01.06
#include #include using namespace std; int main(){ int T; cin >> T; for(int i=1; i> a>> b; int la=a.size(); int lb=b.size(); int cnt=0; for(int j=0; j
알고리즘 문제 풀이/1DP_과제(~180615)
2018.01.06
//https://www.acmicpc.net/problem/2914#include using namespace std; int main() { int a, b; cin >> a >> b; cout
알고리즘 문제 풀이/1DP_과제(~180615)
2018.01.05
//https://www.acmicpc.net/problem/10707 #include using namespace std; int main(){ int a,b,c,d,p; cin >>a >> b >> c>> d>> p; int costx=a*p; int costy=(p>c ?b+d*(p-c) :b ); if(costx>costy) cout