text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
int 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);
int n;
cin >> n;
string s;
for (int i = 1; i <= n; i++) {
string s;
cin >> s;
int t = 1;
for (int j = 0; j < s.size(); j++) {
string s1 = HexToBin(s[j]);
for (char k : s1) a[i][t++] = k - '0';
}
}
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(), greater<int>());
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) a[i][j] += a[i][j - 1];
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) a[j][i] += a[j - 1][i];
}
for (int i : v) {
bool flag = true;
for (int j = 1; j < n; j += i) {
for (int k = 1; k < n; k += i) {
int 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 << endl;
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T1, class T2>
ostream &operator<<(ostream &os, pair<T1, T2> const &v) {
return os << '(' << v.first << ", " << v.second << ')';
}
double const pi = acos(-1);
int n;
bool a[5210][5210];
int sum[5210][5210];
string s;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> s;
for (int j = 0; j < n / 4; ++j) {
string tmp = string("") + s[j];
int mask = stoi(tmp, 0, 16);
for (int k = 3; k >= 0; --k) a[i][j * 4 + 4 - k] = (mask & (1 << k));
}
}
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];
}
}
for (int x = n; x >= 1; --x)
if (n % x == 0) {
bool ok = 1;
for (int i = x; i <= n && ok; i += x) {
for (int j = x; j <= n && ok; j += x) {
int val =
sum[i][j] - sum[i - x][j] - sum[i][j - x] + sum[i - x][j - x];
if (val != 0 && val != x * x) ok = 0;
}
}
if (ok) {
cout << x << '\n';
return 0;
}
}
cerr << 0.001 * clock() << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, sm[5201][5201];
string s;
int to_digit(char ch) {
if (isdigit(ch)) {
return ch - '0';
}
return ch - 'A' + 10;
}
vector<long long> get_factor(long long x) {
vector<long long> ret;
for (long long i = 1; i * i <= x; i++) {
if (x % i == 0) {
ret.push_back(i);
ret.push_back(x / i);
}
}
return ret;
}
string hex_to_bin(string s) {
string out;
for (auto i : s) {
uint8_t n;
if (i <= '9' and i >= '0')
n = i - '0';
else
n = 10 + i - 'A';
for (int8_t j = 3; j >= 0; --j) out.push_back((n & (1 << j)) ? '1' : '0');
}
return out;
}
int get_sum(long long x, long long y, long long len) {
return sm[x][y] - sm[x - len][y] - sm[x][y - len] + sm[x - len][y - len];
}
void solve(long long x) {
long long cnt = 0;
for (long long i = x; i <= n; i += x) {
for (long long j = x; j <= n; j += x) {
long long sum = get_sum(i, j, x);
if (sum == 0 || sum == x * x) {
cnt++;
}
}
}
if (cnt == (n / x) * (n / x)) {
cout << x;
exit(0);
}
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s;
s = hex_to_bin(s);
long long cnt = 0;
for (int j = 1; j <= n; j++) {
cnt += (s[j - 1] == '1');
sm[i][j] = sm[i - 1][j] + cnt;
}
}
vector<long long> v = get_factor(n);
sort(v.begin(), v.end(), greater<long long>());
for (long long x : v) {
solve(x);
}
cout << 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5205;
int a[maxn][maxn];
char b[maxn];
int c[maxn][maxn];
int n;
bool pd(int i) {
for (int j = 1; j <= n - i + 1; j += i) {
for (int k = 1; k <= n - i + 1; k += i) {
int x = j + i - 1;
int y = k + i - 1;
int s = a[x][y] - a[x][k - 1] - a[j - 1][y] + a[j - 1][k - 1];
if (s == 0 || s == i * i) {
continue;
} else
return false;
}
}
return true;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%s", b);
for (int j = 0; j < n / 4; j++) {
int x;
if (b[j] >= '0' && b[j] <= '9')
x = b[j] - '0';
else
x = b[j] - 'A' + 10;
for (int k = 3, p = 1; k >= 0; k--, p++) {
c[i][j * 4 + p] = x >> k & 1;
}
}
}
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] + c[i][j];
}
}
int ans = 1;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
if (pd(i)) ans = max(ans, i);
if (i * i != n) {
if (pd(n / i)) ans = max(ans, n / i);
}
}
}
printf("%d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
map<char, string> hex_to_bin = {
{'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"},
};
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
string inp;
cin >> n;
vector<vector<int>> mat(n);
for (int i = 0; i < n; i++) {
cin >> inp;
for (int j = 0; j < inp.size(); j++) {
string s = hex_to_bin[inp[j]];
for (int k = 0; k < 4; k++)
if (s[k] == '1')
mat[i].push_back(1);
else
mat[i].push_back(0);
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
int val = mat[i][j];
if (i - 1 >= 0) val += mat[i - 1][j];
if (j - 1 >= 0) val += mat[i][j - 1];
if (i - 1 >= 0 && j - 1 >= 0) val -= mat[i - 1][j - 1];
mat[i][j] = val;
}
}
int ans = 1;
for (int i = 2; i <= n; i++) {
if (n % i != 0) continue;
bool flag = true;
for (int j = i - 1; j < n; j += i) {
for (int k = i - 1; k < n; k += i) {
if (mat[j][k] % (i * i) != 0) flag = false;
}
}
if (flag) ans = i;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string f(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";
}
}
string f1(string c) {
if (c == "0000") return "0";
if (c == "0001") return "1";
if (c == "0010") return "2";
if (c == "0011") return "3";
if (c == "0100") return "4";
if (c == "0101") return "5";
if (c == "0110") return "6";
if (c == "0111") return "7";
if (c == "1000") return "8";
if (c == "1001") return "9";
if (c == "1010") return "A";
if (c == "1011") return "B";
if (c == "1100") return "C";
if (c == "1101") return "D";
if (c == "1110") return "E";
if (c == "1111") return "F";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long n;
cin >> n;
vector<string> v1(n);
for (long long i = 0; i < n; i++) cin >> v1[i];
vector<string> v2;
for (long long i = 0; i < n / 4; i++) {
vector<string> w;
for (long long j = 0; j < n; j++) {
w.push_back(f(v1[j][i]));
}
for (long long j = 0; j < 4; j++) {
string val;
for (long long k = 0; k < n; k += 4) {
string tmp;
for (long long a = k; a < k + 4; a++) tmp += w[a].substr(j, 1);
val += f1(tmp);
}
v2.push_back(val);
}
}
vector<long long> div;
long long ans = 1;
for (long long i = 1; i <= n; i++) {
if (n % i == 0) {
long long check1 = 0, check2 = 0;
for (long long j = 0; j < n; j += i) {
long long flag = 0;
for (long long k = j + 1; k < j + i; k++) {
if (v1[k] != v1[j]) {
flag = 1;
break;
}
}
if (flag == 1) {
check1 = 1;
break;
}
}
for (long long j = 0; j < n; j += i) {
long long flag = 0;
for (long long k = j + 1; k < j + i; k++) {
if (v2[k] != v2[j]) {
flag = 1;
break;
}
}
if (flag == 1) {
check2 = 1;
break;
}
}
if (check1 == 0 && check2 == 0) {
ans = i;
}
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 5210;
bitset<N> a[N];
int n;
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j += 4) {
char x;
cin >> x;
if (x == '1')
a[i][j + 3] = 1;
else if (x == '2')
a[i][j + 2] = 1;
else if (x == '3')
a[i][j + 2] = a[i][j + 3] = 1;
else if (x == '4')
a[i][j + 1] = 1;
else if (x == '5')
a[i][j + 1] = a[i][j + 3] = 1;
else if (x == '6')
a[i][j + 2] = a[i][j + 3] = 1;
else if (x == '7')
a[i][j + 1] = a[i][j + 2] = a[i][j + 3] = 1;
else if (x == '8')
a[i][j] = 1;
else if (x == '9')
a[i][j] = a[i][j + 3] = 1;
else if (x == 'A')
a[i][j] = a[i][j + 2] = 1;
else if (x == 'B')
a[i][j] = a[i][j + 2] = a[i][j + 3] = 1;
else if (x == 'C')
a[i][j] = a[i][j + 1] = 1;
else if (x == 'D')
a[i][j] = a[i][j + 1] = a[i][j + 3] = 1;
else if (x == 'E')
a[i][j] = a[i][j + 1] = a[i][j + 2] = 1;
else if (x == 'F')
a[i][j] = a[i][j + 1] = a[i][j + 2] = a[i][j + 3] = 1;
}
}
for (int x = n; x >= 2; x--) {
if (n % x) continue;
bool ep = true;
for (int i = 1; i <= n; i += x) {
for (int j = i + 1; j < i + x; j++) {
ep = ep && (a[j] == a[i]);
if (!ep) break;
}
if (!ep) break;
for (int j = 1; j <= n; j += x) {
for (int k = j + 1; k < j + x; k++) {
ep = ep && (a[i][k] == a[i][k - 1]);
if (!ep) break;
}
if (!ep) break;
}
if (!ep) break;
}
if (ep) {
cout << x;
return 0;
}
}
cout << 1;
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';
if (i - 1 >= 0) {
sum[i][j] += sum[i - 1][j];
}
if (j - 1 >= 0) {
sum[i][j] += sum[i][j - 1];
}
if (i - 1 >= 0 && j - 1 >= 0) sum[i][j] -= sum[i - 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;
template <typename T1, typename T2>
inline void chmin(T1& a, T2 b) {
if (a > b) a = b;
}
template <typename T1, typename T2>
inline void chmax(T1& a, T2 b) {
if (a < b) a = b;
}
const int MOD = 998244353;
const int MAX = 200020;
const double pi = acos(-1);
const double EPS = 1e-12;
const long long INF = 2e18;
int A[5252][5252];
void solve() {
int N;
cin >> N;
for (int i = 0; i < N; ++i) {
string S;
cin >> S;
vector<int> v;
for (int j = 0; j < N / 4; ++j) {
int num = (S[j] <= '9') ? S[j] - '0' : 10 + S[j] - 'A';
for (int k = 4 - 1; k >= 0; --k) v.push_back((num & (1 << k)) ? 1 : 0);
}
for (int j = 0; j < v.size(); ++j) {
A[i + 1][j + 1] = v[j];
}
}
for (int i = 1; i < N + 1; ++i) {
for (int j = 1; j < N + 1; ++j) {
A[i][j] += A[i - 1][j] + A[i][j - 1] - A[i - 1][j - 1];
}
}
vector<int> divs;
for (int i = N; i >= 1; i--) {
if (N % i == 0) divs.push_back(i);
}
for (auto p : divs) {
bool ok = true;
for (int i = 0; i < N; i += p) {
for (int j = 0; j < N; j += p) {
int sum = A[i + p][j + p] + A[i][j] - A[i + p][j] - A[i][j + p];
if (sum != 0 && sum != p * p) goto END;
}
}
cout << (p) << '\n';
return;
END:;
}
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long mod2 = 998244353;
long long mod3 = 1000003;
long long mod4 = 998244853;
long long mod5 = 1000000009;
long long inf = 1LL << 62;
int iinf = 1 << 30;
double pi = 3.141592653589793238462643383279L;
double eps = 1e-14;
int dh[4] = {1, -1, 0, 0};
int dw[4] = {0, 0, 1, -1};
int ddh[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int ddw[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
long long gcd(long long a, long long b) {
if (a < b) swap(a, b);
if (b == 0) return a;
if (a % b == 0) return b;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
long long c = gcd(a, b);
return a * b / c;
}
long long Pow(long long n, long long k) {
long long ret = 1;
long long now = n;
while (k > 0) {
if (k & 1) ret *= now;
now *= now;
k /= 2;
}
return ret;
}
long long beki(long long n, long long k, long long md) {
long long ret = 1;
long long now = n;
now %= md;
while (k > 0) {
if (k % 2 == 1) {
ret *= now;
ret %= md;
}
now *= now;
now %= md;
k /= 2;
}
return ret;
}
long long gyaku(long long n, long long md) { return beki(n, md - 2, md); }
long long poc(long long n) {
long long ret = 0;
long long u = n;
while (u > 0) {
ret += u % 2;
u /= 2;
}
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int a[n][n];
for (long long i = 0; i < n; i++) {
string c;
cin >> c;
for (long long j = 0; j < n / 4; j++) {
int now = j * 4;
int num = c[j] - '0';
if (num < 0 || num >= 10) {
num = 10 + (c[j] - 'A');
}
for (long long k = 0; k < 4; k++) {
a[i][now + k] = (num >> (3 - k)) & 1;
}
}
}
int sum[n + 1][n + 1];
for (long long i = 0; i < n + 1; i++) {
sum[i][0] = 0;
sum[0][i] = 0;
}
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < n; j++) {
sum[i + 1][j + 1] = -sum[i][j] + sum[i][j + 1] + sum[i + 1][j] + a[i][j];
}
}
vector<int> v;
for (long long i = 1; i < n + 1; i++)
if (n % i == 0) v.push_back(i);
for (long long i = v.size() - 1; i >= 0; i--) {
bool bo = true;
for (int j = v[i]; j <= n; j += v[i]) {
for (int k = v[i]; k <= n; k += v[i]) {
int r = sum[j][k] - sum[j][k - v[i]] - sum[j - v[i]][k] +
sum[j - v[i]][k - v[i]];
if (r > 0 && r < v[i] * v[i]) {
bo = false;
break;
}
}
if (!bo) break;
}
if (bo) {
cout << v[i] << endl;
return 0;
}
}
}
|
#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;
}
}
vector<int> div;
for (int i = 1; i <= n / i; ++i) {
if (n % i == 0) {
div.push_back(i);
if (n / i != i) div.push_back(n / i);
}
}
sort(div.begin(), div.end(), greater<int>());
for (auto d : div) {
if (check(d)) {
cout << d << '\n';
return 0;
}
}
assert(false);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int n;
vector<string> fuck;
long long int sum[5300][5300];
char ch;
int main() {
scanf("%lld", &n);
for (long long int i = 0; i < n; i++) {
string to_add = "";
for (long long int j = 0; j < n / 4; j++) {
cin >> ch;
long long int num;
if (ch >= '0' && ch <= '9') {
num = ch - '0';
} else {
num = ch - 'A' + 10;
}
string temp = "";
while (num) {
temp += (num % 2) + '0';
num /= 2;
}
while ((long long int)temp.size() < 4LL) temp += '0';
reverse(temp.begin(), temp.end());
to_add += temp;
}
fuck.push_back(to_add);
}
for (long long int i = 0; i < n; i++) {
if (fuck[i][0] == '0')
sum[i][0] = 0;
else
sum[i][0] = 1;
for (long long int j = 1; j < n; j++) {
if (fuck[i][j] == '0')
sum[i][j] = sum[i][j - 1];
else
sum[i][j] = sum[i][j - 1] + 1;
}
}
for (long long int j = 0; j < n; j++) {
for (long long int i = 1; i < n; i++) {
sum[i][j] += sum[i - 1][j];
}
}
for (long long int x = n; x >= 1; x--) {
if (n % x == 0) {
bool ok = true;
long long int r1 = 0;
long long int r2 = x - 1;
while (r1 < n) {
long long int c1 = 0;
long long int c2 = x - 1;
while (c1 < n) {
long long int Ans = sum[r2][c2];
if (c1 > 0) Ans -= sum[r2][c1 - 1];
if (r1 > 0) Ans -= sum[r1 - 1][c2];
if (r1 > 0 && c1 > 0) Ans += sum[r1 - 1][c1 - 1];
if (Ans == (x * x) || Ans == 0) {
c1 += x;
c2 += x;
} else {
ok = false;
break;
}
}
r1 += x;
r2 += x;
if (!ok) break;
}
if (ok) {
printf("%lld\n", x);
exit(0);
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
using namespace ::std;
const int maxn = 5300;
const int inf = 1e9 + 800;
const int mod = 1e9 + 7;
bool ro[maxn][maxn];
bool cu[maxn][maxn];
bool mosro[maxn];
bool moscu[maxn];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int j = 0; j < n; j += 4) {
char c = s[j / 4];
if ('A' <= c && c <= 'Z') {
c -= 'A';
c += 10;
} else {
c -= '0';
}
ro[i][j] = ((c >> 3) & 1);
ro[i][j + 1] = ((c >> 2) & 1);
ro[i][j + 2] = ((c >> 1) & 1);
ro[i][j + 3] = ((c >> 0) & 1);
}
}
for (int i = 0; i < n; i++) {
for (int j = n - 1; j >= 0; j--) {
cu[i][j] = ro[j][i];
}
}
for (int i = 0; i + 1 < n; i++) {
mosro[i] = 1;
moscu[i] = 1;
for (int j = 0; j < n; j++) {
if (ro[i][j] != ro[i + 1][j]) {
mosro[i] = 0;
}
if (cu[i][j] != cu[i + 1][j]) {
moscu[i] = 0;
}
}
}
for (int x = n; x >= 1; x--) {
if (n % x == 0) {
bool good = 1;
for (int j = 0; j + 1 < n; j++) {
if (j % x != x - 1 && (mosro[j] == 0 || moscu[j] == 0)) {
good = 0;
break;
}
}
if (good) {
cout << x;
return 0;
}
}
}
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
using namespace std;
map<int, string> m;
vector<vector<int>> a;
vector<int> elig;
void convert_input(int i, int j, char c) {
if (c >= 48 and c <= 58) {
int f = (int)(c - 48);
for (int k = 0; k < 4; k++) {
if (f & (1 << k))
a[i][j + 3 - k] = 1;
else
a[i][j + 3 - k] = 0;
}
} else {
int f = 10 + (int)(c - 65);
for (int k = 0; k < 4; k++) {
if (f & (1 << k))
a[i][j + 3 - k] = 1;
else
a[i][j + 3 - k] = 0;
}
}
}
void preprocess(int n) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j += 4) {
char c;
cin >> c;
convert_input(i, j, c);
}
}
}
void compute_elig(int n) {
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
elig[i] = 1;
elig[n / i] = 1;
}
}
}
void update(int n) { ; }
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;
a.resize(n + 1, vector<int>(n + 1));
preprocess(n);
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;
} else
update(i);
}
}
cout << 1;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long powmod(long long a, long long b, long long MOD) {
long long ans = 1;
while (b) {
if (b % 2) ans = ans * a % MOD;
a = a * a % MOD;
b /= 2;
}
return ans;
}
inline void getInt(int* p);
const int maxn = 1000010;
const int inf = 0x3f3f3f3f;
bool a[5205][5205];
int n;
int b[250];
void change(int x, int y, char z) {
int v = b[z];
for (int i = 1; i <= 4; i++) {
a[x][(y - 1) * 4 + i] = (v & (1 << (4 - i)));
}
}
bool check(int x) {
for (int i = 1; i <= n / x; i++) {
for (int j = 1; j <= n / x; j++) {
int flag = 0;
bool t;
for (int k = 1; k <= x; k++) {
for (int z = 1; z <= x; z++) {
if (flag == 0)
t = a[(i - 1) * x + k][(j - 1) * x + z], flag = 1;
else {
if (t != a[(i - 1) * x + k][(j - 1) * x + z]) {
return 0;
}
}
}
}
}
}
return 1;
}
int main() {
for (int i = 0; i <= 9; i++) {
b[i + '0'] = i;
}
for (int i = 0; i <= 9; i++) {
b[i + 'A'] = 10 + i;
}
getInt(&n);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n / 4; j++) {
char x = getchar();
change(i, j, x);
}
getchar();
}
vector<int> v;
int ans = 1;
for (int i = 2; i <= n; i++) {
if (n % i == 0) {
v.push_back(i);
}
}
for (auto x : v) {
if (check(x)) {
ans = x;
}
}
printf("%d", ans);
return 0;
}
inline void getInt(int* p) {
char ch;
do {
ch = getchar();
} while (ch == ' ' || ch == '\n');
if (ch == '-') {
*p = -(getchar() - '0');
while ((ch = getchar()) >= '0' && ch <= '9') {
*p = *p * 10 - ch + '0';
}
} else {
*p = ch - '0';
while ((ch = getchar()) >= '0' && ch <= '9') {
*p = *p * 10 + ch - '0';
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long inf = 2e18;
const long double eps = 1e-9;
const long long NN = 1e5 + 2;
vector<vector<long long> > adj;
bool mat[5201][5201];
long long sums[5201][5201];
vector<long long> to[16];
bool checker(long long n, long long x) {
for (long long i = 0; i < n / x; i++) {
for (long long j = 0; j < n / x; j++) {
long long val = mat[i * x][j * x] * x * x;
long long v1 = i * x > 0 ? sums[i * x - 1][(j + 1) * x - 1] : 0;
long long v2 = j * x > 0 ? sums[(i + 1) * x - 1][j * x - 1] : 0;
long long v3 = i * x > 0 and j * x > 0 ? sums[i * x - 1][j * x - 1] : 0;
long long v4 = sums[(i + 1) * x - 1][(j + 1) * x - 1];
if (v4 - v1 - v2 + v3 != val) {
return 0;
}
}
}
return 1;
}
void solve() {
long long i = 0, j = 0, k = 0, n = 0, m = 0;
cin >> n;
for (i = 0; i < (n); i++) {
string s;
cin >> s;
for (j = 0; j < n / 4; j++) {
vector<long long>& v = s[j] >= 'A' ? to[s[j] - 'A' + 10] : to[s[j] - '0'];
for (k = 4 * j, m = 0; m < 4; k++, m++) mat[i][k] = v[m];
}
}
vector<long long> divs;
for (i = 1; i <= n; i++) {
if (n % i == 0) divs.push_back(i);
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
long long v1 = j > 0 ? sums[i][j - 1] : 0,
v2 = i > 0 ? sums[i - 1][j] : 0,
v3 = (i > 0 and j > 0) ? sums[i - 1][j - 1] : 0;
sums[i][j] = v1 + v2 - v3 + mat[i][j];
}
}
long long ans = 1;
vector<bool> p(100, 1);
for (i = 1; i < divs.size(); i++) {
if (!p[i]) continue;
if (checker(n, divs[i])) {
ans = divs[i];
} else {
for (j = i + 1; j < divs.size(); j++) {
if (divs[j] % divs[i] == 0) p[j] = 0;
}
}
}
cout << ans << '\n';
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long T = 1, tc;
for (long long i = 0; i < 16; i++) {
to[i].resize(4);
long long cp = i;
for (long long j = 0; j < 4; j++) {
to[i][j] = cp % 2;
cp >>= 1;
}
reverse(to[i].begin(), to[i].end());
}
for (tc = 1; tc <= T; tc++) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long inf = 2e18;
const long double eps = 1e-9;
const long long NN = 1e5 + 2;
vector<vector<long long> > adj;
bool mat[5201][5201];
vector<long long> to[16];
bool checker(long long n, long long x) {
for (long long i = 0; i < n / x; i++) {
for (long long j = 0; j < n / x; j++) {
bool val = mat[i * x][j * x];
for (long long ii = i * x; ii < (i + 1) * x; ii++) {
for (long long jj = j * x; jj < (j + 1) * x; ++jj) {
if (mat[ii][jj] != val) return 0;
}
}
}
}
return 1;
}
void solve() {
long long i = 0, j = 0, k = 0, n = 0, m = 0;
cin >> n;
for (i = 0; i < (n); i++) {
string s;
cin >> s;
for (j = 0; j < n / 4; j++) {
vector<long long>& v = s[j] >= 'A' ? to[s[j] - 'A' + 10] : to[s[j] - '0'];
for (k = 4 * j, m = 0; m < 4; k++, m++) mat[i][k] = v[m];
}
}
vector<long long> divs;
for (i = 1; i <= n; i++) {
if (n % i == 0) divs.push_back(i);
}
long long ans = 1;
vector<bool> p(100, 1);
for (i = 1; i < divs.size(); i++) {
if (!p[i]) continue;
if (checker(n, divs[i])) {
ans = divs[i];
} else {
for (j = i + 1; j < divs.size(); j++) {
if (divs[j] % divs[i] == 0) p[j] = 0;
}
}
}
cout << ans << '\n';
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long T = 1, tc;
for (long long i = 0; i < 16; i++) {
to[i].resize(4);
long long cp = i;
for (long long j = 0; j < 4; j++) {
to[i][j] = cp % 2;
cp >>= 1;
}
reverse(to[i].begin(), to[i].end());
}
for (tc = 1; tc <= T; tc++) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1000000007;
long long int gcd(long long int a, long long int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
bool t[5200][5200];
string v[5200];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s[n];
for (int i = int(0); i < int(n); i++) cin >> s[i];
int res1 = n;
int l = 0, r = 0;
while (l < n) {
while (r < n && s[l] == s[r]) {
r++;
}
res1 = gcd(res1, r - l);
l = r;
}
for (int i = int(0); i < int(n); i++) {
for (int j = int(0); j < int(n / 4); j++) {
char u = s[i][j];
int X;
if (u == 'A')
X = 10;
else if (u == 'B')
X = 11;
else if (u == 'C')
X = 12;
else if (u == 'D')
X = 13;
else if (u == 'E')
X = 14;
else if (u == 'F')
X = 15;
else
X = u - '0';
for (int k = int(0); k < int(4); k++) {
if (X & (1 << (3 - k))) t[i][k + j * 4] = 1;
}
}
}
for (int i = int(0); i < int(n); i++) {
int x = 0;
int res = 0;
while (x < n) {
res = t[x][i] + (t[x + 1][i] << 1) + (t[x + 2][i] << 2) +
(t[x + 3][i] << 3);
v[i] += to_string(res);
x += 4;
}
}
int res2 = n;
l = 0, r = 0;
while (l < n) {
while (r < n && v[l] == v[r]) {
r++;
}
res2 = gcd(res2, r - l);
l = r;
}
cout << gcd(res1, res2) << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using PII = pair<int, int>;
const int N = 5210;
char s[N][N / 4];
int sum[N][N];
int n;
bool check(int x) {
int y = n / x;
int S = x * x;
for (int i = 1; i <= y; i++)
for (int j = 1; j <= y; j++) {
int p = i * x, q = j * x;
int p2 = p - x, q2 = q - x;
int s = sum[p][q] + sum[p2][q2] - sum[p2][q] - sum[p][q2];
if (s != S && s != 0) {
return false;
}
}
return true;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%s", s[i] + 1);
for (int i = 1; i <= n; i++) {
int m = n / 4;
for (int j = 1; j <= m; j++) {
int t;
if (s[i][j] <= '9')
t = s[i][j] - '0';
else
t = 10 + s[i][j] - 'A';
int k = (j - 1) * 4;
sum[i][k + 1] = !!(t & 8);
sum[i][k + 2] = !!(t & 4);
sum[i][k + 3] = !!(t & 2);
sum[i][k + 4] = !!(t & 1);
}
}
for (int i = 1; i <= n; i++) {
int t = 0;
for (int j = 1; j <= n; j++) {
t += sum[i][j];
sum[i][j] = sum[i - 1][j] + t;
}
}
for (int i = n; i >= 1; i--)
if (n % i == 0) {
if (check(i)) {
printf("%d\n", i);
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string arr[5205];
string st[5205];
vector<int> result;
void solve() {
long long n;
cin >> n;
for (int i = 0; i < n; i++) {
arr[i] = "";
}
for (int i = 0; i < n; i++) {
string str;
cin >> str;
st[i] = str;
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;
}
}
}
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 l = 0;
int ans;
for (int i = sz; i >= 0; i--) {
int m = i;
int flag = 0;
for (long long i = 0; i < n; i += result[m]) {
for (long long j = i + 1; j < i + result[m]; j++) {
if (st[j] != st[j - 1]) {
flag = 1;
break;
}
}
if (flag == 1) break;
}
for (int i = 0; i < n; i += result[m]) {
for (int j = 0; j < n; j += result[m]) {
string one = arr[i].substr(j, result[m]);
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 = result[m];
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;
int n, m, k, mi = 1e9, x2, y2, i, j, ma = 0, ma2 = -1e9, x, y, z, nom, f, r, l,
b[410000], d[410000], ans;
int a[5211][5211];
char c;
int main() {
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%c", &c);
for (j = 1; j <= n / 4; j++) {
scanf("%c", &c);
if (c >= 'A' && c <= 'F')
x = 10 + (c - 'A');
else
x = (c - '0');
for (k = 1; k <= 4; k++) {
a[i][j * 4 - k + 1] = x % 2;
x /= 2;
}
}
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
a[i][j] += a[i - 1][j] + a[i][j - 1] - a[i - 1][j - 1];
}
}
ans = 1;
for (i = n; i >= 2; i--) {
if (n % i == 0) {
f = 0;
j = i * i;
for (x = i; x <= n; x += i) {
for (y = i; y <= n; y += i) {
if (a[x][y] % j != 0) {
f = 1;
break;
}
}
if (f) break;
}
if (!f) {
ans = i;
break;
}
}
}
printf("%d", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 5200;
int n;
int a[N + 10][N + 10];
char s[N + 10][N + 10];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%s", s[i]);
for (int j = 0; j < n / 4; j++) {
int key = s[i][j] - '0';
if (s[i][j] >= 'A' && s[i][j] <= 'F') {
key = s[i][j] - 'A' + 10;
}
for (int k = 0; k < 4; k++) {
a[i][j * 4 + 4 - k] = key % 2;
key /= 2;
}
}
}
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] + a[i][j];
int ans = -1;
for (int x = 1; x <= n; x++)
if (n % x == 0) {
bool flag = true;
for (int i = x; i <= n; i += x) {
for (int j = x; j <= n; j += x) {
int x0 = i - x + 1, y0 = j - x + 1;
int x1 = i, y1 = j;
int num =
a[x1][y1] - a[x0 - 1][y1] - a[x1][y0 - 1] + a[x0 - 1][y0 - 1];
if (num != 0 && num != x * x) {
flag = false;
break;
}
}
if (!flag) break;
}
if (flag) {
ans = x;
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5200 + 5;
const bool SEND = 1;
int pref[MAXN][MAXN];
char arr[MAXN][MAXN];
bool bad[MAXN];
char s[MAXN];
int n, ans;
bool bit(int x, int p) { return x & (1 << p); }
int rectSum(int ax, int ay, int bx, int by) {
int ret = pref[bx][by];
if (ax > 0) {
ret -= pref[ax - 1][by];
}
if (ay > 0) {
ret -= pref[bx][ay - 1];
}
if (ax > 0 && ay > 0) {
ret += pref[ax - 1][ay - 1];
}
return ret;
}
bool check(int k) {
int L = n / k;
for (int x = 0; x < L; ++x) {
for (int y = 0; y < L; ++y) {
int cur = rectSum(x * k, y * k, (x + 1) * k - 1, (y + 1) * k - 1);
if (cur != 0 && cur != k * k) {
return 0;
}
}
}
return 1;
}
void solve() {
scanf("%d", &n);
if (SEND) {
for (int i = 0; i < n; ++i) {
scanf("%s", s);
for (int j = 0, cur; j < n / 4; ++j) {
if ('A' <= s[j] && s[j] <= 'F') {
cur = s[j] - 'A' + 10;
} else {
cur = s[j] - '0';
}
for (int k = 0; k < 4; ++k) {
arr[i][j * 4 + 3 - k] = bit(cur, k) + '0';
}
}
}
} else {
for (int i = 0; i < n; ++i) {
scanf("%s", arr[i]);
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
pref[i][j] = arr[i][j] - '0';
if (i > 0) {
pref[i][j] += pref[i - 1][j];
}
if (j > 0) {
pref[i][j] += pref[i][j - 1];
}
if (i > 0 && j > 0) {
pref[i][j] -= pref[i - 1][j - 1];
}
}
}
for (int i = n; i > 1; --i) {
if (n % i == 0) {
if (check(i)) {
printf("%d\n", i);
return;
}
}
}
printf("1\n");
}
int main() {
int tt = 1;
while (tt--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int f(char c) { return c > '9' ? c - 'A' + 10 : c - '0'; }
bool ok(vector<vector<int>> &matrix, int x) {
for (int i = 0; i < matrix.size(); i += x) {
for (int j = 0; j < matrix.size(); j += x) {
for (int k = 0; k < x; ++k) {
for (int l = 0; l < x; ++l) {
if (matrix[i + k][j + l] != matrix[i][j]) {
return false;
}
}
}
}
}
return true;
}
vector<vector<int>> compress(vector<vector<int>> &matrix, int x) {
vector<vector<int>> compressedMatrix(matrix.size() / x,
vector<int>(matrix.size() / x));
for (int i = 0; i < matrix.size(); i += x) {
for (int j = 0; j < matrix.size(); j += x) {
compressedMatrix[i / x][j / x] = matrix[i][j];
}
}
return compressedMatrix;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<vector<int>> matrix(n, vector<int>(n));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; j += 4) {
char c;
cin >> c;
int mask = f(c);
for (int k = 0; k < 4; ++k) {
if (mask & (1 << k)) {
matrix[i][j + (3 - k)] = 1;
}
}
}
}
int ansX = 1;
for (int x = 2; x <= matrix.size(); ++x) {
while (matrix.size() % x == 0 && ok(matrix, x)) {
matrix = compress(matrix, x);
ansX *= x;
}
}
cout << ansX << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 5200 + 10;
int n;
string s;
bool prime[MAX_N];
vector<int> p;
int sum[MAX_N][MAX_N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
prime[0] = 1;
prime[1] = 1;
for (int i = 2; i <= n; i++)
if (prime[i] == 0) {
if (n % i == 0) {
p.push_back(i);
}
for (int j = i + i; j <= n; j += i) {
prime[j] = 1;
}
}
for (int i = 1; i <= n; i++) {
cin >> s;
int last = 1;
int d;
for (int j = 0; j < s.size(); j++) {
if (s[j] >= 'A' && s[j] <= 'Z') {
d = s[j] - 'A' + 10;
} else {
d = s[j] - '0';
}
for (int _ = 3; _ >= 0; _--) {
if ((1 << _) & d) {
sum[i][last] = 1;
}
last++;
}
}
}
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]);
}
}
int ans = 1;
for (int _ = 0; _ < p.size(); _++) {
int x = p[_];
int X = 1;
{
int __ = n;
while (__ % x == 0) {
__ /= x;
X *= x;
}
}
int y = x;
while (true) {
int sw = 0;
for (int i = x; i <= n && sw == 0; i += x) {
for (int j = x; j <= n; j += x) {
int _sum =
((sum[i][j] - sum[i - x][j]) - sum[i][j - x]) + sum[i - x][j - x];
if (!(_sum == 0 || _sum == x * x)) {
sw = 1;
break;
}
}
}
if (sw == 0) {
if (x == X) {
break;
}
x *= y;
} else {
x /= y;
break;
}
}
ans *= x;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int m[5250][5250];
bool search(int u, int n) {
bool ret = true;
for (int i = 0; i < n / u; i++) {
for (int j = 0; j < n / u; j++) {
for (int x = 0; x < u; x++) {
for (int y = 0; y < u; y++) {
if (m[i * u][j * u] != m[i * u + x][j * u + y]) {
return false;
}
}
}
}
}
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int j = 0; j < n / 4; j++) {
int t;
if (s[j] >= 'A') {
t = s[j] - 'A' + 10;
} else
t = s[j] - '0';
for (int k = 0; k < 4; k++) {
m[i][j * 4 + 3 - k] = t % 2;
t /= 2;
}
}
}
map<int, int> c;
int d = n;
for (int i = 2; i * i <= d; i++) {
while (d % i == 0) {
c[i]++;
d /= i;
}
}
if (d != 1) c[d]++;
int ans = 1;
for (auto it = c.begin(); it != c.end(); it++) {
int p = it->first;
int q = it->second;
for (int i = 1; i <= q; i++) {
if (!search(pow(p, i), n)) {
ans *= pow(p, i - 1);
break;
}
if (i == q) {
ans *= pow(p, i);
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[5300][5300];
int n;
bool g(int x) {
for (int i = 1; i <= n; i += x) {
for (int j = 1; j <= n; j += x) {
int t = a[i][j];
for (int p = i; p <= i + x - 1; p++) {
for (int q = j; q <= j + x - 1; q++) {
if (a[p][q] != t) return false;
}
}
}
}
return true;
}
int f(int st, int end, vector<int>& v) {
if (st > end) return -1;
int mid = (st + end) / 2;
bool x = g(v[mid]);
if (x) {
int rans = f(mid + 1, end, v);
if (rans != -1) return rans;
return mid;
}
return f(st, mid - 1, v);
}
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 l = 1;
for (int j = 0; j < s.size(); j++) {
int x = s[j];
int z;
if (x >= 48 && x <= 57) {
z = s[j] - 48;
} else {
z = (s[j] - 65) + 10;
}
vector<int> v(4);
for (int k = 0; k < 4; k++) {
if ((z & 1) == 1) {
v.push_back(1);
} else
v.push_back(0);
z = z >> 1;
}
reverse(v.begin(), v.end());
for (int k = 0; k < 4; k++) a[i][l++] = v[k];
}
}
vector<int> v;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
v.push_back(i);
if (i * i != n) v.push_back(n / i);
}
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (int i = 0; i < v.size(); i++) {
if (g(v[i])) {
cout << v[i];
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e4 + 100;
string a[N];
int n, ans = 1;
string toBinary(int x) {
string res = "";
while (x > 0) {
res += (x % 2 ? '1' : '0');
x /= 2;
}
while (res.length() < 4) res += '0';
reverse(res.begin(), res.end());
return res;
}
string convert(string s) {
string res = "";
for (int i = 0; i < s.size(); i++) {
if (s[i] >= '0' && s[i] <= '9')
res += toBinary(s[i] - '0');
else
res += toBinary(10 + s[i] - 'A');
}
return res;
}
bool check(int x) {
bool ok = true;
for (int i = 0; i < n && ok; i += x)
for (int j = 0; j < n && ok; j += x)
for (int k = 0; k < x && ok; k++)
for (int l = 0; l < x && ok; l++)
if (a[i + k][j + l] != a[i][j]) ok = false;
return ok;
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
a[i] = convert(s);
}
for (int i = 2; i <= n; i++) {
if (n % i == 0) {
if (check(i)) ans = i;
}
}
return cout << ans, 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 5e3 + 500;
int G[N][N], sum[N][N], n;
char s[20000];
bool valid(int index) {
int now = index * index;
for (int i = 1; i + index - 1 <= n; i += index) {
for (int j = 1; j + index - 1 <= n; j += index) {
int li = i + index - 1;
int lj = j + index - 1;
int ss =
sum[li][lj] - sum[i - 1][lj] - sum[li][j - 1] + sum[i - 1][j - 1];
if (ss != 0 && ss != now) return false;
}
}
return true;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%s", s + 1);
int num;
for (int j = 1; j <= n / 4; j++) {
if (s[j] >= 'A' && s[j] <= 'F')
num = s[j] - 'A' + 10;
else
num = s[j] - '0';
for (int k = (j - 1) * 4 + 4; k >= (j - 1) * 4 + 1; k--) {
G[i][k] = num % 2;
num /= 2;
}
}
}
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] + G[i][j];
}
}
int ans = 1;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
if (valid(i)) ans = max(ans, i);
if (i * i != n) {
if (valid(n / i)) ans = max(ans, n / i);
}
}
}
if (valid(n)) ans = max(ans, n);
printf("%d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int in() {
int x;
scanf("%d", &x);
return x;
}
long long lin() {
long long x;
scanf("%lld", &x);
return x;
}
void makegraph(int x, vector<vector<int> > &v) {
for (long long i = 0; i < x - 1; i++) {
int a = in(), b = in();
v[a].push_back(b);
v[b].push_back(a);
}
}
template <typename A, size_t NNN, typename T>
void Fill(A (&array)[NNN], const T &val) {
fill((T *)array, (T *)(array + NNN), val);
}
long long MOD = 1e9 + 7;
long long n, m, k;
long long a[255050];
long long sum[255050];
bool mat[6000][6000];
bool check(int x) {
bool flag = true;
for (long long i = 0; i < n / x; i++) {
for (long long j = 0; j < n / x; j++) {
bool checker = mat[i * x][j * x];
for (long long ii = 0; ii < x; ii++) {
for (long long jj = 0; jj < x; jj++) {
if (checker != mat[ii + i * x][jj + j * x]) {
flag = false;
break;
}
}
if (!flag) break;
}
if (!flag) break;
}
if (!flag) break;
}
return flag;
}
int main() {
n = in();
for (long long i = 0; i < n; i++) {
string s;
cin >> s;
for (long long j = 0; j < n / 4; j++) {
int p = (s[j] - '0');
if (p > 16) p -= 7;
for (long long k = 0; k < 4; k++) {
mat[i][j * 4 + 3 - k] = p % 2;
p /= 2;
}
}
}
vector<pair<int, int> > factor;
int nn = n;
for (int i = 2; i * i <= nn; i++) {
if (nn % i == 0) {
int res = 0;
while (nn % i == 0) {
nn /= i;
res++;
}
factor.push_back({i, res});
}
}
if (nn > 1) factor.push_back({nn, 1});
int ans = 1;
for (long long i = 0; i < factor.size(); i++) {
int res = 1;
int preans = 1;
for (long long j = 1; j <= factor[i].second; ++j) {
res *= factor[i].first;
if (check(res)) {
preans = res;
} else
break;
}
ans *= preans;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5200;
int n, arr[MAXN][MAXN];
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int hexToDec(char c) {
int dec = 0;
if ('0' <= c && '9' >= c)
dec = (int)c - '0';
else if ('A' <= c && 'F' >= c)
dec = (int)c - 'A' + 10;
return dec;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
scanf("%d", &n);
for (int i = 0; i < n; i++) {
char s[MAXN / 4 + 1];
scanf("%s", s);
for (int j = 0; j < n / 4; j++) {
int dec = hexToDec(s[j]);
for (int k = 0; k < 4; k++) {
if (dec & (1 << k)) arr[i][4 * j + 3 - k] = 1;
}
}
}
int x = n;
for (int i = 0; i < n; i++) {
int len = 1;
int j = 0, ptr = 0;
while (ptr < n) {
if (arr[i][ptr] == arr[i][j])
ptr++;
else {
len = ptr - j;
x = gcd(x, len);
j = ptr;
}
}
}
for (int j = 0; j < n; j++) {
int len = 1;
int i = 0, ptr = 0;
while (ptr < n) {
if (arr[ptr][j] == arr[i][j])
ptr++;
else {
len = ptr - i;
x = gcd(x, len);
i = ptr;
}
}
}
printf("%d\n", x);
}
|
#include <bits/stdc++.h>
const int maxx = 1e5 + 100;
const int mod = 10007;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
using namespace std;
int n, m, T;
int pre[5210][5210];
int ans, l, r;
string s;
int tot, x, t;
void move(int pos) {
while (t < 4) {
pre[pos][tot--] = (x >> t & 1);
t++;
}
return;
}
void solve(int pos) {
tot = 1, x, t;
for (int i = 0; i < s.size(); i++) {
tot = (i + 1) * 4;
t = 0;
if (s[i] == '1')
x = 1, move(pos);
else if (s[i] == '2')
x = 2, move(pos);
else if (s[i] == '3')
x = 3, move(pos);
else if (s[i] == '4')
x = 4, move(pos);
else if (s[i] == '5')
x = 5, move(pos);
else if (s[i] == '6')
x = 6, move(pos);
else if (s[i] == '7')
x = 7, move(pos);
else if (s[i] == '8')
x = 8, move(pos);
else if (s[i] == '9')
x = 9, move(pos);
else if (s[i] == 'A')
x = 10, move(pos);
else if (s[i] == 'B')
x = 11, move(pos);
else if (s[i] == 'C')
x = 12, move(pos);
else if (s[i] == 'D')
x = 13, move(pos);
else if (s[i] == 'E')
x = 14, move(pos);
else if (s[i] == 'F')
x = 15, move(pos);
else
x = 0, move(pos);
}
}
bool check(int x) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
int X = i + x - 1, Y = j + x - 1;
int sum = pre[X][Y] - pre[X][j - 1] - pre[i - 1][Y] + pre[i - 1][j - 1];
if (sum != 0 && sum != x * x) return false;
}
}
return true;
}
int main() {
int i, j, k;
while (scanf("%d", &n) == 1) {
ans = -inf;
memset(pre, 0, sizeof pre);
for (i = 1; i <= n; i++) {
cin >> s;
solve(i);
}
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++) pre[i][j] += pre[i][j - 1];
for (j = 1; j <= n; j++)
for (i = 1; i <= n; i++) pre[i][j] += pre[i - 1][j];
for (i = n; i >= 1; i--) {
if (n % i) continue;
int ok = 1;
for (j = 1; j <= n; j += i) {
for (k = 1; k <= n; k += i) {
int X = j + i - 1, Y = k + i - 1;
int sum =
pre[X][Y] - pre[X][k - 1] - pre[j - 1][Y] + pre[j - 1][k - 1];
ok &= (sum == 0 || sum == i * i);
}
}
if (ok) ans = max(ans, i);
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, ans, i, j, n_4, a;
bool m[2][5300];
char c;
inline int gcd(int a, int b) {
while (a) {
a ^= b ^= a ^= b %= a;
}
return b;
}
int main() {
scanf("%d", &n);
ans = n;
n_4 = n / 4;
for (i = 0; i < n; ++i) {
for (j = 0; j < n; j += 4) {
while (((c = getchar()) > '9' || c < '0') && (c < 'A' || c > 'F'))
;
if ('0' <= c && '9' >= c)
a = c - '0';
else
a = c - 'A' + 10;
m[i & 1][j] = a >> 3;
m[i & 1][j + 1] = a >> 2 & 1;
m[i & 1][j + 2] = a >> 1 & 1;
m[i & 1][j + 3] = a & 1;
if (i != 0 && (m[i & 1][j] != m[!(i & 1)][j] ||
m[i & 1][j + 1] != m[!(i & 1)][j + 1] ||
m[i & 1][j + 2] != m[!(i & 1)][j + 2] ||
m[i & 1][j + 3] != m[!(i & 1)][j + 3]))
ans = gcd(ans, i);
if (m[i & 1][j] != m[i & 1][j - 1]) ans = gcd(ans, j);
if ((a & 12) % 3) ans = gcd(ans, j + 1);
if ((a & 6) % 3) ans = gcd(ans, j + 2);
if ((a & 3) % 3) ans = gcd(ans, j + 3);
}
if (ans == 1) break;
}
printf("%d", ans);
}
|
#include <bits/stdc++.h>
char s[(1 << 17)];
int ds = (1 << 17);
char ma[5200][5200];
inline char readch() {
if (ds == (1 << 17)) {
fread(s, (1 << 17), 1, stdin);
ds = 0;
}
ds++;
return s[ds - 1];
}
inline int cmmmc(int a, int b) {
int r;
while (b > 0) {
r = a % b;
a = b;
b = r;
}
return a;
}
int main() {
int n, rez = 0, cur, i, j, k;
char ch;
scanf("%d ", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < (n >> 2); j++) {
ch = readch();
if (ch >= 'A' && ch <= 'F')
ch = ch - 'A' + 10;
else
ch = ch - '0';
for (k = 0; k < 4; k++) {
ma[i][4 * j + 3 - k] = ((ch & (1 << k)) > 0);
}
}
readch();
}
for (i = 0; i < n; i++) {
cur = 1;
for (j = 1; j < n; j++) {
if (ma[i][j] == ma[i][j - 1])
cur++;
else {
rez = cmmmc(rez, cur);
cur = 1;
}
}
rez = cmmmc(rez, cur);
}
for (i = 0; i < n; i++) {
cur = 1;
for (j = 1; j < n; j++) {
if (ma[j][i] == ma[j - 1][i])
cur++;
else {
rez = cmmmc(rez, cur);
cur = 1;
}
}
rez = cmmmc(rez, cur);
}
printf("%d\n", rez);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 5200 + 10;
int n;
vector<int> p;
char a[N][N];
bool check(int x) {
for (int i = 1; i <= n; i += x) {
for (int j = 1; j <= n; j += x) {
for (int ii = i; ii < i + x; ii++) {
for (int jj = j; jj < j + x; jj++) {
if (a[ii][jj] != a[i][j]) return false;
}
}
}
}
return true;
}
int main() {
cin >> n;
for (int i = 1; i * i <= n; i++)
if (n % i == 0) p.push_back(i);
int k = p.size() - 1;
if (p.back() * p.back() == n) k--;
for (int i = k; i >= 0; i--) p.push_back(n / p[i]);
string s;
for (int i = 1; i <= n; i++) {
cin >> s;
k = 4;
for (char &c : s) {
int x;
if (!isdigit(c))
x = 10 + c - 'A';
else
x = c - '0';
for (int j = 0; j < 4; j++) {
a[i][k - j] = (x & 1) + '0';
x >>= 1;
}
k += 4;
}
}
for (int i = p.size() - 1; i >= 0; i--) {
if (check(p[i])) {
cout << p[i] << endl;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
bool arr[n][n];
memset(arr, 0, sizeof(arr));
int xo1[n][n];
int xo2[n][n];
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int j = 0; j < (n / 4); j++) {
char temp = s[j];
int temp1;
if (temp < 48 || temp > 57)
temp1 = temp - 55;
else
temp1 = temp - 48;
if ((temp1 & (1 << 3)) != 0) arr[i][4 * j] = 1;
if ((temp1 & (1 << 2)) != 0) arr[i][4 * j + 1] = 1;
if ((temp1 & (1 << 1)) != 0) arr[i][4 * j + 2] = 1;
if ((temp1 & (1 << 0)) != 0) arr[i][4 * j + 3] = 1;
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (j == 0) {
xo1[i][j] = arr[i][j];
continue;
}
xo1[i][j] = xo1[i][j - 1] + arr[i][j];
}
}
for (int j = 0; j < n; j++) {
for (int i = 0; i < n; i++) {
if (i == 0) {
xo2[i][j] = arr[i][j];
continue;
}
xo2[i][j] = xo2[i - 1][j] + arr[i][j];
}
}
set<int> s1, s2;
for (int x = 1; x <= sqrt(n); x++) {
if (n % x != 0) continue;
int count1 = 0;
int count2 = 0;
for (int c = 0; c < n; c++) {
bool yeah = 1;
bool yeah1 = 1;
for (int i = 0; i < n; i += x) {
int ans = 0;
if (i != 0)
ans = xo2[i + x - 1][c] - xo2[i - 1][c];
else
ans = xo2[i + x - 1][c];
if (ans != x && ans != 0) {
yeah = 0;
break;
}
}
for (int i = 0; i < n; i += (n / x)) {
int ans = 0;
if (i != 0)
ans = xo2[i + (n / x) - 1][c] - xo2[i - 1][c];
else
ans = xo2[i + (n / x) - 1][c];
if (ans != (n / x) && ans != 0) {
yeah1 = 0;
break;
}
}
if (yeah1) count1++;
if (yeah) count2++;
}
if (count1 == n) s1.insert(n / x);
if (count2 == n) s1.insert(x);
}
for (int x = 1; x <= sqrt(n); x++) {
if (n % x != 0) continue;
int count1 = 0;
int count2 = 0;
for (int r = 0; r < n; r++) {
bool yeah = 1;
bool yeah1 = 1;
for (int i = 0; i < n; i += x) {
int ans = 0;
if (i != 0)
ans = xo1[r][i + x - 1] - xo1[r][i - 1];
else
ans = xo1[r][i + x - 1];
if (ans != x && ans != 0) {
yeah = 0;
break;
}
}
for (int i = 0; i < n; i += (n / x)) {
int ans = 0;
if (i != 0)
ans = xo1[r][i + (n / x) - 1] - xo1[r][i - 1];
else
ans = xo1[r][i + (n / x) - 1];
if (ans != (n / x) && ans != 0) {
yeah1 = 0;
break;
}
}
if (yeah1) count1++;
if (yeah) count2++;
}
if (count1 == n) s2.insert(n / x);
if (count2 == n) s2.insert(x);
}
int ans = 1;
for (auto itr = s1.begin(); itr != s1.end(); itr++) {
int temp = (*itr);
if (s2.find(temp) != s2.end()) ans = max(ans, temp);
}
cout << ans << endl;
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) {
vector<int> periods;
int sz = 0;
for (int i = 0; i < s.size(); i++) {
if (i > 0 && s[i] != s[i - 1]) {
periods.push_back(sz);
sz = 1;
} else {
sz++;
}
}
periods.push_back(sz);
for (int i = 1; i < periods.size(); i++)
periods[0] = gcd(periods[0], periods[i]);
return periods[0];
}
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;
const int N_MAX = 5205;
int N;
bitset<N_MAX> matrix[N_MAX];
int rect_sum[N_MAX][N_MAX];
int hex_to_int(char hex) { return isdigit(hex) ? hex - '0' : hex - 'A' + 10; }
int get_rect_sum(int r1, int r2, int c1, int c2) {
return rect_sum[r2][c2] - rect_sum[r2][c1] - rect_sum[r1][c2] +
rect_sum[r1][c1];
}
int main() {
scanf("%d", &N);
char str[N_MAX];
for (int i = 0; i < N; i++) {
scanf("%s", str);
reverse(str, str + N / 4);
for (int j = 0; j < N; j++)
matrix[i][j] = (hex_to_int(str[j / 4]) >> j % 4) & 1;
}
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
rect_sum[i + 1][j + 1] = rect_sum[i + 1][j] + rect_sum[i][j + 1] -
rect_sum[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_sum(i, i + x, j, j + x);
if (sum != x * x && sum != 0) good = false;
}
if (good) {
cout << x << '\n';
return 0;
}
}
assert(false);
}
|
#include <bits/stdc++.h>
using namespace std;
int gra[5210][5210];
int n;
char row[5210][5210];
int B[5210][5210];
map<char, int> mp;
vector<int> V;
bool check(int x) {
for (int i = 1; i <= n; i += x) {
for (int j = 1; j <= n; j += x) {
for (int k = i; k < i + x; k++) {
for (int t = j; t < j + x; t++) {
if (gra[k][t] != gra[i][j]) return false;
}
}
}
}
return true;
}
int main(void) {
cin >> n;
mp['A'] = 10, mp['B'] = 11, mp['C'] = 12, mp['D'] = 13, mp['E'] = 14,
mp['F'] = 15;
for (int i = 1; i <= n; i++) {
cin >> row[i];
}
for (int i = 1; i <= n; i++) {
int len = strlen(row[i]);
for (int j = 0; j < len; j++) {
char x = row[i][j];
int num;
if (isdigit(x))
num = x - '0';
else
num = mp[x];
for (int k = 3; k >= 0; k--) {
if (num & (1 << k)) {
gra[i][4 * j + (4 - k)] = 1;
} else {
gra[i][4 * j + (4 - k)] = 0;
}
}
}
}
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
V.push_back(i);
if (i * i != n) V.push_back(n / i);
}
}
sort(V.begin(), V.end());
for (int i = V.size() - 1; i >= 0; i--) {
int cut = V[i];
if (check(cut)) {
cout << cut << endl;
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[5310][5310];
int n;
bool check(int v) {
for (int i = 0; i < n; i += v) {
for (int j = 0; j < n; j += v) {
for (int i1 = 0; i1 < v; ++i1) {
for (int j1 = 0; j1 < v; ++j1) {
if (arr[i + i1][j + j1] != arr[i][j]) return false;
}
}
}
}
return true;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
vector<int> fact;
for (int i = 1; i < n + 1; ++i) {
if (n % i == 0) fact.push_back(i);
}
cerr << (int)fact.size() << endl;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n / 4; ++j) {
char c;
cin >> c;
int res = 0;
if (c <= '9')
res = c - 48;
else
res = c - 'A' + 10;
for (int k = 3; k >= 0; k--) {
arr[i][(j << 2) + k] = res & 1;
res >>= 1;
}
}
}
reverse(fact.begin(), fact.end());
for (auto v : fact) {
if (check(v)) {
cout << v << endl;
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, v[10];
bool mat[5205][5205], ok = 0;
char c;
void f() {
if (c == '0') {
v[1] = 0;
v[2] = 0;
v[3] = 0;
v[4] = 0;
}
if (c == '1') {
v[1] = 0;
v[2] = 0;
v[3] = 0;
v[4] = 1;
}
if (c == '2') {
v[1] = 0;
v[2] = 0;
v[3] = 1;
v[4] = 0;
}
if (c == '3') {
v[1] = 0;
v[2] = 0;
v[3] = 1;
v[4] = 1;
}
if (c == '4') {
v[1] = 0;
v[2] = 1;
v[3] = 0;
v[4] = 0;
}
if (c == '5') {
v[1] = 0;
v[2] = 1;
v[3] = 0;
v[4] = 1;
}
if (c == '6') {
v[1] = 0;
v[2] = 1;
v[3] = 1;
v[4] = 0;
}
if (c == '7') {
v[1] = 0;
v[2] = 1;
v[3] = 1;
v[4] = 1;
}
if (c == '8') {
v[1] = 1;
v[2] = 0;
v[3] = 0;
v[4] = 0;
}
if (c == '9') {
v[1] = 1;
v[2] = 0;
v[3] = 0;
v[4] = 1;
}
if (c == 'A') {
v[1] = 1;
v[2] = 0;
v[3] = 1;
v[4] = 0;
}
if (c == 'B') {
v[1] = 1;
v[2] = 0;
v[3] = 1;
v[4] = 1;
}
if (c == 'C') {
v[1] = 1;
v[2] = 1;
v[3] = 0;
v[4] = 0;
}
if (c == 'D') {
v[1] = 1;
v[2] = 1;
v[3] = 0;
v[4] = 1;
}
if (c == 'E') {
v[1] = 1;
v[2] = 1;
v[3] = 1;
v[4] = 0;
}
if (c == 'F') {
v[1] = 1;
v[2] = 1;
v[3] = 1;
v[4] = 1;
}
}
bool verif(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 - 1; p++)
for (int q = j; q <= j + x - 1; q++) {
if (mat[i][j] != mat[p][q]) return 0;
}
}
}
return 1;
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n / 4; j++) {
cin >> c;
f();
mat[i][4 * (j - 1) + 1] = v[1];
mat[i][4 * (j - 1) + 2] = v[2];
mat[i][4 * (j - 1) + 3] = v[3];
mat[i][4 * (j - 1) + 4] = v[4];
}
}
for (int k = n; k >= 2; k--) {
if (n % k == 0) {
if (verif(k)) {
cout << k;
k = 1;
ok = 1;
}
}
}
if (ok == 0) cout << 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[5205][5205], n;
vector<int> v[16];
int fun(char c) {
if (isdigit(c)) return c - '0';
return 10 + c - 'A';
}
void fun2() {
for (int x = 0; x < 16; x++) {
int y = x;
while (v[x].size() < 4) {
v[x].push_back(y % 2);
y /= 2;
}
reverse(v[x].begin(), v[x].end());
}
}
bool check(long long k) {
for (int x = 1; x <= n; x += k) {
for (int y = 1; y <= n; y += k) {
long long s = a[x + k - 1][y + k - 1] - a[x - 1][y + k - 1] -
a[x + k - 1][y - 1] + a[x - 1][y - 1];
if (s != 0 && s != k * k) {
return 0;
}
}
}
return 1;
}
void fun3() {
for (int x = 1; x <= n; x++) {
for (int y = 1; y <= n; y++) {
a[x][y] += a[x][y - 1];
}
}
for (int x = 1; x <= n; x++) {
for (int y = 1; y <= n; y++) {
a[x][y] += a[x - 1][y];
}
}
}
int main() {
cin >> n;
string s;
fun2();
for (int x = 0; x < n; x++) {
cin >> s;
for (int y = 0; y < n / 4; y++) {
int z = fun(s[y]);
for (int t = 0; t < 4; t++) {
a[x + 1][(4 * y) + t + 1] = v[z][t];
}
}
}
fun3();
vector<int> d;
for (int x = 1; x <= (long long)sqrt(n); x++) {
if (n % x) continue;
d.push_back(x);
if (x != n / x) {
d.push_back(n / x);
}
}
sort((d).begin(), (d).end());
reverse((d).begin(), (d).end());
for (auto x : d) {
if (check(x)) {
cout << x << " ";
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool Matrix[5300][5300];
int convert(char digit) {
if (digit >= '0' && digit <= '9')
return digit - '0';
else
return digit - 'A' + 10;
}
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
int k, n, q, i, j, x, mask, counter = 0, bit;
scanf("%d%*c", &n);
int number, GCD;
char digit;
GCD = n;
for (i = 0; i < n; i++) {
for (j = 0; j < n / 4; j++) {
scanf("%c", &digit);
number = convert(digit);
for (k = 0, mask = 8; k < 4; k++) {
bit = number & mask;
Matrix[i][j * 4 + k] = (bit > 0);
mask = mask >> 1;
}
}
scanf("%*c");
}
for (i = 0; i < n; i++) {
counter = 0;
for (j = 0; j < n; j++) {
if (j > 0 && Matrix[i][j] != Matrix[i][j - 1]) {
GCD = gcd(GCD, counter);
counter = 1;
} else {
counter++;
}
}
GCD = gcd(GCD, counter);
}
for (i = 0; i < n; i++) {
counter = 0;
for (j = 0; j < n; j++) {
if (j > 0 && Matrix[j][i] != Matrix[j - 1][i]) {
GCD = gcd(GCD, counter);
counter = 1;
} else {
counter++;
}
}
GCD = gcd(GCD, counter);
}
printf("%d", GCD);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void fun() {}
long long int __gcda(long long int a, long long int b) {
if (b == 0) {
return a;
} else if (a == 0) {
return b;
} else if (a == b) {
return a;
} else if (b > a) {
return __gcda(a, b % a);
} else if (a > b) {
return __gcda(a % b, b);
}
return 0;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
fun();
map<char, long long int> mapp;
for (long long int i = 0; i < 10; i++) {
mapp[i + '0'] = i;
}
mapp['A'] = 10;
mapp['B'] = 11;
mapp['C'] = 12;
mapp['D'] = 13;
mapp['E'] = 14;
mapp['F'] = 15;
long long int n;
cin >> n;
long long int arr[n][n];
char ch;
for (long long int i = 0; i < n; i++) {
for (long long int j = 0; j < n; j += 4) {
cin >> ch;
long long int num = mapp[ch];
for (long long int k = 3; k >= 0; k--) {
arr[i][j + k] = num & 1;
num = num >> 1;
}
}
}
for (long long int i = 0; i < n; i++) {
long long int sum = 0;
for (long long int j = 0; j < n; j++) {
arr[i][j] += sum;
sum = arr[i][j];
}
}
for (long long int i = 0; i < n; i++) {
long long int sum = 0;
for (long long int j = 0; j < n; j++) {
arr[j][i] += sum;
sum = arr[j][i];
}
}
long long int ans = 1;
for (long long int tr = 2; tr <= n; tr++) {
if (n % tr != 0) continue;
long long int flag = 0;
for (long long int i = 0; i < n; i += tr) {
for (long long int j = 0; j < n; j += tr) {
long long int diff = arr[i + tr - 1][j + tr - 1];
if (i - 1 >= 0) {
diff -= arr[i - 1][j + tr - 1];
}
if (j - 1 >= 0) {
diff -= arr[i + tr - 1][j - 1];
}
if (j - 1 >= 0 && i - 1 >= 0) {
diff += arr[i - 1][j - 1];
}
if (diff == 0 || diff == tr * tr) {
} else {
flag = 1;
break;
}
}
if (flag) break;
}
if (flag == 0) ans = tr;
}
cout << ans << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const long double pi = 3.141592653589793238462643;
int n;
int m;
int k;
string str;
int s[5210][5210];
bool ch(int x) {
bool f = 1;
x = n / x;
for (int i = 0; i < n / x; i++) {
for (int j = 0; j < n / x; j++) {
int sum = s[(i + 1) * x][(j + 1) * x] - s[i * x][(j + 1) * x] -
s[(i + 1) * x][j * x] + s[i * x][j * x];
if (sum == 0 || sum == x * x)
f *= 1;
else
f *= 0;
}
}
return f;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < (n); i++) {
cin >> str;
for (int j = 0; j < (n / 4); j++) {
int x = 0;
if (str[j] >= '0' && str[j] <= '9')
x = str[j] - '0';
else
x = str[j] - 'A' + 10;
for (int k = (4) - 1; k >= 0; k--) {
s[i + 1][j * 4 + k + 1] = x % 2;
x /= 2;
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
s[i][j] += s[i][j - 1] + s[i - 1][j] - s[i - 1][j - 1];
}
}
for (int i = 1; i <= n; i++) {
if (n % i == 0 && ch(i)) {
cout << n / i;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigMod(T p, T e, T M) {
T ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1) ret = (ret * p) % M;
p = (p * p) % M;
}
return (T)ret;
}
template <class T>
inline T modInverse(T a, T M) {
return bigMod(a, M - 2, M);
}
template <class T>
inline T gcd(T a, T b) {
if (b == 0) return a;
return gcd(b, a % b);
}
template <class T>
inline T lcm(T a, T b) {
a = abs(a);
b = abs(b);
return (a / gcd(a, b)) * b;
}
template <class T>
inline string int2String(T a) {
ostringstream str;
str << a;
return str.str();
}
const int dr[] = {0, 1, 0, -1, -1, 1, 1, -1, -2, -2, 2, 2, -1, -1, 1, 1};
const int dc[] = {1, 0, -1, 0, 1, 1, -1, -1, -1, 1, -1, 1, -2, 2, -2, 2};
void fileIO() {}
int H2I(char c) {
if ('A' <= c && c <= 'F')
return 10 + c - 'A';
else
return c - '0';
}
int n, a[5300][5300];
bool ok(int x) {
int area = x * x;
for (int i = x; i <= n; i += x) {
for (int j = x; j <= n; j += x) {
int sum = a[i][j] + a[i - x][j - x] - a[i][j - x] - a[i - x][j];
if (sum && sum != area) return 0;
}
}
return 1;
}
char ch[11111];
int main() {
fileIO();
int start_s = clock();
scanf("%d", &n);
int x;
for (int i = int(0); i < int(n); i++) {
scanf("%s", ch);
for (int j = int(0); j < int((n >> 2)); j++) {
x = H2I(ch[j]);
for (int k = (j + 1) * 4, p = 0; k > j * 4; k--, p++)
a[i + 1][k] = ((bool)(x & (1 << (p))));
}
}
for (int i = int(1); i < int(n + 1); i++)
for (int j = int(2); j < int(n + 1); j++) a[i][j] += a[i][j - 1];
for (int j = int(1); j < int(n + 1); j++)
for (int i = int(2); i < int(n + 1); i++) a[i][j] += a[i - 1][j];
int mx = 1;
for (int x = sqrt(n); x >= 1; x--) {
if (n % x == 0) {
if (ok(x)) (mx = max(mx, x));
if (ok(n / x)) (mx = max(mx, n / x));
}
}
printf("%d\n", mx);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string conv(char ch);
void solve();
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
void solve() {
int i, j, n, c, x, ind;
int flag = 0;
double avg;
cin >> n;
string s[n], bin;
bool a[n][n];
int row[n][n + 1], pfs[n + 1][n + 1];
vector<int> factors;
for (i = 0; i < n; i++) {
cin >> s[i];
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j += 4) {
bin = conv(s[i][j / 4]);
a[i][j] = bin[0] - '0';
a[i][j + 1] = bin[1] - '0';
a[i][j + 2] = bin[2] - '0';
a[i][j + 3] = bin[3] - '0';
}
}
for (i = 0; i < n; i++) {
row[i][0] = 0;
for (j = 0; j < n; j++) {
row[i][j + 1] = a[i][j] + row[i][j];
}
}
for (i = 0; i < n + 1; i++) {
pfs[0][i] = 0;
pfs[i][0] = 0;
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
pfs[i + 1][j + 1] = pfs[i][j + 1] + row[i][j + 1];
}
}
double sr = sqrt(n);
for (i = 1; i <= sr; i++) {
if (n % i == 0) {
factors.push_back(i);
if (i != sr) factors.push_back(n / i);
}
}
sort(factors.begin(), factors.end());
for (ind = factors.size() - 1; ind != -1; ind--) {
x = factors[ind];
flag = 0;
for (i = 0; i < n; i += x) {
for (j = 0; j < n; j += x) {
avg = pfs[i + x][j + x] - pfs[i + x][j] - pfs[i][j + x] + pfs[i][j];
avg /= (x * x);
if (avg != 1 && avg != 0) {
flag = 1;
break;
}
}
if (flag) break;
}
if (!flag) {
cout << x;
return;
}
}
}
string conv(char ch) {
switch (ch) {
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";
default:
return "";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 5201;
bitset<N> a[N];
int n;
int s[N][N];
void p() {
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) cout << (a[i][j] ? 1 : 0) << " \n"[j == n - 1];
}
void load(int ix) {
string s;
cin >> s;
for (int i = 0; i < (n / 4); i++) {
int x = isdigit(s[i]) ? (s[i] - '0') : (s[i] - 'A' + 10);
for (int j = 3; j >= 0; j--, x >>= 1)
a[ix][4 * i + j] = (x & 1) ? true : false;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) load(i);
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
s[i + 1][j + 1] = s[i + 1][j] + s[i][j + 1] - s[i][j] + (a[i][j] ? 1 : 0);
int x;
for (x = n; x > 1; x--) {
if (n % x != 0) continue;
bool isOk = true;
for (int i = 0; i + x <= n && isOk; i += x)
for (int j = 0; j + x <= n && isOk; j += x) {
int z = s[i + x][j + x] - s[i + x][j] - s[i][j + x] + s[i][j];
isOk = (z == x * x || z == 0);
}
if (isOk) break;
}
cout << x << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T1, class T2>
ostream& operator<<(ostream& out, pair<T1, T2>& p) {
out << p.first << ' ' << p.second;
}
template <class T>
istream& operator>>(istream& in, vector<T>& v) {
for (auto& x : v) in >> x;
return in;
}
template <class T>
ostream& operator<<(ostream& out, vector<T>& v) {
for (auto x : v) out << x << ' ';
return out;
}
int n;
bool A[5200][5200];
int dp[5200][5200], dp1[5200][5200];
vector<int> v;
string s;
int maxm = 1;
bool check(int x) {
bool f = 0;
for (long long i = (0); i < (n / x); ++i) {
for (long long j = (0); j < (n / x); ++j) {
if (dp[(i + 1) * x - 1][(j + 1) * x - 1] < x &&
dp1[(i + 1) * x - 1][(j + 1) * x - 1] < x) {
f = 1;
}
}
}
if (f) return 0;
return 1;
}
int main() {
iostream::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
cin >> n;
for (long long i = (0); i < (n); ++i) {
cin >> s;
for (long long j = (0); j < ((int)s.size()); ++j) {
int nm;
if (s[j] >= 'A' && s[j] <= 'F')
nm = 10 + (s[j] - 'A');
else
nm = s[j] - '0';
while (nm > 0) {
v.push_back(nm % 2);
nm /= 2;
}
while ((int)v.size() < 4) v.push_back(0);
reverse((v).begin(), (v).end());
int cnt = 0;
for (long long k = (0); k < (4); ++k) {
A[i][j * 4 + cnt] = v[cnt];
cnt++;
}
v.clear();
}
}
for (long long i = (0); i < (n); ++i) {
dp[0][i] = A[0][i];
dp1[0][i] = 1 - A[0][i];
}
for (long long i = (0); i < (n); ++i) {
dp[i][0] = A[i][0];
dp1[i][0] = 1 - A[i][0];
}
for (long long i = (1); i < (n); ++i) {
for (long long j = (1); j < (n); ++j) {
if (A[i][j] == 1) {
dp[i][j] = min(min(dp[i - 1][j], dp[i][j - 1]), dp[i - 1][j - 1]) + 1;
} else
dp1[i][j] =
min(min(dp1[i - 1][j], dp1[i][j - 1]), dp1[i - 1][j - 1]) + 1;
}
}
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
if (check(i)) maxm = max(maxm, i);
if (i * i != n)
if (check(n / i)) maxm = max(maxm, n / i);
}
}
cout << maxm << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
string htb(char s) {
if (s == '0')
return "0000";
else if (s == '1')
return "0001";
else if (s == '2')
return "0010";
else if (s == '3')
return "0011";
else if (s == '4')
return "0100";
else if (s == '5')
return "0101";
else if (s == '6')
return "0110";
else if (s == '7')
return "0111";
else if (s == '8')
return "1000";
else if (s == '9')
return "1001";
else if (s == 'A')
return "1010";
else if (s == 'B')
return "1011";
else if (s == 'C')
return "1100";
else if (s == 'D')
return "1101";
else if (s == 'E')
return "1110";
else
return "1111";
}
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<vector<int>> m(n + 1, vector<int>(n + 1, 0));
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n / 4; j++) {
char c;
cin >> c;
string s = htb(c);
m[i][4 * j - 3] = s[0] - '0';
m[i][4 * j - 2] = s[1] - '0';
m[i][4 * j - 1] = s[2] - '0';
m[i][4 * j] = s[3] - '0';
}
}
for (int i = 2; i < n + 1; i++) {
m[i][1] += m[i - 1][1];
m[1][i] += m[1][i - 1];
}
for (int i = 2; i < n + 1; i++)
for (int j = 2; j < n + 1; j++)
m[i][j] += m[i][j - 1] + m[i - 1][j] - m[i - 1][j - 1];
int y = 1, t = 0;
for (int x = 2; x < n + 1; x++) {
t = 0;
if (n % x == 0)
for (int i = 1; i <= n / x; i++) {
for (int j = 1; j <= n / x; j++) {
int it = i * x, jt = j * x, u;
u = m[it][jt] - m[it][jt - x] - m[it - x][jt] + m[it - x][jt - x];
if (u != x * x && u != 0) {
t = 1;
break;
}
}
if (t == 1) break;
}
if (t == 0 && n % x == 0) y = x;
}
cout << y;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long matrix[5205][5205];
long long hti(char h) {
if (isdigit(h)) {
return h - '0';
}
return (h - 'A') + 10;
}
long long func(long long x, long long y, long long d) {
long long v = matrix[x][y];
if (x - d >= 0) {
v -= matrix[x - d][y];
}
if (y - d >= 0) {
v -= matrix[x][y - d];
}
if (x - d >= 0 && y - d >= 0) {
v += matrix[x - d][y - d];
}
return v;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n;
cin >> n;
for (long long i = 0; i < n; i++) {
string s;
cin >> s;
reverse(s.begin(), s.end());
for (long long j = 0; j < n; j++) {
matrix[i][j] = (hti(s[j / 4]) >> j % 4) & 1;
}
}
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < n; j++) {
if (i == 0) {
if (j > 0) {
matrix[i][j] += matrix[i][j - 1];
}
} else if (j == 0) {
matrix[i][j] += matrix[i - 1][j];
} else {
matrix[i][j] +=
matrix[i][j - 1] + matrix[i - 1][j] - matrix[i - 1][j - 1];
}
}
}
for (long long x = n; x >= 1; x--) {
if (n % x == 0) {
bool f = true;
for (long long i = x - 1; i < n && f; i += x) {
for (long long j = x - 1; j < n && f; j += x) {
long long sum = func(i, j, x);
if (sum != (x * x) && sum != 0) {
f = false;
}
}
}
if (f) {
cout << x << "\n";
break;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int n;
short arr[5202][5202];
short check1[5202][5202];
int check(int k) {
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 (arr[i][j] != arr[p][q]) return 0;
}
}
}
}
return 1;
}
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cin >> n;
map<char, string> m;
m['A'] = "1010";
m['B'] = "1011";
m['C'] = "1100";
m['D'] = "1101";
m['E'] = "1110";
m['F'] = "1111";
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['0'] = "0000";
string s;
for (int i = 1; i <= n; i++) {
cin >> s;
string val = "";
for (int i = 0; i < s.length(); i++) val += m[s[i]];
for (int j = 1; j <= n; j++) arr[i][j] = val[j - 1] - 48;
}
vector<int> div;
for (int i = 1; i <= n; i++) {
if (n % i == 0) div.push_back(i);
}
int high = div.size() - 1;
int max = 0;
while (high >= 0) {
if (check(div[high])) {
cout << div[high];
return 0;
}
high--;
}
}
|
#include <bits/stdc++.h>
using namespace std;
string s[5205];
int n;
int a[5205][5205];
vector<int> ve;
void check(int x) {
int j = 0;
for (; j < n; j++) {
if (s[j] != s[j / x * x]) break;
}
if (j == n) ve.push_back(x);
}
int main() {
std::ios::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < n; j++) {
a[i][j + 1] =
(s[i][j / 4] <= '9')
? (((int(s[i][j / 4] - '0')) >> (3 - j + j / 4 * 4)) & 1)
: (((int(s[i][j / 4] - 'a' + 10)) >> (3 - j + j / 4 * 4)) & 1);
}
for (int j = 1; j <= n; j++) {
a[i][j] = a[i][j - 1] + a[i][j];
}
}
for (int i = sqrt(n); i > 1; i--) {
if (n % i) continue;
check(i);
check(n / i);
}
check(n);
sort(ve.begin(), ve.end());
bool f = 0;
for (int i = ve.size() - 1; i >= 0; i--) {
int t = ve[i];
f = 1;
for (int i = 0; i < n; i += t) {
for (int j = 0; j <= n - t; j += t) {
if (a[i][j + t] - a[i][j] != t && a[i][j + t] - a[i][j] != 0) {
f = 0;
break;
}
}
if (!f) break;
}
if (f) {
cout << t << endl;
break;
}
}
if (!f) cout << 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
void faster() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
const int maxn = 5e3 + 2e2 + 1;
const long long inf = 1e18;
const long long mod = 1e9 + 7;
const long double pi = acos(-1);
long long n, a[maxn][maxn];
string s;
int main() {
faster();
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> s;
int x;
for (int j = 0; j < n / 4; ++j) {
if ('A' <= s[j] && s[j] <= 'F')
x = 10 + (s[j] - 'A');
else
x = s[j] - '0';
for (int k = 0; k < 4; ++k) a[i][j * 4 + (3 - k) + 1] = (x >> k) & 1;
}
}
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];
}
}
for (int k = n; k >= 1; --k) {
if ((n % k) != 0) continue;
bool u = 0;
for (int i = 1; i <= n; i += k) {
for (int j = 1; j <= n; j += k) {
int res = (a[i + k - 1][j + k - 1] + a[i - 1][j - 1] -
a[i + k - 1][j - 1] - a[i - 1][j + k - 1]);
if (res != 0 && res != k * k) {
u = 1;
break;
}
}
if (u) break;
}
if (!u) {
cout << k;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int const N = 1e6 + 100;
long long int const LINF = numeric_limits<long long int>::max();
int const INF = numeric_limits<int>::max();
int const BN = 31;
long long int gcd(long long int a, long long int b) {
return b ? gcd(b, a % b) : a;
}
long long int pow_mod(long long int a, long long int e, long long int m) {
long long int res = 1;
while (e) {
if (e & 1) res = res * a % m;
a = a * a % m;
e >>= 1;
}
return res;
}
long long int inv_mod(long long int b, long long int m) {
b %= m;
long long int x = 0, y = 1, r, q, a = m;
while (b) {
q = a / b;
r = a % b;
a = b;
b = r;
r = x;
x = y;
y = r - q * y;
}
x += m;
return x % m;
}
int row_gcd(string str[], int n) {
int ret = 0;
for (int i = 0; i < n; i++) {
char ch = 'a';
int cnt = 0;
for (int j = 0; j < n; j++) {
if (ch != str[i][j]) {
ret = gcd(ret, cnt);
cnt = 1;
} else
cnt++;
ch = str[i][j];
}
ret = gcd(ret, cnt);
}
return ret;
}
int col_gcd(string str[], int n) {
int ret = 0;
for (int j = 0; j < n; j++) {
char ch = 'a';
int cnt = 0;
for (int i = 0; i < n; i++) {
if (ch != str[i][j]) {
ret = gcd(ret, cnt);
cnt = 1;
} else
cnt++;
ch = str[i][j];
}
ret = gcd(ret, cnt);
}
return ret;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n;
string mat[n];
m = n / 4;
for (int i = 0; i < n; i++) {
string str;
cin >> str;
mat[i] = "";
for (int j = 0; j < m; j++) {
if (str[j] <= '9') {
mat[i] += bitset<4>(str[j] - '0').to_string();
} else {
mat[i] += bitset<4>(str[j] - 'A' + 10).to_string();
}
}
}
int g1 = row_gcd(mat, n);
int g2 = col_gcd(mat, n);
int ans = gcd(n, gcd(g1, g2));
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[1500];
bool S[5205][5205];
int N, sum[5205][5205];
int f(char x) {
if (x <= '9') return x - '0';
return x - 'A' + 10;
}
bool p(int x) {
if (x > N) return 1;
for (int i = 1; i <= N; i += x) {
for (int j = 1; j <= N; j += x) {
int a = i + x - 1, b = j + x - 1;
int t = sum[a][b] - sum[a][j - 1] - sum[i - 1][b] + sum[i - 1][j - 1];
if (t != x * x && t) return 1;
}
}
return 0;
}
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i) {
scanf("%s", s + 1);
for (int j = 1; j <= N; ++j) {
S[i][j] = (f(s[(j + 3) / 4]) >> ((j + 3) % 4)) & 1;
if (j % 4 == 0)
swap(S[i][j], S[i][j - 3]), swap(S[i][j - 1], S[i][j - 2]);
}
}
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] + S[i][j];
}
}
for (int i = N; i; --i)
if (N % i == 0 && p(i) == 0) return !printf("%d", i);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
long long MODpow(long long input, long long n, long long difference) {
long long res = 1, y = input;
while (n > 0) {
if (n & 1) res = (res * y) % difference;
y = (y * y) % difference;
n /= 2;
}
return res % difference;
}
template <class T>
T _abs(T n) {
return (n < 0 ? -n : n);
}
template <class T>
T _max(T input, T b) {
return (!(input < b) ? input : b);
}
template <class T>
T _min(T input, T b) {
return (input < b ? input : b);
}
template <class T>
T gcd(T input, T b) {
return (b != 0 ? gcd<T>(b, input % b) : input);
}
template <class T>
T lcm(T input, T b) {
return (input / gcd<T>(input, b) * b);
}
inline int fi() {
int n = 0;
int ch = getchar();
while (ch < '0' || ch > '9') ch = getchar();
while (ch >= '0' && ch <= '9')
n = (n << 3) + (n << 1) + ch - '0', ch = getchar();
return n;
}
inline void fo(int input) {
char snum[20];
int iterator = 0;
do {
snum[iterator++] = input % 10 + 48;
input = input / 10;
} while (input != 0);
iterator = iterator - 1;
while (iterator >= 0) putchar(snum[iterator--]);
putchar('\n');
}
const int MOD = 1e9 + 7, INF = 1e9, MAXN = 5205;
const long long INFLL = 1e18;
const long long unsigned INFLLU = 18446744073709551615ULL;
const long double EPS = 1e-12;
inline int inv(int input, int p = MOD) { return MODpow(input, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline void addMOD(int& input, int val, int p = MOD) {
if ((input = (input + val)) >= p) input -= p;
}
inline void subMOD(int& input, int val, int p = MOD) {
if ((input = (input - val)) < 0) input += p;
}
int n;
int preSum[MAXN][MAXN];
bitset<MAXN> input[MAXN];
int hex_to_int(char hex) { return isdigit(hex) ? hex - '0' : hex - 'A' + 10; }
int getsum(int r1, int r2, int c1, int c2) {
return preSum[r2][c2] - preSum[r2][c1] - preSum[r1][c2] + preSum[r1][c1];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
char str[MAXN];
for (int i = 0; i < n; i++) {
cin >> str;
reverse(str, str + n / 4);
for (int j = 0; j < n; j++)
input[i][j] = (hex_to_int(str[j / 4]) >> j % 4) & 1;
}
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
preSum[i + 1][j + 1] =
preSum[i + 1][j] + preSum[i][j + 1] - preSum[i][j] + input[i][j];
for (int x = n; x > 0; x--) {
if (n % x == 0) {
bool good = false;
for (int i = 0; i < n && !good; i += x) {
for (int j = 0; j < n && !good; j += x) {
int sum = getsum(i, i + x, j, j + x);
if (sum != x * x && sum != 0) good = true;
}
}
if (!good) {
cout << x << endl;
return 0;
}
}
}
cerr << "Time elapsed :" << clock() * 1000.0 / CLOCKS_PER_SEC << " ms"
<< '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int LONG_INT_MAX = 1000000000000005;
long long int mod = 998244353;
long long int mod1 = 1e9 + 7;
int a[5205][5205];
bool check(int b, int n) {
for (int i = 0; i < n; i += b) {
for (int j = 0; j < n; j += b) {
int type = -1;
for (int k = 0; k < b; k++) {
for (int l = 0; l < b; l++) {
if (type == -1) {
type = a[i + k][j + l];
} else {
if (type != a[i + k][j + l]) {
return false;
}
}
}
}
}
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n / 4; j++) {
char c;
cin >> c;
int val;
if (c <= '9' && c >= '0') {
val = c - '0';
} else {
val = c - 'A' + 10;
}
int base = 8;
int inp;
int cnt = 0;
while (val != 0) {
if (val >= base) {
inp = 1;
val -= base;
} else {
inp = 0;
}
a[i][j * 4 + cnt] = inp;
cnt++;
base /= 2;
}
}
}
vector<int> fac;
for (int i = 1; i < sqrt(n); i++) {
if (n % i == 0) {
fac.push_back(i);
fac.push_back(n / i);
}
}
if (sqrt(n) * sqrt(n) == n) {
fac.push_back(sqrt(n));
}
sort(fac.begin(), fac.end());
int low = 0;
for (int i = fac.size() - 1; i >= 0; i--) {
if (check(fac[i], n)) {
low = i;
break;
}
}
cout << fac[low] << endl;
return 0;
}
|
#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;
}
}
vector<int> div;
for (int i = 1; i <= n / i; ++i) {
if (n % i == 0) {
div.push_back(i);
if (n / i != i) div.push_back(n / i);
}
}
sort(div.begin(), div.end(), greater<int>());
for (auto d : div) {
if (d != 1 && check(d)) {
cout << d << '\n';
return 0;
}
}
cout << 1 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(time(0));
const int N = 3e5 + 10;
const int MOD = 1e9 + 7;
int get(char c) { return isdigit(c) ? c - '0' : c - 'A' + 10; }
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<string> s(n);
vector<vector<bool>> a(n, vector<bool>(n));
for (int i = 0; i < n; i++) {
cin >> s[i];
reverse(s[i].begin(), s[i].end());
for (int j = 0; j < n; j++) {
a[i][j] = (get(s[i][j / 4]) >> j % 4) & 1;
}
}
vector<vector<int>> c(n + 1, vector<int>(n + 1));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
c[i + 1][j + 1] = c[i + 1][j] + c[i][j + 1] - c[i][j] + a[i][j];
}
}
for (int x = n; x > 0; x--) {
if (n % x == 0) {
bool ok = 1;
for (int i = 0; i < n && ok; i += x) {
for (int j = 0; j < n & ok; j += x) {
int r1 = i, r2 = i + x, c1 = j, c2 = j + x;
int cur = c[r2][c2] - c[r1][c2] - c[r2][c1] + c[r1][c1];
if (cur != x * x && cur != 0) ok = 0;
}
}
if (ok) {
cout << x << '\n';
return 0;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int i, j, k, ii, jj, cnt = 0;
int ar[5250];
char mtx[5250][5250];
vector<int> v;
char* getBin(char c) {
switch (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() {
int n;
scanf("%d", &n);
getchar();
for (i = 1; i * i < n; i++)
if (n % i == 0) v.push_back(i), v.push_back(n / i);
if (i * i == n) v.push_back(i);
sort(v.rbegin(), v.rend());
char c;
for (i = 1; i < n + 1; i++) {
for (j = 1; j < n / 4 + 1; j++) {
c = getchar();
string tps = getBin(c);
for (k = (j - 1) * 4 + 1; k < (j - 1) * 4 + 5; k++)
mtx[i][k] = tps[(k + 3) % 4];
}
getchar();
}
int pos = 0x3f3f3f3f;
for (i = 1; i < n + 1; i++) {
cnt = 0;
char ini = mtx[i][1];
for (j = 1; j < n + 1; j++) {
if (mtx[i][j] == ini)
cnt++;
else
pos = min(cnt, pos), cnt = 1, ini = mtx[i][j];
}
pos = min(cnt, pos);
}
for (k = 0; k < v.size(); k++) {
if (v[k] > pos) continue;
int div = n / v[k];
for (i = 0; i < div; i++)
for (j = 0; j < div; j++) {
char x = mtx[i * v[k] + 1][j * v[k] + 1];
for (ii = i * v[k] + 1; ii < i * v[k] + v[k] + 1; ii++)
for (jj = j * v[k] + 1; jj < j * v[k] + 1 + v[k]; jj++) {
if (mtx[ii][jj] != x)
i = div + 1, j = div + 1, ii = 0x3f3f3f3f, jj = 0x3f3f3f3f;
}
}
if (i == div && j == div) printf("%d\n", v[k]), exit(0);
}
return ~~(0 ^ 0 ^ 0);
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0) return a;
a %= b;
return gcd(b, a);
}
string conv(string k) {
string s, fn = "";
for (auto c : k) {
switch (c) {
case '0':
s = "0000";
break;
case '1':
s = "0001";
break;
case '2':
s = "0010";
break;
case '3':
s = "0011";
break;
case '4':
s = "0100";
break;
case '5':
s = "0101";
break;
case '6':
s = "0110";
break;
case '7':
s = "0111";
break;
case '8':
s = "1000";
break;
case '9':
s = "1001";
break;
case 'A':
s = "1010";
break;
case 'B':
s = "1011";
break;
case 'C':
s = "1100";
break;
case 'D':
s = "1101";
break;
case 'E':
s = "1110";
break;
case 'F':
s = "1111";
break;
}
fn += s;
}
return fn;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<string> s;
for (unsigned long long i = 0; i < n; i++) {
string kk;
cin >> kk;
kk = conv(kk);
s.push_back(kk);
}
long long gr = 0;
for (int i = 0; i < n; i++) {
int cnt = 1;
for (int j = 1; j < n; j++) {
if (s[i][j] == s[i][j - 1])
cnt++;
else {
gr = gcd(gr, cnt);
cnt = 1;
}
}
gr = gcd(gr, cnt);
}
for (int i = 0; i < n; i++) {
int cnt = 1;
for (int j = 1; j < n; j++) {
if (s[j][i] == s[j - 1][i])
cnt++;
else {
gr = gcd(gr, cnt);
cnt = 1;
}
}
gr = gcd(gr, cnt);
}
cout << gr << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
bool a[5210][5210];
int sum[5210][5210];
char str[1310];
void ji_su_shuang_du() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%s", str + 1);
for (int j = 1; j <= n / 4; j++) {
int num = (str[j] < 'A' ? str[j] - '0' : str[j] - 'A' + 10);
for (int k = 3; k >= 0; k--) a[i][j * 4 - k] = (num & (1 << k) ? 1 : 0);
}
}
}
void getsum() {
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];
}
bool check(int x) {
for (int i = x; i <= n; i += x) {
for (int j = x; j <= n; j += x) {
int x2 = i, y2 = j;
int x1 = i - x + 1, y1 = j - x + 1;
int s =
sum[x2][y2] - sum[x1 - 1][y2] - sum[x2][y1 - 1] + sum[x1 - 1][y1 - 1];
if (s != 0 && s != x * x) return false;
}
}
cout << x << endl;
return true;
}
int main() {
ji_su_shuang_du();
getsum();
for (int x = n; x >= 1; x--)
if (n % x == 0 && check(x)) break;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 100005;
void inp_out() {}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
inp_out();
{
long long i, j, k, n, m, ans = 0, cnt = 0, sum = 0;
cin >> n;
string s[n];
for (i = 0; i < n; i++) {
cin >> s[i];
}
long long a[n][n];
for (i = 0; i < n; i++) {
long long p = 0;
for (j = 0; j < n / 4; j++) {
long long x;
(s[i][j] >= 'A' and s[i][j] <= 'F') ? x = s[i][j] - 55
: x = s[i][j] - '0';
for (k = 0; k < 4; k++) {
a[i][p + k] = (1 & (x >> (4 - k - 1)));
}
p += 4;
}
}
for (i = 0; i < n; i++) {
for (j = 1; j < n; j++) {
a[i][j] += a[i][j - 1];
}
}
for (i = 1; i < n; i++) {
for (j = 0; j < n; j++) {
a[i][j] += a[i - 1][j];
}
}
ans = 1;
for (k = 2; k <= n; k++) {
if (n % k) continue;
bool f = 1;
for (i = k - 1; i < n; i += k) {
for (j = k - 1; j < n; j += k) {
long long temp = a[i][j];
if (i - k >= 0) {
temp -= a[i - k][j];
}
if (j - k >= 0) {
temp -= a[i][j - k];
}
if (i - k >= 0 && j - k >= 0) {
temp += a[i - k][j - k];
}
if (temp != 0 and temp != k * k) {
f = 0;
}
}
}
if (f == 1) ans = max(ans, k);
}
cout << ans;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s[5200];
int dp[5200][5200];
string expand_string(string& s) {
int digit;
string tmp2 = "";
for (char c : s) {
if (c >= 'A' && c <= 'Z')
digit = c - 'A' + 10;
else
digit = c - '0';
string tmp = "";
for (int cn = 0; cn < 4; ++cn) {
tmp += (digit & 1 ? '1' : '0');
digit >>= 1;
}
reverse(tmp.begin(), tmp.end());
tmp2 += tmp;
}
return tmp2;
}
int main(int argc, char const* argv[]) {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> s[i];
}
for (int i = 0; i < n; ++i) {
string a = expand_string(s[i]);
for (int j = 0; j < n; ++j) {
dp[i][j] = a[j] == '1' ? 1 : 0;
if (i > 0) dp[i][j] += dp[i - 1][j];
if (j > 0) dp[i][j] += dp[i][j - 1];
if (i > 0 && j > 0) dp[i][j] -= dp[i - 1][j - 1];
}
}
int ans = 1;
for (int d = 2; d < n + 1; ++d) {
if (n % d != 0) continue;
int flag = 1;
for (int i = 0; i < n; i += d)
for (int j = 0; j < n; j += d) {
int ones = dp[i + d - 1][j + d - 1];
if (i > 0) ones -= dp[i - 1][j + d - 1];
if (j > 0) ones -= dp[i + d - 1][j - 1];
if (i > 0 && j > 0) ones += dp[i - 1][j - 1];
int zeros = d * d - ones;
if (ones == d * d || zeros == d * d)
;
else
flag &= 0;
}
ans = flag ? d : ans;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5205;
bitset<maxn> matrix[maxn];
int re_sum[maxn][maxn];
int convert(char x) { return isdigit(x) ? x - '0' : x - 'A' + 10; }
int get_sum(int r1, int r2, int c1, int c2) {
return re_sum[r2][c2] - re_sum[r1][c2] - re_sum[r2][c1] + re_sum[r1][c1];
}
char data[maxn];
int n;
int main(int argc, const char* argv[]) {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%s", data);
reverse(data, data + n / 4);
for (int j = 0; j < n; ++j)
matrix[i][j] = (convert(data[j / 4]) >> j % 4) & 1;
}
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
re_sum[i + 1][j + 1] =
re_sum[i + 1][j] + re_sum[i][j + 1] - re_sum[i][j] + matrix[i][j];
for (int x = n; x; --x)
if (n % x == 0) {
int tag = 1;
for (int i = 0; i < n && tag; i += x)
for (int j = 0; j < n && tag; j += x) {
int sum = get_sum(i, i + x, j, j + x);
if (sum != x * x && sum) tag = 0;
}
if (tag) {
cout << x << endl;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int TESTS = 1;
while (TESTS--) {
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";
char s[n][n];
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < n / 4; j++) {
char c;
cin >> c;
for (long long k = 0; k < 4; k++) s[i][4 * j + k] = m[c][k];
}
}
long long sum[n + 1][n + 1];
for (long long i = 0; i < n + 1; i++)
for (long long j = 0; j < n + 1; j++) sum[i][j] = 0;
for (long long i = 1; i < n + 1; i++)
for (long long j = 1; j < n + 1; j++) {
sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1];
if (s[i - 1][j - 1] == '1') sum[i][j]++;
}
vector<long long> f;
for (long long i = 1; i < sqrt(n) + 1; i++) {
if (n % i == 0) {
f.push_back(i);
f.push_back(n / i);
}
}
sort((f).begin(), (f).end());
reverse((f).begin(), (f).end());
long long z = (long long)f.size();
long long ans = 1;
for (long long k = 0; k < z; k++) {
long long len = f[k];
long long x = 1;
for (long long i = len; i <= n; i += len)
for (long long j = len; j <= n; j += len) {
if ((sum[i][j] - sum[i - len][j] - sum[i][j - len] +
sum[i - len][j - len]) %
(len * len))
x = 0;
}
if (x) {
cout << len;
return 0;
}
}
cout << ans;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline unsigned long long int GCD(unsigned long long int a,
unsigned long long int b) {
while (b != 0) {
unsigned long long int t = a % b;
a = b;
b = t;
}
return a;
}
inline unsigned long long int LCM(unsigned long long int a,
unsigned long long int b) {
return a * b / GCD(a, b);
}
int N;
char field[5555][5555];
bool solve2(int le) {
int rcnt = N / le;
for (int i = 0; i < rcnt * rcnt; i++) {
int si = i / rcnt * le, sj = i % rcnt * le;
char pos = field[si][sj];
for (int ii = si; ii < si + le; ii++) {
for (int jj = sj; jj < sj + le; jj++) {
if (field[ii][jj] != pos) {
return false;
}
}
}
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
;
cin >> (N);
for (int i = 0; i < N; i++) {
string x;
cin >> x;
for (int j = 0; j < N / 4; j++) {
int k;
if (x[j] >= '0' && x[j] <= '9') {
k = x[j] - '0';
} else {
k = x[j] - 'A' + 10;
}
field[i][j * 4] = (k & 8) >> 3;
field[i][j * 4 + 1] = (k & 4) >> 2;
field[i][j * 4 + 2] = (k & 2) >> 1;
field[i][j * 4 + 3] = k & 1;
}
}
vector<int> divv;
for (int i = 1; i <= N; i++) {
if (N % i == 0) divv.push_back(i);
}
long long int asns = 1;
for (int i = 0; i < divv.size(); i++) {
if (solve2(divv[i])) {
asns = divv[i];
}
}
return cout << asns, 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int inf = 1e9;
const long long llf = 1e18;
const int mod = 1e9 + 7;
const int maxn = 5e5 + 10;
int n, m;
int p[maxn];
vector<int> f[maxn];
vector<int> q;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> p[i];
}
for (int i = 1, u, v; i <= m; i++) {
cin >> u >> v;
f[u].push_back(v);
}
for (int i = 1; i <= n; i++) {
sort(f[i].begin(), f[i].end());
}
q.push_back(p[n]);
int ans = 0;
for (int i = n - 1; i >= 1; i--) {
int flag = 1;
for (int x : q) {
auto it = lower_bound(f[p[i]].begin(), f[p[i]].end(), x);
if (it != f[p[i]].end() && *it == x) {
} else {
q.push_back(p[i]);
flag = 0;
break;
}
}
if (flag) ans++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:256000000")
using namespace std;
mt19937_64 gen(time(NULL));
int const maxn = 3e5 + 5;
long long idx[maxn];
unordered_map<long long, bool> go[maxn];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
long long m;
cin >> m;
for (long long i = 1; i <= n; i++) {
long long t;
cin >> t;
idx[t] = i;
}
for (long long i = 0; i < m; i++) {
long long u, v;
cin >> u >> v;
if (idx[u] > idx[v])
continue;
else {
u = idx[u];
v = idx[v];
go[u][v] = 1;
}
}
vector<long long> kek = {0};
long long ans = 0;
for (long long i = 1; i <= n; i++) kek.push_back(i);
for (long long i = n - 1; i >= 1; i--) {
long long j = i;
while (j < n && go[kek[j]][kek[j + 1]]) {
if (kek[j + 1] == n) {
ans++;
}
swap(kek[j], kek[j + 1]);
j++;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long inf = 0x3f3f3f3f3f3f3f3f;
const long long mod = 1e9 + 7;
const int N = 4e5 + 10;
int n, m;
int a[N], p[N];
vector<int> G[N];
int vis[N], cnt, ok[N];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]), p[a[i]] = i;
for (int i = 0; i < m; i++) {
int u, v;
scanf("%d%d", &u, &v);
G[u].push_back(v);
if (v == a[n]) vis[u] = 1;
}
ok[a[n]] = 1;
for (int i = n - 1; i >= 1; i--) {
if (vis[a[i]]) {
int su = 0;
for (int v : G[a[i]]) {
if (p[v] > i) {
if (!ok[v]) su++;
}
}
if (cnt + su >= n - i - 1) {
ok[a[i]] = 1;
cnt++;
}
}
}
printf("%d\n", cnt);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const int N = 3 * 1e5 + 5;
int n, m;
int a[N], c[N];
vector<int> b[N];
void work() {
scanf("%d%d", &n, &m);
for (int i = 0; i <= n - 1; ++i) scanf("%d", &a[i]);
for (int i = 0; i <= m - 1; ++i) {
int x, y;
scanf("%d%d", &x, &y);
b[y].push_back(x);
}
int ans = 0;
for (int i = n - 1; i >= 0; --i) {
if (c[a[i]] == n - 1 - i - ans && i != n - 1)
ans++;
else
for (int f : b[a[i]]) c[f]++;
}
printf("%d\n", ans);
}
int main() {
work();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N, M;
int p[500005], fav[500005], u[500005], v[500005], first[500005], nex[500005];
int u1[500005], v1[500005], first1[500005], nex1[500005], tot, tot1;
void add(int x, int y) {
u[++tot] = x;
v[tot] = y;
nex[tot] = first[x];
first[x] = tot;
}
void add1(int x, int y) {
u1[++tot1] = x;
v1[tot1] = y;
nex1[tot1] = first1[x];
first1[x] = tot1;
}
int main() {
int i, j, k;
cin >> N >> M;
for (i = 1; i <= N; i++) {
cin >> p[i];
}
for (j = 1; j <= M; j++) {
int x, y;
cin >> x >> y;
add(x, y);
add1(y, x);
}
for (i = 1; i <= N - 1; i++) {
for (j = first[p[i]]; j; j = nex[j]) {
if (v[j] == p[N]) {
fav[p[i]]++;
}
}
}
int x = 0, ans = 0;
for (i = N - 1; i >= 1; i--) {
if (N - i - x == fav[p[i]]) {
x++;
ans++;
} else {
for (j = first1[p[i]]; j; j = nex1[j]) {
fav[v1[j]]++;
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> p[300003];
set<int> q;
int z[300003], a[300003], ans;
int main() {
ios_base::sync_with_stdio(false);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> a[i];
while (m--) {
int u, v;
cin >> u >> v;
p[v].push_back(u);
}
for (int x : p[a[n - 1]]) q.insert(x);
for (int i = n - 2; i >= 0; i--) {
if (q.find(a[i]) != q.end() && z[a[i]] == n - i - 2 - ans) {
ans++;
} else {
for (int x : p[a[i]]) z[x]++;
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<vector<int> > d(n + 1, vector<int>());
vector<int> order(n);
set<int> good;
vector<int> cnt(n + 1, 0);
for (int i = 0; i < n; i++) {
cin >> order[i];
}
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
if (v == order[n - 1])
good.insert(u);
else
d[v].push_back(u);
}
int ans = 0;
int k = 0;
for (int i = n - 2; i > -1; i--) {
if (good.find(order[i]) != good.end() and cnt[order[i]] >= k) {
ans++;
} else {
k++;
for (int j = 0; j < d[order[i]].size(); j++) {
cnt[d[order[i]][j]]++;
}
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
int p[3 * maxn];
vector<int> g[3 * maxn];
bool marked[3 * maxn];
bool bachahua[3 * maxn];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n = 0, m = 0, x = 0, y = 0;
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
cin >> x;
p[x] = i;
}
for (int i = 0; i < m; ++i) {
cin >> x >> y;
g[p[x]].push_back(p[y]);
if (p[y] == n) marked[p[x]] = true;
}
int res = 0, sz = 0;
for (int i = n - 1; i >= 1; --i) {
if (marked[i]) {
if (sz > (int)g[i].size()) {
bachahua[i] = true;
++sz;
continue;
}
int poss = 0;
for (auto j : g[i])
if (bachahua[j]) ++poss;
if (poss != sz) {
bachahua[i] = true;
++sz;
continue;
}
++res;
} else {
bachahua[i] = true;
++sz;
}
}
cout << res;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxx = 3e5 + 7;
vector<int> G[maxx];
int cnt[maxx];
int a[maxx];
int main() {
int n, m;
int u, v;
while (~scanf("%d%d", &n, &m)) {
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
while (m--) {
scanf("%d%d", &u, &v);
G[v].push_back(u);
}
for (int i = 0; i < G[a[n]].size(); i++) {
cnt[G[a[n]][i]]++;
}
int ans = 0;
for (int i = n - 1; i >= 1; i--) {
if (n - i - ans == cnt[a[i]])
ans++;
else {
for (int j = 0; j < G[a[i]].size(); j++) {
cnt[G[a[i]][j]]++;
}
}
}
printf("%d\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 500005;
int p[N];
set<int> s[N];
vector<int> v;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> p[i];
for (int i = 1; i <= m; i++) {
int x, y;
cin >> x >> y;
s[x].insert(y);
}
int ans = 0;
for (int i = n - 1; i > 0; i--) {
if (s[p[i]].count(p[n])) {
bool s10 = true;
for (int j = 0; j < v.size(); j++)
if (s[p[i]].count(v[j]) == 0) {
s10 = false;
break;
}
if (s10 == false) {
v.push_back(p[i]);
continue;
}
ans++;
continue;
}
v.push_back(p[i]);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline void read(int &x) {
int v = 0, f = 1;
char c = getchar();
while (!isdigit(c) && c != '-') c = getchar();
if (c == '-')
f = -1;
else
v = v * 10 + c - '0';
while (isdigit(c = getchar())) v = v * 10 + c - '0';
x = v * f;
}
inline void read(long long &x) {
long long v = 0ll, f = 1ll;
char c = getchar();
while (!isdigit(c) && c != '-') c = getchar();
if (c == '-')
f = -1;
else
v = v * 10 + c - '0';
while (isdigit(c = getchar())) v = v * 10 + c - '0';
x = v * f;
}
inline void readc(char &x) {
char c;
while ((c = getchar()) == ' ')
;
x = c;
}
inline void writes(string s) { puts(s.c_str()); }
inline void writeln() { writes(""); }
inline void writei(int x) {
if (x < 0) {
putchar('-');
x = abs(x);
}
if (!x) putchar('0');
char a[25];
int top = 0;
while (x) {
a[++top] = (x % 10) + '0';
x /= 10;
}
while (top) {
putchar(a[top]);
top--;
}
}
inline void writell(long long x) {
if (x < 0) {
putchar('-');
x = abs(x);
}
if (!x) putchar('0');
char a[25];
int top = 0;
while (x) {
a[++top] = (x % 10) + '0';
x /= 10;
}
while (top) {
putchar(a[top]);
top--;
}
}
int n, m, i, j, x, y, p[300005], f[300005], ans;
set<int> s[300005];
vector<int> all;
int main() {
ios_base::sync_with_stdio(false);
;
cin >> n >> m;
for (((i)) = (1); ((i)) <= ((n)); ((i))++) {
cin >> x;
p[x] = i;
}
for (((i)) = (1); ((i)) <= ((m)); ((i))++) {
cin >> x >> y;
x = p[x];
y = p[y];
s[x].insert(y);
}
all.push_back(n);
for (((i)) = ((n - 1)); ((i)) >= (1); ((i))--) {
for (j = 0; j < all.size(); j++)
if (!s[i].count(all[j])) break;
if (j == all.size())
ans++;
else
all.push_back(i);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, m, q, k;
string s;
int MOD = 1e9 + 7;
const int INF = 1e9;
const long long INF64 = 2e18;
const double PI = 3.141592653589793238463;
long long ar[500004], br[500004], vis[500004];
map<int, int> cmap[5004];
vector<long long> gr[500004], vec;
set<long long> myset;
map<string, long long> mymap;
string st1[3004];
vector<long long> arr[500004];
int comp(pair<long long, long long> a, pair<long long, long long> b) {
return a.second < b.second;
}
int mycomp1(long long a, long long b) { return a > b; }
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long A[1000][1000], B[1000][1000];
int main() {
std::ios_base::sync_with_stdio(false);
cin >> n >> m;
for (int i = 0; i < int(n); i++) cin >> ar[i];
for (int i = 0; i < int(m); i++) {
long long u, v;
cin >> u >> v;
gr[u].push_back(v);
}
reverse(ar, ar + n);
long long c = 0;
for (int i = 1; i < n; i++) {
long long r = ar[i], cc = 0;
for (int j = 0; j < gr[r].size(); j++) {
if (gr[r][j] == ar[0] || br[gr[r][j]]) cc++;
}
if (cc != c + 1) {
br[r] = 1;
c++;
}
}
return cout << n - 1 - c, 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 7;
const int MAXK = 1e5 + 3;
const int Candy = 1e7;
const int mod = 1e9 + 7;
const long long inf = 1ll << 55;
const double pi = 3.1415926535897932384626433;
const long double eps = 1e-12;
template <typename T = int>
T gi() {
T x = 0, o = 1;
char ch = getchar();
while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
if (ch == '-') o = -1, ch = getchar();
while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
return x * o;
}
long long fast_pow(int a, int b) {
long long res = a, ret = 1;
while (b > 0) {
if (b % 2) ret = (ret * res) % mod;
res = (res * res) % mod;
b /= 2;
}
return ret;
}
long long fact(long long n) {
if (n == 1 || n == 0) return 1;
return ((n % mod) * (fact(n - 1) % mod) % mod);
}
long long nCk(long long n, long long r) {
return (fact(n) * fast_pow((fact(r) * fact(n - r)) % mod, mod - 2)) % mod;
}
vector<int> g[N];
int n, m, a[N], br[N], x = 1, ans;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 0; i < n; ++i) cin >> a[i];
for (int i = 0; i < m; ++i) {
int u, v;
cin >> u >> v;
g[v].push_back(u);
}
for (int i = 0; i < ((int)(g[a[n - 1]]).size()); ++i) br[g[a[n - 1]][i]]++;
for (int i = (n - 2); i >= (0); --i) {
if (br[a[i]] == x)
ans++;
else {
for (int j = 0; j < ((int)(g[a[i]]).size()); ++j) br[g[a[i]][j]]++;
x++;
}
}
cout << ans;
return (!false && !true) || ((long long)((long long)(1713 + 2377 + 1464) *
(long long)(1713 + 2377 + 1464) *
(long long)(1713 + 2377 + 1464)) !=
(long long)(171323771464));
}
|
#include <bits/stdc++.h>
using namespace std;
const long mm = 998244353;
const int maxn = 200005;
template <class TYPE>
TYPE gcd(TYPE x, TYPE y) {
if (y)
return gcd(y, x % y);
else
return x;
}
template <class TYPE>
TYPE lcm(TYPE x, TYPE y) {
TYPE t = gcd(x, y);
return t ? (x / t * y) : 0;
}
map<int, bool> mp[300005];
int n, m;
int *p;
bool solve(int i, int x) {
if (i < 0) return false;
for (int j = i; j >= 0; j--) {
if (mp[p[j]][x] == true) {
bool check = true;
for (int kk = j + 1; kk <= i; kk++) {
if (mp[p[j]][p[kk]] == false) {
check = false;
break;
}
}
if (check == true) {
for (int kk = j; kk < i; kk++) {
swap(p[kk], p[kk + 1]);
}
return true;
}
}
}
return false;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
p = new int[n];
for (int i = 0; i < n; i++) cin >> p[i];
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
mp[x][y] = true;
}
int cnt = 0;
for (int i = n - 1; i > 0; i--) {
if (solve(i - 1, p[i]) == true) {
cnt++;
swap(p[i - 1], p[i]);
} else
break;
}
cout << cnt;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int pos[1000001];
set<int, greater<int> > after[1000001], before[1000001];
int main() {
ios::sync_with_stdio(false);
;
cin.tie(0);
;
int i, j, n, m, x, y, cur, ans = 0;
cin >> n >> m;
for (i = 1; i <= n; i++) {
cin >> x;
pos[x] = i;
}
for (i = 1; i <= m; i++) {
cin >> x >> y;
if (pos[x] < pos[y]) {
after[pos[x]].insert(pos[y]);
before[pos[y]].insert(pos[x]);
}
}
cur = n;
for (auto x : before[n]) {
if (after[x].size() != cur - x) continue;
cur--;
ans++;
for (auto y : before[x]) after[y].erase(x);
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {}
const long long MAXN = (long long)3e5 + 69;
vector<long long> G[MAXN];
long long p[MAXN];
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long n, m;
cin >> n >> m;
for (long long i = 1; i <= n; i++) {
cin >> p[i];
}
for (long long i = 1; i <= m; i++) {
long long u, v;
cin >> u >> v;
G[u].emplace_back(v);
}
long long ans = 0;
set<long long> S = {p[n]};
for (long long i = n - 1; i >= 1; i--) {
long long s = 0;
for (long long x : G[p[i]]) {
if (S.count(x)) s++;
}
if (s == (long long)S.size()) {
ans++;
} else {
S.emplace(p[i]);
}
}
cout << ans << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fll;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> idtP(n);
vector<int> pIdt(n);
for (int I = 0; I < n; I++) {
cin >> idtP[I];
idtP[I]--;
pIdt[idtP[I]] = I;
}
vector<set<int> > volta(n);
set<pair<int, int> > ultimoViz;
int u, v;
for (int I = 0; I < m; I++) {
cin >> u >> v;
u--;
v--;
volta[u].insert(v);
}
set<int> naoDa;
for (int I = n - 2; I >= 0; I--) {
if (volta[idtP[I]].find(idtP[n - 1]) == volta[idtP[I]].end()) {
naoDa.insert(idtP[I]);
} else {
if (volta[idtP[I]].size() >= naoDa.size()) {
int cont = 0;
for (int el : volta[idtP[I]]) {
if (naoDa.find(el) != naoDa.end()) {
cont++;
}
}
if (cont != naoDa.size()) {
naoDa.insert(idtP[I]);
}
} else {
naoDa.insert(idtP[I]);
}
}
}
cout << n - 1 - naoDa.size() << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int read() {
int w = 0, f = 1;
char c = ' ';
while (c < '0' || c > '9') c = getchar(), f = c == '-' ? -1 : f;
while (c >= '0' && c <= '9') w = w * 10 + c - 48, c = getchar();
return w * f;
}
int n, m, a[500005], b[500005], ans;
vector<int> e[500005];
signed main() {
n = read(), m = read();
for (int i = 1; i <= n; i++) a[i] = read();
int x, y;
for (int i = 1; i <= m; i++) {
x = read(), y = read();
e[y].push_back(x);
}
for (int i = n; i > 0; i--) {
if (b[a[i]] == n - i - ans && i != n)
ans++;
else
for (auto j : e[a[i]]) b[j]++;
}
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 300010;
int cnt[maxn];
vector<int> c[maxn];
int a[maxn];
int main() {
int n, m, x, y;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int i = 1; i <= m; i++) {
scanf("%d%d", &x, &y);
c[y].push_back(x);
}
for (int i = 0; i < c[a[n]].size(); i++) cnt[c[a[n]][i]]++;
int ans = 0;
for (int i = n - 1; i >= 1; i--) {
if (n - i - ans == cnt[a[i]])
ans++;
else {
for (int j = 0; j < c[a[i]].size(); j++) cnt[c[a[i]][j]]++;
}
}
printf("%d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
const int mod = 1e9 + 7;
const double eps = 1e-8;
int n, m;
int p[maxn];
set<int> to[maxn];
void solve() {
vector<int> sk;
int nb = p[n];
for (int i = n - 1; i >= 1; i--) {
bool flag = false;
flag |= !to[nb].count(p[i]);
for (auto iter = sk.begin(); iter != sk.end() && !flag; iter++) {
flag |= !to[*iter].count(p[i]);
}
if (flag) sk.push_back(p[i]);
}
cout << n - 1 - sk.size() << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> p[i];
}
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
to[v].insert(u);
}
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> arr;
vector<unordered_set<int> > gr;
int solve(int pos) {
int ans = 0;
for (int i = pos - 1; i >= 0; --i)
if (gr[arr[i]].count(arr[pos])) {
bool ok = true;
for (int j = i + 1; j < pos; ++j)
if (!gr[arr[i]].count(arr[j])) {
ok = false;
break;
}
if (ok) {
++ans;
swap(arr[i], arr[pos - 1]);
swap(arr[pos], arr[pos - 1]);
--pos;
}
}
return ans;
}
int main() {
int n, m;
cin >> n >> m;
arr.resize(n);
gr.resize(n);
for (int i = 0; i < n; ++i) {
cin >> arr[i];
--arr[i];
}
for (int i = 0; i < m; ++i) {
int a, b;
cin >> a >> b;
gr[a - 1].insert(b - 1);
}
cout << solve(n - 1) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[300004];
int num[300004];
vector<int> v[300004];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
}
int x, y;
while (m--) {
scanf("%d%d", &x, &y);
v[y].push_back(x);
}
memset(num, 0, sizeof(num));
for (int i = 0; i < v[a[n]].size(); ++i) {
num[v[a[n]][i]]++;
}
int ans = 0;
for (int i = n - 1; i >= 1; --i) {
if (num[a[i]] == n - ans - i)
ans++;
else {
for (int j = 0; j < v[a[i]].size(); ++j) {
num[v[a[i]][j]]++;
}
}
}
printf("%d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int sum(long long a) {
int sum = 0;
while (a > 0) {
sum = sum + (a % 10);
a = a / 10;
}
return sum;
}
int count_digit(long long n) {
int count = 0;
while (n > 0) {
n = n / 10;
count++;
}
return count;
}
int binarySearch(int x, int y, long long z, long long v[]) {
int low = x;
int high = y;
int mid = x + (y - x) / 2;
while (low <= high) {
if (v[mid] == z) return mid;
if (v[mid] < z) return binarySearch(mid + 1, high, z, v);
if (v[mid] > z) return binarySearch(low, mid - 1, z, v);
}
return -1;
}
long long modularExponentiation(long long x, long long n, long long M) {
if (n == 0)
return 1;
else if (n % 2 == 0)
return modularExponentiation((x * x) % M, n / 2, M);
else
return (x * modularExponentiation((x * x) % M, (n - 1) / 2, M)) % M;
}
long long binaryExponentiation(long long x, long long n) {
if (n == 0)
return 1;
else if (n % 2 == 0)
return binaryExponentiation(x * x, n / 2);
else
return x * binaryExponentiation(x * x, (n - 1) / 2);
}
int binary(int n) {
int c = 0;
while (n > 0) {
if (n % 2 == 1) {
return pow(2, c);
}
n = n / 2;
c++;
}
}
set<long long> s;
void genrate(long long n, int len, int max) {
if (len > max) return;
s.insert(n);
genrate(n * 10 + 1, len + 1, max);
genrate(n * 10 + 0, len + 1, max);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tests = 1;
while (tests--) {
int n, m;
cin >> n >> m;
vector<int> v(n + 1);
v[0] = 0;
set<int> s[n + 1];
for (int i = 1; i <= n; i++) cin >> v[i];
for (int j = 0; j < m; j++) {
int x, y;
cin >> x >> y;
s[x].insert(y);
}
int X = v[n];
for (int i = n; i >= 1; i--) {
int ptr = i;
while (ptr + 1 <= n && s[v[ptr]].find(v[ptr + 1]) != s[v[ptr]].end()) {
swap(v[ptr], v[ptr + 1]);
ptr++;
}
}
for (int i = 1; i <= n; i++) {
if (v[i] == X) {
cout << n - i;
exit(0);
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
int p[300005];
vector<int> G[300005];
int in[300005];
int ans;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", &p[i]);
for (int i = 1; i <= m; i++) {
int u, v;
scanf("%d%d", &u, &v);
G[u].push_back(v);
}
in[p[n]] = 1;
int ct2 = 1;
for (int i = n - 1; i >= 1; i--) {
int u = p[i];
int ct = 0;
for (auto v : G[u]) {
if (in[v]) ct++;
}
if (ct == ct2) {
ans++;
} else {
in[u] = 1;
ct2++;
}
}
printf("%d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 300005;
int n, m, a[N];
vector<int> adj[N], f(N, 0);
int main(int argc, char const *argv[]) {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
}
for (int i = 0; i < m; ++i) {
int u, v;
scanf("%d %d", &u, &v);
adj[u].push_back(v);
}
int ans = 0, d = 1;
f[a[n]] = 1;
for (int i = n - 1; i >= 1; --i) {
int c = 0;
for (int v : adj[a[i]]) {
c += (f[v] == 1);
}
if (c == d)
ans++;
else {
f[a[i]] = 1;
d++;
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int p[300010];
set<long long int> a[300010];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n, m, i, u, v, j;
cin >> n >> m;
for (i = 1; i <= n; i++) {
cin >> p[i];
}
for (i = 0; i < m; i++) {
cin >> u >> v;
a[v].insert(u);
}
set<long long int> *cur_set = &a[p[n]];
set<long long int> *new_set;
long long int c = 0;
for (j = n - 1; j >= 1; j--) {
i = p[j];
if (cur_set->count(i)) {
c++;
} else {
new_set = new set<long long int>;
set_intersection(cur_set->begin(), cur_set->end(), a[i].begin(),
a[i].end(), inserter(*new_set, new_set->begin()));
swap(new_set, cur_set);
}
}
cout << c << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
long long n, m;
cin >> n >> m;
long long arr[n + 1];
bool in_suffix[n + 1];
for (int i = 1; i <= n; ++i) {
cin >> arr[i];
in_suffix[i] = false;
}
vector<long long> swap[n + 1];
for (int i = 0; i < m; i++) {
long long u, v;
cin >> u >> v;
swap[u].push_back(v);
}
vector<long long> suffix;
suffix.reserve(n);
suffix.push_back(arr[n]);
in_suffix[arr[n]] = true;
int count = 0;
for (int i = n - 1; i > 0; i--) {
int cnt2 = 0;
for (int j = 0; j < swap[arr[i]].size(); j++) {
if (in_suffix[swap[arr[i]][j]] == true) {
cnt2++;
}
}
if (cnt2 == suffix.size()) {
count++;
} else {
in_suffix[arr[i]] = true;
suffix.push_back(arr[i]);
}
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double pi = 3.14159265358979323846;
#pragma GCC optimize("-O2")
template <class T>
using min_heap = priority_queue<T, std::vector<T>, std::greater<T> >;
const int LM = 3e5;
int a[LM + 2], pos[LM + 2], marked[LM + 2], ans, n, m;
vector<int> adj[LM + 2];
int main() {
ios_base::sync_with_stdio(0);
cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
pos[a[i]] = i;
}
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
}
for (int i = 0; i <= n - 2; i++) {
int ps = n - 1 - i, cn = 0;
for (auto u : adj[a[ps]]) {
if (pos[u] > ps and !marked[u]) {
cn++;
}
}
if (cn == i + 1 - ans) {
ans++;
marked[a[ps]] = 1;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 10;
vector<int> v[maxn];
bool mark[maxn];
int p[maxn];
int n;
int m;
inline void input();
inline void ok_ans();
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
input();
ok_ans();
}
inline void input() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> p[i];
}
for (int i = 1; i <= m; i++) {
int l;
int r;
cin >> l >> r;
v[l].push_back(r);
}
}
inline void ok_ans() {
mark[p[n]] = 1;
int ans = 0;
for (int i = n - 1; i >= 1; i--) {
int j = 0;
for (int k = 0; k < v[p[i]].size(); k++) {
if (mark[v[p[i]][k]] == true) {
j++;
}
}
if (j == n - i - ans) {
ans++;
} else {
mark[p[i]] = true;
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
int n, m;
const int maxn = 3e5 + 10;
int idx[maxn];
set<int> st[maxn];
int a[maxn];
int vis[maxn];
int main() {
scanf("%d%d", &n, &m);
for (int i = (1); i < (n + 1); i++) {
int x;
scanf("%d", &x);
a[i] = x;
idx[x] = i;
}
for (int i = (0); i < (m); i++) {
int x, y;
scanf("%d%d", &x, &y);
st[x].insert(y);
if (y == a[n]) vis[x] = 1;
}
for (int i = (n - 1 - 1); i >= (1); i--) {
if (vis[a[i]] == 0) continue;
int t = i;
while (t < n - 1 && st[a[t]].find(a[t + 1]) != st[a[t]].end()) {
swap(a[t], a[t + 1]);
t++;
}
}
int ans = 0;
for (int i = (n - 1); i >= (1); i--) {
if (vis[a[i]] == 0) break;
ans++;
}
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
template <class T>
T gcd(T a, T b) {
T r;
while (b != 0) {
r = a % b;
a = b;
b = r;
}
return a;
}
template <class T>
T lcm(T a, T b) {
return a / gcd(a, b) * b;
}
using namespace std;
const long long MOD = 1e18;
long long n, m, k, t, dd[300005], a[300005], ans, cnt;
vector<int> p[300005];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
p[v].push_back(u);
}
for (int i = n; i >= 1; i--) {
if (dd[a[i]] == cnt && i != n) {
ans++;
continue;
}
for (auto j : p[a[i]]) dd[j]++;
cnt++;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 300000;
int n, m;
unordered_map<int, int> id;
vector<int> adj[MAXN];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
id[x] = i;
}
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
adj[id[u]].push_back(id[v]);
}
for (int i = 0; i < n; i++) {
sort(adj[i].begin(), adj[i].end());
}
int cur = n - 1;
vector<bool> behind(n, false);
for (int i = n - 2; i >= 0; i--) {
if (adj[i].empty()) {
continue;
}
int s = (int)adj[i].size();
int ch = 0;
for (int j : adj[i]) {
if (j < i || behind[j]) {
continue;
}
ch++;
}
if (ch == cur - i) {
cur--;
behind[i] = true;
}
}
cout << n - 1 - cur << '\n';
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.