제출 #1139377

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1139377		JelalTkm	Binary Subsequences (info1cup17_binary)	C++20	0 / 100	68 ms	4416 KiB

binary

#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

using namespace std;

#define int long long int

const int N = 2e3 + 100;
const int md = 1e9 + 7;
const int INF = 1e9;

int32_t main(int32_t argc, char *argv[]) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  
  vector<int> ans(N);

  ans[0] = 1;
  ans[1] = 2;
  for (int i = 2; i < N; i++)
    ans[i] = (ans[i - 1] * ans[i - 2]) % md;

  int T = 1;
  cin >> T;
  while (T--) {
    int n;
    cin >> n;
    cout << ans[n] << '\n';
    for (int i = 0; i < n; i++)
      cout << 1 << " ";
    cout << '\n';
  }
  return 0;
}

• Subtask 1: 0 / 43
• Subtask 2: 0 / 39
• Subtask 3: 0 / 18