結果

問題 No.2797 Square Tile
ユーザー Red_Black_GPGPU
提出日時 2024-09-22 22:59:26
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 3,258 bytes
コンパイル時間 2,035 ms
コンパイル使用メモリ 177,420 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-22 22:59:30
合計ジャッジ時間 3,473 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 16 WA * 5
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp:20:17: warning: integer constant is so large that it is unsigned
   20 | const ll llMIN=-9223372036854775808LL;
      |                 ^~~~~~~~~~~~~~~~~~~~~

ソースコード

diff #
プレゼンテーションモードにする

#include "bits/stdc++.h"
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
#define REP(i, n) for(ll i = 0;i < n;i++)
#define ll long long
//#define MOD 998244353LL
#define MOD 1000000007LL
//using mint = modint998244353;
//using mint = modint1000000007;
#define chmax(a,b) if ((a)<(b))a=(b);
#define chmin(a,b) if ((a)>(b))a=(b);
#define doublecout(a) cout<<setprecision(16)<<a<<endl;
using vi = vector<ll>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
using vvvi = vector<vvi>; // intの2次元の型に vvi という別名をつける
const ll llMAX=9223372036854775807LL; 
const ll llMIN=-9223372036854775808LL;
#ifdef LOCAL
#define dbg(x_) cerr << "?" << __LINE__ << ":" << #x_ << ":\t" << x_ << endl;
#define print1(a0_) cerr << "?" << __LINE__ << ":" << #a0_ << "=" << a0_ << endl;
#define print2(a0_,a1_) cerr << "?" << __LINE__ << ":" << #a0_ << "=" << a0_ << "," << #a1_ << "=" << a1_ << endl;
#define print3(a0_,a1_,a2_) cerr << "?" << __LINE__ << ":" << #a0_ << "=" << a0_ << "," << #a1_ << "=" << a1_ << "," << #a2_ << "=" << a2_ << endl;
#define print4(a0_,a1_,a2_,a3_) cerr << "?" << __LINE__ << ":" << #a0_ << "=" << a0_ << "," << #a1_ << "=" << a1_ << "," << #a2_ << "=" << a2_ << "," 
    << #a3_ << "=" << a3_ << endl;
#define print5(a0_,a1_,a2_,a3_,a4_) cerr << "?" << __LINE__ << ":" << #a0_ << "=" << a0_ << "," << #a1_ << "=" << a1_ << "," << #a2_ << "=" << a2_ << 
    "," << #a3_ << "=" << a3_ << "," << #a4_ << "=" << a4_ << endl;
#else
#define dbg(...)
#define print1(...)
#define print2(...)
#define print3(...)
#define print4(...)
#define print5(...)
#endif
template<typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<","<<p.second<<")"; }
// vector
template<typename T>
ostream &operator<<(ostream &s, const vector<T> &v) {
  int len=v.size();
  for(int i=0; i<len; ++i) {
    s<<v[i];
    if (i<len-1) s<<"\t";
  }
  return s;
}
// 2 dimentional vector
template<typename T>
ostream &operator<<(ostream &s, const vector<vector<T> > &vv) {
  s<<endl;
  int len=vv.size();
  for(int i=0; i<len; ++i) s<<vv[i]<<endl;
  return s;
}
template<typename T1, typename T2>
ostream &operator<<(ostream &s, const map<T1,T2> &mp) {
  int len=mp.size();
  for(auto t:mp) s<<t<<" ";
  return s;
}
void No() {
  cout << "-1" << endl;
  exit(0);
}
ll gcd(ll a,ll b){
  ll r = a % b;
  while(r!=0LL){
    a = b;
    b = r;
    r = a % b;
  }
return b;
}
ll n,k,x,y;
int main(){
  ll ans=0,a,b;
  cin >> a >> b;
  ll n=a*a+b*b;
  if (a==b){
    REP(i,a*2){
    REP(j,a*2){
        cout<<a*i<<" "<<a*j<<endl;
    }
    }
      return 0;
  }
  
  
  ll g=gcd(a,b);
  a/=g;
  b/=g;
  n=a*a+b*b;
  ll nn=n*g*g;
  string ans1="";
  string ans2="";
  ll x=0,y=0;
  ll aa=a,bb=b;
  if (b>a)swap(aa,bb);
  
  ll x2=aa-bb,y2=aa;
  
  REP(i,n){
    REP(i1,g)
    {
        REP(i2,g)
        {
            ans1+=""+to_string((x*g*g+a*g*i1)%nn)+" "+to_string((y*g*g+a*g*i2)%nn)+"\n";
            ans2+=""+to_string((x2*g*g+b*g*i1)%nn)+" "+to_string((y2*g*g+b*g*i2)%nn)+"\n";
        }
    }
    x=(x+aa)%n;
    y=(y+bb)%n;
    x2=(x2+aa)%n;
    y2=(y2+bb)%n;
  }
  
  if (b>a)swap(ans1,ans2);
  cout<<ans1<<ans2;
  
  
  return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0