結果

提出番号 1906
提出者 shibh308
言語 C++
提出日時 2018-08-04 14:29:55
問題名 (65)Small Grid and Score
結果 RE
点数 0%

テストケース

テストケース 結果 得点 実行時間 メモリ使用量
1 WA 0% 2ms 7536KB
2 WA 0% 1ms 8736KB
3 WA 0% 2ms 7520KB
4 WA 0% 2ms 8080KB
5 WA 0% 2ms 8432KB
6 WA 0% 1ms 8400KB
7 WA 0% 2ms 8016KB
8 WA 0% 1ms 8080KB
9 WA 0% 2ms 7968KB
10 WA 0% 2ms 7824KB
11 WA 0% 1ms 8688KB
12 WA 0% 2ms 7840KB
13 AC 92% 2ms 8432KB
14 WA 0% 2ms 8432KB
15 RE 0% 0ms 0KB
16 WA 0% 1ms 8688KB
17 WA 0% 1ms 7520KB
18 AC 92% 1ms 7472KB
19 WA 0% 2ms 8176KB
20 AC 92% 2ms 8096KB
21 WA 0% 2ms 8080KB
22 WA 0% 1ms 8384KB
23 AC 92% 2ms 8400KB
24 WA 0% 2ms 8032KB
テストケース 結果 得点 実行時間 メモリ使用量
25 WA 0% 2ms 8400KB
26 WA 0% 2ms 8048KB
27 WA 0% 2ms 7824KB
28 WA 0% 2ms 8000KB
29 WA 0% 2ms 8432KB
30 WA 0% 1ms 8400KB
31 WA 0% 2ms 7248KB
32 WA 0% 2ms 7632KB
33 WA 0% 2ms 8192KB
34 WA 0% 1ms 8672KB
35 WA 0% 2ms 8336KB
36 WA 0% 2ms 8432KB
37 WA 0% 2ms 8320KB
38 WA 0% 2ms 8720KB
39 WA 0% 2ms 8064KB
40 WA 0% 2ms 7552KB
41 WA 0% 2ms 7248KB
42 WA 0% 2ms 8000KB
43 WA 0% 2ms 8128KB
44 WA 0% 2ms 8432KB
45 WA 0% 2ms 7536KB
46 WA 0% 2ms 8416KB
47 WA 0% 1ms 8096KB
48 WA 0% 2ms 8432KB
49 WA 0% 1ms 7888KB
50 WA 0% 2ms 8432KB
51 WA 0% 2ms 8128KB
52 WA 0% 2ms 7984KB
53 WA 0% 2ms 7920KB
54 WA 0% 2ms 8432KB
55 WA 0% 2ms 8128KB
56 WA 0% 1ms 8448KB
57 WA 0% 2ms 7616KB
58 WA 0% 2ms 7968KB
59 WA 0% 2ms 8416KB
60 WA 0% 1ms 8720KB
61 WA 0% 2ms 8416KB
62 WA 0% 2ms 8432KB
63 WA 0% 1ms 8272KB
64 WA 0% 2ms 7616KB
65 WA 0% 2ms 8256KB
66 WA 0% 2ms 7552KB
67 WA 0% 2ms 8432KB
68 WA 0% 2ms 7888KB
69 WA 0% 2ms 8256KB
70 WA 0% 2ms 8416KB
71 WA 0% 2ms 8224KB
72 WA 0% 1ms 8288KB
73 WA 0% 2ms 7808KB
74 WA 0% 2ms 8640KB
75 WA 0% 1ms 8704KB
76 WA 0% 2ms 8144KB
77 WA 0% 1ms 8384KB
78 WA 0% 2ms 8432KB
79 WA 0% 1ms 8688KB
80 WA 0% 2ms 8128KB
81 WA 0% 1ms 7504KB
82 WA 0% 1ms 8688KB
83 WA 0% 2ms 7552KB
84 WA 0% 2ms 7504KB
85 WA 0% 2ms 7840KB
86 WA 0% 2ms 8720KB
87 WA 0% 1ms 8720KB
88 WA 0% 2ms 7536KB
89 WA 0% 2ms 8416KB
90 WA 0% 2ms 7632KB
91 WA 0% 2ms 8080KB
92 WA 0% 2ms 8432KB
93 WA 0% 2ms 8464KB
94 WA 0% 2ms 7936KB
95 WA 0% 1ms 8688KB
96 WA 0% 2ms 8448KB
97 WA 0% 2ms 8656KB
98 WA 0% 2ms 7776KB
99 WA 0% 2ms 8432KB
100 WA 0% 2ms 8704KB
101 WA 0% 1ms 8720KB
102 WA 0% 2ms 8400KB
103 WA 0% 2ms 8304KB
104 WA 0% 2ms 8448KB
105 WA 0% 2ms 8112KB
106 WA 0% 2ms 8432KB
107 WA 0% 1ms 7520KB
108 WA 0% 2ms 8704KB
109 WA 0% 2ms 8480KB
110 WA 0% 2ms 7248KB
111 WA 0% 2ms 8288KB
112 WA 0% 1ms 8288KB
113 WA 0% 2ms 8112KB
114 WA 0% 2ms 7520KB
115 WA 0% 1ms 7920KB
116 WA 0% 1ms 8368KB
117 WA 0% 2ms 8016KB
118 WA 0% 2ms 8192KB
119 WA 0% 2ms 8416KB
120 WA 0% 1ms 8368KB
121 WA 0% 1ms 8448KB
122 WA 0% 2ms 7824KB
123 WA 0% 2ms 8416KB
124 WA 0% 2ms 8416KB

