zoukankan      html  css  js  c++  java
  • Codeforces 417 C

    Time Limit: 1000MS   Memory Limit: 262144KB   64bit IO Format: %I64d & %I64u

     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 ≤ nai ≠ 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

    很久之前做的题,输出所有的情况就行了。
    #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
    ",i,(i+j)%n+1);
            }
        }
        return 0;
    }
  • 相关阅读:
    了解windows下的npm
    “jupyter notebook 不能导入python库但是终端上可以实现”的问题的解决
    本地创建的jupyter notebook 无法连接本地环境(即不能运行代码)
    win10 + ubuntu 下右键新建md文件(转载)
    LeetCode刷题2
    【入门】离散化
    【10.5NOIP普及模拟】sum
    【10.5NOIP普及模拟】sort
    【2020.02.01NOIP普及模拟4】怪兽
    [图论]最小花费
  • 原文地址:https://www.cnblogs.com/Ritchie/p/5424969.html
Copyright © 2011-2022 走看看