CF740A.Alyona and copybooks
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Little girl Alyona is in a shop to buy some copybooks for school. She study four subjects so she wants to have equal number of copybooks for each of the subjects. There are three types of copybook's packs in the shop: it is possible to buy one copybook for a rubles, a pack of two copybooks for b rubles, and a pack of three copybooks for c rubles. Alyona already has n copybooks.
What is the minimum amount of rubles she should pay to buy such number of copybooks k that n+k is divisible by 4 ? There are infinitely many packs of any type in the shop. Alyona can buy packs of different type in the same purchase.
输入格式
The only line contains 4 integers n , a , b , c ( 1<=n,a,b,c<=109 ).
输出格式
Print the minimum amount of rubles she should pay to buy such number of copybooks k that n+k is divisible by 4 .
输入输出样例
输入#1
1 1 3 4
输出#1
3
输入#2
6 2 1 1
输出#2
1
输入#3
4 4 4 4
输出#3
0
输入#4
999999999 1000000000 1000000000 1000000000
输出#4
1000000000
说明/提示
In the first example Alyona can buy 3 packs of 1 copybook for 3a=3 rubles in total. After that she will have 4 copybooks which she can split between the subjects equally.
In the second example Alyuna can buy a pack of 2 copybooks for b=1 ruble. She will have 8 copybooks in total.
In the third example Alyona can split the copybooks she already has between the 4 subject equally, so she doesn't need to buy anything.
In the fourth example Alyona should buy one pack of one copybook.