Alyona and copybooks
题目描述
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 3 4
3
6 2 1 1
1
4 4 4 4
0
999999999 1000000000 1000000000 1000000000
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.
题目来源：fps-www.educg.net-codeforce-1-2833.xml.zip；FPS 共享题包，题包内第 458 题。保留原作者与原赛事署名。