oj.uz

답안 #538611

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
538611 2022-03-17T08:31:53 Z cig32 "The Lyuboyn" code (IZhO19_lyuboyn) C++17
11 / 100
 133 ms 6840 KB 
#include "bits/stdc++.h"
using namespace std;
const int MAXN = 2e5 + 10;
const int MOD = 1e9 + 7;
#define int long long
#define ll __int128
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
ll read() { // read int128
  int x; cin >> x; return (ll)x;
}
long long bm(long long b, long long p) {
  if(p==0) return 1 % MOD;
  long long r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
long long inv(long long b) { 
  return bm(b, MOD-2);
}
long long f[MAXN];
long long nCr(int n, int r) { 
  long long ans = f[n]; ans *= inv(f[r]); ans %= MOD;
  ans *= inv(f[n-r]); ans %= MOD; return ans;
}
void precomp() { 
  for(int i=0; i<MAXN; i++) f[i] = (i == 0 ? 1 % MOD : (f[i-1] * i) % MOD);
}
void solve(int tc) {
  int n;
  cin >> n;
  cout << (1<<n) << "\n";
  for(int i=1; i<=n; i++) cout << 0;
  cout << "\n";
  int xorsum = 0;
  for(int i=1; i<(1<<n); i++) {
    xorsum ^= (i & -i);
    for(int j=0; j<n; j++) {
      if(xorsum & (1<<j)) cout << "1";
      else cout << "0";
    }
    cout << "\n";
  }
}
int32_t main(){
  precomp();
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}

Subtask #1
0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 1876 KB First number in answer is not x 1 0

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 1876 KB Fail, not exactly k bits are different: line = 0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 1924 KB Found solution while it does not exist
2 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 130 ms 6840 KB Ok
2 Correct 60 ms 4176 KB Ok
3 Correct 3 ms 1876 KB Ok
4 Correct 2 ms 1876 KB Ok
5 Correct 3 ms 1876 KB Ok

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 1876 KB Fail, not exactly k bits are different: line = 0
2 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 133 ms 6768 KB First number in answer is not x 44202 0
2 Halted 0 ms 0 KB -

Subtask #7
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 130 ms 6840 KB Ok
2 Correct 60 ms 4176 KB Ok
3 Correct 3 ms 1876 KB Ok
4 Correct 2 ms 1876 KB Ok
5 Correct 3 ms 1876 KB Ok
6 Incorrect 2 ms 1876 KB Fail, not exactly k bits are different: line = 0
7 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 60 ms 4172 KB First number in answer is not x 92826 0
2 Halted 0 ms 0 KB -