740A Alyona and copybooks codeforces
来源:互联网 发布:stc拆分盘源码 编辑:程序博客网 时间:2024/05/17 22:02
#include<bits/stdc++.h>using namespace std;int main(){ long long n,a,b,c; cin>>n>>a>>b>>c; if(n%4==0) { cout<<0<<endl; } else { int rest=n%4; rest=4-rest; if(rest==1) { if(b+c<a||c*3<a) { if(b+c<c*3) cout<<b+c<<endl; else cout<<c*3<<endl; } else cout<<a<<endl; } else if(rest==2) { if(a*2<b||c*2<b) { if(a*2<c*2) cout<<a*2<<endl; else cout<<c*2<<endl; } else { cout<<b<<endl; } } else if(rest==3) { if(a*3<c||a+b<c) { if(a*3<a+b) cout<<a*3<<endl; else cout<<a+b<<endl; } else { cout<<c<<endl; } } } return 0;}
0 0
- 【20.23%】【codeforces 740A】Alyona and copybooks
- Codeforces 740A Alyona and copybooks
- CodeForces 740A Alyona and copybooks
- CodeForces 740A - Alyona and copybooks(思维)
- 740A Alyona and copybooks codeforces
- codeforces 740A Alyona and copybooks
- codeforces 381A. Alyona and copybooks=
- A.Alyona and copybooks
- A. Alyona and copybooks
- CF 740 A. Alyona and copybooks
- Codeforces Round #381 (Div. 2) A Alyona and copybooks
- Codeforces#381(Div. 2) A.Alyona and copybooks【暴力】
- Codeforces Round #381 (Div. 2) A.Alyona and copybooks
- Codeforces Round #381 (Div. 2) A. Alyona and copybooks
- Codeforces Round #381 (Div. 2) A. Alyona and copybooks
- A. Alyona and copybooks--思维水题
- Codeforces Round #381 (Div. 2) A. Alyona and copybooks(思维)
- Codeforces Round #381 (Div. 2) A. Alyona and copybooks(模拟)
- netstat 命令的 学习笔记
- Spinner
- 指数分布
- sklearn 学习笔记一:开始学习sklearn
- Hibernate 性能操作
- 740A Alyona and copybooks codeforces
- 格式化输入输出
- 740B Alyona and flowers codeforces
- bzoj2821
- [LeetCode]Median of Two Sorted Arrays(Java)
- 235. Lowest Common Ancestor of a Binary Search Tree(unsolved)
- tomcat 转发http请求到https
- HTML5本地数据库存储的应用
- hibernate 查询语句