ソースコード

// g++ macro.cpp -std=c++14
#include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using namespace std;
 
#define dump(x)  cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO"  ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE"  ) << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible"  ) << endl
#define possible(n) cout << ((n) ? "possible" : "impossible"  ) << endl
 
#define SANKOU(n,a,b) cout << ((n) ? (#a) : (#b) ) << endl
 
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
 
#define FOREACH(x,a) for(auto& (x) : (a) )
 
#define WFA(d,v) REP(k,v)REP(i,v)REP(j,v)d[i][j]=min(d[i][j],d[i][k]+d[k][j])
 
#define SCOUT(x) cout<<(x)<<" "
#define ENDL cout<<endl
 
#define VECCIN(x) for(auto&youso_: (x) )cin>>youso_
#define VECIN2(x,y) REP(i,x.size())cin>>x[i]>>y[i]
#define VECCOUT(x) if(1){for(auto tt=x.begin();tt!=x.end();tt++){if(tt!=x.begin())cout<<" ";cout<<(*tt);}cout<<endl;}
 
#define ALL(obj) (obj).begin(),(obj).end()
 
#define EXIST(n,x) (find(ALL(n),x)!=n.end())
#define UNIQUE(obj) sort(ALL( obj )); obj.erase(unique(ALL(obj)),obj.end())
#define EN(x) if(1){cout<<#x<<endl;return 0;}
#define COUT(x) cout<<(x)<<endl
void CINT(){}
template <class Head,class... Tail>
void CINT(Head&& head,Tail&&... tail){
    cin>>head;
    CINT(move(tail)...);
}
#define CIN(...) int __VA_ARGS__;CINT(__VA_ARGS__)
#define LCIN(...) ll __VA_ARGS__;CINT(__VA_ARGS__)
#define SCIN(...) string __VA_ARGS__;CINT(__VA_ARGS__)
 
template <class T = ll>
T IN(){T x;cin>>x;return (x);}
 
template <class Head>
void VT(Head head){}
template <class Head,class Seco,class... Tail>
void VT(Head&& head,Seco&& seco,Tail&&... tail){
    seco.resize(head);
    VT(head,move(tail)...);
}
void VT2(){}
template <class Head,class... Tail>
void VT2(Head&& head,Tail&&... tail){
  VECCIN(head);
  VT2(move(tail)...);
}
 
template <class Head>
void VT3(Head&& head){}
template <class Head,class Seco,class... Tail>
void VT3(Head&& head,Seco&& seco,Tail&&... tail){
  seco[head]=IN();
  VT3(head,move(tail)...);
}
 
#define VC1(n,...) V __VA_ARGS__;VT(n,__VA_ARGS__);VT2(__VA_ARGS__); //aaabbbccc
#define VC2(n,...) V __VA_ARGS__;VT(n,__VA_ARGS__);REP(i,n)VT3(i,__VA_ARGS__); //abcabcabc
 
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision; // cpp_int
 
#define P pair<ll,ll>
#define V vector<ll>
#define M map<ll,ll>
#define S set<ll>
 
#define pb(a) push_back(a)
#define mp make_pair


int main(){

  LCIN(n);
  ll t = n;
  V v;
  while(t != 1){
    if(t % 2 == 0){
      v.pb(2);
      t /= 2;
    }else{
      v.pb(1);
      --t;
    }
  }
  SCOUT(1);
  COUT(v.size());
  REPR(i,v.size()-1)
    cout<<v[i];ENDL;

  return 0;
}