Submission #69113338

---

Source Code Expand

  #include "atcoder/all"
  //#include "atcoder/modint"
  //#pragma GCC optimize("Ofast")
  #include <bits/stdc++.h>
  #include  <string>
  using namespace std;
  using namespace atcoder;
  #define int long long
    template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
  template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
  //const int MOD =1e9+7;
  //constexpr int MOD =10;
  constexpr int MOD =998244353;
  const long long M1=167772161,M2=469762049,M3=1224736769;
  //const int MOD =31607;
  using mint = static_modint<MOD>;
  //using mint = double;
  //using mint = modint;
  ostream& operator << (ostream& ost, const mint& m){ost << m.val();return ost;}
  istream& operator >> (istream& ost,  mint& m){int a;ost >> a;m=a;return ost;}
  double time_limit = 10.0,start_temp=5.0,end_temp=0.0;
  std::random_device seed_gen;
  std::mt19937 engine(seed_gen());

  signed main(){
    //ios_base::sync_with_stdio(false);
    //cin.tie(NULL);
    int n,k;
    cin>>n>>k;
    vector<int>b(1ll<<n,k/(1ll<<n));
    int ans=0;
    for(int i=n-1;i>=0;i--)if(k&(1ll<<i)){
      for(int j=0;j<(1ll<<n);j++)if(j%(1ll<<(n-i))==(1ll<<(n-1-i)))b[j]++,ans=1;
    }
    cout<<ans<<endl;
    for(int i=0;i<(1ll<<n);i++)cout<<b[i]<<" ";
    cout<<endl;
    return 0;
    

    
  }

Submission Info

Judge Result