Codeforces Round #440 (Div. 1) A. Maximum splitting
来源:互联网 发布:为什么要学c语言 编辑:程序博客网 时间:2024/06/06 19:22
题目大意
将一个数分解成若干合数的和,问最多分解成多少个。
题解
贪心用4,6,9来组合,%4=1需要一个9,%4=2需要一个6,%4=3需要一个6一个9,剩下都用4.
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int read(){ char ch=getchar();int f=0; while(ch<'0'||ch>'9') ch=getchar(); while(ch>='0'&&ch<='9') {f=f*10+(ch^48);ch=getchar();} return f;}int main(){ int q=read(); while(q--) { int n=read(); if(n%4==0) { printf("%d\n",n/4); } else if(n%4==2) { if(n<6) printf("%d\n",-1); else printf("%d\n",(n-6)/4+1); } else if(n%4==1) { if(n<9) printf("-1\n"); else printf("%d\n",(n-9)/4+1); } else { if(n<15) printf("-1\n"); else printf("%d\n",(n-15)/4+2); } }}
阅读全文
0 0
- Codeforces Round #440 (Div. 1) A. Maximum splitting
- 【Codeforces Round #440 (Div. 2) C】 Maximum splitting
- Codeforces Round #440 (Div. 2)C. Maximum splitting
- Codeforces Round #440 (Div. 2) C. Maximum splitting
- Codeforces Round #440 (Div. 2,)-数学&规律- Maximum splitting
- Codeforces Round #440 div2 C. Maximum splitting
- Codeforces Round #440 C. Maximum splitting
- A. Lesha and array splitting Codeforces Round #390 (Div. 2)
- Codeforces Round #390 (Div. 2)A Lesha and array splitting
- Codeforces Round #390(Div. 2)A. Lesha and array splitting【思维】
- Codeforces Round #390 (Div. 2) - A Lesha and array splitting (贪心)
- C. Maximum splitting--codeforces
- Codeforces Round #259 (Div. 1) A. Little Pony and Expected Maximum
- Codeforces Round #259 (Div. 1) A Little Pony and Expected Maximum
- [Codeforces Round #452 (Div. 2)] Splitting in Teams
- Codeforces Round #440 (Div. 2) A B
- Educational Codeforces Round 4 A. The Text Splitting
- Codeforces Round #276 (Div. 1) B. Maximum Value
- Jquery表单验证
- AngularJs用户管理
- Xcode9学习笔记5
- Codeforces Round #440 (Div. 2)B. Maximum of Maximums of Minimums
- 073 定积分基本公式牛顿-莱布尼茨公式证明
- Codeforces Round #440 (Div. 1) A. Maximum splitting
- Cocos 中的自动绑定
- 函数一致性导数的定义
- Matlab中image、imagesc和imshow函数用法解析
- Cocos 中的脚本绑定
- 洛谷 P1083 借教室
- 读Zepto源码之Stack模块
- Js C++手动绑定(案例1)
- Codeforces Round #440 div2 B Maximum of Maximums of Minimums