HDU 5143 NPY and arithmetic progression DFS
来源:互联网 发布:网络1元乞讨 编辑:程序博客网 时间:2024/05/16 06:23
NPY and arithmetic progression
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 309 Accepted Submission(s): 95
Problem Description
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?
He thinks it's easy to understand,and he found a challenging problem from his talented math teacher:
You're given four integers,
Attention: You must use every number exactly once.
Can you solve this problem?
Input
The first line contains a integer T — the number of test cases (1≤T≤100000 ).
The next T lines,each contains 4 integersa1,a2,a3,a4(0≤a1,a2,a3,a4≤109) .
The next T lines,each contains 4 integers
Output
For each test case,print "Yes"(without quotes) if the numbers can be divided properly,otherwise print "No"(without quotes).
Sample Input
31 2 2 11 0 0 03 0 0 0
Sample Output
YesNoYesHintIn 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}./*HDU 5143 DFS 比赛时没看懂题目,参考别人的; DFS多余3个的数可以自己成等比数列和其他数组合成等比数列的有1,2,3, 2,3,4 1,2,3,4 三种情况*/#include<iostream>#include<stdio.h>using namespace std;bool check(int a,int b,int c,int d) { if(a==0&&b==0&&c==0&&d==0) return true; //数为0,或者>=3 if( ((a!=0&&a>=3)||(a==0)) && ((b!=0&&b>=3)||(b==0)) && ((c!=0&&c>=3)||(c==0)) && ((d!=0&&d>=3)||(d==0)) ) return true; if(a-1>=0&&b-1>=0&&c-1>=0&&d-1>=0) //1234 if(check(a-1,b-1,c-1,d-1)) return true; if(a-1>=0&&b-1>=0&&c-1>=0) //123 if(check(a-1,b-1,c-1,d)) return true; if(b-1>=0&&c-1>=0&&d-1>=0) //234 if(check(a,b-1,c-1,d-1)) return true; return false; } int main(){int t,a,b,c,d,sum;scanf("%d",&t);while(t--){scanf("%d%d%d%d",&a,&b,&c,&d);if(check(a,b,c,d))printf("Yes\n");elseprintf("No\n");}return 0;}
0 0
- HDU 5143 NPY and arithmetic progression DFS
- HDU 5143 NPY and arithmetic progression DFS
- HDOJ 5143 NPY and arithmetic progression DFS
- hdu 5143 NPY and arithmetic progression
- HDU 5143 NPY and arithmetic progression
- hdu 5143 NPY and arithmetic progression
- hdu 5143 NPY and arithmetic progression(枚举)
- HDU 5143 NPY and arithmetic progression(思维题)
- hdu 5143 NPY and arithmetic progression(思路,枚举)
- HDU 5143 NPY and arithmetic progression 思维+枚举
- HDOJ 5143 NPY and arithmetic progression
- HDU 5143 NPY and arithmetic progression (枚举基本类型123、234、1234的个数)
- 【CUGBACM15级BC第22场 B】hdu 5143 NPY and arithmetic progression
- HDU5143 NPY and arithmetic progression【暴力】
- HDU5142 NPY and arithmetic progression && BestCoder Round #23 1002
- ARITHMETIC PROGRESSION
- Arithmetic Progression
- Arithmetic Progression
- 第十六周项目1按给定部分程序的要求,用指向数组的指针变量作为形式参数编写函数,完成排序
- 第16周-逆序输出数组
- 十大编程算法助程序员走上高手之路
- 不要抱有房地产再次高潮幻想
- MySQL联合查询
- HDU 5143 NPY and arithmetic progression DFS
- Activity-ListView再现经典讲解
- 上传到
- HDU 5144 NPY and shot 物理题,抛球距离最远
- 身陷敌阵
- 第十六周项目2——去除第一个单词前的空格
- 关于FAT32转换成NTFS失败问题
- ARM嵌入式软件编程杂谈
- C++代码 检测某进程是否开启