4-adjacent
来源:互联网 发布:淘宝买家拆分订单发货 编辑:程序博客网 时间:2024/06/05 16:46
Problem Statement
We have a sequence of length N, a=(a1,a2,…,aN). Each ai is a positive integer.
Snuke's objective is to permute the element in a so that the following condition is satisfied:
For each 1≤i≤N−1, the product of ai and ai+1 is a multiple of 4.
Determine whether Snuke can achieve his objective.
Constraints
2≤N≤105
ai is an integer.
1≤ai≤109
Input
Input is given from Standard Input in the following format:
N
a1 a2 … aN
Output
If Snuke can achieve his objective, print Yes; otherwise, print No.
Sample Input 1
3
1 10 100
Sample Output 1
Yes
One solution is (1,100,10).
Sample Input 2
4
1 2 3 4
Sample Output 2
No
It is impossible to permute a so that the condition is satisfied.
Sample Input 3
3
1 4 1
Sample Output 3
Yes
The condition is already satisfied initially.
Sample Input 4
2
1 1
Sample Output 4
No
Sample Input 5
6
2 7 1 8 2 8
Sample Output 5
We have a sequence of length N, a=(a1,a2,…,aN). Each ai is a positive integer.
Snuke's objective is to permute the element in a so that the following condition is satisfied:
For each 1≤i≤N−1, the product of ai and ai+1 is a multiple of 4.
Determine whether Snuke can achieve his objective.
Constraints
2≤N≤105
ai is an integer.
1≤ai≤109
Input
Input is given from Standard Input in the following format:
N
a1 a2 … aN
Output
If Snuke can achieve his objective, print Yes; otherwise, print No.
Sample Input 1
3
1 10 100
Sample Output 1
Yes
One solution is (1,100,10).
Sample Input 2
4
1 2 3 4
Sample Output 2
No
It is impossible to permute a so that the condition is satisfied.
Sample Input 3
3
1 4 1
Sample Output 3
Yes
The condition is already satisfied initially.
Sample Input 4
2
1 1
Sample Output 4
No
Sample Input 5
6
2 7 1 8 2 8
Sample Output 5
Yes
#include<stdio.h>int main (){int i,n;while(scanf("%d",&n)!=EOF){int a=0,b=0,t;for(i=0;i<n;i++){scanf("%d",&t);if(t%2==0)a++;if(t%4==0)b++;//printf("%d %d %d\n",a,b,n);}a=a-b;if((n-a)<=2*b&&a!=0)printf("Yes\n");else if((n-a-1)<=2*b&&a==0)printf("Yes\n");elseprintf("No\n");}}
阅读全文
0 0
- 4-adjacent
- adjacent difference
- Practice_5: Adjacent List Graph
- Sicily 4421. Adjacent Rooms
- Adjacent Bit Counts(P3786)
- Adjacent Bit Counts
- Adjacent Bit Counts
- WOJ1020-Adjacent Difference
- 【nyoj715】Adjacent Bit Counts
- nyoj 715 Adjacent Bit Counts
- [GeeksforGeeks]Remove all adjacent duplicates
- NYOJ 715 Adjacent Bit Counts
- WOJ:Problem 1020 - Adjacent Difference
- SPOJ 5295 Adjacent Bit Counts
- Adjacent Bit Counts (DP)
- NYOJ 715 Adjacent Bit Counts
- implement a undirected graph use adjacent list
- 使用DELETE ADJACENT DUPLICATES FROM <table>注意
- LOADBMP (RGB) 模式
- 详解Tomcat 配置文件server.xml
- C语言学习琐记一
- 学习原子哥STM32M4(1):GPIO输出配置
- 卡尔曼滤波(一)
- 4-adjacent
- 带调色板的位图BMP和不带调色板的BMP
- mysql 查看索引详解
- 万维链技术理念
- 322. Coin Change
- 关于openGL学习心得
- opengl之自动纹理
- python调用Agora_Recording_SDK_for_Linux_FULL
- OpenGL关于纹理和基本图形的混合问题