제출 #557147

#제출 시각아이디문제언어결과실행 시간메모리
557147Yazan_AlattarPick (COI18_pick)C++14
5 / 100
1 ms212 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 200007;
const ll inf = 2e9;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const double eps = 1e-6;
const int dx[] = {0, -1, 0, 1}, dy[] = {1, 0, -1, 0};
const int block = 320;

int a, b, c, d, x, y;

int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> a >> b >> c >> d;

    for(int i = 1; i <= c / 2; ++i) cout << x++ << " " << y++ << endl;

    cout << x++ << " " << y-- << endl;

    for(int i = 1; i <= c / 2 - 1; ++i) cout << x-- << " " << y-- << endl;

    for(int i = 1; i <= d / 2 - 1; ++i) cout << x++ << " " << y-- << endl;

    cout << x-- << " " << y-- << endl;

    for(int i = 1; i <= d / 2; ++i) cout << x-- << " " << y++ << endl;

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...