HDU NPY and arithmetic progression(BestCoder Round #22)
2015-11-09 16:19
375 查看
[align=left]Problem Description:[/align]
NPY is learning arithmetic progression in his math class. In mathematics, an arithmetic progression (AP) is a sequence of numbers such that the difference between the consecutive terms is constant.(from wikipedia)
He thinks it's easy to understand,and he found a challenging problem from his talented math teacher:
You're given four integers, a1,a2,a3,a4, which are the numbers of 1,2,3,4 you have.Can you divide these numbers into some Arithmetic Progressions,whose lengths are equal to or greater than 3?(i.e.The number of AP can be one)
Attention: You must use every number exactly once.
Can you solve this problem?
[align=left]Input:[/align]
The first line contains a integer T — the number of test cases (1≤T≤100000).
The next T lines,each contains 4 integers a1,a2,a3,a4(0≤a1,a2,a3,a4≤109).
[align=left]Output:[/align]
For each test case,print "Yes"(without quotes) if the numbers can be divided properly,otherwise print "No"(without quotes).
[align=left]Sample Input:[/align]
3
1 2 2 1
1 0 0 0
3 0 0 0
[align=left]Sample Output:[/align]
Yes
No
Yes
Hint:
In the first case,the numbers can be divided into {1,2,3} and {2,3,4}. In the second case,the numbers can't be divided properly. In the third case,the numbers can be divided into {1,1,1}.
题意:给出a,b,c,d,代表数字1,2,3,4的个数,现在要判断这些数字完全能否组成等差数列(每个数字要用完),因为只有1,2,3,4这四个数,所以等差数列只有1,1,1; 2,2,2; 3,3,3; 4,4,4; 1,2,3; 2,3,4; 1,2,3,4。
NPY is learning arithmetic progression in his math class. In mathematics, an arithmetic progression (AP) is a sequence of numbers such that the difference between the consecutive terms is constant.(from wikipedia)
He thinks it's easy to understand,and he found a challenging problem from his talented math teacher:
You're given four integers, a1,a2,a3,a4, which are the numbers of 1,2,3,4 you have.Can you divide these numbers into some Arithmetic Progressions,whose lengths are equal to or greater than 3?(i.e.The number of AP can be one)
Attention: You must use every number exactly once.
Can you solve this problem?
[align=left]Input:[/align]
The first line contains a integer T — the number of test cases (1≤T≤100000).
The next T lines,each contains 4 integers a1,a2,a3,a4(0≤a1,a2,a3,a4≤109).
[align=left]Output:[/align]
For each test case,print "Yes"(without quotes) if the numbers can be divided properly,otherwise print "No"(without quotes).
[align=left]Sample Input:[/align]
3
1 2 2 1
1 0 0 0
3 0 0 0
[align=left]Sample Output:[/align]
Yes
No
Yes
Hint:
In the first case,the numbers can be divided into {1,2,3} and {2,3,4}. In the second case,the numbers can't be divided properly. In the third case,the numbers can be divided into {1,1,1}.
题意:给出a,b,c,d,代表数字1,2,3,4的个数,现在要判断这些数字完全能否组成等差数列(每个数字要用完),因为只有1,2,3,4这四个数,所以等差数列只有1,1,1; 2,2,2; 3,3,3; 4,4,4; 1,2,3; 2,3,4; 1,2,3,4。
#include<stdio.h> #include<string.h> #include<queue> #include<math.h> #include<stdlib.h> #include<algorithm> using namespace std; const int N=1e6+10; const int INF=0x3f3f3f3f; const int MOD=1e9+7; typedef long long LL; int Judge(int a, int b, int c, int d) { if ((a >= 3 || a == 0) && (b >= 3 || b == 0) && (c >= 3 || c == 0) && (d >= 3 || d == 0)) return 1; ///如果有三个一样的数就可以组成一个等差数列了;当所有数都被用完时,肯定可以被分的完全 if (a >= 1 && b >= 1 && c >= 1 && d >= 1) { if (Judge(a-1, b-1, c-1, d-1)) ///组成1,2,3,4的等差数列 return 1; } if (b >= 1 && c >= 1 && d >= 1) { if (Judge(a, b-1, c-1, d-1)) ///组成2,3,4的等差数列 return 1; } if (a >= 1 && b >= 1 && c >= 1) { if (Judge(a-1, b-1, c-1, d)) ///组成1,2,3的等差数列 return 1; } return 0; } int main () { int T, i, ans, a[10]; scanf("%d", &T); while (T--) { for (i = 0; i < 4; i++) scanf("%d", &a[i]); ans = Judge(a[0], a[1], a[2], a[3]); if (ans == 1) printf("Yes\n"); else printf("No\n"); } return 0; }
相关文章推荐
- Java汉字转拼音pinyin4j用法
- 2.6版Linux内核中涉及的结构体指定初始化项目解析
- 高精度AD芯片ADS8364在生理信号数据采集中的应用
- math.h里的数学计算公式介绍
- Msp430定时器的介绍及其基本应用
- MSP430单片机__中断服务
- 寻迹小车 FOLLOWME—— 电机测速及转速控制
- C嵌入汇编
- 在线汇编编写代码
- AVR使用范例--定时器实现PWM功能
- 控制全局变量初始化顺序 && #pragma详解
- 安装Matlab 7.0 步骤和常见问题
- Code Co-op 教程
- Ubuntu下编译C程序
- C经典书籍
- AVR中断详解
- JDBC
- android+string.xml;
- 第9周 项目3 - 稀疏矩阵的三元组表示的实现及应用
- AJAX文件上传插件