322A - Ciel and Dancing - CodeForces Solution

greedy *1000

Please click on ads to support us..

Python Code: 

a, b= map(int, input().split())
print(a+b-1)

for i in range (1,a+1):
    print(i, 1)
for i in range (2,b+1):
    print(1,i)

C++ Code: 

#include <iostream>
#include <math.h>
using namespace std;

int main() {
    int b, g;
    cin >> b >> g;
    cout << b + g - 1 << endl;

    for (int i = 0; i < b; i++) {
        cout << i + 1 << " " << 1 << endl;
    }
    for (int i = 1; i < g; i++) {
        cout << 1 << " " << i + 1 << endl;
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

1000B - Light It Up
218B - Airport
1463B - Find The Array
1538C - Number of Pairs
621B - Wet Shark and Bishops
476B - Dreamoon and WiFi
152C - Pocket Book
1681D - Required Length
1725D - Deducing Sortability
1501A - Alexey and Train
721B - Passwords
1263D - Secret Passwords
1371B - Magical Calendar
1726E - Almost Perfect
1360C - Similar Pairs
900A - Find Extra One
1093D - Beautiful Graph
748A - Santa Claus and a Place in a Class
1511B - GCD Length
676B - Pyramid of Glasses
597A - Divisibility
1632A - ABC
1619D - New Year's Problem
242B - Big Segment
938A - Word Correction
159C - String Manipulation 10
258A - Little Elephant and Bits
1536C - Diluc and Kaeya
1428C - ABBB
1557A - Ezzat and Two Subsequences