text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
void gao1() {
long long a = 0, b = 0;
for (int i = 29; i >= 0; i--) {
cout << "? " << (a + (1ll << i)) << " " << a << endl;
fflush(stdout);
int x;
cin >> x;
if (x == -1) {
a |= (1 << i);
}
}
cout << "! " << a << " " << a << endl;
fflush(stdout);
return;
}
int main() {
long long a = 0, b = 0;
cout << "? " << 0 << " " << 0 << endl;
fflush(stdout);
int ttt;
cin >> ttt;
if (ttt == 0) {
gao1();
return 0;
}
int flag = ttt;
for (int i = 29; i >= 0; i--) {
cout << "? " << (a + (1 << i)) << " " << (b + (1 << i)) << endl;
fflush(stdout);
int tmp;
cin >> tmp;
if (tmp == 0) {
for (int j = i; j >= 0; j--) {
cout << "? " << (a + (1 << j)) << " " << (b) << endl;
fflush(stdout);
int tt;
cin >> tt;
if (tt == -1) {
a += (1 << j);
b += (1 << j);
}
}
cout << "! " << a << " " << b << endl;
fflush(stdout);
return 0;
} else if (tmp == -flag) {
if (flag == 1) {
a += (1 << i);
} else {
b += (1 << i);
}
cout << "? " << (a) << " " << (b) << endl;
fflush(stdout);
cin >> flag;
if (flag == 0) {
for (int j = i - 1; j >= 0; j--) {
cout << "? " << (a + (1 << j)) << " " << (b) << endl;
fflush(stdout);
int tt;
cin >> tt;
if (tt == -1) {
a += (1 << j);
b += (1 << j);
}
}
cout << "! " << a << " " << b << endl;
fflush(stdout);
return 0;
}
} else {
if (flag == 1) {
cout << "? " << (a + (1 << i)) << " " << (b) << endl;
fflush(stdout);
int tmp;
cin >> tmp;
if (tmp == 0) {
a += (1 << i);
for (int j = i - 1; j >= 0; j--) {
cout << "? " << (a + (1 << j)) << " " << (b) << endl;
fflush(stdout);
int tt;
cin >> tt;
if (tt == -1) {
a += (1 << j);
b += (1 << j);
}
}
cout << "! " << a << " " << b << endl;
fflush(stdout);
return 0;
}
if (tmp == -1) {
a += (1 << i);
b += (1 << i);
}
} else if (flag == -1) {
cout << "? " << (a) << " " << (b + (1 << i)) << endl;
fflush(stdout);
int tmp;
cin >> tmp;
if (tmp == 0) {
b += (1 << i);
for (int j = i - 1; j >= 0; j--) {
cout << "? " << (a + (1 << j)) << " " << (b) << endl;
fflush(stdout);
int tt;
cin >> tt;
if (tt == -1) {
a += (1 << j);
b += (1 << j);
}
}
cout << "! " << a << " " << b << endl;
fflush(stdout);
return 0;
}
if (tmp == 1) {
a += (1 << i);
b += (1 << i);
}
}
}
}
cout << "! " << a << " " << b << endl;
fflush(stdout);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, x = 0, y = 0, res1, res2, nxt;
cout << "? 0 0" << endl;
cin >> nxt;
for (i = 29; i >= 0; i--) {
cout << "? " << x + (1 << i) << ' ' << y << endl;
cin >> res1;
cout << "? " << x << ' ' << y + (1 << i) << endl;
cin >> res2;
if (res1 == res2) {
if (nxt == 1)
x += 1 << i;
else
y += 1 << i;
nxt = res1;
}
if (res1 < res2) {
x += 1 << i;
y += 1 << i;
}
}
cout << "! " << x << ' ' << y;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int eq(int a, int b, int x) {
int res = 0;
for (; x >= 0; x--) {
int c = a, d = b;
int t = (1 << x);
cout << "? " << (c ^ t) << " " << d << endl;
int res1 = 0;
cin >> res1;
if (res1 == -1) {
a = (a ^ t);
b = (b ^ t);
res = (res ^ t);
}
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a = 0, b = 0;
int c = 0, d = 0;
int x = 29;
int res = 0;
int agt = 0;
cout << "? " << c << " " << d << endl;
cin >> res;
if (res == 1) {
agt = 1;
} else if (res == -1)
agt = -1;
else {
int temp = eq(a, b, x);
a = (a ^ temp);
b = (b ^ temp);
cout << "! " << a << " " << b << endl;
return 0;
}
for (; x >= 0; x--) {
c = a, d = b;
int t = (1 << x);
cout << "? " << (c ^ t) << " " << d << endl;
int res1 = 0, res2 = 0;
cin >> res1;
cout << "? " << (c) << " " << (d ^ t) << endl;
cin >> res2;
if (res1 * res2 == 0) {
if (res1 == 0 && res2 == 0) {
if (agt > 0)
a = a ^ t;
else
b = b ^ t;
int temp = eq(a, b, x - 1);
a = (a ^ temp);
b = (b ^ temp);
cout << "! " << a << " " << b << endl;
return 0;
}
if (res1 == 0) {
b = (b ^ t);
} else {
a = (a ^ t);
}
int temp = eq(a, b, x - 1);
a = (a ^ temp);
b = (b ^ temp);
cout << "! " << a << " " << b << endl;
return 0;
}
if (res1 * res2 == -1) {
if (res1 == -1) {
a = (a ^ t);
b = (b ^ t);
}
} else {
if (agt > 0) {
a = (a ^ t);
} else
b = (b ^ t);
agt = res1;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int bitmax = 29;
int question(int c, int d) {
cout << "? " << c << " " << d << endl;
cout.flush();
int res;
cin >> res;
return res;
}
int a, b;
int main() {
int rel = question(a, b);
for (int bit = bitmax; bit >= 0; bit--) {
int B = 1 << bit;
if (rel == 1) {
if (question(a | B, b | B) == 1) {
if (question(a | B, b) == -1) {
a |= B;
b |= B;
}
} else {
a |= B;
rel = question(a, b);
}
} else if (rel == -1) {
if (question(a | B, b | B) == -1) {
if (question(a | B, b) == -1) {
a |= B;
b |= B;
}
} else {
b |= B;
rel = question(a, b);
}
} else {
if (question(a, b | B) == 1) {
a |= B;
b |= B;
}
}
}
cout << "! " << a << " " << b << endl;
cout.flush();
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 100005;
void solve() {
long long n, m;
long long a = 0;
long long b = 0;
cout << "? " << a << " " << b << '\n';
long long y;
cin >> y;
for (long long i = 29; i >= 0; i--) {
cout << "? " << a << " " << b + (1LL << i) << '\n';
cout.flush();
long long x = 0;
cin >> x;
cout << "? " << a + (1LL << i) << " " << b << '\n';
cout.flush();
long long z = 0;
cin >> z;
if (x == 1 and z == -1) {
a = a + (1LL << i);
b = b + (1LL << i);
} else if (x == -1 and z == 1) {
continue;
} else if (x == 1 and z == 1) {
if (y == 1)
a = a + (1 << i);
else
b = b + (1 << i);
y = 1;
} else if (x == -1 and z == -1) {
if (y == 1)
a = a + (1 << i);
else
b = b + (1 << i);
y = -1;
} else {
if (y == 1)
a = a + (1 << i);
else
b = b + (1 << i);
y = 0;
}
}
cout << "! " << a << " " << b << '\n';
cout.flush();
}
signed main() {
long long t;
ios_base::sync_with_stdio(false);
t = 1;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const double PI = acos(-1);
long long fast_exp(long long a, long long b) {
long long res = 1;
while (b) {
if (b & 1LL) {
res *= a;
res %= 1000000007;
}
b >>= 1LL;
a *= a;
a %= 1000000007;
}
return res;
}
int query(int x, int y) {
cout << "? " << x << ' ' << y << "\n" << flush;
int q;
cin >> q;
if (q == -2) {
exit(1);
}
return q;
}
signed main(int argc, char* argv[], char* envp[]) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.precision(20);
cerr << fixed;
cout << fixed;
int a = 0, b = 0, c = 0, d = 0;
int res = query(c, d);
for (int i = 29; i >= 0; i--) {
int q = query(c | (1 << i), d | (1 << i));
if ((res == -1 and q == 1) or (res == 1 and q == -1)) {
if (res == -1) {
b |= (1 << i);
d |= (1 << i);
} else if (res == 1) {
a |= (1 << i);
c |= (1 << i);
}
res = query(c, d);
} else {
int q1 = query(c, d | (1 << i));
if (q1 == 1) {
a |= (1 << i);
b |= (1 << i);
c |= (1 << i);
d |= (1 << i);
}
}
}
cout << "! " << a << ' ' << b << endl << flush;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long a = (1 << 30), b = (1 << 30);
unsigned long ansa = 0x0, ansb = 0x0;
int diff, q1, q;
printf("? 0 0\n");
fflush(stdout);
scanf("%d", &diff);
for (int k = 1; k <= 30; k++) {
a = (ansa)&0xffffffff;
b = (ansb)&0xffffffff;
a |= (1 << (30 - k));
printf("? %lu %lu\n", a, b);
fflush(stdout);
scanf("%d", &q);
b |= (1 << (30 - k));
a ^= (1 << (30 - k));
printf("? %lu %lu\n", a, b);
fflush(stdout);
scanf("%d", &q1);
if (q != q1) {
if (q == -1) {
ansa |= (1 << (30 - k));
ansb |= (1 << (30 - k));
}
} else {
if (diff == 1) {
ansa |= (1 << (30 - k));
} else {
ansb |= (1 << (30 - k));
}
diff = q;
}
}
printf("! %ld %ld", ansa, ansb);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int TESTS = 1;
while (TESTS--) {
long long i, j, k, l, m, n, c, d, v[31] = {0}, a, b;
c = pow(2, 30) - 1;
d = pow(2, 30) - 1;
cout << "? " << c << " " << d << '\n';
fflush(stdout);
cin >> k;
j = k * (-1);
a = 0;
b = 0;
c = 0;
d = 0;
for (m = 29; m >= 0; m--) {
c = c + pow(2, m);
d = d + pow(2, m);
cout << "? " << c << " " << d << '\n';
fflush(stdout);
cin >> k;
if (k == 0) break;
if (k != j && k != 0) {
v[m] = 1;
if (j == 1) {
a = a + pow(2, m);
c = c - pow(2, m);
} else {
b = b + pow(2, m);
d -= pow(2, m);
}
cout << "? " << c << " " << d << '\n';
fflush(stdout);
cin >> k;
j = k;
}
}
c = a;
d = b;
for (i = 0; i <= 29; i++) {
if (v[i] == 1) continue;
c += pow(2, i);
cout << "? " << c << " " << d << '\n';
fflush(stdout);
cin >> k;
if (k == -1) {
a += pow(2, i);
b += pow(2, i);
}
c -= pow(2, i);
}
cout << "! " << a << " " << b << '\n';
fflush(stdout);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int query(int a, int b) {
int answer;
cout << "? " << a << " " << b << endl;
cin >> answer;
return answer;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int a = 0, b = 0;
int big = query(0, 0);
for (int i = 29; i >= 0; i--) {
int ans1 = query(a ^ (1 << i), b);
int ans2 = query(a, b ^ (1 << i));
if (ans1 == ans2) {
if (big == 1)
a ^= (1 << i);
else
b ^= (1 << i);
big = ans1;
} else {
if (ans2 == 1) {
a ^= (1 << i);
b ^= (1 << i);
}
}
}
cout << "! " << a << " " << b << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int ans1 = 0, ans2 = 0;
int ansa = 0, ansb = 0;
printf("? 0 0\n");
fflush(stdout);
int d;
scanf("%d", &d);
for (int i = (1 << 29); i != 0; i /= 2) {
printf("? %d %d\n", ans1 + i, ans2 + i);
fflush(stdout);
int p;
scanf("%d", &p);
if (p == d) {
printf("? %d %d\n", ans1 + i, ans2);
fflush(stdout);
int pp;
scanf("%d", &pp);
if (pp == -1) {
ansa += i;
ansb += i;
}
} else {
if (p == -1 && d == 1) {
ans1 += i;
ansa += i;
}
if (p == 1 && d == -1) {
ans2 += i;
ansb += i;
}
printf("? %d %d\n", ans1, ans2);
fflush(stdout);
scanf("%d", &d);
}
}
printf("! %d %d\n", ansa, ansb);
}
|
#include <bits/stdc++.h>
using namespace std;
int ask(int c, int d) {
cout << "? " << c << ' ' << d << endl;
int ans;
cin >> ans;
return ans;
}
int main() {
cout.flush();
int a = 0, b = 0, big = ask(0, 0);
for (int i = 29; i >= 0; i--) {
int f = ask(a ^ (1 << i), b), s = ask(a, b ^ (1 << i));
if (f == s) {
if (big == 1)
a ^= (1 << i);
else
b ^= (1 << i);
big = f;
} else if (f == -1) {
a ^= (1 << i);
b ^= (1 << i);
}
}
cout << "! " << a << ' ' << b << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<string> vec_splitter(string s) {
for (char& c : s) c = c == ',' ? ' ' : c;
stringstream ss;
ss << s;
vector<string> res;
for (string z; ss >> z; res.push_back(z))
;
return res;
}
void debug_out(vector<string> args, int idx) { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, Head H, Tail... T) {
if (idx > 0) cerr << ", ";
stringstream ss;
ss << H;
cerr << args[idx] << " = " << ss.str();
debug_out(args, idx + 1, T...);
}
void localTest() {}
map<pair<long long, long long>, long long> dp;
long long query(long long c, long long d) {
if (dp.find({c, d}) != dp.end()) {
return dp[{c, d}];
}
cout << "? " << c << " " << d << "\n";
cout.flush();
long long x;
cin >> x;
dp[{c, d}] = x;
return x;
}
void solver() {
long long N = 29;
long long a = 0, b = 0, greater = query(0, 0);
for (int i = N; i >= 0; --i) {
long long bit = (1LL << i);
long long fQuery = query(a ^ bit, b), sQuery = query(a, b ^ bit);
if (fQuery == sQuery) {
if (greater == 1) {
a |= bit;
} else {
b |= bit;
}
greater = fQuery;
} else if (sQuery == 1) {
a |= bit;
b |= bit;
}
}
cout << "! " << a << " " << b << "\n";
cout.flush();
return;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
while (t--) {
solver();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5205;
int n;
int sum[maxn][maxn];
char a;
char cs[] = "0123456789ABCDEF";
map<char, int> cidic;
void init() {
for (int i = 0; i < 16; i++) {
cidic[cs[i]] = i;
}
}
void update(int i, int j) {
sum[i][j] += (i > 0 ? sum[i - 1][j] : 0) + (j > 0 ? sum[i][j - 1] : 0) -
(i > 0 && j > 0 ? sum[i - 1][j - 1] : 0);
}
bool check(int k) {
for (int i = 0; i < n; i += k) {
for (int j = 0; j < n; j += k) {
int c_sum = sum[i + k - 1][j + k - 1] -
(j > 0 ? sum[i + k - 1][j - 1] : 0) -
(i > 0 ? sum[i - 1][j + k - 1] : 0) +
(i > 0 && j > 0 ? sum[i - 1][j - 1] : 0);
if (c_sum != 0 && c_sum != k * k) return false;
}
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
init();
for (int i = 0; i < n; i++) {
for (int j = 0; j < n / 4; j++) {
cin >> a;
int ms = cidic[a];
sum[i][j * 4] = (ms >> 3) & 1;
update(i, j * 4);
sum[i][j * 4 + 1] = (ms >> 2) & 1;
update(i, j * 4 + 1);
sum[i][j * 4 + 2] = (ms >> 1) & 1;
update(i, j * 4 + 2);
sum[i][j * 4 + 3] = ms & 1;
update(i, j * 4 + 3);
}
}
int k = 1;
while (k != n && !check(n / k)) {
k++;
while (n % k != 0) {
k++;
}
}
cout << n / k << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void DBG() { cerr << "]\n"; }
template <typename T, typename... Args>
void DBG(T first, Args... args) {
cerr << first;
if (sizeof...(args)) cerr << ", ";
DBG(args...);
}
const long long N = 6000;
vector<string> a(N, "");
bool can(long long k, long long n) {
for (long long i = 0; i < n; i += k) {
for (long long j = 0; j < n; j += k) {
for (long long x = 0; x < k; x++) {
for (long long y = 0; y < k; y++) {
if (a[i + x][j + y] != a[i][j]) {
return false;
}
}
}
}
}
return true;
}
void solve() {
long long n;
cin >> n;
map<char, string> m;
m['0'] = "0000";
m['1'] = "0001";
m['2'] = "0010";
m['3'] = "0011";
m['4'] = "0100";
m['5'] = "0101";
m['6'] = "0110";
m['7'] = "0111";
m['8'] = "1000";
m['9'] = "1001";
m['A'] = "1010";
m['B'] = "1011";
m['C'] = "1100";
m['D'] = "1101";
m['E'] = "1110";
m['F'] = "1111";
for (long long i = 0; i < n; i++) {
string x;
cin >> x;
for (long long j = 0; j < n / 4; j++) {
string val = m[x[j]];
for (char ch : val) a[i].push_back(ch);
}
}
for (long long i = n; i >= 1; i--) {
if (n % i == 0 && can(i, n)) {
cout << i << "\n";
return;
}
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long t = 1;
for (long long tt = 1; tt <= t; tt++) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
bool mat[5205][5205];
int prefR[5205][5205], prefC[5205][5205];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int t = 1;
while (t--) {
int n, i, j, k;
cin >> n;
char ch;
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j += 4) {
cin >> ch;
long long int num = 0;
if (isdigit(ch))
num = ch - '0';
else
num = ch - 'A' + 10;
k = j + 3;
while (num > 0) {
mat[i][k] = num % 2;
k--;
num /= 2;
}
}
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) prefR[i][j] = prefR[i][j - 1] + mat[i][j];
}
for (j = 1; j <= n; j++) {
for (i = 1; i <= n; i++) prefC[i][j] = prefC[i - 1][j] + mat[i][j];
}
for (i = n; i >= 2; i--) {
long long int f = 1;
if (n % i == 0) {
for (k = 1; k <= n; k++) {
for (j = 1; j <= n; j += i) {
long long int val = prefC[j + i - 1][k] - prefC[j - 1][k];
if (val != i * mat[j][k]) {
f = 0;
break;
}
}
if (!f) break;
}
if (!f) continue;
for (k = 1; k <= n; k++) {
for (j = 1; j <= n; j += i) {
long long int val = prefR[k][j + i - 1] - prefR[k][j - 1];
if (val != i * mat[k][j]) {
f = 0;
break;
}
}
if (!f) break;
}
if (f) {
cout << i << "\n";
return 0;
}
}
}
cout << "1\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int cc[5205][5205];
int check(int n, int t) {
int ok = 1;
for (int i = t; i <= n; i += t)
for (int j = t; j <= n; j += t) {
int val = cc[i][j] - cc[i - t][j] - cc[i][j - t] + cc[i - t][j - t];
if (!(val == 0 || val == t * t)) {
ok = 0;
break;
}
}
return ok;
}
int main() {
int n;
cin >> n;
string s;
for (int i = 0; i < n; ++i) {
cin >> s;
for (int j = 0; j < s.size(); ++j) {
int d = (isalpha(s[j]) ? s[j] - 'A' + 10 : s[j] - '0');
for (int k = 3; k >= 0; --k) {
cc[i + 1][(j * 4 + k) + 1] = (d & 1);
d >>= 1;
}
}
}
for (int i = 0; i <= n; ++i) cc[0][i] = cc[i][0] = 0;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
cc[i][j] = cc[i - 1][j] + cc[i][j - 1] - cc[i - 1][j - 1] + cc[i][j];
vector<int> can;
for (int i = 1; i <= n; ++i)
if (n % i == 0) can.push_back(i);
int res = 1;
for (int i = can.size() - 1; i > 0; --i) {
int ok = check(n, can[i]);
if (ok) {
res = can[i];
break;
}
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[5206][5206], sum[5206][5206], v[5000];
int n, sol, lg;
int main() {
cin >> n;
for (int l = 1; l <= n; l++) {
string s;
cin >> s;
for (int c = 1; c <= s.size(); c++) {
char chr;
int val;
chr = s[c - 1];
if (chr >= '0' and chr <= '9')
val = chr - '0';
else
val = chr - 'A' + 10;
for (int bit = 3; bit >= 0; bit--)
a[l][4 * c - bit] = ((val & (1 << bit)) > 0);
}
}
sol = n;
for (int l = 1; l <= n; l++)
for (int c = 1; c <= n; c++) {
sum[l][c] = sum[l - 1][c] + sum[l][c - 1] - sum[l - 1][c - 1] + a[l][c];
}
for (int i = n; i >= 1; i--)
if (n % i == 0) {
lg++;
v[lg] = i;
}
for (int k = 1; k <= lg; k++) {
int dim = v[k];
bool ok = true;
for (int l = 0; l < n; l = l + dim)
for (int c = 0; c < n; c = c + dim) {
int sumtot = sum[l + dim][c + dim] - sum[l + dim][c] - sum[l][c + dim] +
sum[l][c];
if (sumtot != 0 and sumtot != dim * dim) ok = false;
}
if (ok) {
cout << dim;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool isPrime(long long n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (long long i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
vector<long long> primes;
bool prime[10005];
void seive() {
memset(prime, 1, sizeof(prime));
prime[0] = 0;
prime[1] = 0;
for (long long i = 2; i <= 10000; i++) {
if (prime[i] == 1) {
for (long long j = i * i; j <= 10000; j += i) prime[j] = 0;
}
}
}
long long power(long long a, long long b) {
long long ans = 1;
while (b > 0) {
if (b % 2 == 1) ans = (ans % 1000000007 * a % 1000000007) % 1000000007;
a = (a * a) % 1000000007;
b = b / 2;
}
return ans;
}
template <typename T>
std::string NumberToString(T Number) {
std::ostringstream ss;
ss << Number;
return ss.str();
}
string cal(char c) {
if (c == '0') return "0000";
if (c == '1') return "0001";
if (c == '2') return "0010";
if (c == '3') return "0011";
if (c == '4') return "0100";
if (c == '5') return "0101";
if (c == '6') return "0110";
if (c == '7') return "0111";
if (c == '8') return "1000";
if (c == '9') return "1001";
if (c == 'A') return "1010";
if (c == 'B') return "1011";
if (c == 'C') return "1100";
if (c == 'D') return "1101";
if (c == 'E') return "1110";
if (c == 'F') return "1111";
}
void solve() {
int n;
cin >> n;
int i, j, a[n + 1][n + 1], b[n + 1][n + 1];
for (i = 0; i <= n; i++)
for (j = 0; j <= n; j++) {
a[i][j] = 0;
b[i][j] = 0;
}
for (i = 1; i <= n; i++) {
string s;
cin >> s;
int k = 1;
for (j = 0; j < s.size(); j++) {
string ss = cal(s[j]);
int z = 0;
for (int l = k; l < k + 4; l++) {
int x = ss[z++] - '0';
if (x == 1)
a[i][l] = true;
else
a[i][l] = false;
b[i][l] = a[i][l];
}
k += 4;
}
}
vector<int> vec;
for (i = n; i >= 1; i--) {
if (n % i == 0) vec.push_back(i);
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) a[i][j] += a[i][j - 1];
}
for (j = 1; j <= n; j++) {
for (i = 1; i <= n; i++) b[i][j] += b[i - 1][j];
}
for (int p = 0; p < vec.size(); p++) {
int x = vec[p];
int flag = 0;
for (i = 1; i <= n; i++) {
for (j = x; j <= n; j += x) {
long long sum = a[i][j] - a[i][j - x];
if (sum == x || sum == 0)
;
else {
flag = 1;
break;
}
}
if (flag) break;
}
for (j = 1; j <= n; j++) {
for (i = x; i <= n; i += x) {
long long sum = b[i][j] - b[i - x][j];
if (sum == x || sum == 0)
;
else {
flag = 1;
break;
}
}
if (flag) break;
}
if (!flag) {
cout << x;
return;
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
bool codechef = 0;
long long t = 1;
if (codechef) cin >> t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma warning(disable : 4996)
const int N = 5201;
bool b[N][N];
char s[N];
int gcd(int a, int b) { return a ? gcd(b % a, a) : b; }
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf(" %s", s);
for (int j = 0; j < n / 4; j++) {
int x = isdigit(s[j]) ? s[j] - '0' : s[j] - 'A' + 10;
for (int k = 0; k < 4; k++) b[i][j * 4 + k] = (x >> (3 - k)) & 1;
}
}
int g = 0;
for (int i = 0; i < n; i++) {
int k = -1;
for (int j = 0; j < n; j++) {
if (j == n - 1 || b[i][j] != b[i][j + 1]) {
g = gcd(g, j - k);
k = j;
}
}
}
for (int i = 0; i < n; i++) {
int k = -1;
for (int j = 0; j < n; j++) {
if (j == n - 1 || b[j + 1][i] != b[j][i]) {
g = gcd(g, j - k);
k = j;
}
}
}
cout << g << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
const double eps = (1e-8);
string g[5205];
int sum[5205][5205];
int getSum(int i1, int j1, int i2, int j2) {
int ret = sum[i2][j2];
if (i1 - 1 >= 0) {
ret -= sum[i1 - 1][j2];
}
if (j1 - 1 >= 0) {
ret -= sum[i2][j1 - 1];
}
if (i1 - 1 >= 0 && j1 - 1 >= 0) ret += sum[i1 - 1][j1 - 1];
return ret;
}
int n;
bool check(int x) {
for (int j = 0; j < n; j += x) {
for (int i = 0; i < n; i += x) {
if (getSum(i, j, i + x - 1, j + x - 1) != x * x &&
getSum(i, j, i + x - 1, j + x - 1) != 0)
return false;
}
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n / 4; ++j) {
char c;
cin >> c;
if (isalpha(c)) {
c -= 'A' - 10;
} else
c -= '0';
string bin;
while (c) {
bin += c % 2 + '0';
c /= 2;
}
while ((int)(bin).size() < 4) bin += '0';
reverse(bin.begin(), bin.end());
g[i] += bin;
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
sum[i][j] = g[i][j] - '0';
}
partial_sum(sum[i], sum[i] + n, sum[i]);
for (int j = 0; j < n; ++j) {
if (i - 1 >= 0) {
sum[i][j] += sum[i - 1][j];
}
}
}
for (int i = n; i > 1; --i) {
if (n % i == 0 && check(i)) {
cout << i << '\n';
return 0;
}
}
cout << 1 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = (int)5202;
const int mod = (int)1e9 + 7;
int n, m, k, l, s, t, r, ans, T;
bool a[maxn][maxn], now;
int b[maxn][maxn];
vector<int> ppp;
string p;
inline int cal(int x) {
if (x >= '0' && x <= '9')
return x - '0';
else
return x - 'A' + 10;
}
inline int query(int l1, int r1, int l2, int r2) {
return b[l2][r2] - b[l2][r1 - 1] - b[l1 - 1][r2] + b[l1 - 1][r1 - 1];
}
int ttt(int k) {
for (int i = k; i <= n; i += k)
for (int j = k; j <= n; j += k) {
int nowi = i - k + 1;
int nowj = j - k + 1;
int tmp = query(nowi, nowj, i, j);
if (tmp != 0 && tmp != k * k) return 0;
}
return 1;
}
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p;
for (int j = 0; j < n / 4; j++) {
int tmp = cal(p[j]);
a[i][(j)*4 + 4] = tmp % 2;
tmp /= 2;
a[i][(j)*4 + 3] = tmp % 2;
tmp /= 2;
a[i][(j)*4 + 2] = tmp % 2;
tmp /= 2;
a[i][(j)*4 + 1] = tmp % 2;
tmp /= 2;
}
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
b[i][j] = b[i - 1][j] + b[i][j - 1] + a[i][j] - b[i - 1][j - 1];
for (int i = 1; i <= n; i++) {
if (n % i == 0) {
ppp.push_back(i);
}
}
int L = 1, R = ppp.size();
for (int i = R - 1; i >= 0; i--) {
if (ttt(ppp[i])) {
ans = ppp[i];
break;
}
if ((double)clock() / (double)CLOCKS_PER_SEC >= 2.4) break;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template <size_t l>
using BS = bitset<l>;
template <typename T>
using D = deque<T>;
template <typename T>
using L = list<T>;
template <typename T>
using MS = multiset<T>;
template <typename T, typename U>
using P = pair<T, U>;
template <typename T>
using Q = queue<T>;
template <typename T>
using S = set<T>;
template <typename T, typename U>
using UM = unordered_map<T, U>;
template <typename T>
using UMS = unordered_multiset<T>;
template <typename T>
using US = unordered_set<T>;
template <typename T>
using V = vector<T>;
template <typename T>
ostream& operator<<(ostream& os, const D<T>& d) {
os << "d[";
for (auto it = d.begin(), next = d.begin(); d.end() != next; it = next) {
os << *it;
++next;
if (d.end() != next) {
os << ", ";
}
}
return os << "]";
}
template <typename T>
ostream& operator<<(ostream& os, const L<T>& l) {
os << "l[";
for (auto it = l.begin(), next = l.begin(); l.end() != next; it = next) {
os << *it;
++next;
if (l.end() != next) {
os << ", ";
}
}
return os << "]";
}
template <typename T>
ostream& operator<<(ostream& os, const MS<T>& ms) {
os << "m{";
for (auto it = ms.begin(), next = ms.begin(); ms.end() != next; it = next) {
os << *it;
++next;
if (ms.end() != next) {
os << ", ";
}
}
return os << "}";
}
template <typename T>
ostream& operator<<(ostream& os, const S<T>& s) {
os << "{";
for (auto it = s.begin(), next = s.begin(); s.end() != next; it = next) {
os << *it;
++next;
if (s.end() != next) {
os << ", ";
}
}
return os << "}";
}
template <typename T, typename U>
ostream& operator<<(ostream& os, const UM<T, U>& um) {
os << "um{";
for (auto it = um.begin(), next = um.begin(); um.end() != next; it = next) {
os << it->first << ": " << it->second;
++next;
if (um.end() != next) {
os << ", ";
}
}
return os << "}";
}
template <typename T>
ostream& operator<<(ostream& os, const UMS<T>& ums) {
os << "ums{";
for (auto it = ums.begin(), next = ums.begin(); ums.end() != next;
it = next) {
os << *it;
++next;
if (ums.end() != next) {
os << ", ";
}
}
return os << "}";
}
template <typename T>
ostream& operator<<(ostream& os, const US<T>& us) {
os << "us{";
for (auto it = us.begin(), next = us.begin(); us.end() != next; it = next) {
os << *it;
++next;
if (us.end() != next) {
os << ", ";
}
}
return os << "}";
}
template <typename T>
ostream& operator<<(ostream& os, const V<T>& v) {
os << "[";
for (auto it = v.begin(), next = v.begin(); v.end() != next; it = next) {
os << *it;
++next;
if (v.end() != next) {
os << ", ";
}
}
return os << "]";
}
template <typename T>
const T& abs(const T& x) {
if (x >= 0) {
return x;
}
return -x;
}
template <typename T>
V<T>& uniq(V<T>& v) {
const auto newend_it = unique(v.begin(), v.end());
v.resize(newend_it - v.begin());
return v;
}
template <typename T>
struct E {
T u, v;
};
template <typename T>
ostream& operator<<(ostream& os, const E<T>& e) {
return os << "(" << e.u << ", " << e.v << ")";
}
template <typename T>
bool operator<(const E<T>& l, const E<T>& r) {
return l.u < r.u || (l.u == r.u && l.v < r.v);
}
template <typename T>
constexpr T cshift(const T t, size_t left_shift_bits = 1) {
constexpr size_t T_bits = sizeof(T) * 8;
left_shift_bits %= T_bits;
left_shift_bits += T_bits;
left_shift_bits %= T_bits;
const size_t right_shift_bits = T_bits - left_shift_bits;
return (t << left_shift_bits) ^ (t >> right_shift_bits);
}
template <typename T>
size_t numdigits(T x, size_t base = 10) {
size_t ret = 0;
while (x > 0) {
x /= base;
++ret;
}
return ret;
}
UM<char, string> LOOKUP = {
{'0', "0000"}, {'1', "0001"}, {'2', "0010"}, {'3', "0011"},
{'4', "0100"}, {'5', "0101"}, {'6', "0110"}, {'7', "0111"},
{'8', "1000"}, {'9', "1001"}, {'A', "1010"}, {'B', "1011"},
{'C', "1100"}, {'D', "1101"}, {'E', "1110"}, {'F', "1111"},
};
size_t n;
V<string> A;
V<BS<5200>> X, Y;
V<int> divs;
int main() {
cin >> n;
A = V<string>(n);
for (int i = 0; i < int(n); i++) {
string tmp;
cin >> tmp;
for (const char& ch : tmp) {
A[i] += LOOKUP[ch];
}
}
for (int i = 1; i <= n; ++i) {
if (n % i == 0) {
divs.push_back(i);
}
}
X = V<BS<5200>>(n);
for (int i = 0; i < int(n); i++) {
X[i] = BS<5200>(A[i]);
}
Y = V<BS<5200>>(n);
for (int i = 0; i < int(n); i++) {
for (int j = 0; j < int(n); j++) {
Y[i][j] = X[j][i];
}
}
for (auto it = divs.rbegin(); divs.rend() != it; ++it) {
const int d = *it;
if (d == 1) {
cout << d << endl;
return 0;
}
BS<5200> mask = 0b1, tmpbs;
tmpbs = mask;
int tmpd = d;
do {
mask = tmpbs;
tmpbs = mask | (mask << tmpd);
tmpd *= 2;
} while (mask != tmpbs);
mask.flip();
for (int i = 0; i < int(n); i++) {
if (!(((((X[i] & (mask >> 1)) << 1) | ((X[i] & mask) >> 1)) == X[i]) &&
((((Y[i] & (mask >> 1)) << 1) | ((Y[i] & mask) >> 1)) == Y[i]))) {
goto breakcontinue;
}
}
cout << d << endl;
return 0;
breakcontinue:;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int raod[5201][5201];
int n, in1, in2, first;
string second;
bool check(int x) {
for (int i = 1; i <= n / x; i++) {
for (int j = 1; j <= n / x; j++) {
in1 = i * x;
in2 = j * x;
first = raod[in1][in2] - raod[in1 - x][in2] - raod[in1][in2 - x] +
raod[in1 - x][in2 - x];
if (first != 0 && first != x * x) return false;
}
}
return true;
}
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> second;
for (int j = 0; j < second.size(); j++) {
int x;
if (second[j] >= '0' && second[j] <= '9')
x = second[j] - '0';
else
x = (second[j] - 'A') + 10;
string p = "";
while (x) {
if (x & 1)
p += '1';
else
p += '0';
x /= 2;
}
while ((int)p.size() != 4) p += '0';
reverse(p.begin(), p.end());
for (int l = 0; l < 4; l++)
raod[i][j * 4 + l + 1] = raod[i - 1][j * 4 + l + 1] +
raod[i][j * 4 + l] - raod[i - 1][j * 4 + l] +
(p[l] == '1');
}
}
for (int i = n; i >= 1; i--) {
if (n % i != 0) continue;
if (check(i)) {
cout << i << '\n';
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:33554432")
using namespace std;
long long MOD = 1e9 + 7;
int n, k;
int A[5202][5202];
int pref[5202][5202];
bool check(int i, int j, int val) {
return A[i][j] * val * val == pref[i + val][j + val] + pref[i][j] -
pref[i][j + val] - pref[i + val][j];
}
bool poss(int val) {
for (int i = 0; i < n; i += val) {
for (int j = 0; j < n; j += val) {
if (!check(i, j, val)) return false;
}
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
scanf("%d\n", &n);
for (int i = 0; i < n; i++) {
char curr;
for (int j = 0; j < n / 4; j++) {
scanf("%c", &curr);
int el = curr > '9' ? curr - 'A' + 10 : curr - '0';
for (int k = 0; k < 4; k++) {
A[i][j * 4 + k] = el >= (1 << (3 - k)) ? 1 : 0;
el -= el >= 1 << (3 - k) ? 1 << (3 - k) : 0;
}
}
scanf("%c", &curr);
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
pref[i][j] = pref[i - 1][j] + pref[i][j - 1] - pref[i - 1][j - 1] +
A[i - 1][j - 1];
}
int answer = 1;
for (int i = 1; i <= n; i++) {
if (n % i == 0 && poss(i)) answer = i;
}
printf("%d", answer);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int n;
void change(char ch, vector<int> &c);
void change(char ch, vector<int> &c) {
long long int num;
if ((int)(ch) >= 65) {
num = (int)(ch)-55;
} else {
num = (int)(ch)-48;
}
long long int p = 3;
while (num > 0) {
long long int d = num % 2;
num = num / 2;
c[p--] = d;
}
for (int i = p; i >= 0; i--) {
c[i] = 0;
}
}
void convert(string s, vector<int> &d) {
long long int p = 0;
for (int i = 0; i < s.length(); i++) {
vector<int> c(4, 0);
change(s[i], c);
long long int p1 = 0;
for (int j = p; j < p + 4; j++) {
d[j] = c[p1++];
}
p = p + 4;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
cin >> n;
int a[n + 1][n + 1];
for (int i = 0; i < n; i++) {
vector<int> d(n, 0);
string s;
cin >> s;
convert(s, d);
for (int j = 0; j < n; j++) {
a[i][j] = d[j];
}
}
vector<vector<int> > rect(n + 1, vector<int>(n + 1, 0));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
long long int s = 0;
if (i >= 0 && j - 1 >= 0) {
s += rect[i][j - 1];
}
if (i - 1 >= 0 && j >= 0) {
s += rect[i - 1][j];
}
if (i - 1 >= 0 && j - 1 >= 0) {
s -= rect[i - 1][j - 1];
}
s += a[i][j];
rect[i][j] = s;
}
}
vector<int> factor;
for (int i = 1; i <= n; i++) {
if (n % i == 0) {
factor.push_back(i);
}
}
sort(factor.begin(), factor.end());
long long int ans = 1;
long long int size = factor.size();
for (int k = size - 1; k >= 0; k--) {
long long int x = factor[k];
long long int flag = 0;
for (int i = 0; i < n; i += x) {
for (int j = 0; j < n; j += x) {
long long int s = 0;
if (i + x - 1 < n && j + x - 1 < n) {
s += rect[i + x - 1][j + x - 1];
}
if (i - 1 >= 0 && j - 1 >= 0) {
s += rect[i - 1][j - 1];
}
if (i - 1 >= 0 && j + x - 1 < n) {
s -= rect[i - 1][j + x - 1];
}
if (i + x - 1 < n && j - 1 >= 0) {
s -= rect[i + x - 1][j - 1];
}
if (a[i][j] == 0) {
if (s != 0) {
flag = -1;
break;
}
} else {
if (s != x * x) {
flag = -1;
break;
}
}
}
if (flag == -1) {
break;
}
}
if (flag == 0) {
ans = x;
break;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int LIM = 1e5 + 5, MOD = 1e9 + 7;
const int N_MAX = 5205;
int N;
bitset<N_MAX> matrix[N_MAX];
int rect[N_MAX][N_MAX];
int get_rect(int r1, int r2, int c1, int c2) {
return rect[r2][c2] - rect[r2][c1] - rect[r1][c2] + rect[r1][c1];
}
int hexconvert(char hex) { return isdigit(hex) ? hex - '0' : hex - 'A' + 10; }
int main() {
cin >> N;
char str[N_MAX];
for (int i = 0; i < N; i++) {
cin >> str;
reverse(str, str + N / 4);
for (int j = 0; j < N; j++)
matrix[i][j] = (hexconvert(str[j / 4]) >> j % 4) & 1;
}
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
rect[i + 1][j + 1] =
rect[i + 1][j] + rect[i][j + 1] - rect[i][j] + matrix[i][j];
for (int x = N; x > 0; x--)
if (N % x == 0) {
bool good = true;
for (int i = 0; i < N && good; i += x)
for (int j = 0; j < N && good; j += x) {
int sum = get_rect(i, i + x, j, j + x);
if (sum != x * x && sum != 0) good = false;
}
if (good) {
cout << x << '\n';
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, mat[5300][5300], d[5300][5300];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
memset(d, 0, sizeof(d));
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n / 4; j++) {
char c;
cin >> c;
int x = c - '0';
if (c >= 'A') x = c - 'A' + 10;
for (int p = j * 4 + 3; p >= j * 4; p--) {
mat[i][p] = 0;
if (x % 2) mat[i][p] = 1;
x /= 2;
}
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
d[i + 1][j + 1] = d[i][j + 1] + d[i + 1][j] - d[i][j] + mat[i][j];
}
}
int x = n;
for (; x > 1; x--) {
if (n % x != 0) continue;
bool t = false;
for (int i = 1; i <= n; i += x) {
for (int j = 1; j <= n; j += x) {
int sum = d[i + x - 1][j + x - 1] + d[i - 1][j - 1] -
d[i + x - 1][j - 1] - d[i - 1][j + x - 1];
if (sum != x * x and sum != 0) {
t = true;
break;
}
}
if (t) break;
}
if (!t) return cout << x, 0;
}
cout << 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const long long inf = 1e14;
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, ans = 0;
cin >> n;
long long bi[n][n];
memset(bi, 0, sizeof(bi));
string s;
for (long long i = 0; i < n; i++) {
cin >> s;
for (long long j = 0; j < n / 4; j++) {
if (s[j] > '9') {
if (s[j] == 'A') {
bi[i][j * 4] = 1;
bi[i][j * 4 + 1] = 0;
bi[i][j * 4 + 2] = 1;
bi[i][j * 4 + 3] = 0;
} else if (s[j] == 'B') {
bi[i][j * 4] = 1;
bi[i][j * 4 + 1] = 0;
bi[i][j * 4 + 2] = 1;
bi[i][j * 4 + 3] = 1;
} else if (s[j] == 'C') {
bi[i][j * 4] = 1;
bi[i][j * 4 + 1] = 1;
bi[i][j * 4 + 2] = 0;
bi[i][j * 4 + 3] = 0;
} else if (s[j] == 'D') {
bi[i][j * 4] = 1;
bi[i][j * 4 + 1] = 1;
bi[i][j * 4 + 2] = 0;
bi[i][j * 4 + 3] = 1;
} else if (s[j] == 'E') {
bi[i][j * 4] = 1;
bi[i][j * 4 + 1] = 1;
bi[i][j * 4 + 2] = 1;
bi[i][j * 4 + 3] = 0;
} else if (s[j] == 'F') {
bi[i][j * 4] = 1;
bi[i][j * 4 + 1] = 1;
bi[i][j * 4 + 2] = 1;
bi[i][j * 4 + 3] = 1;
}
} else {
long long tmp = s[j] - '0';
bitset<4> bs(tmp);
bi[i][j * 4] = bs[3];
bi[i][j * 4 + 1] = bs[2];
bi[i][j * 4 + 2] = bs[1];
bi[i][j * 4 + 3] = bs[0];
}
}
}
long long an = 0;
for (long long i = 0; i < n; i++) {
long long cnt0 = 0, cnt1 = 0, tmp = 0;
for (long long j = 0; j < n; j++) {
if (bi[i][j] == 1) cnt1++;
if (bi[i][j] == 0 || j == n - 1) {
an = gcd(an, cnt1);
cnt1 = 0;
}
}
tmp = 0;
for (long long j = 0; j < n; j++) {
if (bi[i][j] == 0) cnt0++;
if (bi[i][j] == 1 || j == n - 1) {
an = gcd(an, cnt0);
cnt0 = 0;
}
}
}
for (long long i = 0; i < n; i++) {
long long cnt0 = 0, cnt1 = 0, tmp = 0;
for (long long j = 0; j < n; j++) {
if (bi[j][i] == 1) cnt1++;
if (bi[j][i] == 0 || j == n - 1) {
an = gcd(an, cnt1);
cnt1 = 0;
}
}
for (long long j = 0; j < n; j++) {
if (bi[j][i] == 0) cnt0++;
if (bi[j][i] == 1 || j == n - 1) {
an = gcd(an, cnt0);
cnt0 = 0;
}
}
}
cout << an;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
template <class T>
istream &operator>>(istream &, vector<T> &);
template <class T>
ostream &operator<<(ostream &, const vector<T> &);
using ll = long long;
using vll = vector<long long>;
constexpr int INF = 0x3f3f3f3f;
constexpr ll BINF = 0x3f3f3f3f3f3f3f3fLL;
const int N = 5200;
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
int getPeriod(const vector<int> &s) {
int sz = 0, now = -1;
for (int i = 0; i < s.size(); i++) {
if (i > 0 && s[i] != s[i - 1]) {
if (now == -1)
now = sz;
else
now = gcd(now, sz);
sz = 1;
} else {
sz++;
}
}
if (now == -1)
now = sz;
else
now = gcd(now, sz);
return now;
}
int solve() {
int n;
cin >> n;
vector<string> v(n);
cin >> v;
vector<vi> a(n, vi(n)), b(n, vi(n));
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
if (isdigit(v[i][j / 4])) {
a[i][j] = ((v[i][j / 4] - '0') >> (3 - j % 4)) & 1;
b[j][i] = ((v[i][j / 4] - '0') >> (3 - j % 4)) & 1;
} else {
a[i][j] = ((v[i][j / 4] - 'A' + 10) >> (3 - j % 4)) & 1;
b[j][i] = ((v[i][j / 4] - 'A' + 10) >> (3 - j % 4)) & 1;
}
}
vector<int> periods;
for (int i = 0; i < n; i++) {
periods.push_back(getPeriod(a[i]));
periods.push_back(getPeriod(b[i]));
}
for (int i = 1; i < periods.size(); i++)
periods[0] = gcd(periods[0], periods[i]);
cout << periods[0] << endl;
return 0;
}
int main() {
ios::sync_with_stdio(0);
solve();
return 0;
}
template <class T>
istream &operator>>(istream &is, vector<T> &v) {
for (auto it = v.begin(); it != v.end(); ++it) is >> *it;
return is;
}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto it = v.begin(); it != v.end();) os << *it << " \n"[++it == v.end()];
return os;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
char input[5205], B[5205][5205];
string board[5205];
void fill(int r, char original) {
if (original == '0') board[r] += "0000";
if (original == '1') board[r] += "0001";
if (original == '2') board[r] += "0010";
if (original == '3') board[r] += "0011";
if (original == '4') board[r] += "0100";
if (original == '5') board[r] += "0101";
if (original == '6') board[r] += "0110";
if (original == '7') board[r] += "0111";
if (original == '8') board[r] += "1000";
if (original == '9') board[r] += "1001";
if (original == 'A') board[r] += "1010";
if (original == 'B') board[r] += "1011";
if (original == 'C') board[r] += "1100";
if (original == 'D') board[r] += "1101";
if (original == 'E') board[r] += "1110";
if (original == 'F') board[r] += "1111";
}
int solve(int x) {
for (int i = 1; i <= n; i += x) {
for (int j = 1; j <= n; j += x) {
char now = board[i][j];
for (int k = i; k < i + x; k++) {
for (int q = j; q < j + x; q++) {
if (board[k][q] == now)
continue;
else
return 0;
}
}
}
}
return 1;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%s", &input);
board[i] += ' ';
for (int j = 0; j < n / 4; j++) {
fill(i, input[j]);
}
}
for (int i = n; i >= 1; i--) {
if (!(n % i)) {
if (solve(i)) {
printf("%d\n", i);
return 0;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool ok[5206], book[5206];
int P[5206][5206], n;
int qwq(char x) {
if (x >= 'A')
return 10 + x - 'A';
else
return x - '0';
}
int p[5206], num;
void Analyze(int x) {
num = 0;
for (int i = 2; i * i <= x; ++i)
while (x % i == 0) x /= i, p[num++] = i;
if (x > 1) p[num++] = x;
}
bool work(int x) {
if (book[x]) return ok[x];
book[x] = true;
for (int i = 0; i < n; ++i)
for (int j = 0; j < n / x; ++j)
for (int k = 1; k < x; ++k)
if (P[i][j * x + k] != P[i][j * x + k - 1]) return ok[x] = false;
for (int i = 0; i < n; ++i)
for (int j = 0; j < n / x; ++j)
for (int k = 1; k < x; ++k)
if (P[j * x + k][i] != P[j * x + k - 1][i]) return ok[x] = false;
return ok[x] = true;
}
int main() {
cin >> n;
getchar();
char ch;
for (int i = 0, q; i < n; ++i) {
for (int j = 0; j < n / 4; ++j) {
ch = getchar();
q = qwq(ch);
for (int k = 1; k <= 4; ++k) P[i][(j + 1) * 4 - k] = (q & 1), q >>= 1;
}
getchar();
}
Analyze(n);
int ans = 1;
for (int i = 0; i < num; ++i) {
if (work(p[i] * ans)) ans *= p[i];
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
void tobin(char hex, int bin[]) {
int x;
if (hex >= 48 && hex <= 57)
x = hex - '0';
else
x = hex - 'A' + 10;
int k = 4;
while (k >= 1) {
bin[k] = x % 2;
x = x / 2;
k--;
}
}
int sum(int *dp[5201], bool *a[5201], int n) {
for (int i = 0; i <= n; i++) dp[i][0] = dp[0][i] = 0;
for (int i = 1; i <= n; i++) {
dp[i][1] = dp[i - 1][1] + a[i][1];
dp[1][i] = dp[1][i - 1] + a[1][i];
}
for (int i = 2; i <= n; i++) {
for (int j = 2; j <= n; j++) {
dp[i][j] = dp[i - 1][j] + dp[i][j - 1] + a[i][j] - dp[i - 1][j - 1];
}
}
for (int x = n; x >= 1; x--) {
if (n % x != 0) continue;
int flag = 1;
for (int i = 1; i <= n / x; i++) {
for (int j = 1; j <= n / x; j++) {
int y = dp[i * x][j * x] - dp[(i - 1) * x][j * x] -
dp[i * x][(j - 1) * x] + dp[(i - 1) * x][(j - 1) * x];
if (y != 0 && y != x * x) {
flag = 0;
break;
}
}
if (flag == 0) break;
}
if (flag == 1) return x;
}
}
int main() {
int n;
cin >> n;
int bin[5];
bool *a[5201];
int *dp[5201];
for (int i = 0; i <= 5200; i++) {
a[i] = new bool[5201];
dp[i] = new int[5201];
}
char ch[1301];
for (int i = 1; i <= n; i++) {
cin >> ch;
int j = 1;
for (int k = 0; ch[k] != '\0'; k++) {
tobin(ch[k], bin);
for (int t = 1; t <= 4; t++) a[i][j++] = bin[t];
}
}
int ans = sum(dp, a, n);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int mod = 1e9 + 7;
long double eps = 1e-12;
int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
int n, res = 0, k = 0, h, ans = 0, m;
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int lcm(int x, int y) { return (x * y) / gcd(x, y); }
int pot(int a, int b) {
if (b < 0) return 0;
int r = 1;
while (b) {
if (b % 2) r = (r * a) % mod;
a = (a * a) % mod;
b /= 2;
}
return r % mod;
}
void pr(int a[], int n) {
for (int i = 1; i <= n; i++) cout << a[i] << " ";
cout << '\n';
}
void read(int a[], int n) {
for (int i = 1; i <= n; i++) cin >> a[i];
}
void yes() { cout << "YES\n"; }
void no() { cout << "NO\n"; }
vector<int> v[300015];
void add_edge(int x, int y) {
v[x].push_back(y);
v[y].push_back(x);
}
string s2, ch = "", s[5205], s1 = "", t;
vector<pair<string, int> > vs;
vector<pair<pair<int, int>, int> > vvv, vvv2;
vector<pair<int, int> > vv[300015], vv2;
int dp[5205][5205];
string HexToBin(char c) {
switch (toupper(c)) {
case '0':
return "0000";
case '1':
return "0001";
case '2':
return "0010";
case '3':
return "0011";
case '4':
return "0100";
case '5':
return "0101";
case '6':
return "0110";
case '7':
return "0111";
case '8':
return "1000";
case '9':
return "1001";
case 'A':
return "1010";
case 'B':
return "1011";
case 'C':
return "1100";
case 'D':
return "1101";
case 'E':
return "1110";
case 'F':
return "1111";
}
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int i = 0, x = 0, z = 0, y = 0, j = 0, q, mx = 0, mm, idx = 0, ok = 0, l = 0,
r, negatif = 0, positif = 0;
set<int>::iterator itw, ith;
set<int>::iterator it;
multiset<int> mst, mst2;
cin >> n;
for (i = 0; i <= (int)(n - 1); i++) {
s[i] = "";
for (j = 0; j < (n / 4); j++) {
char c;
cin >> c;
s[i] += HexToBin(c);
}
}
for (i = 1; i <= (int)(n); i++) {
for (j = 1; j <= (int)(n); j++) {
dp[i][j] = dp[i][j - 1] + dp[i - 1][j] - dp[i - 1][j - 1];
if (s[i - 1][j - 1] == '1') {
dp[i][j]++;
}
}
}
vector<int> v;
for (i = 1; i <= n; i++) {
if (n % i == 0) v.push_back(i);
}
for (l = ((int)((v).size())) - 1; l >= 0; l--) {
x = v[l];
int flag = 1;
for (i = x; i <= n; i += x) {
for (j = x; j <= n; j += x) {
int nb1 = dp[i][j] - dp[i - x][j] - dp[i][j - x] + dp[i - x][j - x];
int nb0 = x * x - nb1;
if (nb1 != (x * x) && nb0 != (x * x)) {
flag = 0;
break;
}
}
if (!flag) break;
}
if (flag) return cout << x, 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[1309];
bool a[5201][5201];
int n, i, j, k, f, dp[2][5201][5201];
int main() {
for (scanf("%d", &n), i = 1; i <= n; ++i)
for (scanf("%s", s), j = 0; s[j]; k = s[j] - ('9' < s[j] ? 'A' - 10 : '0'),
a[i][(j << 2) + 1] = 8 & k, a[i][(j << 2) + 2] = 4 & k,
a[i][(j << 2) + 3] = 2 & k, a[i][(j << 2) + 4] = 1 & k,
++j)
;
for (i = 1; i <= n; ++i)
for (j = 1; j <= n; k = (bool)a[i][j],
dp[k][i][j] = 1 + min(dp[k][i - 1][j - 1],
min(dp[k][i][j - 1], dp[k][i - 1][j])),
++j)
;
for (k = n + 1; --k; f ? (exit(printf("%d\n", k) & 0)) : (void)0)
for (f = !(n % (i = k)); f && i <= n; i += k)
for (j = k; f && j <= n; f &= (dp[(bool)a[i][j]][i][j] >= k), j += k)
;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
bool a[5500][5500];
bool f[5500];
int checked[5500];
int spf[5500];
const int N = 5500;
int prime[N];
bool check2(int jj, int pf) {
vector<vector<bool> > vv;
for (int i = 0; i < n * pf / jj; ++i) {
vector<bool> kg;
for (int j = 0; j < n * pf / jj; ++j) {
kg.push_back(a[i * jj / pf][j * jj / pf]);
}
vv.push_back(kg);
}
for (int i = 0; i < (int)vv.size(); ++i)
for (int j = 0; j < (int)vv.size(); ++j) {
int i2 = i - i % pf;
int j2 = j - j % pf;
if (vv[i][j] != vv[i2][j2]) return 0;
}
return 1;
}
bool check(int kk) {
vector<int> pff;
bool ok = true;
int num = kk;
while (num != 1) {
int cnt = 1;
int j = spf[num];
while (num % j == 0) {
num /= j;
cnt *= j;
}
ok &= f[cnt];
}
return ok;
}
void solve() {
int ndash = N - 1;
for (int i = 2; i <= ndash; ++i) {
if (!spf[i]) {
for (int j = i; j <= ndash; j += i)
if (!spf[j]) spf[j] = i;
}
}
f[1] = 1;
cin >> n;
char s;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n / 4; ++j) {
int num = 0;
cin >> s;
if (s >= '0' and s <= '9')
num = s - '0';
else
num = 10 + s - 'A';
for (int k = 0; k < 4; ++k) a[i][j * 4 + k] = (num & (1 << (3 - k)));
}
}
vector<int> facts;
vector<int> pfs;
int nn = n;
for (int i = 2; i < n + 1; ++i) {
if (nn % i == 0) pfs.push_back(i);
while (nn % i == 0) nn /= i;
}
for (int i = 0; i < (int)pfs.size(); ++i) {
bool ok = true;
int jj = pfs[i];
while (jj <= n) {
ok &= f[jj / pfs[i]];
if (ok) ok &= check2(jj, pfs[i]);
f[jj] = ok;
jj *= pfs[i];
}
}
int ans = 1;
for (int i = 1; i < n + 1; ++i)
if (n % i == 0 and check(i)) ans = i;
cout << ans << '\n';
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string a[5205];
string x[505];
int main() {
x['0'] = "0000";
x['1'] = "0001";
x['2'] = "0010";
x['3'] = "0011";
x['4'] = "0100";
x['5'] = "0101";
x['6'] = "0110";
x['7'] = "0111";
x['8'] = "1000";
x['9'] = "1001";
x['A'] = "1010";
x['B'] = "1011";
x['C'] = "1100";
x['D'] = "1101";
x['E'] = "1110";
x['F'] = "1111";
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
string xx;
cin >> xx;
a[i] += "0";
for (int j = 0; j < xx.size(); j++) a[i] += x[xx[j]];
}
for (int i = 1; i <= n; i++) {
if (n % i != 0) continue;
int f = 0;
for (int j = 1; j <= n; j += n / i) {
for (int k = 1; k <= n; k += n / i) {
for (int jj = j; jj < j + n / i; jj++) {
for (int kk = k; kk < k + n / i; kk++) {
if (a[jj][kk] != a[j][k]) {
f = 1;
break;
}
}
if (f) break;
}
if (f) break;
}
if (f) break;
}
if (!f) {
printf("%d", n / i);
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<char, string> m;
vector<string> matrix;
int gcd(int a, int b);
void solve() {
m['0'] = "0000";
m['1'] = "0001";
m['2'] = "0010";
m['3'] = "0011";
m['4'] = "0100";
m['5'] = "0101";
m['6'] = "0110";
m['7'] = "0111";
m['8'] = "1000";
m['9'] = "1001";
m['A'] = "1010";
m['B'] = "1011";
m['C'] = "1100";
m['D'] = "1101";
m['E'] = "1110";
m['F'] = "1111";
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
string s = "";
for (int j = 0; j < n / 4; ++j) {
char c;
cin >> c;
s += m[c];
}
matrix.push_back(s);
}
int x = n;
for (int i = 0; i < n; ++i) {
int k = 1, len = 1;
while (k < n) {
len = 1;
while (k < n && matrix[i][k] == matrix[i][k - 1]) ++k, ++len;
x = gcd(x, len);
k = k + 1;
}
}
for (int i = 0; i < n; ++i) {
int k = 1, len = 1;
while (k < n) {
len = 1;
while (k < n && matrix[k][i] == matrix[k - 1][i]) ++k, ++len;
x = gcd(x, len);
k = k + 1;
}
}
cout << x << '\n';
}
int gcd(int a, int b) {
while (b != 0) {
a = a % b;
swap(a, b);
}
return a;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<int, int> factors;
void primef(int n) {
int cnt = 0;
if (n % 2 == 0) {
while (n % 2 == 0) cnt++, n /= 2;
factors[2] = cnt;
}
for (int i = 3; i <= sqrt(n); i += 2) {
cnt = 0;
if (n % i == 0) {
while (n % i == 0) n /= i, cnt++;
factors[i] = cnt;
}
}
if (n > 2) factors[n] = 1;
}
void inp(int n, int arr[]) {
for (int i = 0; i < n; i++) cin >> arr[i];
}
vector<vector<int> > v(20);
void binary(int a) {
int k = a;
vector<int> vv;
for (int i = 0; i < 4; i++) {
vv.push_back(a % 2);
a /= 2;
}
reverse((vv).begin(), (vv).end());
v[k] = vv;
}
void solve() {
int n;
cin >> n;
for (int i = 0; i < 16; i++) binary(i);
int a[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n / 4; j++) {
char c;
cin >> c;
int p;
if (c >= 'A' && c <= 'F') {
p = c - 'A' + 10;
} else
p = c - '0';
for (int k = 0; k < 4; k++) {
a[i][j * 4 + k] = v[p][k];
}
}
}
primef(n);
int ans = 1;
for (auto elem : factors) {
int temp = 1;
int el = 1;
int tot = elem.second;
while (tot--) {
el *= elem.first;
int check = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
i++;
j++;
int ii = i / el + (i % el != 0);
int jj = j / el + (j % el != 0);
ii *= el;
jj *= el;
i--;
j--;
ii--;
jj--;
if (a[i][j] != a[ii][jj]) {
check = 0;
break;
}
}
if (check == 0) break;
}
if (check) {
temp = el;
} else
break;
}
ans *= temp;
}
cout << ans << '\n';
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[5300][5300], n;
bool valid(int x) {
int i, j, t, k, p;
for (i = 0; i < n / x; i++) {
for (j = 0; j < n / x; j++) {
t = arr[i * x][j * x];
for (k = 0; k < x; k++) {
for (p = 0; p < x; p++)
if (arr[i * x + k][j * x + p] != t) return false;
}
}
}
return true;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int i, l, t, j;
string s;
vector<int> v;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s;
l = s.size();
for (j = 0; j < l; j++) {
if (s[j] >= '0' && s[j] <= '9')
t = s[j] - '0';
else
t = s[j] - 'A' + 10;
arr[i][j * 4 + 3] = (t & 1) ? 1 : 0;
arr[i][j * 4 + 2] = (t & 2) ? 1 : 0;
arr[i][j * 4 + 1] = (t & 4) ? 1 : 0;
arr[i][j * 4] = (t & 8) ? 1 : 0;
}
}
for (i = 2; i <= n; i++) {
if (n % i == 0) {
v.push_back(i);
}
}
reverse(v.begin(), v.end());
l = v.size();
for (i = 0; i < l; i++) {
if (valid(v[i])) {
cout << v[i] << endl;
return 0;
}
}
cout << 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string hex_char(char c) {
switch (toupper(c)) {
case '0':
return "0000";
case '1':
return "0001";
case '2':
return "0010";
case '3':
return "0011";
case '4':
return "0100";
case '5':
return "0101";
case '6':
return "0110";
case '7':
return "0111";
case '8':
return "1000";
case '9':
return "1001";
case 'A':
return "1010";
case 'B':
return "1011";
case 'C':
return "1100";
case 'D':
return "1101";
case 'E':
return "1110";
case 'F':
return "1111";
}
return "";
}
int check(int x, int n, vector<string> &s) {
for (int i = 0; i < n / x; ++i) {
for (int j = 0; j < n / x; ++j) {
char c = s[i * x][j * x];
for (int k = 0; k < x; ++k) {
for (int l = 0; l < x; ++l) {
int a = i * x + k;
int b = j * x + l;
if (c != s[a][b]) return 0;
}
}
}
}
return 1;
}
int main() {
long long unsigned n;
cin >> n;
vector<string> input;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
string t;
for (int i = 0; i < s.size(); ++i) {
t += hex_char(s[i]);
}
input.push_back(t);
}
for (int i = n; i > 1; --i) {
if (n % i == 0) {
int f = check(i, n, input);
if (f == 1) {
cout << i << endl;
return 0;
}
}
}
cout << 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 6e3;
int n;
int A[MAXN][MAXN];
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n;
for (int ii = 1; ii <= n; ii++) {
string row;
cin >> row;
for (int jj = 0; jj < row.size(); jj++) {
int v =
row[jj] >= '0' && row[jj] <= '9' ? row[jj] - '0' : row[jj] - 'A' + 10;
for (int kk = jj * 4 + 4; kk >= jj * 4 + 1; kk--) {
if (v & 1) A[ii][kk] = 1;
v >>= 1;
}
}
}
for (int ii = 1; ii <= n; ii++) {
for (int jj = 1; jj <= n; jj++) {
if (ii == 1)
A[ii][jj] += A[ii][jj - 1];
else if (jj == 1)
A[ii][jj] += A[ii - 1][jj];
else
A[ii][jj] += A[ii - 1][jj] + A[ii][jj - 1] - A[ii - 1][jj - 1];
}
}
int ans = 1;
for (int x = 1; x <= n; x++) {
if (n % x) continue;
bool flag = true;
for (int ii = 1; ii <= n / x; ii++) {
for (int jj = 1; jj <= n / x; jj++) {
int x1 = (ii - 1) * x + 1, y1 = (jj - 1) * x + 1, x2 = ii * x,
y2 = jj * x;
int area =
A[x2][y2] - A[x2][y1 - 1] - A[x1 - 1][y2] + A[x1 - 1][y1 - 1];
if (area != 0 && area != (x2 - x1 + 1) * (y2 - y1 + 1)) flag = false;
}
}
if (flag) ans = x;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
string hexc(char c) {
if (c == '0') return "0000";
if (c == '1') return "0001";
if (c == '2') return "0010";
if (c == '3') return "0011";
if (c == '4') return "0100";
if (c == '5') return "0101";
if (c == '6') return "0110";
if (c == '7') return "0111";
if (c == '8') return "1000";
if (c == '9') return "1001";
if (c == 'A') return "1010";
if (c == 'B') return "1011";
if (c == 'C') return "1100";
if (c == 'D') return "1101";
if (c == 'E') return "1110";
return "1111";
}
bool rowisfine(string row, long long mod, long long n) {
vector<string> bins(n / 4);
for (long long i = 0; i < n / 4; ++i) {
bins[i] = hexc(row[i]);
}
for (long long i = 0; i < n / mod; ++i) {
char c = bins[i * mod / 4][i * mod % 4];
for (long long j = 1; j < mod; ++j) {
long long curi = i * mod + j;
if (bins[curi / 4][curi % 4] != c) return false;
}
}
return true;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n;
cin >> n;
long long cols = n / 4;
vector<string> s(n);
for (long long i = 0; i < n; ++i) cin >> s[i];
bool done = false;
for (long long i = n; i >= 2; --i) {
if (n % i) continue;
long long row;
for (row = 0; row < n; ++row) {
if (row % i == 0) {
if (!rowisfine(s[row], i, n)) {
break;
}
} else {
long long col;
for (col = 0; col < cols; ++col) {
if (s[row][col] != s[row - 1][col]) break;
}
if (col != cols) break;
;
}
}
if (row == n) {
done = true;
cout << i << endl;
break;
}
}
if (!done) cout << 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long int n;
cin >> n;
vector<string> input(n + 1);
for (long long int i = 1; i <= n; i++) {
cin >> input[i];
}
vector<long long int> vec;
for (long long int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
if (n / i == i) {
vec.push_back(i);
} else {
vec.push_back(i);
vec.push_back(n / i);
}
}
}
vec.push_back(n);
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
for (long long int x = n; x >= 2; x--) {
if (n % x != 0) continue;
long long int f = 0;
for (long long int i = 1; i <= n; i++) {
long long int j = i;
for (j = i; j < i + x; j++) {
if (input[j] != input[i]) {
f = 1;
break;
}
}
if (f == 1) {
break;
}
i = j - 1;
}
if (f == 1) {
continue;
}
for (long long int i = 1; i <= n; i += x) {
vector<int> v;
v.push_back(0);
for (long long int j = 0; j < input[i].size(); j++) {
if (input[i][j] == '0') {
v.push_back(0);
v.push_back(0);
v.push_back(0);
v.push_back(0);
} else if (input[i][j] == '1') {
v.push_back(0);
v.push_back(0);
v.push_back(0);
v.push_back(1);
} else if (input[i][j] == '2') {
v.push_back(0);
v.push_back(0);
v.push_back(1);
v.push_back(0);
} else if (input[i][j] == '3') {
v.push_back(0);
v.push_back(0);
v.push_back(1);
v.push_back(1);
} else if (input[i][j] == '4') {
v.push_back(0);
v.push_back(1);
v.push_back(0);
v.push_back(0);
} else if (input[i][j] == '5') {
v.push_back(0);
v.push_back(1);
v.push_back(0);
v.push_back(1);
} else if (input[i][j] == '6') {
v.push_back(0);
v.push_back(1);
v.push_back(1);
v.push_back(0);
} else if (input[i][j] == '7') {
v.push_back(0);
v.push_back(1);
v.push_back(1);
v.push_back(1);
} else if (input[i][j] == '8') {
v.push_back(1);
v.push_back(0);
v.push_back(0);
v.push_back(0);
} else if (input[i][j] == '9') {
v.push_back(1);
v.push_back(0);
v.push_back(0);
v.push_back(1);
} else if (input[i][j] == 'A') {
v.push_back(1);
v.push_back(0);
v.push_back(1);
v.push_back(0);
} else if (input[i][j] == 'B') {
v.push_back(1);
v.push_back(0);
v.push_back(1);
v.push_back(1);
} else if (input[i][j] == 'C') {
v.push_back(1);
v.push_back(1);
v.push_back(0);
v.push_back(0);
} else if (input[i][j] == 'D') {
v.push_back(1);
v.push_back(1);
v.push_back(0);
v.push_back(1);
} else if (input[i][j] == 'E') {
v.push_back(1);
v.push_back(1);
v.push_back(1);
v.push_back(0);
} else if (input[i][j] == 'F') {
v.push_back(1);
v.push_back(1);
v.push_back(1);
v.push_back(1);
}
}
long long int f2 = 0;
for (long long int k = 1; k <= n; k++) {
long long int j = k;
for (j = k; j < k + x; j++) {
if (v[j] != v[k]) {
f2 = 1;
break;
}
}
if (f2 == 1) {
break;
}
k = j - 1;
}
if (f2 == 1) {
f = 1;
break;
}
}
if (f == 1) {
continue;
}
cout << x;
return 0;
}
cout << 1;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5.2e3 + 5;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
char s[MAXN];
bool a[MAXN][MAXN];
int main(void) {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%s", s + 1);
for (int j = 1; s[j]; ++j) {
if (s[j] >= '0' && s[j] <= '9')
s[j] -= '0';
else
s[j] = s[j] - 'A' + 10;
for (int k = 0; k < 4; ++k) a[i][(j << 2) - k] = (s[j] >> k) & 1;
}
}
int x = 0;
for (int i = 1; i <= n && x != 1; ++i)
for (int l = 1, r = 1; l <= n && x != 1; l = r) {
while (r <= n && a[i][r] == a[i][l]) ++r;
x = gcd(x, r - l);
}
for (int j = 1; j <= n && x != 1; ++j)
for (int l = 1, r = 1; l <= n && x != 1; l = r) {
while (r <= n && a[r][j] == a[l][j]) ++r;
x = gcd(x, r - l);
}
printf("%d", x);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long int> divisors;
bool a[5205][5205];
long long dp[5205][5205];
map<char, long long> m;
long long power(long long a, long long b) {
if (b == 0) return 1;
if (b == 1) return a;
if (b % 2 == 1) return (power(a, b - 1) * a) % 1000000007;
long long q = power(a, b / 2);
return (q * q) % 1000000007;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int TESTS = 1;
while (TESTS--) {
long long n;
cin >> n;
for (long long int i = 1; i < n + 1; i++) {
if (n % i == 0) divisors.push_back(i);
}
for (long long int i = 0; i < 10; i++) {
m[(char)('0' + i)] = i;
}
for (long long int i = 0; i < 6; i++) {
m[(char)('A' + i)] = 10 + i;
}
long long p = n / 4;
for (long long int i = 1; i < n + 1; i++) {
string s;
cin >> s;
for (long long int j = 0; j < p; j++) {
long long g = m[s[j]], c = 0;
while (g > 0) {
if (g % 2 == 1) a[i][4 * (j + 1) - c] = 1;
g /= 2;
c++;
}
}
}
for (long long int i = 1; i < n + 1; i++) {
for (long long int j = 1; j < n + 1; j++) {
dp[i][j] = dp[i][j - 1] + a[i][j];
}
}
for (long long int j = 1; j < n + 1; j++) {
for (long long int i = 1; i < n + 1; i++) {
dp[i][j] += dp[i - 1][j];
}
}
long long ans = 0;
long long f = 0;
for (auto u : divisors) {
u = n / u;
f = 0;
for (int i = u; i <= n; i += u) {
for (int j = u; j <= n; j += u) {
long long k =
dp[i][j] + dp[i - u][j - u] - dp[i - u][j] - dp[i][j - u];
if (k != u * u && k != 0) {
f = 1;
break;
}
}
if (f) break;
}
if (!f) {
ans = u;
break;
}
}
cout << ans;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
int main() {
std::ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
map<char, string> has;
has['0'] = "0000";
has['1'] = "0001";
has['2'] = "0010";
has['3'] = "0011";
has['4'] = "0100";
has['5'] = "0101";
has['6'] = "0110";
has['7'] = "0111";
has['8'] = "1000";
has['9'] = "1001";
has['A'] = "1010";
has['B'] = "1011";
has['C'] = "1100";
has['D'] = "1101";
has['E'] = "1110";
has['F'] = "1111";
int n;
cin >> n;
string inp[n], s[n];
for (long long i = 0; i < n; i++) cin >> inp[i];
for (long long i = 0; i < n; i++) {
s[i] = "";
for (char c : inp[i]) s[i] += has[c];
}
int dp[n][n];
memset(dp, 0, sizeof dp);
dp[0][0] = s[0][0] - '0';
for (long long i = 1; i <= n - 1; i++) {
dp[0][i] += (dp[0][i - 1] + s[0][i] - '0');
dp[i][0] += (dp[i - 1][0] + s[i][0] - '0');
}
for (long long i = 1; i <= n - 1; i++)
for (long long j = 1; j <= n - 1; j++)
dp[i][j] =
dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1] + (s[i][j] - '0');
vector<int> f;
for (int i = 1; i * i <= n; i++) {
if ((n % i) == 0) {
f.push_back(i);
if ((i * i) != n) f.push_back(n / i);
}
}
sort(f.begin(), f.end());
int ans = 0;
for (int x : f) {
int flg = 0;
for (int i = x - 1; i < n; i += x) {
for (int j = x - 1; j < n; j += x) {
int sub1 = 0, sub2 = 0, add = 0;
if (i >= x) sub1 = dp[i - x][j];
if (j >= x) sub2 = dp[i][j - x];
if (i >= x && j >= x) add = dp[i - x][j - x];
int y = dp[i][j] - sub1 - sub2 + add;
if ((y != 0) && (y != x * x)) flg = 1;
}
if (flg) break;
}
if (!flg) ans = x;
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, x;
cin >> n;
string s;
vector<vector<bool>> a(n, vector<bool>(n, false));
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 0; j < s.size(); j++) {
if (isalpha(s[j])) {
x = s[j] - 'A' + 10;
} else {
x = s[j] - '0';
}
for (int k = 3; k >= 0; k--) {
a[i][j * 4 + k] = (x % 2 == 1);
x /= 2;
}
}
}
int ans = 0;
vector<vector<int>> sum(n + 1, vector<int>(n + 1, 0));
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1];
sum[i][j] += a[i - 1][j - 1];
}
}
vector<int> div;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
div.push_back(i);
if (i * i != n) {
div.push_back(n / i);
}
}
}
sort(div.begin(), div.end());
int m, d, tot;
bool valid;
int ss1, ss2, ee1, ee2;
for (int ii = div.size() - 1; ii >= 0; ii--) {
m = div[ii];
d = n / m;
valid = true;
for (int i = 0; valid && i < n; i += m) {
for (int j = 0; j < n; j += m) {
ss1 = i;
ss2 = i + m - 1;
ee1 = j;
ee2 = j + m - 1;
tot = sum[ss2 + 1][ee2 + 1];
tot -= sum[ss1][ee2 + 1];
tot -= sum[ss2 + 1][ee1];
tot += sum[ss1][ee1];
if ((tot != m * m) && (tot != 0)) {
valid = false;
break;
}
}
}
if (valid) {
cout << m << endl;
return;
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mn = 1 * (int)(1e5) + 10;
const int mod = 1 * (int)(1e9) + 7;
const int mm = 5 * (int)(1e3) + 200 + 10;
const int base = 1 * (int)(1e9);
const bool aNs = 0;
int tt, ntest = 1;
void docfile() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
if (ifstream("test"
".inp")) {
freopen(
"test"
".inp",
"r", stdin);
if (!aNs)
freopen(
"test"
".out",
"w", stdout);
else
freopen(
"test"
".ans",
"w", stdout);
} else if (ifstream(""
".inp")) {
freopen(
""
".inp",
"r", stdin);
freopen(
""
".out",
"w", stdout);
}
}
template <typename T>
void read(T& x) {
x = 0;
T f = 1;
char ch = getchar();
while (!isdigit(ch)) f = ch == '-' ? -f : f, ch = getchar();
while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
x *= f;
}
template <typename T>
void write(T a) {
if (a < 0) {
putchar('-');
write(-a);
return;
}
if (a < 10) {
putchar('0' + a);
return;
}
write(a / 10);
putchar((char)('0' + (a % 10)));
}
string s[16];
int a[mm][mm];
bool Kt(int x, int y, int m, int n) {
return (a[m][n] - a[m][y - 1] - a[x - 1][n] + a[x - 1][y - 1] == 0 ||
a[m][n] - a[m][y - 1] - a[x - 1][n] + a[x - 1][y - 1] ==
(m - x + 1) * (n - y + 1));
}
void enter() {
int n;
read(n);
int ok = 0;
s[0] = "0000";
s[1] = "0001";
s[2] = "0010";
s[3] = "0011";
s[4] = "0100";
s[5] = "0101";
s[6] = "0110";
s[7] = "0111";
s[8] = "1000";
s[9] = "1001";
s[10] = "1010";
s[11] = "1011";
s[12] = "1100";
s[13] = "1101";
s[14] = "1110";
s[15] = "1111";
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; j += 4) {
int x;
char c = getchar();
while (!isdigit(c) && !isalpha(c)) c = getchar();
if (isdigit(c))
x = c - '0';
else
x = c - 'A' + 10;
for (int k = j; k < j + 4; ++k) a[i][k] = s[x][k - j] - '0';
}
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
a[i][j] += a[i - 1][j] + a[i][j - 1] - a[i - 1][j - 1];
int sol = 1;
for (int mid = n; mid >= 2; --mid)
if (n % mid == 0) {
bool Ok = 1;
for (int i = 0; i + mid <= n; i += mid)
for (int j = 0; j + mid <= n; j += mid)
if (!Kt(i + 1, j + 1, i + mid, j + mid)) Ok = 0;
if (Ok) {
cout << mid;
return;
}
}
cout << sol;
}
void solve() {}
void print_result() {}
int main() {
docfile();
for (tt = 1; tt <= ntest; ++tt) {
enter();
solve();
print_result();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
int n;
cin >> n;
int m = n / 4;
vector<vector<int> > a(n, vector<int>(m));
vector<vector<int> > c(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
char c;
cin >> c;
a[i][j] = isdigit(c) ? c - '0' : c - 'A' + 10;
}
}
for (int i = 0; i + 4 <= n; i++) {
vector<vector<int> > b(4, vector<int>(n));
for (int j = i; j < i + 4; j++) {
for (int k = 0; k < m; k++) {
int tmp = a[j][k];
for (int t = 3; t >= 0; t--) {
b[j - i][k * 4 + t] = tmp % 2;
tmp /= 2;
}
}
}
for (int k = 0; k < n; k++) {
int tmp = 0;
for (int j = 0; j < 4; j++) {
tmp = tmp * 2 + b[j][k];
}
c[k][i / 4] = tmp;
}
}
auto compression = [&](int x) {
for (int i = 0; i + x <= n; i += x) {
vector<int> b = a[i];
for (int j = i; j < i + x; j++) {
for (int k = 0; k < m; k++) {
b[k] &= a[j][k];
}
}
for (int j = i; j < i + x; j++) {
for (int k = 0; k < m; k++) {
if (b[k] != a[j][k]) return false;
}
}
}
for (int i = 0; i + x <= n; i += x) {
vector<int> b = c[i];
for (int j = i; j < i + x; j++) {
for (int k = 0; k < m; k++) {
b[k] &= c[j][k];
}
}
for (int j = i; j < i + x; j++) {
for (int k = 0; k < m; k++) {
if (b[k] != c[j][k]) return false;
}
}
}
return true;
};
int ans = 1;
for (int x = 1; x * x <= n; x++) {
if (n % x) continue;
if (compression(x)) {
ans = max(ans, x);
}
if (x * x != n && compression(n / x)) {
ans = max(ans, n / x);
}
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#pragma warning(disable : 6031)
using namespace std;
const int maxn = 2e5 + 10;
const long long mode = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const double pi = 3.14159265358979323846264338327950;
template <class T>
inline T min(T a, T b, T c) {
return min(min(a, b), c);
}
template <class T>
inline T max(T a, T b, T c) {
return max(max(a, b), c);
}
template <class T>
inline T min(T a, T b, T c, T d) {
return min(min(a, b), min(c, d));
}
template <class T>
inline T max(T a, T b, T c, T d) {
return max(max(a, b), max(c, d));
}
int n;
bool a[5211][5211];
int gcd(int a, int b) { return a == 0 ? b : gcd(b % a, a); }
void parse_char(int x, int y, char c) {
int num = -1;
if (isdigit(c))
num = c - '0';
else
num = c - 'A' + 10;
for (int i = 0; i < 4; ++i) {
a[x][y + 3 - i] = num & 1;
num >>= 1;
}
}
int main() {
scanf("%d", &n);
char buf[5211];
for (int i = 0; i < n; i++) {
scanf("%s", buf);
for (int j = 0; j < n / 4; ++j) parse_char(i, j * 4, buf[j]);
}
int g = n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
int k = j;
while (k < n && a[i][k] == a[i][j]) ++k;
g = gcd(g, k - j);
j = k - 1;
}
for (int j = 0; j < n; j++)
for (int i = 0; i < n; i++) {
int k = i;
while (k < n && a[k][j] == a[i][j]) ++k;
g = gcd(g, k - i);
i = k - 1;
}
cout << g << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int mat[5201][5201];
int n;
vector<int> factors;
bool eval(int x) {
for (int i = 0; i < (n / x); i++) {
for (int j = 0; j < (n / x); j++) {
int block_val;
for (int k = 0; k < x; k++) {
for (int l = 0; l < x; l++) {
if (k == 0 && l == 0)
block_val = mat[x * i + k][x * j + l];
else {
if (mat[x * i + k][x * j + l] != block_val) return false;
}
}
}
}
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
int num;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int j = 0; j < s.length(); j++) {
if (s[j] >= '0' && s[j] <= '9') {
num = s[j] - '0';
for (int k = 0; k < 4; k++) {
if (num & (1 << (3 - k)))
mat[i][4 * j + k] = 1;
else
mat[i][4 * j + k] = 0;
}
} else {
num = s[j] - 'A';
num += 10;
for (int k = 0; k < 4; k++) {
if (num & (1 << (3 - k)))
mat[i][4 * j + k] = 1;
else
mat[i][4 * j + k] = 0;
}
}
}
}
for (int i = 1; i <= n; i++) {
if (n % i == 0) factors.push_back(i);
}
int start = 0, end = factors.size() - 1;
int ans;
for (int i = 0; i < factors.size(); i++) {
bool var = eval(factors[i]);
if (var == true) {
ans = i;
}
}
cout << factors[ans];
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const long double eps = 1e-7;
const int inf = 1000000010;
const long long INF = 10000000000000010LL;
const int mod = 1000000007;
const int MAXN = 5300;
int n, m, k, u, v, x, y, t, a, b, ans, cnt;
bool A[MAXN][MAXN];
vector<int> D;
char ch;
bool check(int x) {
for (int i = 0; i < n; i += x)
for (int j = 0; j < n; j += x) {
bool f = A[i][j];
for (int ii = i; ii < i + x; ii++)
for (int jj = j; jj < j + x; jj++)
if (A[ii][jj] != f) return 0;
}
return 1;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j += 4) {
cin >> ch;
if ('0' <= ch && ch <= '9')
x = ch - '0';
else
x = ch - 'A' + 10;
if (x & 8) A[i][j] = 1;
if (x & 4) A[i][j + 1] = 1;
if (x & 2) A[i][j + 2] = 1;
if (x & 1) A[i][j + 3] = 1;
}
}
for (int i = 1; i <= n; i++)
if (n % i == 0) D.push_back(i), cnt++;
for (int x : D) {
if (check(x)) ans = x;
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int sum[5220][5220];
int m;
vector<int> d;
bool work(int p) {
int b = m / p, ans;
for (int i = 1; i <= b; ++i) {
for (int j = 1; j <= b; ++j) {
ans = sum[i * p][j * p] - sum[(i - 1) * p][j * p] -
sum[i * p][(j - 1) * p] + sum[(i - 1) * p][(j - 1) * p];
if (ans && ans != p * p) return 0;
}
}
return 1;
}
void show() {
for (int i = 1; i <= m; ++i) {
for (int j = 1; j <= m; ++j) {
printf("%d%c", sum[i][j], j == m ? '\n' : ' ');
}
}
}
int main() {
int n, x, i, j, k, w;
scanf("%d", &n);
m = n;
for (i = 1; i <= n; ++i) {
for (j = 1; j <= (n >> 2); ++j) {
scanf("%1x", &x);
for (k = j << 2, w = 1; w <= 4; --k, ++w) {
sum[i][k] = x & 1, x >>= 1;
}
}
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
sum[i][j] += sum[i][j - 1] + sum[i - 1][j] - sum[i - 1][j - 1];
}
}
for (i = 2; i * i <= n; ++i) {
if (n % i == 0) {
d.push_back(i);
while (n % i == 0) n /= i;
}
}
if (n > 1) d.push_back(n);
int ans = 1;
for (int p : d) {
while (m % (ans * p) == 0 && work(ans * p)) ans *= p;
}
printf("%d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int oneh[5209][5209], onev[5209][5209];
string qn[5209];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long int n;
cin >> n;
vector<int> fac;
for (long long int i = 1; i <= n; i++) {
if (n % i == 0) fac.push_back(i);
}
fac.push_back(n);
long long int sz = fac.size();
for (long long int i = 1; i <= n; i++) qn[i] = qn[i] + " ";
for (long long int i = 1; i <= n; i++) {
string s;
cin >> s;
long long int yo = n / 4;
for (long long int j = 0; j <= yo - 1; j++) {
switch (s[j]) {
case '0':
qn[i] += "0000";
break;
case '1':
qn[i] += "0001";
break;
case '2':
qn[i] += "0010";
break;
case '3':
qn[i] += "0011";
break;
case '4':
qn[i] += "0100";
break;
case '5':
qn[i] += "0101";
break;
case '6':
qn[i] += "0110";
break;
case '7':
qn[i] += "0111";
break;
case '8':
qn[i] += "1000";
break;
case '9':
qn[i] += "1001";
break;
case 'A':
qn[i] += "1010";
break;
case 'B':
qn[i] += "1011";
break;
case 'C':
qn[i] += "1100";
break;
case 'D':
qn[i] += "1101";
break;
case 'E':
qn[i] += "1110";
break;
case 'F':
qn[i] += "1111";
break;
}
}
}
for (long long int i = 0; i <= n; i++) {
onev[0][i] = 0;
oneh[0][i] = 0;
onev[i][0] = 0;
oneh[i][0] = 0;
}
for (long long int i = 1; i <= n; i++) {
for (long long int j = 1; j <= n; j++) {
if (qn[i][j] == '0') {
oneh[i][j] = oneh[i - 1][j];
} else {
oneh[i][j] = oneh[i - 1][j] + 1;
}
}
}
for (long long int i = 1; i <= n; i++) {
for (long long int j = 1; j <= n; j++) {
{ onev[i][j] = onev[i][j - 1] + oneh[i][j]; }
}
}
for (long long int i1 = sz - 1; i1 >= 0; i1--) {
long long int req = fac[i1];
long long int haa = n / req;
int fou = 1;
long long int da = req * req;
for (long long int i = 1; i <= haa; i++) {
for (long long int j = 1; j <= haa; j++) {
if ((((onev[i * req][j * req] - onev[(i - 1) * req][j * req]) % da !=
0)) ||
((onev[i * req][j * req] - onev[(i)*req][(j - 1) * req]) % da !=
0)) {
fou = 0;
break;
}
}
}
if (fou == 1) {
cout << fac[i1] << endl;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
string to_bin(char c) {
switch (c) {
case '0':
return "0000";
break;
case '1':
return "0001";
break;
case '2':
return "0010";
break;
case '3':
return "0011";
break;
case '4':
return "0100";
break;
case '5':
return "0101";
break;
case '6':
return "0110";
break;
case '7':
return "0111";
break;
case '8':
return "1000";
break;
case '9':
return "1001";
break;
case 'A':
return "1010";
break;
case 'B':
return "1011";
break;
case 'C':
return "1100";
break;
case 'D':
return "1101";
break;
case 'E':
return "1110";
break;
case 'F':
return "1111";
break;
case 'a':
return "1010";
break;
case 'b':
return "1011";
break;
case 'c':
return "1100";
break;
case 'd':
return "1101";
break;
case 'e':
return "1110";
break;
case 'f':
return "1111";
break;
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
char c;
string s, t;
cin >> n;
vector<string> v;
bool bad = false, bd = false;
for (int i = 0; i < n; i++) {
s = "";
for (int j = 0; j < n / 4; j++) {
cin >> c;
if (j == 0) {
if (c != '0' && c != 'F') bd = true;
}
if (c != '0' && c != 'F') bad = true;
s += to_bin(c);
}
v.push_back(s);
}
vector<int> del;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
del.push_back(i);
if (i * i < n) del.push_back(n / i);
}
}
sort(del.begin(), del.end());
reverse(del.begin(), del.end());
for (int d : del) {
if (d == 1) {
cout << 1;
return 0;
}
if ((d % 4 == 0) && bad) continue;
if (d >= 4 && bd) continue;
int ii = 0;
int jj = 0;
bool f = true;
while (f && ii < n - 1) {
char b = v[ii][jj];
for (int i = ii; i < ii + d; i++) {
for (int j = jj; j < jj + d; j++) {
if (v[i][j] != b) {
f = false;
break;
}
}
}
jj += d;
if (jj == n) {
ii += d;
jj = 0;
}
}
if (f) {
cout << d;
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
string f(char x) {
if (x == '0') return "0000";
if (x == '1') return "0001";
if (x == '2') return "0010";
if (x == '3') return "0011";
if (x == '4') return "0100";
if (x == '5') return "0101";
if (x == '6') return "0110";
if (x == '7') return "0111";
if (x == '8') return "1000";
if (x == '9') return "1001";
if (x == 'A') return "1010";
if (x == 'B') return "1011";
if (x == 'C') return "1100";
if (x == 'D') return "1101";
if (x == 'E') return "1110";
if (x == 'F') return "1111";
}
int main() {
int n;
scanf("%d", &n);
char s[5005];
bool allZeros = true, allOnes = true;
vector<string> inp(5205, "");
for (int i = 0; i < n; ++i) {
scanf("%s", s);
int len = strlen(s);
for (int j = 0; j < len; ++j) {
inp[i] += f(s[j]);
if (s[j] == '0')
allOnes = false;
else if (s[j] == 'F')
allZeros = false;
else {
allZeros = false;
allOnes = false;
}
}
}
if (allZeros || allOnes) {
cout << n << endl;
return 0;
}
vector<int> div;
for (int i = 1; i <= sqrt(n) + 1; ++i) {
if (n % i == 0) {
if (i == (n / i))
div.push_back(i);
else {
div.push_back(i);
div.push_back(n / i);
}
}
}
sort(div.begin(), div.end());
int ans = 1;
for (int i = 1; i < div.size(); i++) {
bool success = true;
for (int j = 0; j < n / div[i]; j++) {
for (int k = 0; k < n / div[i]; k++) {
allZeros = true, allOnes = true;
for (int l = 0; l < div[i]; l++) {
for (int m = 0; m < div[i]; m++) {
if (inp[j * div[i] + l][k * div[i] + m] == '0')
allOnes = false;
else if (inp[j * div[i] + l][k * div[i] + m] == '1')
allZeros = false;
}
}
if (allOnes || allZeros)
;
else {
success = false;
break;
}
}
}
if (success) ans = max(ans, div[i]);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char c;
int s[5300][5300], n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j += 4) {
cin >> c;
int x;
if (c >= '0' && c <= '9')
x = c - '0';
else
x = c - 'A' + 10;
for (int k = 0; k < 4; k++) {
s[i][j + k] = (x >> (3 - k)) & 1;
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
s[i][j] += s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1];
}
}
int flag, i;
for (i = n; i >= 1; i--) {
if (n % i) continue;
flag = 1;
for (int j = 1; j * i <= n; j++) {
for (int k = 1; k * i <= n; k++) {
int sum = s[i * j][i * k] - s[i * (j - 1)][i * k] -
s[i * j][i * (k - 1)] + s[i * (j - 1)][i * (k - 1)];
if (sum != i * i && sum) {
flag = 0;
break;
}
}
if (!flag) break;
}
if (flag) {
cout << i << endl;
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
namespace fastIO {
bool IOerror = 0;
inline char nc() {
static char buf[100000], *p1 = buf + 100000, *pend = buf + 100000;
if (p1 == pend) {
p1 = buf;
pend = buf + fread(buf, 1, 100000, stdin);
if (pend == p1) {
IOerror = 1;
return -1;
}
}
return *p1++;
}
inline bool blank(char ch) {
return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
}
template <class T>
inline bool read(T &x) {
bool sign = 0;
char ch = nc();
x = 0;
for (; blank(ch); ch = nc())
;
if (IOerror) return false;
if (ch == '-') sign = 1, ch = nc();
for (; ch >= '0' && ch <= '9'; ch = nc()) x = x * 10 + ch - '0';
if (sign) x = -x;
return true;
}
inline bool read(double &x) {
bool sign = 0;
char ch = nc();
x = 0;
for (; blank(ch); ch = nc())
;
if (IOerror) return false;
if (ch == '-') sign = 1, ch = nc();
for (; ch >= '0' && ch <= '9'; ch = nc()) x = x * 10 + ch - '0';
if (ch == '.') {
double tmp = 1;
ch = nc();
for (; ch >= '0' && ch <= '9'; ch = nc())
tmp /= 10.0, x += tmp * (ch - '0');
}
if (sign) x = -x;
return true;
}
inline bool read(char *s) {
char ch = nc();
for (; blank(ch); ch = nc())
;
if (IOerror) return false;
for (; !blank(ch) && !IOerror; ch = nc()) *s++ = ch;
*s = 0;
return true;
}
inline bool read(char &c) {
for (c = nc(); blank(c); c = nc())
;
if (IOerror) {
c = -1;
return false;
}
return true;
}
template <typename T, typename... U>
inline bool read(T &head, U &...tail) {
return read(head) && read(tail...);
}
struct Ostream_fwrite {
char *buf, *p1, *pend;
Ostream_fwrite() {
buf = new char[100000];
p1 = buf;
pend = buf + 100000;
}
void out(char ch) {
if (p1 == pend) {
fwrite(buf, 1, 100000, stdout);
p1 = buf;
}
*p1++ = ch;
}
template <class T>
void print(T x) {
static char s[15], *s1;
s1 = s;
if (!x) *s1++ = '0';
if (x < 0) out('-'), x = -x;
while (x) *s1++ = x % 10 + '0', x /= 10;
while (s1-- != s) out(*s1);
}
void print(double x, int y) {
static long long mul[] = {1,
10,
100,
1000,
10000,
100000,
1000000,
10000000,
100000000,
1000000000,
10000000000LL,
100000000000LL,
1000000000000LL,
10000000000000LL,
100000000000000LL,
1000000000000000LL,
10000000000000000LL,
100000000000000000LL};
if (x < -1e-12) out('-'), x = -x;
long long x2 = (long long)floor(x);
if (!y && x - x2 >= 0.5) ++x2;
x -= x2;
x *= mul[y];
long long x3 = (long long)floor(x);
if (y && x - x3 >= 0.5) ++x3;
print(x2);
if (y > 0) {
out('.');
for (size_t i = 1; i < y && x3 * mul[i] < mul[y]; out('0'), ++i)
;
print(x3);
}
}
void print(char *s) {
while (*s) out(*s++);
}
void print(const char *s) {
while (*s) out(*s++);
}
void flush() {
if (p1 != buf) {
fwrite(buf, 1, p1 - buf, stdout);
p1 = buf;
}
}
~Ostream_fwrite() { flush(); }
} Ostream;
template <class T>
void print(T x) {
Ostream.print(x);
}
inline void print(char x) { Ostream.out(x); }
inline void print(char *s) { Ostream.print(s); }
inline void print(const char *s) { Ostream.print(s); }
inline void print(double x, int y) { Ostream.print(x, y); }
template <typename T, typename... U>
inline void print(const T &head, const U &...tail) {
print(head);
print(tail...);
}
inline void flush() { Ostream.flush(); }
}; // namespace fastIO
using namespace fastIO;
int getv(char c) {
if (isdigit(c)) return (c - '0');
return (c - 'A' + 10);
}
int n;
bool a[5205][5205];
char buf[5205];
int pre[5205][5205];
void check(int x) {
int mj = x * x;
for (int i = x; i <= n; i += x) {
for (int j = x; j <= n; j += x) {
int vaa = pre[i][j] - pre[i - x][j] - pre[i][j - x] + pre[i - x][j - x];
if (vaa == 0 || vaa == mj) continue;
return;
}
}
cout << x;
exit(0);
}
int main() {
read(n);
for (int i = 1; i <= n; i++) {
read(buf);
for (int j = 1, pos = 0; j <= n; j += 4, pos++) {
int val = getv(buf[pos]);
a[i][j] = val & (1 << 3);
a[i][j + 1] = val & (1 << 2);
a[i][j + 2] = val & (1 << 1);
a[i][j + 3] = val & (1 << 0);
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
pre[i][j] = pre[i - 1][j] + pre[i][j - 1] - pre[i - 1][j - 1] + a[i][j];
}
}
for (int x = n; x >= 2; x--) {
if (n % x != 0) continue;
check(x);
}
cout << 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 5201;
int a[N][N];
vector<int> elig;
void compute_elig(int n) {
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
elig[i] = 1;
elig[n / i] = 1;
}
}
}
int check(int k, int n) {
for (int i = 1; i <= n; i += k) {
for (int j = 1; j <= n; j += k) {
for (int p = i; p < i + k; p++) {
for (int q = j; q < j + k; q++) {
if (a[i][j] != a[p][q]) return 0;
}
}
}
}
return 1;
}
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j += 4) {
char ch;
cin >> ch;
int val;
if (isdigit(ch))
val = ch - '0';
else
val = ch - 'A' + 10;
int cur = 8;
for (int k = j; k <= j + 3; k++) {
if (val >= cur) {
val -= cur;
a[i][k] = 1;
}
cur /= 2;
}
}
}
elig.resize(n + 1, 0);
compute_elig(n);
for (int i = n; i >= 1; i--) {
if (elig[i]) {
if (check(i, n)) {
cout << i << "\n";
return 0;
}
}
}
cout << 1;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> divisors;
bool matrix[n][n];
for (int i = 1; i <= n; ++i) {
if (n % i == 0) {
divisors.push_back(i);
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n / 4; ++j) {
char c;
cin >> c;
int num;
if (c >= 'A') {
num = c - 'A' + 10;
} else {
num = c - '0';
}
matrix[i][j * 4 + 0] = (num >> 3) == 1;
matrix[i][j * 4 + 1] = ((num >> 2) & 1) == 1;
matrix[i][j * 4 + 2] = ((num >> 1) & 1) == 1;
matrix[i][j * 4 + 3] = (num & 1) == 1;
}
}
int currpos = ceil(divisors.size() / 2.0);
int increment = ceil(currpos / 2.0);
int currguess = divisors[currpos];
bool wasok = false;
bool firsttime = true;
int largest = 1;
for (int i = 0; i < divisors.size(); ++i) {
currguess = divisors[i];
bool isok = true;
for (int i = 0; i < n / currguess; ++i) {
for (int j = 0; j < n / currguess; ++j) {
bool currbol = matrix[i * currguess][j * currguess];
for (int k = 0; k < currguess; ++k) {
for (int l = 0; l < currguess; ++l) {
if (matrix[i * currguess + k][j * currguess + l] != currbol) {
isok = false;
}
}
}
}
}
if (isok) {
if (currguess > largest) {
largest = currguess;
}
}
}
cout << largest << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
bool matrix[5205][5205];
char inp[1305];
vector<int> divivi;
int func(char c) {
if (c >= '0' && c <= '9')
return c - '0';
else
return c - 'A' + 10;
}
bool check(int x, int n) {
int i, j, r, c, ini;
for (r = 0; r < n / x; r++) {
for (c = 0; c < n / x; c++) {
ini = matrix[r * x][c * x];
for (i = 0; i < x; i++)
for (j = 0; j < x; j++)
if (matrix[r * x + i][c * x + j] != ini) return 0;
}
}
return 1;
}
int main() {
int n, i, j, cal;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%s\n", inp);
for (j = 0; j < n / 4; j++) {
cal = func(inp[j]);
matrix[i][j * 4] = (cal & 8);
matrix[i][j * 4 + 1] = (cal & 4);
matrix[i][j * 4 + 2] = (cal & 2);
matrix[i][j * 4 + 3] = (cal & 1);
}
}
for (i = 1; i <= n; i++)
if (n % i == 0) divivi.push_back(i);
for (i = divivi.size() - 1; i >= 1; i--)
if (check(divivi[i], n)) {
printf("%d\n", divivi[i]);
return 0;
}
printf("%d\n", divivi[0]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-6;
const int64_t MOD = 1000000007;
const int MAXN = 5205;
int sum[MAXN][MAXN];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.precision(10);
cout << fixed;
int n;
cin >> n;
for (int i = 0; i < (int)(n); i++) {
string s;
cin >> s;
for (int j = 0; j < (int)(n / 4); j++) {
int x = (s[j] >= '0' && s[j] <= '9') ? s[j] - '0' : s[j] - 'A' + 10;
for (int k = 0; k < (int)(4); k++) {
int p = ((x & (1 << (3 - k))) > 0) ? 1 : 0;
sum[i + 1][4 * j + k + 1] = sum[i + 1][4 * j + k] +
sum[i][4 * j + k + 1] - sum[i][4 * j + k] +
p;
}
}
}
for (int d = (int)n; d >= (int)(2); d--) {
if (n % d == 0) {
bool ok = true;
for (int i = 0; i < (int)(n / d); i++) {
for (int j = 0; j < (int)(n / d); j++) {
int x1 = i * d;
int y1 = j * d;
int x2 = (i + 1) * d;
int y2 = (j + 1) * d;
int s = sum[x2][y2] - sum[x1][y2] - sum[x2][y1] + sum[x1][y1];
if (s != 0 && s != d * d) {
ok = false;
break;
}
}
if (!ok) {
break;
}
}
if (ok) {
cout << d << "\n";
exit(0);
}
}
}
cout << "1\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5207;
string s[MAXN];
string g(int x) {
string s;
for (int i = 3; i >= 0; i--) {
if (x & (1 << i))
s += '1';
else
s += '0';
}
return s;
}
string f(char c) {
if ('0' <= c && c <= '9') return g(c - '0');
return g(c - 'A' + 10);
}
vector<int> dv;
string fine[MAXN];
int n;
bool isOk(int x) {
int y = n / x;
for (int p = 0; p < y; p++) {
int k = p * x;
for (int i = 0; i < x; i++) {
if (fine[k + i].empty()) return false;
if (fine[k + i] != fine[k]) return false;
}
}
return true;
}
void pre(int x) {
int y = n / x;
for (int i = 0; i < n; i++) {
bool ok = true;
for (int p = 0; p < y; p++) {
int k = p * x;
for (int j = 0; j < x; j++) {
if (s[i][k] != s[i][k + j]) {
ok = false;
break;
}
}
if (ok)
fine[i] += s[i][k];
else {
fine[i] = "";
break;
}
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
if (n % i) continue;
dv.push_back(i);
}
for (int i = 0; i < n; i++) {
string t;
cin >> t;
for (char c : t) {
s[i] += f(c);
}
}
for (int x = n; x > 0; x--) {
if (n % x) continue;
pre(x);
if (isOk(x)) {
cout << x << endl;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char mp[5205][5205];
int sum[5205][5205];
int main() {
int n;
scanf("%d", &n);
char a;
for (int i = 1; i <= n; i++) {
getchar();
for (int j = 1; j <= n; j += 4) {
scanf("%c", &a);
int x = a > '9' ? a - 'A' + 10 : a - '0';
for (int k = 0; k < 4; k++) sum[i][j + k] = (x >> (3 - k)) & 1;
}
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
sum[i][j] += sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1];
for (int i = n; i >= 1; i--) {
if (n % i == 0) {
int cnt = i;
bool flag = true;
for (int row = 1; row * cnt <= n; row++) {
for (int col = 1; col * cnt <= n; col++) {
int s = sum[cnt * row][cnt * col] - sum[cnt * row][cnt * (col - 1)] -
sum[cnt * (row - 1)][cnt * col] +
sum[cnt * (row - 1)][cnt * (col - 1)];
flag &= ((s == cnt * cnt) || s == 0);
}
}
if (flag) {
cout << i << endl;
return 0;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
inline long long fpow(long long n, long long k, int p = 998244353) {
long long r = 1;
for (; k; k >>= 1) {
if (k & 1) r = r * n % p;
n = n * n % p;
}
return r;
}
inline long long inv(long long a, long long p = 998244353) {
return fpow(a, p - 2, p);
}
inline long long addmod(long long a, long long val, long long p = 998244353) {
{
if ((a = (a + val)) >= p) a -= p;
}
return a;
}
inline long long submod(long long a, long long val, long long p = 998244353) {
{
if ((a = (a - val)) < 0) a += p;
}
return a;
}
inline long long mult(long long a, long long b, long long p = 998244353) {
return (long long)a * b % p;
}
bool is_digit(char x) { return x - '0' >= 0 && x - '0' <= 9; }
int conv(char x) {
if (is_digit(x)) return x - '0';
return x - 'A' + 10;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int n;
cin >> n;
vector<vector<int> > arr(n, vector<int>(n));
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int j = 0; j < n; j++) {
arr[i][j] = ((conv(s[j / 4])) >> (3 - j % 4)) & 1;
}
}
vector<vector<int> > sum(n + 1, vector<int>(n + 1, 0));
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
sum[i][j] =
sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + arr[i - 1][j - 1];
}
}
bool check = true;
for (int x = n; x >= 1; x--) {
if (n % x) continue;
check = true;
for (int i = 1; i <= n; i += x) {
for (int j = 1; j <= n; j += x) {
int currsum = sum[i + x - 1][j + x - 1] + sum[i - 1][j - 1] -
sum[i + x - 1][j - 1] - sum[i - 1][j + x - 1];
if (currsum != 0 && currsum != x * x) {
check = false;
break;
}
}
if (!check) break;
}
if (check) {
cout << x << "\n";
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
string tob(string s) {
string t;
for (int i = 0; i < s.size(); i++) {
switch (s[i]) {
case '0':
t += "0000";
break;
case '1':
t += "0001";
break;
case '2':
t += "0010";
break;
case '3':
t += "0011";
break;
case '4':
t += "0100";
break;
case '5':
t += "0101";
break;
case '6':
t += "0110";
break;
case '7':
t += "0111";
break;
case '8':
t += "1000";
break;
case '9':
t += "1001";
break;
case 'A':
t += "1010";
break;
case 'B':
t += "1011";
break;
case 'C':
t += "1100";
break;
case 'D':
t += "1101";
break;
case 'E':
t += "1110";
break;
case 'F':
t += "1111";
break;
case 'a':
t += "1010";
break;
case 'b':
t += "1011";
break;
case 'c':
t += "1100";
break;
case 'd':
t += "1101";
break;
case 'e':
t += "1110";
break;
case 'f':
t += "1111";
break;
default:
t += '.';
}
}
return t;
}
int main() {
int n;
scanf("%d", &n);
string arr[n];
for (int i = 0; i < n; i++) {
char ss[700000];
scanf("%s", ss);
arr[i] = tob(ss);
}
vector<int> v;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
if (n / i == i) {
v.push_back(i);
} else {
v.push_back(i);
v.push_back(n / i);
}
}
}
int mx = 1;
for (int m : v) {
for (int i = 0; i < n; i += m) {
for (int j = 0; j < n; j += m) {
int o = arr[i][j];
for (int ii = i; ii < i + m; ii++) {
for (int jj = j; jj < j + m; jj++) {
if (arr[ii][jj] != o) {
goto go;
}
}
}
}
}
mx = max(mx, m);
go:;
}
printf("%d", mx);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e4;
const int mod = 1e9 + 7;
int n;
string s[N];
map<pair<string, int>, bool> dp;
bool checkhor(int i, int x) {
if (x == 1) return true;
string t = s[i];
if (dp.count({t, x})) return dp[{t, x}];
deque<int> v;
for (int j = int(t.size() - 1); j >= int(0); j--) {
int num = t[j] - '0';
if (t[j] >= 'A' and t[j] <= 'Z') {
num = 10 + (t[j] - 'A');
}
for (int i = int(1); i <= int(4); i++) {
v.push_front(num % 2);
num /= 2;
}
}
bool ok = true;
for (int i = 0; i < v.size(); i += x) {
for (int j = int(i); j <= int(i + x - 1); j++) {
if (v[j] != v[i]) {
ok = false;
break;
}
}
}
return dp[{t, x}] = ok;
}
bool check(int x) {
if (x == 1) return true;
for (int i = int(1); i <= int(n); i++) {
int j = ceil(1.0 * i / x);
bool ok = checkhor(i, x);
if (s[i] != s[x * (j - 1) + 1] or !ok) {
return false;
}
}
return true;
}
signed main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = int(1); i <= int(n); i++) cin >> s[i];
for (int i = int(n); i >= int(1); i--) {
if (n % i) continue;
if (check(i)) {
cout << i << '\n';
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int dp[5201][5201];
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n / 4; j++) {
char t;
cin >> t;
if (t >= 'A')
t -= ('A' - 10);
else
t -= '0';
int tt = t;
for (int k = 3; k >= 0; k--) {
dp[i][j * 4 - 3 + k] = tt % 2;
tt /= 2;
}
}
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
dp[i][j] = dp[i][j] + dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1];
vector<int> v;
for (int i = 2; i * i <= n; i++)
if (n % i == 0) {
v.push_back(i);
if (n / i != i) v.push_back(n / i);
}
v.push_back(n);
sort(v.begin(), v.end());
int ans = 1;
bool ch = 1;
for (int i = v.size() - 1; i >= 0; i--) {
int t = v[i];
ch = 1;
for (int j = t; j <= n && ch; j += t) {
for (int k = t; k <= n && ch; k += t) {
int no = dp[j][k] - dp[j - t][k] - dp[j][k - t] + dp[j - t][k - t];
if (no != 0 && no != t * t) ch = 0;
}
}
if (ch) {
ans = t;
break;
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, x, cur, sum[5555][5555], ans;
bool mp[5555][5555];
char s[5555];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%s", s);
x = strlen(s);
for (int j = 0; j < x; j++) {
if (s[j] >= 'A' && s[j] <= 'F')
cur = 10 + s[j] - 'A';
else
cur = s[j] - '0';
for (int k = 0; k < 4; k++) {
mp[i][j * 4 + k + 1] = (bool)(cur & (1 << (3 - k)));
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
sum[i][j] = sum[i][j - 1] + sum[i - 1][j] - sum[i - 1][j - 1] + mp[i][j];
}
}
for (int i = 1; i <= n; i++) {
if (n % i == 0) {
bool f = 0;
for (int j = i; j <= n; j += i) {
for (int k = i; k <= n; k += i) {
cur = sum[j][k] - sum[j - i][k] - sum[j][k - i] + sum[j - i][k - i];
if (cur != i * i && cur) {
f = 1;
break;
}
}
if (f) break;
}
if (!f) ans = i;
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
const int mod = (1e9) + 7;
const double eps = 1e-10;
const int siz = 3e5 + 5, siz2 = 33, lg = 21, block = 317, block2 = 1000,
mxv = 1e6;
const long long idnt[2] = {LLONG_MAX, LLONG_MIN};
int n;
bool arr[5205][5205], diff[5205];
char str[1305];
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%s", str);
for (int j = 0; j < n / 4; j++) {
int val = str[j] >= 'A' ? str[j] - 'A' + 10 : str[j] - '0';
for (int mask = 1 << 3, k = 1; mask > 0; mask >>= 1, k++) {
arr[i][j * 4 + k] = (bool)(val & mask);
}
}
}
diff[n] = true;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i < n && arr[i][j] != arr[i + 1][j]) {
diff[i] = true;
}
if (j < n && arr[i][j] != arr[i][j + 1]) {
diff[j] = true;
}
}
}
int g = 0;
for (int i = 1; i <= n; i++) {
if (diff[i]) {
g = gcd(g, i);
}
}
printf("%d\n", g);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e18;
const int mod = 1e9 + 7;
const int N = 2e5 + 10;
inline int add(int x, int y) {
x += y;
if (x >= mod) x -= mod;
return x;
}
inline int mul(int x, int y) {
x = (1LL * x * y) % mod;
return x;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int mat[5201][1301];
int dp[5201][5201];
int n;
int get(int i, int j) {
int jj = (j - 1) / 4 + 1;
int pos = 3 - (j - 1) % 4;
return ((mat[i][jj] & (1 << pos)) > 0 ? 1 : 0);
}
int get2(int a, int b, int c, int d) {
return (dp[c][d] - dp[a - 1][d] - dp[c][b - 1] + dp[a - 1][b - 1]);
}
void pre() {
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
dp[i][j] = dp[i][j - 1] + dp[i - 1][j] - dp[i - 1][j - 1] + get(i, j);
}
}
}
bool check(int x) {
for (int r = 1; r <= n / x; ++r) {
for (int cc = 1; cc <= n / x; ++cc) {
int a = (r - 1) * x + 1;
int b = (cc - 1) * x + 1;
int c = (r - 1) * x + x;
int d = (cc - 1) * x + x;
if (get2(a, b, c, d) != 0 && get2(a, b, c, d) != x * x) return false;
}
}
return true;
}
int32_t main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n / 4; ++j) {
char ch;
cin >> ch;
if (ch >= '0' && ch <= '9')
mat[i][j] = ch - '0';
else
mat[i][j] = ch - 'A' + 10;
}
}
pre();
int ans = 0;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
if (check(i)) ans = max(ans, i);
if (i * i != n)
if (check(n / i)) ans = max(ans, n / i);
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[5222][5222], ans, n, psum[5222][5222];
vector<int> v;
int cal(int sx, int ex, int sy, int ey) {
return psum[ex][ey] - psum[ex][sy - 1] - psum[sx - 1][ey] +
psum[sx - 1][sy - 1];
}
int sol(int x) {
for (int i = 0; i < n / x; i++) {
int sx = i * x + 1;
int ex = i * x + x;
for (int j = 0; j < n / x; j++) {
int sy = j * x + 1;
int ey = j * x + x;
if (cal(sx, ex, sy, ey) != a[i * x + 1][j * x + 1] * x * x) {
return 0;
}
}
}
return 1;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
for (int i = 1; i <= n; i++) {
string s;
cin >> s;
int idx = 1;
for (int j = 0; j < s.size(); j++) {
int cur = 0;
if (s[j] >= 'A' && s[j] <= 'F') {
cur = s[j] - 'A' + 10;
} else {
cur = s[j] - '0';
}
for (int j = 3; j >= 0; j--) {
if ((1 << j) & cur) {
a[i][idx] = 1;
}
idx++;
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
psum[i][j] =
psum[i - 1][j] + psum[i][j - 1] - psum[i - 1][j - 1] + a[i][j];
}
}
long long sq = sqrt(n);
for (int i = 1; i <= sq; i++) {
if (n % i == 0) {
v.push_back(i);
if (n / i != i) {
v.push_back(n / i);
}
}
}
for (int i = 0; i < v.size(); i++) {
if (sol(v[i])) {
ans = max(ans, v[i]);
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<vector<int>> a(n + 1, vector<int>(n + 1));
for (int i = 1; i <= n; ++i) {
string second;
cin >> second;
char c;
int y = 0;
for (int j = 1; j <= n; j += 4) {
c = second[y];
++y;
if (c == '0') {
a[i][j] = 0;
a[i][j + 1] = 0;
a[i][j + 2] = 0;
a[i][j + 3] = 0;
} else if (c == '1') {
a[i][j] = 0;
a[i][j + 1] = 0;
a[i][j + 2] = 0;
a[i][j + 3] = 1;
} else if (c == '2') {
a[i][j] = 0;
a[i][j + 1] = 0;
a[i][j + 2] = 1;
a[i][j + 3] = 0;
} else if (c == '3') {
a[i][j] = 0;
a[i][j + 1] = 0;
a[i][j + 2] = 1;
a[i][j + 3] = 1;
} else if (c == '4') {
a[i][j] = 0;
a[i][j + 1] = 1;
a[i][j + 2] = 0;
a[i][j + 3] = 0;
} else if (c == '5') {
a[i][j] = 0;
a[i][j + 1] = 1;
a[i][j + 2] = 0;
a[i][j + 3] = 1;
} else if (c == '6') {
a[i][j] = 0;
a[i][j + 1] = 1;
a[i][j + 2] = 1;
a[i][j + 3] = 0;
} else if (c == '7') {
a[i][j] = 0;
a[i][j + 1] = 1;
a[i][j + 2] = 1;
a[i][j + 3] = 1;
} else if (c == '8') {
a[i][j] = 1;
a[i][j + 1] = 0;
a[i][j + 2] = 0;
a[i][j + 3] = 0;
} else if (c == '9') {
a[i][j] = 1;
a[i][j + 1] = 0;
a[i][j + 2] = 0;
a[i][j + 3] = 1;
} else if (c == 'A') {
a[i][j] = 1;
a[i][j + 1] = 0;
a[i][j + 2] = 1;
a[i][j + 3] = 0;
} else if (c == 'B') {
a[i][j] = 1;
a[i][j + 1] = 0;
a[i][j + 2] = 1;
a[i][j + 3] = 1;
} else if (c == 'C') {
a[i][j] = 1;
a[i][j + 1] = 1;
a[i][j + 2] = 0;
a[i][j + 3] = 0;
} else if (c == 'D') {
a[i][j] = 1;
a[i][j + 1] = 1;
a[i][j + 2] = 0;
a[i][j + 3] = 1;
} else if (c == 'E') {
a[i][j] = 1;
a[i][j + 1] = 1;
a[i][j + 2] = 1;
a[i][j + 3] = 0;
} else if (c == 'F') {
a[i][j] = 1;
a[i][j + 1] = 1;
a[i][j + 2] = 1;
a[i][j + 3] = 1;
}
}
}
for (int k = 1; k <= n / 2; ++k) {
if (n % k == 0) {
int f4 = 0;
int r = n / k;
for (int i = 1; i <= n; i += r) {
int f3 = 0;
for (int j = 1; j <= n; j += r) {
int f2 = 0;
int q = a[i][j];
for (int a1 = 0; a1 < r; ++a1) {
int f1 = 0;
for (int a2 = 0; a2 < r; ++a2) {
if (a[a1 + i][a2 + j] != q) {
f1 = 1;
break;
}
}
if (f1) {
f2 = 1;
break;
}
}
if (f2) {
f3 = 1;
break;
}
}
if (f3) {
f4 = 1;
break;
}
}
if (f4 == 0) {
cout << r;
return;
}
}
}
cout << 1;
}
int main() {
int t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
constexpr int MAXN = 5205;
int n, mat[MAXN][MAXN];
std::string s;
inline vector<bool> hx2bin(char c) {
int val;
if (c >= 'A')
val = c - 'A' + 10;
else
val = c - '0';
vector<bool> ret;
for (int msk = 1 << 3; msk > 0; msk >>= 1) {
ret.push_back(msk & val);
}
return ret;
}
inline void add_to_mat(int i) {
int j = 1;
for (char c : s) {
for (bool bit : hx2bin(c)) {
mat[i][j] = int(bit) + mat[i][j - 1] + mat[i - 1][j] - mat[i - 1][j - 1];
++j;
}
}
}
inline bool is_okay(int x) {
for (int i = x; i <= n; i += x) {
for (int j = x; j <= n; j += x) {
int ss = mat[i][j] - mat[i - x][j] - mat[i][j - x] + mat[i - x][j - x];
if (ss == 0 || ss == x * x)
continue;
else
return false;
}
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> s;
add_to_mat(i);
}
int best_x = 1;
for (int x = 1; x * x <= n; ++x) {
if (n % x) continue;
if (is_okay(n / x)) {
best_x = n / x;
break;
} else if (is_okay(x)) {
best_x = x;
}
}
cout << best_x << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> find_div(int n) {
vector<int> out;
for (long long x = 1; x * x <= n; ++x) {
if (n % x) continue;
out.push_back(x);
if (n / x != x) out.push_back(n / x);
}
sort(out.begin(), out.end());
return out;
}
int cnv_to10(char ch) {
if (isdigit(ch)) return ch - '0';
return 10 + ch - 'A';
}
int get_bit(int val, int i) { return (val >> i) & 1; }
void fill_next4(vector<int>& dst, int& pos, int val) {
for (int i = 3; i >= 0; --i, ++pos) dst[pos] = get_bit(val, i);
}
vector<vector<int> > calc_p_sum(const vector<vector<int> >& d) {
int n = d.size();
vector<vector<int> > p(n, vector<int>(n));
p[0][0] = d[0][0];
for (int j = 1; j < n; ++j) p[0][j] += p[0][j - 1] + d[0][j];
for (int i = 1; i < n; ++i) p[i][0] += p[i - 1][0] + d[i][0];
for (int i = 1; i < n; ++i)
for (int j = 1; j < n; ++j)
p[i][j] = p[i - 1][j] + p[i][j - 1] - p[i - 1][j - 1] + d[i][j];
return p;
}
int calc_sum(const vector<vector<int> >& p, int x, int y, int m) {
int A = 0;
if (x - 1 >= 0 && y - 1 >= 0) A = p[x - 1][y - 1];
int B = 0;
if (x - 1 >= 0) B = p[x - 1][y + m];
int C = 0;
if (y - 1 >= 0) C = p[x + m][y - 1];
int D = p[x + m][y + m];
return D - B - C + A;
}
int main() {
std::ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> divisors = find_div(n);
reverse(divisors.begin(), divisors.end());
vector<vector<int> > d(n, vector<int>(n));
for (int i = 0; i < n; ++i) {
int pos = 0;
string s;
cin >> s;
for (char ch : s) fill_next4(d[i], pos, cnv_to10(ch));
}
auto p_sum = calc_p_sum(d);
for (int m : divisors) {
bool failed = false;
for (int i = 0; i < n; i += m) {
for (int j = 0; j < n; j += m) {
int ss = calc_sum(p_sum, i, j, m - 1);
if (ss == 0 || ss == m * m) continue;
failed = true;
break;
}
if (failed) break;
}
if (!failed) {
cout << m << endl;
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
bitset<(int)(5200)> mat[(int)(5200)];
int gcd(int a, int b) {
int r = a % b;
while (r) {
a = b;
b = r;
r = a % b;
}
return b;
}
int hex(char ch) { return isdigit(ch) ? ch - '0' : ch - 'A' + 10; }
int main() {
ios_base ::sync_with_stdio(NULL);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string st;
cin >> st;
for (char ch : st) {
mat[i] <<= 4;
mat[i] |= hex(ch);
}
}
bool fl = 0;
int gc;
for (int i = 0; i < n; i++) {
int cc = 1;
for (int j = n - 2; j >= n - n; j--) {
if (mat[i][j] == mat[i][j + 1]) {
cc++;
} else {
if (!fl) {
gc = cc;
fl = 1;
} else {
gc = gcd(cc, gc);
}
cc = 1;
}
}
if (!fl) {
gc = cc;
} else {
gc = gcd(cc, gc);
}
}
for (int j = n - 1; j >= n - n; j--) {
int cc = 1;
for (int i = 1; i < n; i++) {
if (mat[i - 1][j] == mat[i][j]) {
cc++;
} else {
if (!fl) {
gc = cc;
} else {
gc = gcd(cc, gc);
}
cc = 1;
}
}
if (!fl) {
gc = cc;
} else {
gc = gcd(cc, gc);
}
}
cout << gc << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
const double eps = (1e-8);
string g[5205];
int rEqual[5205][5205], cEqual[5205][5205];
int n;
bool check(int x) {
for (int j = 0; j < n; j += x) {
for (int i = 0; i < n; i += x) {
if (rEqual[i][j] < x || cEqual[i][j] < x) return false;
for (int st = j; st < j + x; ++st) {
if (cEqual[i][st] < x) return false;
}
}
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n / 4; ++j) {
char c;
cin >> c;
if (isalpha(c)) {
c -= 'A' - 10;
} else
c -= '0';
string bin;
while (c) {
bin += c % 2 + '0';
c /= 2;
}
while ((int)(bin).size() < 4) bin += '0';
reverse(bin.begin(), bin.end());
g[i] += bin;
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
int st = j;
char c = g[i][j];
while (j < n && g[i][j] == c) {
rEqual[i][st]++;
++j;
}
--j;
for (int k = st + 1; k <= j; ++k) rEqual[i][k] = rEqual[i][k - 1] - 1;
}
}
for (int j = 0; j < n; ++j) {
for (int i = 0; i < n; ++i) {
int st = i;
char c = g[i][j];
while (i < n && g[i][j] == c) {
cEqual[st][j]++;
++i;
}
--i;
for (int k = st + 1; k <= i; ++k) cEqual[k][j] = cEqual[k - 1][j] - 1;
}
}
for (int i = n; i > 1; --i) {
if (n % i == 0 && check(i)) {
cout << i << '\n';
return 0;
}
}
cout << 1 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5200 + 11;
int n, w;
bool row[maxn][maxn];
bool col[maxn][maxn];
char x;
bool check(bool *row, int l) {
bool ret = 1;
for (int i = 0, j = 0; i < n;) {
while (j < i + l) ret &= row[i] == row[j++];
i = j;
}
return ret;
}
int32_t main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n / 4; j++) {
cin >> x;
if (x >= '0' and x <= '9')
w = x - '0';
else
w = x - 'A' + 10;
for (int k = 0; k < 4; k++) {
row[i][4 * j + k] = (w >> (3 - k)) & 1;
col[4 * j + k][i] = row[i][4 * j + k];
}
}
}
int ans = 1;
for (int i = 2; i <= n; i++) {
if (n % i) continue;
bool ok = true;
for (int j = 0; j < n; j++) ok &= check(row[j], i);
for (int j = 0; j < n; j++) ok &= check(col[j], i);
if (ok) ans = i;
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int mat[5210][5210], n, d[5210];
void get_input(int i, int jstart, int num) {
mat[i][jstart] = num / 8;
mat[i][jstart + 1] = (num % 8) / 4;
mat[i][jstart + 2] = (num % 4) / 2;
mat[i][jstart + 3] = num % 2;
}
int check(int baseline, int i, int j, int step) {
for (int inneri = 0; inneri < step; inneri++)
for (int innerj = 0; innerj < step; innerj++)
if (mat[i + inneri][j + innerj] != baseline) return 0;
return 1;
}
int checkdiv(int num) {
int baseline;
for (int i = 1; i <= n; i += d[num]) {
for (int j = 1; j <= n; j += d[num]) {
baseline = mat[i][j];
if (!check(baseline, i, j, d[num])) return 0;
}
}
return 1;
}
int main() {
int divnum = 0;
char ch;
cin >> n;
scanf("%c", &ch);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n / 4; j++) {
scanf("%c", &ch);
if (ch >= 48 && ch <= 57) get_input(i, j * 4 - 3, ch - 48);
if (ch >= 65 && ch <= 90) get_input(i, j * 4 - 3, ch - 55);
}
scanf("%c", &ch);
}
for (int i = 1; i <= n; i++) {
if (n % i == 0) {
divnum++;
d[divnum] = i;
}
}
for (int num = divnum; num >= 1; num--) {
if (checkdiv(num)) {
cout << d[num] << endl;
break;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int maxt[5210][5210];
int a[5210][5210];
char str[5210];
int getn(char ch) {
if (ch >= '0' && ch <= '9') {
return ch - '0';
} else {
return 10 + ch - 'A';
}
}
int main() {
scanf("%d", &n);
memset(maxt, 0, sizeof(maxt));
for (int i = 1; i <= n; i++) {
scanf("%s", str + 1);
int In = 0, len = strlen(str + 1);
for (int j = len; j >= 1; j--) {
int N = getn(str[j]);
int Jn = 0;
while (N) {
a[i][n - In - Jn] = N % 2;
N /= 2;
Jn++;
}
for (; Jn < 4; Jn++) {
if (n - In - Jn == 0) {
break;
}
a[i][n - In - Jn] = 0;
}
In += Jn;
}
for (int j = n - In; j >= 1; j--) {
a[i][j] = 0;
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
maxt[i][j] =
a[i][j] + maxt[i - 1][j] + maxt[i][j - 1] - maxt[i - 1][j - 1];
}
}
for (int I = n; I >= 1; I--) {
if (n % I == 0) {
int flag = 1;
for (int i = 1; i <= (n / I); i++) {
for (int j = 1; j <= (n / I); j++) {
int cnt = maxt[i * I][j * I] - maxt[(i - 1) * I][j * I] -
maxt[i * I][(j - 1) * I] + maxt[(i - 1) * I][(j - 1) * I];
if (cnt != I * I * a[i * I][j * I]) {
flag = 0;
break;
}
}
if (!flag) {
break;
}
}
if (flag) {
printf("%d\n", I);
break;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
void solve() {
long long n;
cin >> n;
vector<long long> fac;
long long i = 1;
while (i * i <= n) {
if (n % i == 0) {
fac.push_back(i);
if (i * i == n) {
i++;
continue;
}
fac.push_back(n / i);
}
i++;
}
long long a[n + 5][n + 5];
memset(a, 0, sizeof(a));
for (int i = 1; i < n + 1; i++) {
string s;
cin >> s;
int n1 = s.size();
int id = n;
for (int j = n1 - 1; j >= 0; j--) {
long long val1 = s[j] - '0';
if (s[j] >= 'A') val1 = s[j] - 'A' + 10;
int val2 = 4;
while (val2--) {
a[i][id--] = (val1 & 1);
val1 /= 2;
}
}
}
set<long long> s;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
s.insert(a[i][j]);
}
}
if (s.size() == 1) {
cout << n << "\n";
} else {
long long ans = 1;
for (auto ele : fac) {
if (ele == n) continue;
map<pair<long long, long long>, long long> v;
long long x = ele;
int flag = 1;
for (int i = 1; i <= n / x; i++) {
for (int j = 1; j <= n / x; j++) {
for (int k = 1; k <= x; k++) {
for (int l = 1; l <= x; l++) {
if (a[(i - 1) * x + k][(j - 1) * x + l] != a[i * x][j * x])
flag = 0;
}
}
}
}
if (flag) ans = max(ans, ele);
}
cout << ans << "\n";
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int tc = 1;
while (tc--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[5202][5202];
string HexToBin(char x) {
switch (x) {
case '0':
return "0000";
break;
case '1':
return "0001";
break;
case '2':
return "0010";
break;
case '3':
return "0011";
break;
case '4':
return "0100";
break;
case '5':
return "0101";
break;
case '6':
return "0110";
break;
case '7':
return "0111";
break;
case '8':
return "1000";
break;
case '9':
return "1001";
break;
case 'A':
case 'a':
return "1010";
break;
case 'B':
case 'b':
return "1011";
break;
case 'C':
case 'c':
return "1100";
break;
case 'D':
case 'd':
return "1101";
break;
case 'E':
case 'e':
return "1110";
break;
case 'F':
case 'f':
return "1111";
break;
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n;
cin >> n;
string s;
for (long long i = 1; i <= n; i++) {
string s;
cin >> s;
long long t = 1;
for (long long j = 0; j < s.size(); j++) {
string s1 = HexToBin(s[j]);
for (char k : s1) a[i][t++] = k - '0';
}
}
vector<long long> v;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) v.push_back(i), v.push_back(n / i);
}
sort(v.begin(), v.end(), greater<long long>());
for (long long i = 1; i <= n; i++) {
for (long long j = 1; j <= n; j++) a[i][j] += a[i][j - 1];
}
for (long long i = 1; i <= n; i++) {
for (long long j = 1; j <= n; j++) a[j][i] += a[j - 1][i];
}
for (long long i : v) {
bool flag = true;
for (long long j = 1; j < n; j += i) {
for (long long k = 1; k < n; k += i) {
long long ans = a[j + i - 1][k + i - 1] - a[j + i - 1][k - 1] -
a[j - 1][k + i - 1] + a[j - 1][k - 1];
if (ans != i * i && ans != 0) flag = false;
}
}
if (flag) {
cout << i << "\n";
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 5212;
int n;
int cnt[N][N];
bool a[N][N];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int j = 0; j < n / 4; j++) {
int val = 0;
if (s[j] >= '0' && s[j] <= '9')
val = s[j] - '0';
else
val = s[j] - 'A' + 10;
a[i][4 * j + 3] = (val & 1);
val /= 2;
a[i][4 * j + 2] = (val & 1);
val /= 2;
a[i][4 * j + 1] = (val & 1);
val /= 2;
a[i][4 * j + 0] = (val & 1);
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cnt[i][j] = a[i][j];
if (i) cnt[i][j] += cnt[i - 1][j];
if (j) cnt[i][j] += cnt[i][j - 1];
if (i && j) cnt[i][j] -= cnt[i - 1][j - 1];
}
}
int ans = 1;
for (int i = 2; i <= n; i++) {
if (n % i == 0) {
bool C = 0;
int x = i;
for (int j = i - 1; j < n; j += i) {
for (int l = i - 1; l < n; l += i) {
int val = cnt[j][l];
if (j >= x) val -= cnt[j - x][l];
if (l >= x) val -= cnt[j][l - x];
if (l >= x && j >= x) val += cnt[j - x][l - x];
if (val == 0 || val == (i * i))
;
else
C = 1;
}
}
if (!C) ans = i;
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 5205;
bitset<NMAX> bit[NMAX];
char s[NMAX];
int a[NMAX][NMAX], n;
inline int Convert(char ch) {
if ('0' <= ch && ch <= '9') return ch - '0';
return ch - 'A' + 10;
}
int main() {
ios_base::sync_with_stdio(false);
cin >> n;
int j = 0;
for (int i = 0; i < n; ++i) {
cin >> (s + 1);
for (int k = 1; k <= n / 4; ++k) {
int val = Convert(s[k]);
for (int p = 3; p >= 0; --p) {
if ((val & (1 << p)) == 0)
bit[i][j++] = 0;
else
bit[i][j++] = 1;
}
if (j == n) j = 0;
}
}
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j) {
int x = 0, y = 0, z = 0;
if (i - 1 >= 0) x = a[i - 1][j];
if (j - 1 >= 0) y = a[i][j - 1];
if (i - 1 >= 0 && j - 1 >= 0) z = a[i - 1][j - 1];
a[i][j] = x + y - z + bit[i][j];
}
for (int p = n; p >= 1; --p) {
if (n % p != 0) continue;
bool good = true;
for (int i = p - 1; i < n && good; i += p)
for (int j = p - 1; j < n && good; j += p) {
int x = 0, y = 0, z = 0;
if (i - p >= 0) x = a[i - p][j];
if (j - p >= 0) y = a[i][j - p];
if (i - p >= 0 && j - p >= 0) z = a[i - p][j - p];
int sum = a[i][j] - x - y + z;
if (sum != p * p && sum != 0) good = false;
}
if (good == true) {
cout << p << "\n";
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[5205][5205];
bool check(long long i, long long j, long long k) {
k--;
long long act =
a[i + k][j + k] - a[i - 1][j + k] - a[i + k][j - 1] + a[i - 1][j - 1];
k++;
if (act == k * k || act == 0) return 1;
return 0;
}
bool verif(long long n, long long ans) {
long long i, j;
for (i = 1; i <= n - ans + 1; i += ans)
for (j = 1; j <= n - ans + 1; j += ans)
if (!check(i, j, ans)) return 0;
return 1;
}
vector<long long> divv[5205];
int main() {
ios_base::sync_with_stdio(false);
char x;
long long i, j, nr, ind2, n, k, ans;
cin >> n;
for (i = 2; i <= n; i++) {
for (j = i; j <= n; j += i) divv[j].push_back(i);
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= n / 4; j++) {
cin >> x;
if (x >= '0' && x <= '9')
nr = x - '0';
else
nr = x - 'A' + 10;
for (k = 1; k <= 4; k++) {
ind2 = (j - 1) * 4 + k;
a[i][ind2] = (nr & 8) / 8;
a[i][ind2] += a[i - 1][ind2] + a[i][ind2 - 1] - a[i - 1][ind2 - 1];
nr = nr << 1;
}
}
}
for (long long ind = divv[n].size() - 1; ind >= 0; ind--) {
ans = divv[n][ind];
if (verif(n, ans)) {
cout << ans << '\n';
return 0;
}
}
cout << 1 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool grid[5205][5205];
int rect[5205][5205];
char cek;
int main() {
int n, i, j, k, x, y, r, c, ans, curr, temp, sum;
scanf("%d", &n);
getchar();
for (i = 1; i <= n; i++) {
for (j = 0; j < n / 4; j++) {
scanf("%c", &cek);
if (cek >= '0' && cek <= '9') {
curr = cek - '0';
} else {
curr = cek - 'A' + 10;
}
for (k = 4; k >= 1; k--) {
if (curr % 2 == 1) {
grid[i][4 * j + k] = 1;
}
curr /= 2;
}
}
getchar();
}
memset(rect, 0, sizeof(rect));
rect[1][1] = grid[1][1];
for (i = 2; i <= n; i++) {
rect[1][i] = rect[1][i - 1] + grid[1][i];
rect[i][1] = rect[i - 1][1] + grid[i][1];
}
for (i = 2; i <= n; i++) {
for (j = 2; j <= n; j++) {
rect[i][j] =
rect[i - 1][j] + rect[i][j - 1] - rect[i - 1][j - 1] + grid[i][j];
}
}
for (i = n; i >= 1; i--) {
if (n % i == 0) {
int can = 1;
for (j = 0; j < n; j += i) {
for (k = 0; k < n; k += i) {
sum =
rect[j + i][k + i] - rect[j][k + i] - rect[j + i][k] + rect[j][k];
if (sum == 0 || sum == i * i) continue;
can = 0;
break;
}
}
if (can == 1) {
ans = i;
break;
}
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct fast_ios {
fast_ios() {
cin.tie(nullptr), ios::sync_with_stdio(false),
cout << fixed << setprecision(20);
};
} fast_ios_;
template <class T>
auto add = [](T a, T b) -> T { return a + b; };
template <class T>
auto f_max = [](T a, T b) -> T { return max(a, b); };
template <class T>
auto f_min = [](T a, T b) -> T { return min(a, b); };
template <class T>
using V = vector<T>;
using Vl = V<int>;
using VVl = V<Vl>;
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
for (int i = 0; i < (int)v.size(); i++)
os << v[i] << (i + 1 != v.size() ? " " : "");
return os;
}
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
for (T& in : v) is >> in;
return is;
}
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;
}
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int ceil(int a, int b) { return (a + b - 1) / b; }
int digit(int a) { return (int)log10(a); }
int e_dist(pair<int, int> a, pair<int, int> b) {
return abs(a.first - b.first) * abs(a.first - b.first) +
abs(a.second - b.second) * abs(a.second - b.second);
}
int m_dist(pair<int, int> a, pair<int, int> b) {
return abs(a.first - b.first) + abs(a.second - b.second);
}
void Worshall_Floyd(VVl& g) {
for (int k = (0), k_end_ = (((int)(g).size())); k < k_end_; ++k)
for (int i = (0), i_end_ = (((int)(g).size())); i < i_end_; ++i)
for (int j = (0), j_end_ = (((int)(g).size())); j < j_end_; ++j)
chmin(g[i][j], g[i][k] + g[k][j]);
}
const int MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 1e5;
int dx[8] = {1, 0, -1, 0, 1, -1, 1, -1}, dy[8] = {0, 1, 0, -1, -1, -1, 1, 1};
bool YN(bool flag) {
cout << (flag ? "YES" : "NO") << '\n';
return flag;
}
bool yn(bool flag) {
cout << (flag ? "Yes" : "No") << '\n';
return flag;
}
struct Edge {
int from, to;
int cost;
Edge(int u, int v, int c) {
cost = c;
from = u;
to = v;
}
bool operator<(const Edge& e) const { return cost < e.cost; }
};
struct WeightedEdge {
int to;
int cost;
WeightedEdge(int v, int c = 1) {
to = v;
cost = c;
}
bool operator<(const WeightedEdge& e) const { return cost < e.cost; }
};
using WeightedGraph = V<V<WeightedEdge>>;
int hextolint(char c) {
if ('0' <= c && c <= '9')
return c - '0';
else
return (c - 'A') + 10;
}
char linttohex(int v) {
if (v < 10)
return '0' + v;
else
return 'A' + (v - 10);
}
struct UnionFind {
public:
UnionFind() : _n(0) {}
UnionFind(int n) : _n(n), parent_or_size(n, -1) {}
int merge(int a, int b) {
assert(0 <= a && a < _n);
assert(0 <= b && b < _n);
int x = leader(a), y = leader(b);
if (x == y) return x;
if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
if (used_count) {
if (count_in_set[x].size() < count_in_set[y].size()) {
std::swap(count_in_set[x], count_in_set[y]);
}
for (auto p : count_in_set[y]) {
count_in_set[x][p.first] += p.second;
}
}
if (set_operate) {
root_values[x] = f(root_values[y], root_values[x]);
}
parent_or_size[x] += parent_or_size[y];
parent_or_size[y] = x;
return x;
}
bool same(int a, int b) {
assert(0 <= a && a < _n);
assert(0 <= b && b < _n);
return leader(a) == leader(b);
}
int leader(int a) {
assert(0 <= a && a < _n);
if (parent_or_size[a] < 0) return a;
return parent_or_size[a] = leader(parent_or_size[a]);
}
int size(int a) {
assert(0 <= a && a < _n);
return -parent_or_size[leader(a)];
}
std::vector<std::vector<int>> groups() {
std::vector<int> leader_buf(_n), group_size(_n);
for (int i = 0; i < _n; i++) {
leader_buf[i] = leader(i);
group_size[leader_buf[i]]++;
}
std::vector<std::vector<int>> result(_n);
for (int i = 0; i < _n; i++) {
result[i].reserve(group_size[i]);
}
for (int i = 0; i < _n; i++) {
result[leader_buf[i]].push_back(i);
}
result.erase(
std::remove_if(result.begin(), result.end(),
[&](const std::vector<int>& v) { return v.empty(); }),
result.end());
return result;
}
void set_operate_and_value(std::vector<int> array,
function<int(int, int)> _f) {
f = _f;
root_values = array;
set_operate = true;
}
int get_set_value(int a) { return root_values[leader(a)]; }
void regist_count(int a, int label) {
if (!used_count) {
used_count = true;
count_in_set.assign(_n, std::map<int, int>());
}
count_in_set[leader(a)][label]++;
}
int get_count(int a, int label) {
if (!used_count) return -1;
return count_in_set[leader(a)][label];
}
private:
int _n;
std::vector<int> parent_or_size;
std::vector<std::map<int, int>> count_in_set;
bool used_count = false;
std::vector<int> root_values;
function<int(int, int)> f;
bool set_operate = false;
};
int N;
int main() {
cin >> N;
V<string> arr(N);
cin >> arr;
V<string> _arr;
for (int j = (0), j_end_ = (N); j < j_end_; ++j) {
string _s = "";
for (int i = (0), i_end_ = (N / 4); i < i_end_; ++i) {
int sum = 0;
for (int k = (0), k_end_ = (4); k < k_end_; ++k) {
int v = hextolint(arr[i * 4 + k][j / 4]);
if (v & (8 >> (j % 4))) {
sum += 8 >> k;
}
}
_s += linttohex(sum);
}
_arr.push_back(_s);
}
{
UnionFind tree(N), _tree(N);
for (int i = (0), i_end_ = (N); i < i_end_; ++i) {
for (int j = (i + 1), j_end_ = (N); j < j_end_; ++j) {
if (tree.same(i, j)) continue;
if (arr[i] == arr[j]) tree.merge(i, j);
}
}
for (int i = (0), i_end_ = (N); i < i_end_; ++i) {
for (int j = (i + 1), j_end_ = (N); j < j_end_; ++j) {
if (_tree.same(i, j)) continue;
if (_arr[i] == _arr[j]) _tree.merge(i, j);
}
}
int ans = 1;
for (int x = (1), x_end_ = (N + 1); x < x_end_; ++x) {
if (N % x != 0) continue;
bool flag = true;
for (int i = (0), i_end_ = (N / x); i < i_end_; ++i) {
for (int k = (0), k_end_ = (x); k < k_end_; ++k) {
if (!tree.same(i * x, i * x + k)) flag = false;
}
}
for (int i = (0), i_end_ = (N / x); i < i_end_; ++i) {
for (int k = (0), k_end_ = (x); k < k_end_; ++k) {
if (!_tree.same(i * x, i * x + k)) flag = false;
}
}
if (flag) chmax(ans, x);
}
cout << ans << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
bitset<6000> c[6000], r[6000], t;
set<int> se;
int solve(int h) {
int w = n / h;
for (int i = 0; i < w; i++) {
for (int j = 1; j < h; j++) {
if (r[i * h] != r[i * h + j]) {
return 0;
}
}
}
for (int i = 0; i < w; i++) {
for (int j = 1; j < h; j++) {
if (c[i * h] != c[i * h + j]) {
return 0;
}
}
}
return h;
}
inline int toint(char cc) {
if (cc >= '0' && cc <= '9')
return cc - '0';
else
return cc - 'A' + 10;
}
int main() {
cin >> n;
se.clear();
for (int i = 1; i <= sqrt(n); i++) {
if (!(n % i)) {
se.insert(i);
se.insert(n / i);
}
}
for (int i = 0; i < n; i++) {
string t;
cin >> t;
for (int j = 0; j < t.size(); j++) {
int tt = toint(t[j]);
if (tt & 1) {
r[i].set(j * 4);
c[j * 4 + 3].set(i);
}
if (tt & 2) {
r[i].set(j * 4 + 1);
c[j * 4 + 2].set(i);
}
if (tt & 4) {
r[i].set(j * 4 + 2);
c[j * 4 + 1].set(i);
}
if (tt & 8) {
r[i].set(j * 4 + 3);
c[j * 4].set(i);
}
}
}
int yes = 0;
for (set<int>::reverse_iterator i = se.rbegin(); i != se.rend(); i++) {
yes = solve(*i);
if (yes) break;
}
if (yes == 0)
cout << 1 << endl;
else
cout << yes << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
string arr[5205];
string st[5205];
vector<int> result;
void hexToBinary(string str, int i) {
for (int j = 0; j < str.length(); j++) {
switch (str[j]) {
case '0':
arr[i].insert(arr[i].length(), "0000");
break;
case '1':
arr[i].insert(arr[i].length(), "0001");
break;
case '2':
arr[i].insert(arr[i].length(), "0010");
break;
case '3':
arr[i].insert(arr[i].length(), "0011");
break;
case '4':
arr[i].insert(arr[i].length(), "0100");
break;
case '5':
arr[i].insert(arr[i].length(), "0101");
break;
case '6':
arr[i].insert(arr[i].length(), "0110");
break;
case '7':
arr[i].insert(arr[i].length(), "0111");
break;
case '8':
arr[i].insert(arr[i].length(), "1000");
break;
case '9':
arr[i].insert(arr[i].length(), "1001");
break;
case 'A':
arr[i].insert(arr[i].length(), "1010");
break;
case 'B':
arr[i].insert(arr[i].length(), "1011");
break;
case 'C':
arr[i].insert(arr[i].length(), "1100");
break;
case 'D':
arr[i].insert(arr[i].length(), "1101");
break;
case 'E':
arr[i].insert(arr[i].length(), "1110");
break;
case 'F':
arr[i].insert(arr[i].length(), "1111");
break;
}
}
}
void solve() {
long long n;
cin >> n;
for (int i = 0; i < n; i++) {
arr[i] = "";
}
for (int i = 0; i < n; i++) {
cin >> st[i];
hexToBinary(st[i], i);
}
int i = 1;
while (i * i <= n) {
if (n % i == 0) {
result.push_back(i);
if (n / i != i) result.push_back(n / i);
}
i++;
}
sort(result.begin(), result.end());
int sz = result.size() - 1;
int ans;
for (int i = sz; i >= 0; i--) {
int fact = result[i];
int flag = 0;
for (long long i = 0; i < n; i += fact) {
for (long long j = i + 1; j < i + fact; j++) {
if (st[j] != st[j - 1]) {
flag = 1;
break;
}
}
if (flag == 1) break;
}
for (int i = 0; i < n; i += fact) {
for (int j = 0; j < n; j += fact) {
string one = arr[i].substr(j, fact);
for (int k = 1; k < one.length(); k++) {
if (one[k] != one[k - 1]) {
flag = 1;
break;
}
}
if (flag == 1) break;
}
if (flag == 1) {
break;
}
}
if (flag == 0) {
ans = fact;
break;
}
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = (5200 + 1);
int n, arr[N][N];
int conv[4];
string s;
void con(char ch) {
conv[0] = 0;
conv[1] = 0;
conv[2] = 0;
conv[3] = 0;
if (ch == '1') {
conv[3] = 1;
} else if (ch == '2') {
conv[0] = 0;
conv[1] = 0;
conv[2] = 1;
conv[3] = 0;
} else if (ch == '3') {
conv[0] = 0;
conv[1] = 0;
conv[2] = 1;
conv[3] = 1;
} else if (ch == '4') {
conv[0] = 0;
conv[1] = 1;
conv[2] = 0;
conv[3] = 0;
} else if (ch == '5') {
conv[0] = 0;
conv[1] = 1;
conv[2] = 0;
conv[3] = 1;
} else if (ch == '6') {
conv[0] = 0;
conv[1] = 1;
conv[2] = 1;
conv[3] = 0;
} else if (ch == '7') {
conv[0] = 0;
conv[1] = 1;
conv[2] = 1;
conv[3] = 1;
} else if (ch == '8') {
conv[0] = 1;
conv[1] = 0;
conv[2] = 0;
conv[3] = 0;
} else if (ch == '9') {
conv[0] = 1;
conv[1] = 0;
conv[2] = 0;
conv[3] = 1;
} else if (ch == 'A') {
conv[0] = 1;
conv[1] = 0;
conv[2] = 1;
conv[3] = 0;
} else if (ch == 'B') {
conv[0] = 1;
conv[1] = 0;
conv[2] = 1;
conv[3] = 1;
} else if (ch == 'C') {
conv[0] = 1;
conv[1] = 1;
conv[2] = 0;
conv[3] = 0;
} else if (ch == 'D') {
conv[0] = 1;
conv[1] = 1;
conv[2] = 0;
conv[3] = 1;
} else if (ch == 'E') {
conv[0] = 1;
conv[1] = 1;
conv[2] = 1;
conv[3] = 0;
} else if (ch == 'F') {
conv[0] = 1;
conv[1] = 1;
conv[2] = 1;
conv[3] = 1;
}
}
bool check(int x) {
for (int i = 1; i <= n; i += x) {
for (int j = 1; j <= n; j += x) {
for (int p = i; p < i + x; p++) {
for (int q = j; q < j + x; q++) {
if (arr[i][j] != arr[p][q]) return 0;
}
}
}
}
return 1;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s;
int l = n / 4;
for (int j = 1; j <= l; j++) {
con(s[j - 1]);
arr[i][4 * (j - 1) + 1] = conv[0];
arr[i][4 * (j - 1) + 2] = conv[1];
arr[i][4 * (j - 1) + 3] = conv[2];
arr[i][4 * (j - 1) + 4] = conv[3];
}
}
int l = 1, h = n;
vector<int> v;
for (int i = n; i >= 1; i--) {
if (n % i == 0 && check(i)) {
cout << i << endl;
break;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
map<char, string> we;
int n, x;
int a[5202][5202];
int pass(int bx) {
int div = n / bx, cc, dd;
int d = div * div, b = bx * bx, f = 0;
for (int i = bx - 1; i < n; i += bx) {
for (int j = bx - 1; j < n; j += bx) {
cc = i - bx;
dd = j - bx;
int long long t = a[i][j];
if (cc >= 0) t -= a[cc][j];
if (dd >= 0) t -= a[i][dd];
if (cc >= 0 && dd >= 0) t += a[cc][dd];
if (t == 0 || t == b) f++;
}
}
if (f == d)
return 0;
else
return 1;
}
int main() {
we['0'] = "0000";
we['1'] = "0001";
we['2'] = "0010";
we['3'] = "0011";
we['4'] = "0100";
we['5'] = "0101";
we['6'] = "0110";
we['7'] = "0111";
we['8'] = "1000";
we['9'] = "1001";
we['A'] = "1010";
we['B'] = "1011";
we['C'] = "1100";
we['D'] = "1101";
we['E'] = "1110";
we['F'] = "1111";
scanf("%d", &n);
vector<int> v;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
v.push_back(i);
v.push_back(n / i);
}
}
sort(v.begin(), v.end());
x = n / 4;
char cd, c;
for (int i = 0; i < n; i++) {
scanf("%c", &cd);
for (int j = 0; j < n; j += 4) {
scanf("%c", &c);
string s = we[c];
a[i][j] = 1;
a[i][j + 1] = 1;
a[i][j + 2] = 1;
a[i][j + 3] = 1;
if (s[0] == '0') a[i][j] = 0;
if (s[1] == '0') a[i][j + 1] = 0;
if (s[2] == '0') a[i][j + 2] = 0;
if (s[3] == '0') a[i][j + 3] = 0;
}
}
for (int i = 1; i < n; i++) {
for (int j = 0; j < n; j++) {
a[i][j] += a[i - 1][j];
}
}
for (int i = 1; i < n; i++) {
for (int j = 0; j < n; j++) {
a[j][i] += a[j][i - 1];
}
}
int cnt = v.size() - 1;
while (cnt != 0 && pass(v[cnt]) == 1) {
cnt--;
}
printf("%d", v[cnt]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
char s[6010];
int sum[5210][5210], c[5210][5210];
int b[10];
bool check(int x) {
for (int i = 1; i <= n; i += x)
for (int j = 1; j <= n; j += x) {
int num = sum[i + x - 1][j + x - 1] - sum[i + x - 1][j - 1] -
sum[i - 1][j + x - 1] + sum[i - 1][j - 1];
if (num != x * x && num != 0) return (0);
}
return (1);
}
int main() {
scanf("%d", &n);
for (int ii = 0; ii <= n - 1; ii++) {
scanf("%s", s);
int len = n / 4;
int k = 0;
for (int i = 0; i <= len - 1; i++) {
int o;
if (s[i] >= 'A' && s[i] <= 'F')
o = s[i] - 'A' + 10;
else
o = s[i] - '0';
int num = 0;
memset(b, 0, sizeof(b));
while (o != 0) {
num++;
b[num] = o % 2;
o /= 2;
}
for (int i = 4; i >= 1; i--) c[ii + 1][++k] = b[i];
}
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + c[i][j];
}
int o = 0;
int ans = 0;
for (int i = 1; i <= n; i++)
if (n % i == 0) {
if (check(i)) {
ans = max(ans, i);
}
}
printf("%d\n", ans);
return (0);
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5200 + 15;
const int INF = 0x3f3f3f3f;
inline void rdInt(int &x) { scanf("%d", &x); }
inline void ptInt(int x) { printf("%d", x); }
inline void ptInts(int x, char c) { printf("%d%c", x, c); }
inline void rdStr(char *x) { scanf("%s", x); }
inline void ptStr(char *x) { printf("%s\n", x); }
inline void rdLL(long long &x) { scanf("%lld", &x); }
inline void ptLL(long long x) { printf("%lld", x); }
inline bool strEq(char *x, char *y) { return strcmp(x, y) == 0; }
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
bool a[MAXN][MAXN];
int stk[MAXN];
char s[MAXN][MAXN >> 1];
int n, m;
void seta(bool *Ary, bool _1, bool _2, bool _3, bool _4) {
Ary[0] = _1;
Ary[1] = _2;
Ary[2] = _3;
Ary[3] = _4;
}
void conv(bool *Ary, char c) {
switch (c) {
case '0':
seta(Ary, 0, 0, 0, 0);
break;
case '1':
seta(Ary, 0, 0, 0, 1);
break;
case '2':
seta(Ary, 0, 0, 1, 0);
break;
case '3':
seta(Ary, 0, 0, 1, 1);
break;
case '4':
seta(Ary, 0, 1, 0, 0);
break;
case '5':
seta(Ary, 0, 1, 0, 1);
break;
case '6':
seta(Ary, 0, 1, 1, 0);
break;
case '7':
seta(Ary, 0, 1, 1, 1);
break;
case '8':
seta(Ary, 1, 0, 0, 0);
break;
case '9':
seta(Ary, 1, 0, 0, 1);
break;
case 'A':
seta(Ary, 1, 0, 1, 0);
break;
case 'B':
seta(Ary, 1, 0, 1, 1);
break;
case 'C':
seta(Ary, 1, 1, 0, 0);
break;
case 'D':
seta(Ary, 1, 1, 0, 1);
break;
case 'E':
seta(Ary, 1, 1, 1, 0);
break;
case 'F':
seta(Ary, 1, 1, 1, 1);
break;
default:
ptStr("Oops.");
}
}
void calstk(int &res) {
int tmp = stk[1];
for (int i = (1); i <= (*stk); i++) tmp = gcd(tmp, stk[i]);
res = res ? gcd(res, tmp) : tmp;
}
int main() {
rdInt(n);
m = n >> 2;
for (int i = (0); i < (n); i++) rdStr(s[i]);
if (n == 1) {
return puts("1");
} else if (n == 2) {
if (s[0][0] == '3' && s[1][0] == '3') return puts("2");
if (s[0][0] == '0' && s[1][0] == '0') return puts("2");
return puts("1");
} else if (n == 3) {
if (s[0][0] == '8' && s[1][0] == '8' && s[2][0] == '8') return puts("3");
if (s[0][0] == '0' && s[1][0] == '0' && s[2][0] == '0') return puts("3");
return puts("1");
}
for (int i = (0); i < (n); i++)
for (int j = (0); j < (m); j++) {
conv(a[i] + j * 4, s[i][j]);
}
int ans = 0;
for (int i = (0); i < (n); i++) {
int num = 0;
stk[0] = 0;
bool cur = a[i][0];
for (int j = (0); j <= (n); j++) {
if (cur == a[i][j] && j < n) {
num++;
} else {
cur ^= 1;
stk[++*stk] = num;
num = 1;
}
}
calstk(ans);
}
if (ans == 1) {
ptInt(1);
return 0;
}
for (int i = (0); i < (n); i++) {
int num = 0;
stk[0] = 0;
bool cur = a[0][i];
for (int j = (0); j <= (n); j++) {
if (cur == a[j][i] && j < n) {
num++;
} else {
cur ^= 1;
stk[++*stk] = num;
num = 1;
}
}
calstk(ans);
}
ptInt(ans);
return 0;
}
|
#include <bits/stdc++.h>
#pragma G++ optimize(2)
using namespace std;
const int N = 5205;
int n, sum[N][N], c[N], cnt;
bool a[N][N];
void rd(int i, int st) {
char in = 0;
int x;
while (!(('0' <= in && in <= '9') || ('A' <= in && in <= 'F')))
scanf("%c", &in);
if ('0' <= in && in <= '9') x = in - '0';
if ('A' <= in && in <= 'F') x = in - 'A' + 10;
for (int j = st + 3; j >= st; j--) {
a[i][j] = x & 1;
x >>= 1;
}
}
bool check(int x) {
int z = x * x;
for (int i = x; i <= n; i += x)
for (int j = x; j <= n; j += x) {
int s = sum[i][j] + sum[i - x][j - x] - sum[i][j - x] - sum[i - x][j];
if (s != 0 && s != z) return 0;
}
return 1;
}
int FJ() {
for (int i = n; i >= 2; i--)
if (n % i == 0)
if (check(i)) return i;
return 1;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j += 4) rd(i, j);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
sum[i][j] = a[i][j] + sum[i][j - 1] + sum[i - 1][j] - sum[i - 1][j - 1];
printf("%d", FJ());
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long power(long long a, long long b, long long modi) {
long long res = 1;
while (b) {
if (b % 2) {
res = (res * a) % modi;
}
b /= 2;
a = (a * a) % modi;
}
return res;
}
int dirx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int diry[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, -1, 1};
long long n, m;
long long curres, ans = 0;
long long a[5500], b[5500], c[5500];
vector<long long> vt;
int mat[5500][5500], sum[5500][5500];
string fun(int num) {
string ans;
while (num > 0) {
ans += '0' + (num % 2);
num /= 2;
}
while (ans.length() < 4) ans += "0";
reverse(ans.begin(), ans.end());
return ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
int flag = 0;
char ch;
string s;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n / 4; j++) {
cin >> ch;
int num;
if (isalpha(ch))
num = 10 + (ch - 'A');
else
num = ch - '0';
s = fun(num);
for (int k = 0; k < 4; k++) mat[i][(j - 1) * 4 + k + 1] = (s[k] - '0');
}
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
sum[i][j] =
sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + (mat[i][j]);
long long ans = 1;
vt.push_back(n);
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
vt.push_back(i);
if (i == n / i) continue;
vt.push_back(n / i);
}
}
for (auto x : vt) {
bool flag = true;
int i = x;
while (i <= n) {
int j = x;
while (j <= n) {
long long cur =
sum[i][j] - sum[i - x][j] - sum[i][j - x] + sum[i - x][j - x];
if (cur == 0 || cur == x * x) {
} else
flag = false;
j += x;
}
i += x;
}
if (flag) ans = max(ans, x);
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
const int maxn = 5205;
using namespace std;
int n, a[maxn][maxn], m;
int cnt, sum[maxn][maxn], x[maxn];
bool check(int x) {
int now;
for (int i = x; i <= n; i += x) {
for (int j = x; j <= n; j += x) {
now = sum[i][j] - sum[i - x][j] - sum[i][j - x] + sum[i - x][j - x];
if (now == 0 || now == x * x)
continue;
else
return 0;
}
}
return 1;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n / 4; j++) {
scanf("%1x", &m);
cnt = 0;
while (m) {
a[i][j * 4 - cnt++] = (m % 2);
m >>= 1;
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + a[i][j];
}
}
cnt = 0;
for (int i = 1; i <= n; i++) {
if (n % i == 0) {
x[++cnt] = i;
}
}
for (int k = cnt; k >= 1; k--) {
if (check(x[k])) {
printf("%d\n", x[k]);
break;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
char s[5400][5400];
char pp[5400];
map<char, string> ma;
int gcd(int a, int b) {
int r;
while (b > 0) {
r = a % b;
a = b;
b = r;
}
return a;
}
int main() {
ma['0'] = "0000";
ma['1'] = "0001";
ma['2'] = "0010";
ma['3'] = "0011";
ma['4'] = "0100";
ma['5'] = "0101";
ma['6'] = "0110";
ma['7'] = "0111";
ma['8'] = "1000";
ma['9'] = "1001";
ma['A'] = "1010";
ma['B'] = "1011";
ma['C'] = "1100";
ma['D'] = "1101";
ma['E'] = "1110";
ma['F'] = "1111";
int t;
cin >> t;
int len;
for (int i = 1; i <= t; i++) {
getchar();
scanf("%s", pp);
len = strlen(pp);
for (int j = 0; j < len; j++) {
for (int k = j * 4 + 1; k <= j * 4 + 4; k++) {
s[i][k] = ma[pp[j]][k - 4 * j - 1];
}
}
}
int n = t;
int m = 4 * len;
queue<int> q;
int p = 0;
for (int i = 1; i <= n; i++) {
p = 0;
for (int j = 1; j <= m; j++) {
if (s[i][j] != s[i][j + 1] || j == m) {
if (j - p == 1) {
cout << 1 << endl;
return 0;
}
q.push(j - p);
p = j;
}
}
}
for (int i = 1; i <= m; i++) {
p = 0;
for (int j = 1; j <= n; j++) {
if (s[j][i] != s[j + 1][i] || j == n) {
if (j - p == 1) {
cout << 1 << endl;
return 0;
}
q.push(j - p);
p = j;
}
}
}
int g = q.front();
q.pop();
while (!q.empty()) {
g = gcd(g, q.front());
q.pop();
}
cout << g << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[5250];
int b[5250][5250];
int main() {
int n, i, j, k;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> s;
for (int j = 0; j < n; j++) {
int val;
if (s[j] >= '0' && s[j] <= '9')
val = s[j] - '0';
else
val = s[j] - 'A' + 10;
b[i][j * 4 + 1] = val / 8 % 2;
b[i][j * 4 + 2] = val / 4 % 2;
b[i][j * 4 + 3] = val / 2 % 2;
b[i][j * 4 + 4] = val % 2;
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
b[i][j] = b[i][j] + b[i - 1][j] + b[i][j - 1] - b[i - 1][j - 1];
}
}
for (i = n; i >= 1; i--) {
if (n % i != 0) continue;
int flag = 1;
for (j = i; j <= n; j += i) {
for (k = i; k <= n; k += i) {
int sum = b[j][k] - b[j - i][k] - b[j][k - i] + b[j - i][k - i];
if (sum != 0 && sum != i * i) {
flag = 0;
break;
}
}
}
if (flag == 1) {
cout << i << endl;
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
map<char, string> m;
void populate() {
m['0'] = "0000";
m['1'] = "0001";
m['2'] = "0010";
m['3'] = "0011";
m['4'] = "0100";
m['5'] = "0101";
m['6'] = "0110";
m['7'] = "0111";
m['8'] = "1000";
m['9'] = "1001";
m['A'] = "1010";
m['B'] = "1011";
m['C'] = "1100";
m['D'] = "1101";
m['E'] = "1110";
m['F'] = "1111";
}
int main() {
populate();
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int d[n][n];
string s;
for (int i = 0; i < n; i++) {
cin >> s;
int l = 0;
for (int j = 0; j < s.length(); j++) {
string p = m[s[j]];
for (int k = 0; k < 4; k++) {
d[i][l++] = p[k] - '0';
}
}
}
int dp[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == 0 || j == 0)
dp[i][j] = 1;
else {
if (d[i][j] == d[i - 1][j - 1] && d[i][j] == d[i - 1][j] &&
d[i][j] == d[i][j - 1]) {
dp[i][j] = min(min(dp[i - 1][j], dp[i][j - 1]), dp[i - 1][j - 1]) + 1;
} else {
dp[i][j] = 1;
}
}
}
}
int ans = 1;
for (int i = n; i > 1; i--) {
if (n % i == 0) {
bool poss = true;
for (int j = i - 1; j < n; j += i) {
for (int k = i - 1; k < n; k += i) {
if (dp[j][k] < i) {
poss = false;
break;
}
}
if (!poss) break;
}
if (poss) {
ans = i;
break;
}
}
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, mp[5250][5250], cnt, ans = 2e9, f[5250][5250], fac[5250];
char s[5250];
void pt_mp() {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) printf("%d", mp[i][j]);
puts("");
}
}
int S(int x, int y, int xx, int yy) {
return f[xx][yy] + f[x - 1][y - 1] - f[x - 1][yy] - f[xx][y - 1];
}
bool check(int x) {
for (int i = 1; i <= n; i += x) {
for (int j = 1; j <= n; j += x) {
int tmp = S(i, j, i + x - 1, j + x - 1);
if (!(!tmp || tmp == x * x)) return 0;
}
}
return 1;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
if (n % i == 0) fac[++cnt] = i;
for (int i = 1; i <= n; i++) {
scanf("%s", s);
int cnt = 0;
for (int j = 0, x; j < strlen(s); j++) {
if (s[j] >= '0' && s[j] <= '9')
x = s[j] - '0';
else
x = s[j] - 'A' + 10;
for (int k = 3; k >= 0; k--) {
cnt++;
if ((1 << k) & x) mp[i][cnt] = 1;
}
}
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
f[i][j] = f[i][j - 1] + f[i - 1][j] - f[i - 1][j - 1] + mp[i][j];
for (int i = cnt; i; i--) {
if (check(fac[i])) {
printf("%d", fac[i]);
return 0;
}
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.