-
Notifications
You must be signed in to change notification settings - Fork 0
/
476D.cpp
70 lines (65 loc) · 1.66 KB
/
476D.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
58
59
60
61
62
63
64
65
66
67
68
69
70
/* Ankit Srivastava */
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define FF first
#define SS second
#define s(n) scanf("%d",&n)
#define sl(n) scanf("%lld",&n)
#define sf(n) scanf("%lf",&n)
#define ss(n) scanf("%s",n)
#define sc(n) {char temp[4]; ss(temp); n=temp[0];}
#define INF (int)1e9
#define LINF (long long)1e18
#define EPS 1e-9
#define maX(a,b) ((a)>(b)?(a):(b))
#define miN(a,b) ((a)<(b)?(a):(b))
#define abS(x) ((x)<0?-(x):(x))
typedef long long ll;
typedef unsigned long long LL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef pair<int,PII> TRI;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<ll> vl;
typedef vector<PII> VII;
typedef vector<TRI> VT;
int n, k;
void precompute() {
}
void read() {
s(n), s(k);
}
void preprocess() {
}
void solve() {
vector<vector<int> > v;
vector<int> temp;
int i;
for (i = 1; ; i+=2) {
temp.push_back(i);
if(temp.size() == 3) {
temp.push_back(i - 1);
v.push_back(temp);
temp.clear();
}
if(v.size() == n) break;
}
printf("%d\n", i * k);
for (std::vector<vector<int> >::iterator it = v.begin(); it != v.end(); ++it) {
for (std::vector<int>::iterator i = (*it).begin(); i != (*it).end(); ++i) {
printf("%d ", (*i) * k);
}
putchar('\n');
}
}
int main() {
precompute();
read();
preprocess();
solve();
return 0;
}