Codeforces 417 C (递推)
2016-04-23 16:43
281 查看
Football
Submit Status
Description
One day, at the "Russian Code Cup" event it was decided to play football as an out of competition event. All participants was divided into nteams and played several matches, two teams could not play against each other more than once.
The appointed Judge was the most experienced member — Pavel. But since he was the wisest of all, he soon got bored of the game and fell asleep. Waking up, he discovered that the tournament is over and the teams want to know the results of all the matches.
Pavel didn't want anyone to discover about him sleeping and not keeping an eye on the results, so he decided to recover the results of all games. To do this, he asked all the teams and learned that the real winner was friendship, that is, each team beat the other teams exactly ktimes. Help Pavel come up with chronology of the tournir that meets all the conditions, or otherwise report that there is no such table.
Input
The first line contains two integers — n and k (1 ≤ n, k ≤ 1000).
Output
In the first line print an integer m — number of the played games. The following m lines should contain the information about all the matches, one match per line. The i-th line should contain two integers ai and bi (1 ≤ ai, bi ≤ n; ai ≠ bi). The numbers ai and bi mean, that in the i-th match the team with number ai won against the team with number bi. You can assume, that the teams are numbered from 1 ton.
If a tournir that meets the conditions of the problem does not exist, then print -1.
Sample Input
Input
Output
Source
RCC 2014 Warmup (Div. 2)
很久之前做的题,输出所有的情况就行了。
Time Limit: 1000MS | Memory Limit: 262144KB | 64bit IO Format: %I64d & %I64u |
Description
One day, at the "Russian Code Cup" event it was decided to play football as an out of competition event. All participants was divided into nteams and played several matches, two teams could not play against each other more than once.
The appointed Judge was the most experienced member — Pavel. But since he was the wisest of all, he soon got bored of the game and fell asleep. Waking up, he discovered that the tournament is over and the teams want to know the results of all the matches.
Pavel didn't want anyone to discover about him sleeping and not keeping an eye on the results, so he decided to recover the results of all games. To do this, he asked all the teams and learned that the real winner was friendship, that is, each team beat the other teams exactly ktimes. Help Pavel come up with chronology of the tournir that meets all the conditions, or otherwise report that there is no such table.
Input
The first line contains two integers — n and k (1 ≤ n, k ≤ 1000).
Output
In the first line print an integer m — number of the played games. The following m lines should contain the information about all the matches, one match per line. The i-th line should contain two integers ai and bi (1 ≤ ai, bi ≤ n; ai ≠ bi). The numbers ai and bi mean, that in the i-th match the team with number ai won against the team with number bi. You can assume, that the teams are numbered from 1 ton.
If a tournir that meets the conditions of the problem does not exist, then print -1.
Sample Input
Input
3 1
Output
3 1 2 2 3 3 1
Source
RCC 2014 Warmup (Div. 2)
很久之前做的题,输出所有的情况就行了。
#include <iostream> #include <stdio.h> typedef long long LL; using namespace std; int main() { int i,n,m,k,j; cin>>n>>k; if (n-1<2*k) cout<<-1<<endl; else { cout<<n*k<<endl; for (i=1;i<=n;i++) { for (j=0;j<k;j++) printf("%d %d\n",i,(i+j)%n+1); } } return 0; }
相关文章推荐
- json_encode中文unicode的问题
- VS2013设置护眼背景颜色
- 2016.4.23 GDOI 2016 赛前模拟 总结
- Qt开发环境搭建
- 前端构建工具Gulp使用总结
- 解决OX10.11.4 不能授权的问题
- 从Oracle RAC用到的技术来了解RAC的体系结构和工作原理
- java swing的版面结构
- 推荐提升 Android 性能的建议
- 输出N个字母的全排列问题
- Oracle 分析函数(Analysis Function)相关用法
- HTML标签marquee实现滚动效果
- "黑科技" - Eclipse使用RecyclerView
- 20145120 《Java程序设计》实验三实验报告
- [改善Java代码]不要让四舍五入亏了一方
- 第一章 从开机加电到执行main函数之前的过程
- 【GDOI2016模拟4.22】飞机调度
- 商业研究(10):比呀比-海淘电商-海外正品直邮-高品质跨境购物平台
- android 5.0 自动接听电话
- JAVA——异常(1)