백준

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

180119_1159_농구경기

//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)

180105_10707_수도요금

//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

알고리즘 문제 풀이/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

bong sue
'백준' 태그의 글 목록 (20 Page)