Submission #3447039


Source Code Expand

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <bitset>
using namespace std;

const int N = 4010;
const int mod = 998244353;

inline int deg(const bitset <N> &b) {
  int t = N - 1;
  while (!b[t] && t >= 0) t --;
  return t + 1;
}

int n;

inline void read(bitset <N> &b) {
  static char buf[N];
  scanf("%s", buf);
  reverse(buf, buf + strlen(buf));
  for (int i = 0; buf[i]; i ++)
    b[i] = (bool)(buf[i] - '0');
}

bitset <N> X, A[N];

inline bitset <N> gcd(bitset <N> p, bitset <N> q) {
  int a = deg(p);
  int b = deg(q);
  while (true) {
    if (!a) return q;
    if (!b) return p;
    if (a < b) {
      swap(p, q);
      swap(a, b);
    }
    p ^= q << (a - b);
    while (p[a] == 0 && a >= 0) a --;
    a ++;
  }
}

int main() {
  scanf("%d", &n);
  read(X);
  for (int i = 1; i <= n; i ++) read(A[i]);
  for (int i = 2; i <= n; i ++)
    A[1] = gcd(A[1], A[i]);
  int ans = 0;
  for (int i = deg(X) - 1, j = deg(A[1]) - 1; i >= j; i--) 
    ans = ((ans << 1) + X[i]) % mod;
  ans = (ans + 1) % mod;
  printf("%d\n", ans);
  return 0;
}

Submission Info

Submission Time
Task F - XorShift
User The_Unbeatable
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1142 Byte
Status RE
Exec Time 99 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:46:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &n);
                  ^
./Main.cpp: In function ‘void read(std::bitset<4010ul>&)’:
./Main.cpp:21:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", buf);
                   ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1000
Status
AC × 1
RE × 3
AC × 1
RE × 59
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt, s4.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, 53.txt, 54.txt, 55.txt, 56.txt, s1.txt, s2.txt, s3.txt, s4.txt
Case Name Status Exec Time Memory
01.txt RE 97 ms 256 KB
02.txt RE 97 ms 256 KB
03.txt RE 97 ms 256 KB
04.txt RE 97 ms 256 KB
05.txt RE 99 ms 256 KB
06.txt RE 97 ms 256 KB
07.txt RE 97 ms 256 KB
08.txt RE 97 ms 256 KB
09.txt RE 97 ms 256 KB
10.txt RE 97 ms 256 KB
11.txt RE 98 ms 256 KB
12.txt RE 98 ms 256 KB
13.txt RE 97 ms 256 KB
14.txt RE 97 ms 256 KB
15.txt RE 97 ms 256 KB
16.txt RE 96 ms 256 KB
17.txt RE 97 ms 256 KB
18.txt RE 97 ms 256 KB
19.txt RE 97 ms 256 KB
20.txt RE 96 ms 256 KB
21.txt RE 96 ms 256 KB
22.txt RE 96 ms 256 KB
23.txt RE 97 ms 256 KB
24.txt RE 96 ms 256 KB
25.txt RE 97 ms 256 KB
26.txt RE 98 ms 256 KB
27.txt RE 96 ms 256 KB
28.txt RE 96 ms 256 KB
29.txt RE 97 ms 256 KB
30.txt RE 96 ms 256 KB
31.txt RE 97 ms 256 KB
32.txt RE 96 ms 256 KB
33.txt RE 97 ms 256 KB
34.txt RE 97 ms 256 KB
35.txt RE 97 ms 256 KB
36.txt RE 96 ms 256 KB
37.txt RE 98 ms 256 KB
38.txt RE 97 ms 256 KB
39.txt RE 97 ms 256 KB
40.txt RE 97 ms 256 KB
41.txt RE 96 ms 256 KB
42.txt RE 97 ms 256 KB
43.txt RE 97 ms 256 KB
44.txt RE 98 ms 256 KB
45.txt RE 97 ms 256 KB
46.txt RE 96 ms 256 KB
47.txt RE 97 ms 256 KB
48.txt RE 98 ms 256 KB
49.txt RE 97 ms 256 KB
50.txt RE 97 ms 256 KB
51.txt RE 97 ms 256 KB
52.txt RE 97 ms 256 KB
53.txt RE 96 ms 256 KB
54.txt RE 98 ms 256 KB
55.txt RE 97 ms 256 KB
56.txt RE 97 ms 256 KB
s1.txt RE 96 ms 256 KB
s2.txt RE 96 ms 256 KB
s3.txt RE 96 ms 256 KB
s4.txt AC 1 ms 256 KB