문제 링크 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5PjMgaALgDFAUq
문제의 저작권은 SW Expert Academy에 있습니다.
#include <iostream> using namespace std; int main(void) { int T, N, CMD, delta; cin >> T; for(int t_case=0; t_case<T; t_case++) { int speed=0, distance = 0; cin >> N; for(int i=0; i<N; i++) { cin >> CMD; switch(CMD) { case 0: distance += speed; break; case 1: cin >> delta; speed += delta; distance += speed; break; case 2: cin >> delta; speed -= delta; if(speed < 0) speed = 0; distance += speed; break; } } cout << "#" << t_case+1 << " " << distance << "\n"; } return 0; } | cs |
'C & C++ > SW Expert Academy' 카테고리의 다른 글
SWEA 1288 - 새로운 불면증 치료법 (0) | 2018.04.28 |
---|---|
SWEA 1928 - Base64 Decoder (0) | 2018.04.28 |
SWEA 1945 - 간단한 소인수분해 (0) | 2018.04.28 |
SWEA 1946 - 간단한 압축 풀기 (0) | 2018.04.28 |
SWEA 1948 - 날짜 계산기 (0) | 2018.04.28 |