D. Dreamoon and Sets(构造+数论)

https://codeforces.com/problemset/problem/476/D

思路：

面向样例编程。

1 2 3 5

7 8 9  11

13 14 15 17

...

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n,k;cin>>n>>k;
   LL cnt=0;
   for(LL i=1;i<maxn;i++){
       if(i%4==0){
          ++cnt;++cnt;
          a[i]=cnt;
          ++cnt;
       }
       else{
          ++cnt;
          a[i]=cnt;
       }
   }
   LL mx=k*a[n*4];
   cout<<mx<<"\n";
   for(LL i=1;i<=n*4;i++){
      cout<<a[i]*k<<" ";
      if(i%4==0){
         cout<<"\n";
      }
   }
   return 0;
}