Codeforces Round #199 (Div. 2) -- A. Xenia and Divisors (思路)
来源:互联网 发布:js data属性 编辑:程序博客网 时间:2024/05/06 10:26
Xenia the mathematician has a sequence consisting of n (n is divisible by 3) positive integers, each of them is at most 7. She wants to split the sequence into groups of three so that for each group of three a, b, c the following conditions held:
- a < b < c;
- a divides b,b divides c.
Naturally, Xenia wants each element of the sequence to belong to exactly one group of three. Thus, if the required partition exists, then it has groups of three.
Help Xenia, find the required partition or else say that it doesn't exist.
The first line contains integer n (3 ≤ n ≤ 99999) — the number of elements in the sequence. The next line containsn positive integers, each of them is at most 7.
It is guaranteed that n is divisible by 3.
If the required partition exists, print groups of three. Print each group as values of the elements it contains. You should print values in increasing order. Separate the groups and integers in groups by whitespaces. If there are multiple solutions, you can print any of them.
If there is no solution, print -1.
61 1 1 2 2 2
-1
62 2 1 1 4 6
1 2 41 2 6大体题意:给你n(n 一定是3的倍数)个数,1 <= ai <= 7,问是否能挑出n/3组组合 a,b,c 使得 a < b < c; a divides b, b divides c.不可以的话输出-1.思路:想一想便可以知道 组合只有三种情况:1 2 41 2 61 3 6.那么讨论各个数的关系即可了!写这篇博客目的在于 讨论问题 要全面吧,自己认为的没用的条件 便可能是关键问题!!这种题 就在于逻辑顺序了!#include<cstdio>#include<cstring>#include<cctype>#include<cstdlib>#include<cmath>#include<iostream>#include<sstream>#include<iterator>#include<algorithm>#include<string>#include<vector>#include<set>#include<map>#include<deque>#include<queue>#include<stack>#include<list>typedef long long ll;typedef unsigned long long llu;const int maxn = 100000 + 10;const int inf = 0x3f3f3f3f;const double pi = acos(-1.0);const double eps = 1e-8;using namespace std;int vis[10];int a;int main(){ int n; while(scanf("%d",&n) == 1){ memset(vis,0,sizeof vis); for (int i = 0; i < n; ++i) { scanf("%d",&a); vis[a]++; } if (vis[5] || vis[7]){ printf("-1\n"); continue; } if (vis[1] != n/3)printf("-1\n"); else { if (vis[2] - vis[4] < 0 || vis[2] - vis[4] != vis[6] - vis[3] || vis[6] < vis[3])printf("-1\n"); else { for (int i = 0; i < vis[4]; ++i)printf("1 2 4\n"); for (int i = 0; i < vis[6]-vis[3]; ++i)printf("1 2 6\n"); for (int i = 0; i < vis[3]; ++i)printf("1 3 6\n"); } } } return 0;}
- Codeforces Round #199 (Div. 2) -- A. Xenia and Divisors (思路)
- Codeforces Round #199 (Div. 2) A. Xenia and Divisors
- CodeForces #199Div.2-A.Xenia and Divisors
- Codeforces Round #199 (Div. 2) B. Xenia and Spies
- Codeforces Round #199(Div. 2) B. Xenia and Spies
- Codeforces Round #199 (Div. 2) E. Xenia and Tree
- CodeForces 342A Xenia and Divisors
- Codeforces 342 A. Xenia and Divisors
- CodeForces 342A Xenia and Divisors
- A. Xenia and Divisors
- Codeforces Round #197 (Div. 2) C. Xenia and Weights - 搜索
- Codeforces Round #197 (Div. 2) B. Xenia and Ringroad
- Codeforces Round #197 (Div. 2) D. Xenia and Bit Operations
- Codeforces Round #197 (Div. 2)B. Xenia and Ringroad
- Codeforces Round #197 (Div. 2) c. Xenia and Weights
- Codeforces Round #197 (Div. 2) D. Xenia and Bit Operations
- [DP] Codeforces Round #197 (Div. 2) C. Xenia and Weights
- Codeforces Round #207 (Div. 2) D. Xenia and Hamming
- SVN命令行笔记
- spark分类训练时因分类标签值太大导致outOfMemery
- 从神经网络到BP算法(纯理论推导)
- CodeForces 339D
- 图的深度优先遍历和广度优先遍历
- Codeforces Round #199 (Div. 2) -- A. Xenia and Divisors (思路)
- 关于FILE_MODE值的问题,!!!!!
- 插入排序
- 图片,点9(.9)
- 读书笔记-现代操作系统-2进程与线程-2.4调度
- js中的ajax经典实例
- java中定义泛型类和定义泛型方法的写法
- hive插入数据
- UVa 1589 象棋