HDU 5143 NPY and arithmetic progression (枚举基本类型123、234、1234的个数)
来源:互联网 发布:ios11app下载不了软件 编辑:程序博客网 时间:2024/05/23 00:36
NPY and arithmetic progression
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 799 Accepted Submission(s): 254
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}.
Source
BestCoder Round #22
解题思路:由数字1,2,3,4,组成的等差数列只有123、234、1234和长度>=3的常数列。如果数列123、234和1234的数量大于等于3,那么这些数量的数列可以变为3个或4个常数列,例如:123、123、123变成111、222、333。所以可以直接枚举数列123、234、1234的个数(0~2),再判断数字1、 2、 3、 4的剩余个数,如果是0或者大于等于3,那么就可以。
代码如下:
#include <cstdio>#include <iostream>#include <cstdlib>#include <cstring>#include <cmath>#include <string>#include <algorithm>#include <vector>#include <deque>#include <list>#include <set>#include <map>#include <stack>#include <queue>#include <numeric>#include <iomanip>#include <bitset>#include <sstream>#include <fstream>#include <limits.h>#include <ctime>#define debug "output for debug\n"#define pi (acos(-1.0))#define eps (1e-6)#define inf (1<<28)#define sqr(x) (x) * (x)#define mod 1000000007using namespace std;typedef long long ll;typedef unsigned long long ULL;int main(){ int i,j,k,t; int a1,a2,a3,a4; scanf("%d",&t); while(t--) { scanf("%d%d%d%d",&a1,&a2,&a3,&a4); int flag=0; for(i=0; i<3; i++) { for(j=0; j<3; j++) { for(k=0; k<3; k++) { if((a1-i-k)<0||(a2-i-j-k)<0||(a3-i-j-k)<0||(a4-j-k)<0) continue; if(((a1-i-k)>=3||(a1-i-k)==0)&&((a2-i-j-k)>=3||(a2-i-j-k)==0)&&((a3-i-j-k)>=3||(a3-i-j-k)==0)&&((a4-j-k)>=3||(a4-j-k)==0)) { flag=1; break; } } if(flag) break; } if(flag) break; } if(flag) printf("Yes\n"); else printf("No\n"); } return 0;}
0 0
- HDU 5143 NPY and arithmetic progression (枚举基本类型123、234、1234的个数)
- hdu 5143 NPY and arithmetic progression(枚举)
- hdu 5143 NPY and arithmetic progression(思路,枚举)
- HDU 5143 NPY and arithmetic progression 思维+枚举
- HDU 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 DFS
- HDU 5143 NPY and arithmetic progression(思维题)
- HDOJ 5143 NPY and arithmetic progression DFS
- HDOJ 5143 NPY and arithmetic progression
- 【CUGBACM15级BC第22场 B】hdu 5143 NPY and arithmetic progression
- HDU5143 NPY and arithmetic progression【暴力】
- HDU5142 NPY and arithmetic progression && BestCoder Round #23 1002
- HDU 5142 NPY and FFT(水~)
- ARITHMETIC PROGRESSION
- Arithmetic Progression
- HDU 1024 Max Sum Plus Plus (DP·滚动数组)
- iOS UI21_多线程
- java 中记录时间
- android 赋值或点击事件混乱
- 黑马程序员——java基础 多线程(复习)
- HDU 5143 NPY and arithmetic progression (枚举基本类型123、234、1234的个数)
- HDU 5093 Battle ships(二分图匹配)
- 文章标题
- flash广告
- Monthly Expense(POJ--3273【二分查找】
- HDU 2955 Robberies
- [leetcode-190]Reverse Bits(C)
- 移植最新内核Linux4.1.6到TQ2440开发板教程(一)
- 序列化和反序列化时的注意点