-
Notifications
You must be signed in to change notification settings - Fork 0
/
441C.cpp
57 lines (48 loc) · 913 Bytes
/
441C.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
int main()
{
ll n , m ,k1;
cin >> n >> m >> k1;
int i = 1;
int j = 1;
int a[n * m][2];
int k = 0;
while( i <= n && j <=m)
{
a[k][0] = i;
a[k][1] = j;
int in = 0;
if( j == m && i % 2 == 1)
{
in = 1;
}
else if( j == 1 && i % 2 == 0)
{
in = 1;
}
if(j!=m && i%2 == 1)
j++;
else if( j!=1 && i %2 == 0)
j--;
i += in;
k++;
}
k = 0;
while(k1 > 1)
{
cout << "2 ";
cout << a[k][0] << " " << a[k][1] << " ";
cout << a[k + 1][0] << " " << a[k + 1][1] << " " << endl;;
k +=2;
k1--;
}
cout << n * m - k << " ";
while( k < n * m )
{
cout << a[k][0] << " " << a[k][1] << " ";
k++;
}
}