結果

提出番号	2111
提出者	rickytheta
言語	C++
提出日時	2018-08-04 15:19:42
問題名	(65)Small Grid and Score
結果	AC
点数	30%

---

テストケース

ソースコード

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

ll n;

int w = 65;
int h = 65;
int mp[65][65];
const int PATH = 1;
const int MULT = 2;
const int PLUS = 3;
const int BLOCK = 4;
char poi[] = {' ', '.', '2', '1', '#'};

int main(){
  scanf("%lld",&n);
  int px = 0, py = 0;
  REP(j,w)mp[h-1][j] = PATH;
  REP(i,h)mp[i][w-1] = PATH;
  REP(i,60){
    bool bl = n%2==0;
    n /= 2;
    if(!bl){
      if(i%2==0){
        FOR(i,py+1,h)mp[i][px] = PATH;
      }else{
        FOR(j,px+1,w)mp[py][j] = PATH;
      }
    }
    if(i%2==0){
      px++; mp[py][px] = PATH;
      px++; mp[py][px] = MULT;
    }else{
      py++; mp[py][px] = PATH;
      py++; mp[py][px] = MULT;
    }
  }
  mp[0][0] = PATH;
  REP(i,h)REP(j,w)if(mp[i][j]==0){
    mp[i][j] = BLOCK;
  }
  printf("%d %d\n",h,w);
  REP(i,h){
    REP(j,w)printf("%c",poi[mp[i][j]]);
    puts("");
  }
  return 0;
}