| //https://www.acmicpc.net/problem/12790 #include <iostream> |
| 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< T; i++) |
| { |
| cin >> hp >> mp >> atk >> def >> a >> b >> c >> d; |
| hp+=a; |
| mp+=b; |
| atk+=c; |
| def+=d; |
| if(hp<1) hp=1; |
| if(mp<1) mp=1; |
| if(atk<0) atk=0; |
| ans=hp+5*mp+2*atk+2*def; |
| cout << ans << endl; |
| } |
| } |
'알고리즘 문제 풀이 > 1DP_과제(~180615)' 카테고리의 다른 글
| 171227_2563_색종이 (0) | 2017.12.27 |
|---|---|
| 171226_2998_8진수 (0) | 2017.12.26 |
| 171224_1789_수들의 합 (0) | 2017.12.24 |
| 171224_10886_0 = not cute / 1 = cute (0) | 2017.12.24 |
| 171224_10798_세로읽기 (0) | 2017.12.24 |