problem_id stringlengths 6 6 | language stringclasses 2
values | original_status stringclasses 3
values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3
values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270
values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03230 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (... | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (... | replace | 45 | 48 | 45 | 48 | 0 | |
p03230 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
#define COUT(x)... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
#define COUT(x)... | replace | 103 | 105 | 103 | 106 | 0 | |
p03230 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
typedef pair<int, int> P;
const int MOD = 1000000007;
const ll INF = 1e16;
const double EPS =... | #include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
typedef pair<int, int> P;
const int MOD = 1000000007;
const ll INF = 1e16;
const double EPS =... | replace | 39 | 40 | 39 | 40 | 0 | |
p03230 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define pb... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define pb... | replace | 48 | 49 | 48 | 49 | 0 | |
p03230 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int f = -1;
for (int i = 1; i < 1000; i++) {
if (n == i * (i + 1) / 2) {
f = i;
}
}
if (f == -1) {
cout << "No" << endl;
return 0;
} else {
cout << "Yes" << endl;
cout << f + 1 << endl;
int cnt = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int f = -1;
for (int i = 1; i < 1000; i++) {
if (n == i * (i + 1) / 2) {
f = i;
}
}
if (f == -1) {
cout << "No" << endl;
return 0;
} else {
cout << "Yes" << endl;
cout << f + 1 << endl;
int cnt = ... | replace | 18 | 19 | 18 | 19 | 0 | |
p03230 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); +... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); +... | replace | 20 | 21 | 20 | 21 | 0 | |
p03231 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
#define int long long
#define end \
getchar(); ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
#define int long long
#define end \
getchar(); ... | replace | 84 | 85 | 84 | 85 | TLE | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
i... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
i... | replace | 26 | 27 | 26 | 27 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5;
char s[maxn + 10];
char t[maxn + 10];
int n, m;
int main() {
while (cin >> n >> m) {
scanf("%s", s + 1);
scanf("%s", t + 1);
ll lcm = 1ll * n * m / __gcd(n, m);
ll nn = lcm / n;
ll mm = lcm / m;
ll sum = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5;
char s[maxn + 10];
char t[maxn + 10];
int n, m;
int main() {
while (cin >> n >> m) {
scanf("%s", s + 1);
scanf("%s", t + 1);
ll lcm = 1ll * n * m / __gcd(n, m);
ll nn = lcm / n;
ll mm = lcm / m;
ll sum = ... | replace | 16 | 17 | 16 | 19 | 0 | |
p03231 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (long long i = 0; i < (ll)(n); i++)
using namespace std;
ll gcd(ll a, ll b) {
if (a < b) {
ll t = a;
a = b;
b = t;
}
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return ((ll)(a * b)) / gcd(a, b); }
int main... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (long long i = 0; i < (ll)(n); i++)
using namespace std;
ll gcd(ll a, ll b) {
if (a < b) {
ll t = a;
a = b;
b = t;
}
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return ((ll)(a * b)) / gcd(a, b); }
int main... | replace | 25 | 34 | 25 | 33 | TLE | |
p03231 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <s... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <s... | insert | 96 | 96 | 96 | 105 | TLE | |
p03231 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int)x.size())
#define pb push_back
#define mp make_pai... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int)x.size())
#define pb push_back
#define mp make_pai... | replace | 42 | 47 | 42 | 48 | TLE | |
p03231 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | replace | 102 | 103 | 102 | 103 | 0 | |
p03231 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace ... | #include <algorithm>
#include <bitset>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace ... | replace | 63 | 64 | 63 | 64 | TLE | |
p03231 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
template <typename F, typename S>
std::ostream &operator<<(ostream &os, const ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
template <typename F, typename S>
std::ostream &operator<<(ostream &os, const ... | replace | 48 | 53 | 48 | 53 | TLE | |
p03231 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (ll i = j; i < (n); i++)
#define CLR(mat, f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a <= x && x < b)
#define out(ans) cout << ans << endl
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
const int INF = 1000000;
const... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (ll i = j; i < (n); i++)
#define CLR(mat, f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a <= x && x < b)
#define out(ans) cout << ans << endl
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
const int INF = 1000000;
const... | replace | 30 | 41 | 30 | 43 | TLE | |
p03231 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
long int N, M, k, l;
cin >> N >> M;
char s[N], t[M];
long int LCM, gameover = 0;
for (int i = 0; i < N; i++) {
cin >> s[i];
}
for (int i = 0; i < M; i++) {
cin >> t[i];
}
if (M >= N) {
k = M;
l = N;
} else {
k = N;
l = M;
... | #include <iostream>
using namespace std;
int main() {
long int N, M, k, l;
cin >> N >> M;
char s[N], t[M];
long int LCM, gameover = 0;
for (int i = 0; i < N; i++) {
cin >> s[i];
}
for (int i = 0; i < M; i++) {
cin >> t[i];
}
if (M >= N) {
k = M;
l = N;
} else {
k = N;
l = M;
... | replace | 57 | 58 | 57 | 58 | 0 | |
p03231 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
typedef long long ll;
const int mod = 1e+9 + 7;
int main() {
ll N, M;
cin >> N >> M;
string S, T;
cin >> S >> T;
ll lcm = N / __gcd(N, M) * M;
ll g = __gcd(N, M);
/*vecto... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
typedef long long ll;
const int mod = 1e+9 + 7;
int main() {
ll N, M;
cin >> N >> M;
string S, T;
cin >> S >> T;
ll lcm = N / __gcd(N, M) * M;
ll g = __gcd(N, M);
/*vecto... | replace | 38 | 39 | 38 | 39 | 0 | |
p03231 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <stdio.h>
#define ll long long
using namespace std;
const int N = 200100, P = 998244353;
inline int read() {
int x = 0, f = 0, c = getchar();
for (; c > '9' || c < '0'; f = c == '-', c = getchar())
;
for (; c >= '0' && c <= '9'; c = getchar())
x = (x << 1) ... | #include <algorithm>
#include <cstring>
#include <stdio.h>
#define ll long long
using namespace std;
const int N = 200100, P = 998244353;
inline int read() {
int x = 0, f = 0, c = getchar();
for (; c > '9' || c < '0'; f = c == '-', c = getchar())
;
for (; c >= '0' && c <= '9'; c = getchar())
x = (x << 1) ... | replace | 25 | 26 | 25 | 26 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
#define debug(x) cout << #x << " = " << x << endl
#define fori(i, ini, lim) for (int i = int(ini); i < int(lim); i++)
#define ford(i, ini, lim) for (int i = int(ini); i >= int(lim); i--)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
ll gcd(ll ... | #include <bits/stdc++.h>
#define debug(x) cout << #x << " = " << x << endl
#define fori(i, ini, lim) for (int i = int(ini); i < int(lim); i++)
#define ford(i, ini, lim) for (int i = int(ini); i >= int(lim); i--)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
ll gcd(ll ... | delete | 23 | 24 | 23 | 23 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, ans = -1;
cin >> N >> M;
string s, t;
cin >> s >> t;
long long L, a = N, b = M, c = a % b;
while (c != 0) {
a = b, b = c, c = a % b;
}
L = N * M / b;
int x = L / N, y = L / M, z = min(N / y, M / x);
for (int i = 0; i < z; i++) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, M, ans = -1;
cin >> N >> M;
string s, t;
cin >> s >> t;
long long L, a = N, b = M, c = a % b;
while (c != 0) {
a = b, b = c, c = a % b;
}
L = N * M / b;
int x = L / N, y = L / M, z = min(N / y, M / x);
for (int i = 0; i < z;... | replace | 3 | 4 | 3 | 4 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
string S, T;
int main() {
long long N, M;
scanf("%lld%lld", &N, &M);
cin >> S >> T;
if (N > M)
swap(N, M), swap(S, T);
long long G = __gcd(N, M);
long long ans = N / G * M;
long long sg = ans / N, tg = ans / M, si = 0, ti = 0;
while (si < ans && ti < a... | #include <bits/stdc++.h>
using namespace std;
string S, T;
int main() {
long long N, M;
scanf("%lld%lld", &N, &M);
cin >> S >> T;
if (N > M)
swap(N, M), swap(S, T);
long long G = __gcd(N, M);
long long ans = N / G * M;
long long sg = ans / N, tg = ans / M, si = 0, ti = 0;
while (si < ans && ti < a... | replace | 15 | 16 | 15 | 16 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
ll m, n;
cin >> m >> n;
string s, t;
cin >> s >> t;
if (m < n) {
string u = s;
s = t;
t = u;
ll o... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
ll m, n;
cin >> m >> n;
string s, t;
cin >> s >> t;
if (m < n) {
string u = s;
s = t;
t = u;
ll o... | replace | 45 | 46 | 45 | 46 | 0 | |
p03231 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
typedef long long ll;
int gcd(int a, int b) {
if (a < b) {
int tmp = a;
a = b;
b = tmp;
}
if (b == 0) ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
typedef long long ll;
int gcd(int a, int b) {
if (a < b) {
int tmp = a;
a = b;
b = tmp;
}
if (b == 0) ... | replace | 37 | 38 | 37 | 41 | TLE | |
p03231 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a > b)
return gcd(b, a);
if (b % a == 0)
return a;
return gcd(a, b - a);
}
int main() {
int n, m;
cin >> n >> m;
string s1, s2;
cin >> s1 >> s2;
int x = gcd(n, m);
long long lcm = ((long long)n * m) / x;
... | #include <iostream>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a > b)
return gcd(b, a);
if (b % a == 0)
return a;
return gcd(a, b - a);
}
int main() {
int n, m;
cin >> n >> m;
string s1, s2;
cin >> s1 >> s2;
int x = gcd(n, m);
long long lcm = ((long long)n * m) / x;
... | insert | 19 | 19 | 19 | 27 | 0 | |
p03231 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for (int i = 1; ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for (int i = 1; ... | replace | 34 | 35 | 34 | 35 | 0 | |
p03231 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
long long gcd(long long x, long long y) {
while (y != 0) {
long long tmp = x;
x = y;
y = tmp % y;
}
return x;
}
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
char s[100001];
char t[100001];
int main() {
long l... | #include <algorithm>
#include <iostream>
using namespace std;
long long gcd(long long x, long long y) {
while (y != 0) {
long long tmp = x;
x = y;
y = tmp % y;
}
return x;
}
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
char s[100001];
char t[100001];
int main() {
long l... | replace | 24 | 25 | 24 | 25 | 0 | |
p03231 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
typedef long long ll;
const int mod = 1e+9 + 7;
int main() {
ll N, M;
cin >> N >> M;
string S, T;
cin >> S >> T;
ll lcm = N / __gcd(N, M) * M;
ll g = __gcd(N, M);
/*vecto... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
typedef long long ll;
const int mod = 1e+9 + 7;
int main() {
ll N, M;
cin >> N >> M;
string S, T;
cin >> S >> T;
ll lcm = N / __gcd(N, M) * M;
ll g = __gcd(N, M);
/*vecto... | replace | 38 | 39 | 38 | 39 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, M;
string S, T;
cin >> N >> M >> S >> T;
long L = (N * M) / __gcd(N, M);
vector<char> data(L, '0');
for (int i = 0; i < N; i++) {
data.at(i * L / N) = S.at(i);
}
int flag = 1;
for (int i = 0; i < M; i++) {
if (data.at(i * L / M... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, M;
string S, T;
cin >> N >> M >> S >> T;
long L = (N * M) / __gcd(N, M);
long npl = 0, mpl = 0, flag = 1;
while (npl != N && mpl != M) {
if (npl * L / N == mpl * L / M) {
if (S.at(npl) != T.at(mpl)) {
flag = 0;
brea... | replace | 7 | 16 | 7 | 20 | 0 | |
p03231 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <math.h>
using namespace std;
const int MAXN = 1e7 + 10;
int N, M;
char S[MAXN], T[MAXN];
inline bool check() {
register int i, j;
int K = 1ll * N * M / __gcd(N, M);
int n = K / N, m = K / M;
swap(n, m);
for (i = 1, j = 1;... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <math.h>
using namespace std;
const int MAXN = 1e7 + 10;
int N, M;
char S[MAXN], T[MAXN];
inline bool check() {
register int i, j;
long long K = 1ll * N * M / __gcd(N, M);
long long n = K / N, m = K / M;
swap(n, m);
for (i... | replace | 13 | 15 | 13 | 15 | 0 | |
p03231 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
long long gcd(long long a, long long b) {
long long t = 1;
while (b) {
t = b;
b = a % b;
a = t;
}
return t;
}
int main() {
long long n, m;
string s, t;
while (scanf("%lld%lld", &n, &m) != EOF) {
cin >> s >> t;
long long L = n *... | #include <cstdio>
#include <iostream>
using namespace std;
long long gcd(long long a, long long b) {
long long t = 1;
while (b) {
t = b;
b = a % b;
a = t;
}
return t;
}
int main() {
long long n, m;
string s, t;
while (scanf("%lld%lld", &n, &m) != EOF) {
cin >> s >> t;
long long L = n *... | replace | 27 | 28 | 27 | 28 | 0 | |
p03231 | C++ | Runtime Error | #include <cstdio>
#include <map>
#define int long long
#define RI register int
#define CI const int &
using namespace std;
const int N = 100005;
int n, m, l;
char s[N], t[N];
map<int, char> res;
inline int gcd(CI n, CI m) { return m ? gcd(m, n % m) : n; }
signed main() {
RI i;
scanf("%lld%lld%s%s", &n, &m, s + 1, t... | #include <cstdio>
#include <map>
#define int long long
#define RI register int
#define CI const int &
using namespace std;
const int N = 100005;
int n, m, l;
char s[N], t[N];
map<int, char> res;
inline int gcd(CI n, CI m) { return m ? gcd(m, n % m) : n; }
signed main() {
RI i;
scanf("%lld%lld%s%s", &n, &m, s + 1, t... | replace | 15 | 19 | 15 | 19 | 0 | |
p03231 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <utility>
#include <vector>
#define ALL(obj) (obj).be... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <utility>
#include <vector>
#define ALL(obj) (obj).be... | replace | 83 | 84 | 83 | 84 | 0 | |
p03231 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
... | replace | 32 | 38 | 32 | 37 | TLE | |
p03231 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll, ll>
#define FOR(I, A, B) for (ll I = ll(A); I < ll(B); ++I)
#define FORR(I, A, B) for (ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x, t, f) ((x) ? (t) : (f))
#define SORT(x) (sort(x.begin(), x.end())) // 0 2 2 3 4 5 8 9
#define POS... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll, ll>
#define FOR(I, A, B) for (ll I = ll(A); I < ll(B); ++I)
#define FORR(I, A, B) for (ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x, t, f) ((x) ? (t) : (f))
#define SORT(x) (sort(x.begin(), x.end())) // 0 2 2 3 4 5 8 9
#define POS... | insert | 54 | 54 | 54 | 56 | TLE | |
p03231 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <numeric>
typedef long long int ll;
typedef unsigned long long int ull;
#define rep(i, n) for (auto i = 0; i < (n); i++)
using namespace std;
ll gcd(ll m, ll n) {
if (m == 0)
return 0;
if (n == 0)
return 0;
while (m != n) {
if (m > n)
m = m - n;
else
... | #include <bits/stdc++.h>
#include <numeric>
typedef long long int ll;
typedef unsigned long long int ull;
#define rep(i, n) for (auto i = 0; i < (n); i++)
using namespace std;
ll gcd(ll m, ll n) {
if (m == 0)
return 0;
if (n == 0)
return 0;
while (m != n) {
if (m > n)
m = m - n;
else
... | replace | 84 | 91 | 84 | 88 | TLE | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, a, b) for (long long i = a; i < b; ++i)
#define rrep(i, a, b) for (int i = a; i >= b; --i)
#define yesno(flag) \
if (flag) \
c... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, a, b) for (long long i = a; i < b; ++i)
#define rrep(i, a, b) for (int i = a; i >= b; --i)
#define yesno(flag) \
if (flag) \
c... | replace | 37 | 38 | 37 | 38 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, m;
cin >> n >> m;
string s, t;
cin >> s >> t;
ll lcm = (n * m) / __gcd(n, m);
string ans;
ans.resi... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, m;
cin >> n >> m;
string s, t;
cin >> s >> t;
ll gcd = __gcd(n, m);
ll lcm = (n * m) / gcd;
n /= g... | replace | 13 | 30 | 13 | 19 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) {
ll p = max(x, y);
ll q = min(x, y);
while (p % q != 0) {
p %= q;
ll temp = q;
q = p;
p = temp;
}
return q;
}
int main() {
bool ans = true;
ll n, m;
cin >> n >> m;
string s, t;
cin >> s >> t;
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) {
ll p = max(x, y);
ll q = min(x, y);
while (p % q != 0) {
p %= q;
ll temp = q;
q = p;
p = temp;
}
return q;
}
int main() {
bool ans = true;
ll n, m;
cin >> n >> m;
string s, t;
cin >> s >> t;
i... | replace | 24 | 25 | 24 | 25 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cstdint>
#include <vector>
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define RFOR(i, l, r) for (int i = (l); i >= (int)(r); i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, n - 1, 0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf... | #include <bits/stdc++.h>
#include <cstdint>
#include <vector>
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define RFOR(i, l, r) for (int i = (l); i >= (int)(r); i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, n - 1, 0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf... | replace | 20 | 29 | 20 | 24 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n, m;
string s, t;
cin >> n >> m >> s >> t;
ll ans = n / __gcd(n, m) * m;
ll a = ans / n, b = ans / m;
for (ll i = 0, j = 0; i < n; i += b, j += a) {
if (s[i] != t[j])
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n, m;
string s, t;
cin >> n >> m >> s >> t;
ll g = __gcd(n, m);
ll ans = n / g * m;
for (int i = 0, j = 0; i < n; i += n / g, j += m / g) {
if (s[i] != t[j])
ans = ... | replace | 9 | 12 | 9 | 12 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef unsigned long ul;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long> vl;
typedef vector<double> vd;
typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef pair<... | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef unsigned long ul;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long> vl;
typedef vector<double> vd;
typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef pair<... | replace | 28 | 133 | 28 | 990 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
string s, t;
cin >> n >> m >> s >> t;
long long l = n * m / (__gcd(n, m));
string ans(l, '1');
for (int i = 0; i < n; i++) {
int j = i * (l / n) + 1;
ans[j - 1] = s[i];
}
for (int i = 0; i < m; i++) {
int j = i * (l /... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
string s, t;
cin >> n >> m >> s >> t;
long long l = n * m / __gcd(n, m);
for (long long i = 0; i < m; i++) {
long long j = i * (l / m);
if (j % (l / n) == 0 and s[j / (l / n)] != t[i]) {
cout << -1 << endl;
return 0... | replace | 6 | 17 | 6 | 10 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
// #pragma comment(linker,"/STACK:1024000000,1024000000")
// 251103FD
// 4008802802
// 4008160009
// 1175114440
using namespace std;
#define PB pop_back
#define PF pop_front
#define np next_permutation
#define eb emplace_back
#define pb push_back
#define bf push_front
#define mp make_pair
#defi... | #include <bits/stdc++.h>
// #pragma comment(linker,"/STACK:1024000000,1024000000")
// 251103FD
// 4008802802
// 4008160009
// 1175114440
using namespace std;
#define PB pop_back
#define PF pop_front
#define np next_permutation
#define eb emplace_back
#define pb push_back
#define bf push_front
#define mp make_pair
#defi... | replace | 50 | 51 | 50 | 51 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
string s, t;
cin >> s >> t;
int an = n * m / __gcd(n, m);
if (n > m)
swap(n, m), swap(s, t);
for (int i = 0; i < n; i++)
if (i * (an / n) % (an / m) == 0)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
int32_t main() {
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
string s, t;
cin >> s >> t;
int an = n * m / __gcd(n, m);
if (n > m)
swap(n, m), swap(s, t);
for (int i = 0; i < n; i++)
if (i * (a... | replace | 5 | 6 | 5 | 8 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2000100;
typedef long long int ll;
ll N, M;
char S[maxn], T[maxn];
ll gcd(ll m, ll n) { return (0 == n) ? m : gcd(n, m % n); }
int main(void) {
scanf("%lld%lld", &N, &M);
scanf("%s", S);
scanf("%s", T);
ll g = gcd(N, M);
ll l = N * M / g;
l... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2000100;
typedef long long int ll;
ll N, M;
char S[maxn], T[maxn];
ll gcd(ll m, ll n) { return (0 == n) ? m : gcd(n, m % n); }
int main(void) {
scanf("%lld%lld", &N, &M);
scanf("%s", S);
scanf("%s", T);
ll g = gcd(N, M);
ll l = N * M / g;
l... | replace | 21 | 22 | 21 | 22 | 0 | |
p03231 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#includ... | replace | 77 | 78 | 77 | 78 | -11 | |
p03231 | C++ | Runtime Error | #include <iostream>
using namespace std;
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
long long lcm(long long x, long long y) { return x * y / gcd(x, y); }
long long N, M;
string S, T;
int main() {
cin >> N >> M >> S >> T;
long long L = lcm(N, M);
string X(L, '*');
for (int i = 0; i... | #include <iostream>
using namespace std;
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
long long lcm(long long x, long long y) { return x * y / gcd(x, y); }
long long N, M;
string S, T;
int main() {
cin >> N >> M >> S >> T;
long long L = lcm(N, M), n = N / gcd(N, M), m = M / gcd(N, M);
... | replace | 8 | 14 | 8 | 11 | 0 | |
p03231 | C++ | Time Limit Exceeded | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <string>
using namespace std;
#define pi 3.14159265
int gcd(int m, int n) {
// 引数に０がある場合は０を返す
if ((0 == m) || (0 == n))
return 0;
// ユークリッドの方法
while (m != n) {
if (m > n)
m = m - n;
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <string>
using namespace std;
#define pi 3.14159265
int gcd(int m, int n) {
// 引数に０がある場合は０を返す
if ((0 == m) || (0 == n))
return 0;
// ユークリッドの方法
while (m != n) {
if (m > n)
m = m - n;
... | replace | 36 | 41 | 36 | 37 | TLE | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vll = vector<vl>;
using vb = vector<bool>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using psi = pair<string, int>;
using pii = pair<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vll = vector<vl>;
using vb = vector<bool>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using psi = pair<string, int>;
using pii = pair<... | replace | 57 | 59 | 57 | 59 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define int long long
#define P pair<long, long>
#define all(a) a.begin(), a.end()
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
signed main() {
int n, m;
string s, t;
cin >> n >> m... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define int long long
#define P pair<long, long>
#define all(a) a.begin(), a.end()
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
signed main() {
int n, m;
string s, t;
cin >> n >> m... | replace | 17 | 23 | 17 | 21 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long n, m, l;
string s1, s2;
char x[999800010];
int gcd(int a, int b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
long long lcm(long a, long b) { return a / gcd(a, b) * b; }
int main() {
cin >> n >> m >> s1 >> s2;
l = lcm(n, m);
for (int... | #include <bits/stdc++.h>
using namespace std;
long long n, m, l;
string s1, s2;
map<int, char> x;
int gcd(int a, int b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
long long lcm(long a, long b) { return a / gcd(a, b) * b; }
int main() {
cin >> n >> m >> s1 >> s2;
l = lcm(n, m);
for (int ... | replace | 6 | 7 | 6 | 7 | -11 | |
p03231 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (ll i = j; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define INF (1000000000)
#define MOD (1000000007)
#define MAX (100000)
#define pii pair<int, int>
/////////////////////////////////////////////////////////
class XY... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (ll i = j; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define INF (1000000000)
#define MOD (1000000007)
#define MAX (100000)
#define pii pair<int, int>
/////////////////////////////////////////////////////////
class XY... | replace | 78 | 100 | 78 | 82 | TLE | |
p03231 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#ifdef __DEBUG__
#define DBG(X) cout << #X << " = " << (X) << endl;
#define SAY(X) cout << (X) << endl;
#else
#define DBG(X)
#define SAY(X)
#endif
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll =... | #include <bits/stdc++.h>
#ifdef __DEBUG__
#define DBG(X) cout << #X << " = " << (X) << endl;
#define SAY(X) cout << (X) << endl;
#else
#define DBG(X)
#define SAY(X)
#endif
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll =... | replace | 75 | 83 | 75 | 82 | TLE | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rep(i, s, N) for (ll i{s}; i < N; i++)
#define rem(i, N, s) for (ll i{N}; i > s; i--)
using namespace std;
using ll = long long int;
using ld = long double;
using P = pair<ll, ll>;
const int MOD = (int)1e9 + 7;
const... | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rep(i, s, N) for (ll i{s}; i < N; i++)
#define rem(i, N, s) for (ll i{N}; i > s; i--)
using namespace std;
using ll = long long int;
using ld = long double;
using P = pair<ll, ll>;
const int MOD = (int)1e9 + 7;
const... | replace | 106 | 111 | 106 | 109 | 0 | |
p03231 | C++ | Time Limit Exceeded | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
#define P pair<int, int>
#define rep(i,... | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
#define P pair<int, int>
#define rep(i,... | replace | 202 | 209 | 202 | 207 | TLE | |
p03231 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
long long int A, a, n, m, y, s;
string str_1, str_2, str_3;
long long int x[2][30000];
int gcd(int m, int n) {
if (m % n == 0)
return n;
m... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
long long int A, a, n, m, y, s;
string str_1, str_2, str_3;
long long int x[2][30000];
int gcd(int m, int n) {
while (true) {
if (m % n == 0... | replace | 16 | 22 | 16 | 24 | 0 | |
p03231 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll lcm(ll m, ll n) { // 最小公倍数
if (0 == m || 0 == n)
return 0;
return ((m / __gcd(m, n)) * n);
}
int main() {
ll N, M, L, a, b;
cin >> N >> M;
string S, T;
cin >> S >> T;
L = lcm(N, M);
a = L / N;
b = L / M;
// SはX[0], X[a], X... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll lcm(ll m, ll n) { // 最小公倍数
if (0 == m || 0 == n)
return 0;
return ((m / __gcd(m, n)) * n);
}
int main() {
ll N, M, L, a, b;
cin >> N >> M;
string S, T;
cin >> S >> T;
L = lcm(N, M);
a = L / N;
b = L / M;
// SはX[0], X[a], X... | replace | 26 | 27 | 26 | 27 | TLE | |
p03231 | C++ | Runtime Error | // warm heart, wagging tail,and a smile just for you!
// ▓▓▓▓▓▓▓▓▓▓▓▓
// ▓▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓▓▓▓▓▓▓▓▓▓▓
// ▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓▓▓
// ▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓
// ... | // warm heart, wagging tail,and a smile just for you!
// ▓▓▓▓▓▓▓▓▓▓▓▓
// ▓▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓▓▓▓▓▓▓▓▓▓▓
// ▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓▓▓
// ▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓
// ... | replace | 77 | 78 | 77 | 78 | 0 | |
p03231 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
long long N, M;
string S, T;
cin >> N >> M >> S >> T;
long long i, j;
long long k = 1;
for (i = 0; i < N && k == 1; i++) {
for (j = 0; j < M; j++) {
if (i * M == j * N && S[i] != T[j]) {
k = 0;
}
}
}... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
long long N, M;
string S, T;
cin >> N >> M >> S >> T;
long long i, j;
long long k = 1;
for (i = 0; i < N && k == 1; i++) {
j = i * M / N;
if (i * M == j * N && S[i] != T[j]) {
k = 0;
}
}
if (k == 0) {
c... | replace | 10 | 14 | 10 | 13 | TLE | |
p03231 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int> vint;
typedef vector<ll> vll;
template <typename T> istream &operator>>(istream &is, ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int> vint;
typedef vector<ll> vll;
template <typename T> istream &operator>>(istream &is, ... | replace | 40 | 45 | 40 | 47 | TLE | |
p03231 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
long long n, m;
string s, t;
cin >> n >> m;
cin >> s;
cin >> t;
// string ans;
long long G;
if (n > m) {
G = n * m / gcd(n, m);
} else {
G ... | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
long long n, m;
string s, t;
cin >> n >> m;
cin >> s;
cin >> t;
// string ans;
long long G;
if (n > m) {
G = n * m / gcd(n, m);
} else {
G ... | replace | 25 | 26 | 25 | 26 | TLE | |
p03231 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int, int> P;
const int INF = 1e18;
int gcd(int a, int b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
signed main() {
int n, m;
string s, t;
cin >> n >> m >> s >> t;
int l = n / gcd(n, m) *... | #include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int, int> P;
const int INF = 1e18;
int gcd(int a, int b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
signed main() {
int n, m;
string s, t;
cin >> n >> m >> s >> t;
int l = n / gcd(n, m) *... | replace | 20 | 21 | 20 | 21 | TLE | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
// using namespace boost::multiprecision;
using namespace std;
typedef long long ll;
// typedef unsigned long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
// #define rep(i, n) for (ll i = 0; i < (n); ++i)
// #define sz(x) ll(x.size())
typed... | #include <bits/stdc++.h>
#include <cmath>
// using namespace boost::multiprecision;
using namespace std;
typedef long long ll;
// typedef unsigned long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
// #define rep(i, n) for (ll i = 0; i < (n); ++i)
// #define sz(x) ll(x.size())
typed... | replace | 57 | 58 | 57 | 58 | 0 | |
p03231 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define MAX_S 100000
#define MAX_T 100000
int N, M;
char S[MAX_S];
char T[MAX_T];
long long gcd(long long m, long long n) {
if (m < n) {
swap(m, n);
}
long long temp;
while (m % n != 0) {
temp = n;
n = m % n;
m = temp;
}
return n;
}
long long... | #include <bits/stdc++.h>
using namespace std;
#define MAX_S 100000
#define MAX_T 100000
int N, M;
char S[MAX_S];
char T[MAX_T];
long long gcd(long long m, long long n) {
if (m < n) {
swap(m, n);
}
long long temp;
while (m % n != 0) {
temp = n;
n = m % n;
m = temp;
}
return n;
}
long long... | replace | 30 | 36 | 30 | 37 | TLE | |
p03231 | Python | Runtime Error | # from math import gcd
from fraction import gcd
import sys
N, M = map(int, input().split())
S = input()
T = input()
d = gcd(N, M)
m = N * M // d
for i in range(d):
if S[i * (N // d)] != T[i * (M // d)]:
print(-1)
sys.exit()
print(m)
| # from math import gcd
from fractions import gcd
import sys
N, M = map(int, input().split())
S = input()
T = input()
d = gcd(N, M)
m = N * M // d
for i in range(d):
if S[i * (N // d)] != T[i * (M // d)]:
print(-1)
sys.exit()
print(m)
| replace | 1 | 2 | 1 | 2 | ModuleNotFoundError: No module named 'fraction' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03231/Python/s663695996.py", line 2, in <module>
from fraction import gcd
ModuleNotFoundError: No module named 'fraction'
|
p03231 | Python | Runtime Error | from math import gcd
N, M = map(int, input().split())
S = input()
T = input()
G = gcd(N, M)
L = N * M // G
n = N // G
m = M // G
ans = True
for k in range(G):
if S[k * n] != T[k * m]:
ans = False
break
print(L if ans else -1)
| from fractions import gcd
N, M = map(int, input().split())
S = input()
T = input()
G = gcd(N, M)
L = N * M // G
n = N // G
m = M // G
ans = True
for k in range(G):
if S[k * n] != T[k * m]:
ans = False
break
print(L if ans else -1)
| replace | 0 | 1 | 0 | 1 | 0 | |
p03231 | Python | Time Limit Exceeded | #!/usr/bin/env python
def gcd(a, b):
if a < b:
a, b = b, a
if b == 1:
return 1
m = a % b
if m == 0:
return b
return gcd(b, m)
def main():
N, M = [int(a) for a in input().split()]
S = input()
T = input()
L = N * M // gcd(N, M)
a1 = L // N
a2 = L /... | #!/usr/bin/env python
def gcd(a, b):
if a < b:
a, b = b, a
if b == 1:
return 1
m = a % b
if m == 0:
return b
return gcd(b, m)
def main():
N, M = [int(a) for a in input().split()]
S = input()
T = input()
L = N * M // gcd(N, M)
a1 = L // N
a2 = L /... | replace | 24 | 27 | 24 | 25 | TLE | |
p03231 | Python | Runtime Error | import fractions
n, m = map(int, input().split())
s = input()
t = input()
lcm = n * m // fractions.gcd(n, m)
sl = [""] * lcm
for i in range(len(s)):
temp = i * lcm // n
sl[temp] = s[i]
for i in range(len(t)):
temp = i * lcm // m
if sl[temp] != "" and sl[temp] != t[i]:
print(-1)
exit()
p... | import fractions
n, m = map(int, input().split())
s = input()
t = input()
gcd = fractions.gcd(n, m)
lcm = n * m // gcd
o = lcm // gcd
for i in range(gcd):
if s[i * lcm // m] != t[i * lcm // n]:
print(-1)
exit()
print(lcm)
| replace | 5 | 13 | 5 | 10 | AttributeError: module 'fractions' has no attribute 'gcd' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03231/Python/s844935793.py", line 5, in <module>
lcm = n * m // fractions.gcd(n, m)
AttributeError: module 'fractions' has no attribute 'gcd'
|
p03231 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
typedef long long int ll;
typedef pair<int, int> pi;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.ti... | #include <bits/stdc++.h>
#define mod 10007
using namespace std;
typedef long long int ll;
typedef pair<int, int> pi;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);... | replace | 1 | 2 | 1 | 2 | TLE | |
p03231 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
const int INF = 1145141919, MOD = 1e9 + 7;
const long long LINF = 8931145141919364364, LMOD = 998244353;
// const int dx[]={1,0,-1,0,1,1,-1,-1},dy[]={0,-1,0,1,1,-1,-1,1};
int gcd(int x, int... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
const int INF = 1145141919, MOD = 1e9 + 7;
const long long LINF = 8931145141919364364, LMOD = 998244353;
// const int dx[]={1,0,-1,0,1,1,-1,-1},dy[]={0,-1,0,1,1,-1,-1,1};
int gcd(int x, int... | replace | 29 | 30 | 29 | 30 | TLE | |
p03231 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
// 最大公約数を求める関数
long gcd(int x, int y) {
long r;
// ユーグリッドの互除法
while ((r = x % y) != 0) // yで割り切れるまでループ
{
x = y;
y = r;
}
return y;
}
long lcm(long x, long y) { return (x * y / gcd(x, y)); }
int main(void) {
long N, M;
char S[100001];... | #include <algorithm>
#include <iostream>
using namespace std;
// 最大公約数を求める関数
long gcd(int x, int y) {
long r;
// ユーグリッドの互除法
while ((r = x % y) != 0) // yで割り切れるまでループ
{
x = y;
y = r;
}
return y;
}
long lcm(long x, long y) { return (x * y / gcd(x, y)); }
int main(void) {
long N, M;
char S[100001];... | replace | 34 | 41 | 34 | 40 | TLE | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (long long int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (long long int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (long long int i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define Size(n) (n).size()
#def... | #include <bits/stdc++.h>
#define rep(i, n) for (long long int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (long long int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (long long int i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define Size(n) (n).size()
#def... | insert | 48 | 48 | 48 | 55 | 0 | |
p03231 | C++ | Runtime Error | /* nothing is impossible */
#include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define fi first
#define se second
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i... | /* nothing is impossible */
#include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define fi first
#define se second
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i... | replace | 42 | 45 | 42 | 43 | 0 | |
p03231 | Python | Runtime Error | import math
N, M = list(map(int, input().split()))
S = input()
T = input()
L = N * M // math.gcd(N, M)
d = dict()
for i in range(N):
index = 1 + (L // N) * i
d[index] = S[i]
for j in range(M):
index = 1 + (L // M) * j
if index in d:
if d[index] != T[j]:
print(-1)
exi... | import math
N, M = list(map(int, input().split()))
S = input()
T = input()
def gcd(a, b):
if a < b:
a, b = b, a
if b == 0:
return a
c = a % b
return gcd(b, c)
L = N * M // gcd(N, M)
d = dict()
for i in range(N):
index = 1 + (L // N) * i
d[index] = S[i]
for j in range(M):
... | replace | 6 | 7 | 6 | 17 | 0 | |
p03231 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
typedef long long int ll;
#define FOR... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
typedef long long int ll;
#define FOR... | replace | 56 | 58 | 56 | 60 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
const int N = 1e5 + 1e2;
int n, m;
char s1[N], s2[N], a[N];
ll gcd(ll a, ll b) { return !b ? a : gcd(b, a % b); }
int main() {
scanf("%d %d", &n, &m);
scanf(" %s", s1 + 1);
scanf(" %s", s2 + 1);
if (s1[1] != s2[1]) {
puts("-1");
return 0;
}
a[1] = s1[1];... | #include <bits/stdc++.h>
#define ll long long
const int N = 1e5 + 1e2;
int n, m;
char s1[N], s2[N];
std::map<int, char> a;
ll gcd(ll a, ll b) { return !b ? a : gcd(b, a % b); }
int main() {
scanf("%d %d", &n, &m);
scanf(" %s", s1 + 1);
scanf(" %s", s2 + 1);
if (s1[1] != s2[1]) {
puts("-1");
return 0;
... | replace | 4 | 5 | 4 | 6 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, M, l, lcm, dn, dm;
string S, T;
cin >> N >> M >> S >> T;
l = (N * M) / __gcd(N, M);
dn = l / N;
dm = l / M;
lcm = (dn * dm) / __gcd(dn, dm);
for (int i = 0; i < l; i += lcm) {
if (S.at(i / dn) != T.at(i / dm)) {
cout << -1 ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, M, l, lcm, dn, dm;
string S, T;
cin >> N >> M >> S >> T;
l = (N * M) / __gcd(N, M);
dn = l / N;
dm = l / M;
lcm = (dn * dm) / __gcd(dn, dm);
for (int64_t i = 0; i < l; i += lcm) {
if (S.at(i / dn) != T.at(i / dm)) {
cout <<... | replace | 11 | 12 | 11 | 12 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <random>
//-------------------------------------------------------------------------
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define prv(v) \
for (auto i : v) { ... | #include <bits/stdc++.h>
#include <random>
//-------------------------------------------------------------------------
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define prv(v) \
for (auto i : v) { ... | replace | 44 | 45 | 44 | 46 | 0 | |
p03231 | C++ | Time Limit Exceeded | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// マクロ&定数 ==============... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// マクロ&定数 ==============... | replace | 63 | 64 | 63 | 64 | TLE | |
p03231 | C++ | Runtime Error | #include <stdio.h>
int gcd(int a, int b) {
if (a == b)
return a;
if (a > b) {
int c = a;
a = b;
b = c;
}
if (b % a == 0)
return a;
else
return gcd(a, b % a);
}
int main(void) {
long long n, m;
scanf("%d%d", &n, &m);
char s[n + 5];
char t[m + 5];
scanf(" %s", s);
scanf(" %s"... | #include <stdio.h>
int gcd(int a, int b) {
if (a == b)
return a;
if (a > b) {
int c = a;
a = b;
b = c;
}
if (b % a == 0)
return a;
else
return gcd(a, b % a);
}
int main(void) {
long long n, m;
scanf("%lld%lld", &n, &m);
char s[n + 5];
char t[m + 5];
scanf(" %s", s);
scanf("... | replace | 16 | 17 | 16 | 17 | -11 | |
p03231 | C++ | Time Limit Exceeded | /*Lucky_Glass*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll lena, lenb;
string A, B;
inline ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
int main() {
cin >> lena >> lenb >> A >> B;
ll len = lena * lenb / GCD(lena, lenb);
ll fA = len / lena, fB = len / lenb;
ll add = fA * fB / ... | /*Lucky_Glass*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll lena, lenb;
string A, B;
inline ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
int main() {
cin >> lena >> lenb >> A >> B;
ll len = lena * lenb / GCD(lena, lenb);
ll fA = len / lena, fB = len / lenb;
ll pos = 0;
for (... | replace | 11 | 20 | 11 | 18 | TLE | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll gcd(ll a, ll b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
ll n, m;
cin >> n >> m;
string s, t;
cin >> s >> t;
ll lon = n * (m / gcd(n, m));
vector<char> tmp(lon, '.');
for (ll i = 0; i < n; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll gcd(ll a, ll b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
ll n, m;
cin >> n >> m;
string s, t;
cin >> s >> t;
ll kou = gcd(n, m), lon = n * (m / kou);
// vector<char> tmp (lon,'.');
// for(l... | replace | 15 | 21 | 15 | 21 | 0 | |
p03231 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
long long LCM(long long a, long long b) {
int r, x, tmp, lcm;
x = a * b;
/* 自然数 a > b を確認・入替 */
if (a < b) {
tmp = a;
a = b;
... | #include <algorithm>
#include <array>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
long long LCM(long long a, long long b) {
long long r, x, tmp, lcm;
x = a * b;
/* 自然数 a > b を確認・入替 */
if (a < b) {
tmp = a;
a =... | replace | 12 | 13 | 12 | 13 | 0 | |
p03231 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf LLONG_MAX / 10000000
#define INF LLONG_MAX / 3
#define P pair<int, int>
#define EPS DBL_EPSILON
using namespace std;
int n, m;
string s, t;
int gcd(int a, int b) {
while (max(a, b) % min(a, b)) {
if (a < b)
... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf LLONG_MAX / 10000000
#define INF LLONG_MAX / 3
#define P pair<int, int>
#define EPS DBL_EPSILON
using namespace std;
int n, m;
string s, t;
int gcd(int a, int b) {
while (max(a, b) % min(a, b)) {
if (a < b)
... | replace | 23 | 25 | 23 | 25 | TLE | |
p03231 | C++ | Runtime Error | #include <cstdio>
int N, M;
char S[100010], T[100010];
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
scanf("%d%d%s%s", &N, &M, S, T);
for (int i = 0; i < N; i++) {
if (1ll * i * M % N == 0 && S[i] != T[i * M / N])
return puts("-1"), 0;
}
printf("%lld\n", 1ll * N * M / gcd(N, M))... | #include <cstdio>
int N, M;
char S[100010], T[100010];
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
scanf("%d%d%s%s", &N, &M, S, T);
for (int i = 0; i < N; i++) {
if (1ll * i * M % N == 0 && S[i] != T[1ll * i * M / N])
return puts("-1"), 0;
}
printf("%lld\n", 1ll * N * M / gcd(... | replace | 7 | 8 | 7 | 8 | 0 | |
p03231 | C++ | Time Limit Exceeded | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include "bits/stdc++.h"
// #include <boost/multiprecision/cpp_int.hpp>
// #include <intrin.h> //AtCoder (gcc)
// 上ではこれがあると動かない。__popcnt用のincludeファイル。
using namespace std;
typedef long long ll;
typedef long double ld;
#define ... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include "bits/stdc++.h"
// #include <boost/multiprecision/cpp_int.hpp>
// #include <intrin.h> //AtCoder (gcc)
// 上ではこれがあると動かない。__popcnt用のincludeファイル。
using namespace std;
typedef long long ll;
typedef long double ld;
#define ... | replace | 863 | 876 | 863 | 881 | TLE | |
p03231 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
inline long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
#define ll long long
#define rep(i, x, y) for (int... | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
inline long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
#define ll long long
#define rep(i, x, y) for (int... | replace | 34 | 37 | 34 | 36 | TLE | |
p03231 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1e9 + 7;
void print() { std::cout << std::endl; }
template <typename Head> void print(Head &&head) {
std::cout << head << std::endl;
}
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&...tail) {
std... | #include <bits/stdc++.h>
typedef long long ll;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1e9 + 7;
void print() { std::cout << std::endl; }
template <typename Head> void print(Head &&head) {
std::cout << head << std::endl;
}
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&...tail) {
std... | replace | 43 | 44 | 43 | 45 | TLE | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll gcd(ll a, ll b) {
if (a < b)
swap(... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll gcd(ll a, ll b) {
if (a < b)
swap(... | replace | 23 | 24 | 23 | 24 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fo(i, a, b) for (int i = a; i <= b; i++)
long long N, M, L, D, l, ans;
char s[110000], t[110000];
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
inline void chec(long long d) {
if (d <= ans)
return;
l = L / d;
long long pos, p, ... | #include <bits/stdc++.h>
#define fo(i, a, b) for (int i = a; i <= b; i++)
long long N, M, L, D, l, ans;
char s[110000], t[110000];
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
inline void chec(long long d) {
if (d <= ans)
return;
l = L / d;
long long pos, p, ... | replace | 14 | 15 | 14 | 15 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(... | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(... | replace | 22 | 36 | 22 | 25 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) { return b == 0 ? a : gcd(b, a % b); }
int64_t lcm(int64_t a, int64_t b) { return a * b / gcd(a, b); }
int main() {
int64_t i, j, k;
int64_t N, M;
string S, T;
cin >> N >> M >> S >> T;
int64_t L = lcm(N, M);
int64_t l = lcm(L ... | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) { return b == 0 ? a : gcd(b, a % b); }
int64_t lcm(int64_t a, int64_t b) { return a * b / gcd(a, b); }
int main() {
int64_t i, j, k;
int64_t N, M;
string S, T;
cin >> N >> M >> S >> T;
int64_t L = lcm(N, M);
int64_t l = lcm(L ... | replace | 14 | 15 | 14 | 15 | 0 | |
p03231 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <math.h>
#include <memory.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
long long gcd(long long a, long long b) {
long long c;
while (b) {
c = a;
a... | #include <algorithm>
#include <functional>
#include <math.h>
#include <memory.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
long long gcd(long long a, long long b) {
long long c;
while (b) {
c = a;
a... | replace | 37 | 38 | 37 | 38 | 0 | |
p03231 | C++ | Runtime Error | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <array>
#include <cstring>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
int gcd(int x, int y) {
x = std::abs(x);
y = std::abs(y);
int a = std::max(x, y), b = std::min(x, y);
int r = a % b;
wh... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <array>
#include <cstring>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
int gcd(int x, int y) {
x = std::abs(x);
y = std::abs(y);
int a = std::max(x, y), b = std::min(x, y);
int r = a % b;
wh... | replace | 33 | 36 | 33 | 34 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define fori(i, b, e) for (ll i = (b); i < (e); i++)
#define forr(i, b, e) for (ll i = (b); i >= (e); i--)
#define allele(v) v.begin(), v.end()
#define fi first
#define se second
int main() {
ios::sync_... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define fori(i, b, e) for (ll i = (b); i < (e); i++)
#define forr(i, b, e) for (ll i = (b); i >= (e); i--)
#define allele(v) v.begin(), v.end()
#define fi first
#define se second
int main() {
ios::sync_... | replace | 19 | 25 | 19 | 22 | 0 | |
p03231 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
typede... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
typede... | replace | 113 | 114 | 113 | 114 | TLE | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int main() {
long long N, M;
string S, T;
cin >> N >> M;
cin >> S;
cin >> T;
long long L = N * M / gcd(N, M);
int p = L / N;
int q = L / M;
int r = p * q / gcd(p, q);
for (int i... | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int main() {
long long N, M;
string S, T;
cin >> N >> M;
cin >> S;
cin >> T;
long long L = N * M / gcd(N, M);
long long p = L / N;
long long q = L / M;
long long r = p * q / gcd(p... | replace | 13 | 17 | 13 | 17 | 0 | |
p03231 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int n, m;
string s, t;
int gcd(int a, int b) {
if (a % b == 0)
return b;
return gcd(b, a % b);... | #include <algorithm>
#include <climits>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int n, m;
string s, t;
int gcd(int a, int b) {
if (a % b == 0)
return b;
return gcd(b, a % b);... | replace | 39 | 40 | 39 | 40 | 0 | |
p03231 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vt<T>>;
template <class T> using ttt = tuple<T, T>;
using tii = tuple<int, int>;
using tiii = tuple<int, int, int>;
using vi = vector<int>;
#define rep(i, n) for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vt<T>>;
template <class T> using ttt = tuple<T, T>;
using tii = tuple<int, int>;
using tiii = tuple<int, int, int>;
using vi = vector<int>;
#define rep(i, n) for (int i = 0;... | replace | 35 | 36 | 35 | 36 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.