Tolik and His Uncle(构造)

https://codeforces.com/contest/1179/problem/B

---

又被吊打了。

先考虑一行的时候，怎么构造，肯定是先走到头，然后再回来，再过去。

考虑n行的时候也这样，类似于中心对称去构造。

#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;}
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n,m;cin>>n>>m;
   for(LL i=1;i<=n/2;i++){
       for(LL j=1;j<=m;j++){
           cout<<i<<" "<<j<<"\n";
           cout<<(n-i+1)<<" "<<(m-j+1)<<"\n";
       }
   }
   if(n&1){
      for(LL j=1;j<=m/2;j++){
          cout<<n/2+1<<" "<<j<<"\n";
          cout<<n/2+1<<" "<<m-j+1<<"\n";
      }
      if(m&1){
          cout<<n/2+1<<" "<<m/2+1<<"\n";
      }
   }
   return 0;
}