백준 20233번 Bicycle

문제 링크입니다: www.acmicpc.net/problem/20233

20233번: Bicycle

간단한 구현 문제였습니다.

 

	#include <iostream>
	#include <algorithm>
	using namespace std;
	const int WORKING_DAY = 21;
	const int FIRST_OPTION_FREE_MINUTE = 30;
	const int SECOND_OPTION_FREE_MINUTE = 45;
	int main(void)
	{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int a, x, b, y, T;
	cin >> a >> x >> b >> y >> T;
	int firstOption = max(0, T - FIRST_OPTION_FREE_MINUTE) * x * WORKING_DAY + a;
	int secondOption = max(0, T - SECOND_OPTION_FREE_MINUTE) * y * WORKING_DAY + b;
	cout << firstOption << " " << secondOption << "\n";
	return 0;
	}

view raw .cpp hosted with ❤ by GitHub

 

개발환경:Visual Studio 2017

 

지적, 조언, 질문 환영입니다! 댓글 남겨주세요~