303837: CF740A. Alyona and copybooks

Memory Limit:256 MB Time Limit:1 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Alyona and copybooks

题意翻译

## 题目描述 Alyona在学校学习4门课程,她要去书店买书。她想让给4门课程中每门课买的书数量相同,开始时有$n$本书。书店有3种书:第一种买一次只能买一本,花费$a$卢布;第二种买一次能买两本,花费$b$卢布;第三种买一次能买三本,花费$c$卢布。每种书都有无限多个。问最少要花多少卢布? ## 输入格式 一行,$n$,$a$,$b$,$c$(1<=$n$,$a$,$b$,$c$<=$10^9$)。 ## 输出格式 输出Alyona最少需要花多少卢布以保证符合要求。

题目描述

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<=10^{9} $ ).

输出格式


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.

Input

题意翻译

## 题目描述 Alyona在学校学习4门课程,她要去书店买书。她想让给4门课程中每门课买的书数量相同,开始时有$n$本书。书店有3种书:第一种买一次只能买一本,花费$a$卢布;第二种买一次能买两本,花费$b$卢布;第三种买一次能买三本,花费$c$卢布。每种书都有无限多个。问最少要花多少卢布? ## 输入格式 一行,$n$,$a$,$b$,$c$(1<=$n$,$a$,$b$,$c$<=$10^9$)。 ## 输出格式 输出Alyona最少需要花多少卢布以保证符合要求。

加入题单

算法标签: