cf 190div 2 A

最新推荐文章于 2025-01-20 09:00:00 发布

hange_db

最新推荐文章于 2025-01-20 09:00:00 发布

阅读量728

点赞数

CC 4.0 BY-SA版权

分类专栏： codeforces 水题大训练

本文链接：https://blog.youkuaiyun.com/hange_dbdp/article/details/9638631

codeforces 水题大训练专栏收录该内容

12 篇文章

订阅专栏

在Cieland的舞蹈室中，男女从未共舞过。面对有限的歌曲数量，需要制定一套规则使得他们能尽可能多地跳舞。通过简单的逻辑判断，找出最佳的配对方式。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Fox Ciel and her friends are in a dancing room. There are n boys and m girls here, and they never danced before. There will be some songs, during each song, there must be exactly one boy and one girl are dancing. Besides, there is a special rule:

either the boy in the dancing pair must dance for the first time (so, he didn't dance with anyone before);
or the girl in the dancing pair must dance for the first time.

Help Fox Ciel to make a schedule that they can dance as many songs as possible.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 100) — the number of boys and girls in the dancing room.

Output

In the first line print k — the number of songs during which they can dance. Then in the following k lines, print the indexes of boys and girls dancing during songs chronologically. You can assume that the boys are indexed from 1 to n, and the girls are indexed from 1 to m.

Sample test(s)

input
2 1

output
2
1 1
2 1

input
2 2

output
3
1 1
1 2
2 2刚开始看到这个题的时候表示吓到了，因为是贪心，后来仔细一看，压根不需要，就是找个规律即可，下面是代码：#include <string>
#include <cstring>
#include <vector>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <iostream>

using namespace std;

int main(){
    int  n,m;
    cin>>n>>m;
    cout<<n+m-1<<endl;
    for(int i=1;i<=n;i++)
       cout<<i<<" "<<"1"<<endl;
    for(int i=2;i<=m;i++)
       cout<<"1"<<" "<<i<<endl;
       return 0;
}