problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
double S = A / B;
cout << fixed << setprecision(10) << S << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double A, B;
cin >> A >> B;
double S = A / B;
cout << fixed << setprecision(10) << S << endl;
} | [
"variable_declaration.type.primitive.change"
] | 934,080 | 934,081 | u046313635 | cpp |
p03135 | #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 t, x;
cin >> t, x;
double ans = double(t) / x;
cout << fixed << setprecision(10) << ans << endl;
return 0;
}
| #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 t, x;
cin >> t >> x;
double ans = double(t) / x;
cout << fixed << setprecision(10) << ans << endl;
return 0;
}
| [] | 934,084 | 934,085 | u186506670 | cpp |
p03135 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i, n) for (i = 0; i < n; i++)
#define F(i, a, b) for (i = a; a <= b; i++)
#define arr(a, n) \
for (i = 0; i < n; i++) ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i, n) for (i = 0; i < n; i++)
#define F(i, a, b) for (i = a; a <= b; i++)
#define arr(a, n) \
for (i = 0; i < n; i++) ... | [
"variable_declaration.type.change"
] | 934,086 | 934,087 | u159663513 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, x;
double a;
cin >> t >> x;
a = t / x;
cout << a << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double t, x;
double a;
cin >> t >> x;
a = t / x;
cout << a << endl;
} | [
"variable_declaration.type.primitive.change"
] | 934,088 | 934,089 | u666712170 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
float t = T / X;
cout << t;
} | #include <iostream>
using namespace std;
int main() {
float T, X;
cin >> T >> X;
float t = T / X;
cout << t;
} | [
"variable_declaration.type.primitive.change"
] | 934,092 | 934,093 | u212144411 | cpp |
p03135 | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
#define DUMP(i, v) \
for (ll i = 0; i < v.size(); i++) \
cout << v[i] << " "
using... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
#define DUMP(i, v) \
for (ll i = 0; i < v.size(); i++) \
cout << v[i] << " "
using... | [
"expression.operation.binary.remove"
] | 934,101 | 934,102 | u225053756 | cpp |
p03135 | #include <stdio.h>
int main(void) {
int T, X, t;
scanf("%d %d", &T, &X);
printf("%d", T / X);
return 0;
}
| #include <stdio.h>
int main(void) {
float T, X, t;
scanf("%f %f", &T, &X);
printf("%f", T / X);
return 0;
}
| [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 934,103 | 934,104 | u818573308 | cpp |
p03135 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int t, x;
double ans;
cin >> t >> x;
ans = ~t / x;
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
double t, x;
double ans;
cin >> t >> x;
ans = t / x;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"expression.operation.unary.bitwise.remove"
] | 934,105 | 934,106 | u206390098 | cpp |
p03135 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 934,107 | 934,108 | u814715203 | cpp |
p03135 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int t, x;
cin >> t >> x;
double ans = t / x;
cout << fixed << setprecision(8) << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
double t, x;
cin >> t >> x;
double ans = t / x;
cout << fixed << setprecision(8) << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 934,109 | 934,110 | u816145694 | cpp |
p03135 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
double x, t;
cin >> x >> t;
printf("%.3f\n", t / x);
} | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
double x, t;
cin >> x >> t;
printf("%.3f\n", x / t);
} | [
"expression.operation.binary.remove"
] | 934,119 | 934,120 | u120050685 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << fixed << setprecision(10);
cout << a / b << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b;
cin >> a >> b;
cout << fixed << setprecision(10);
cout << a / b << endl;
} | [
"variable_declaration.type.primitive.change"
] | 934,121 | 934,122 | u330025192 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
double t, x;
cin >> t >> x;
cout << fixed << setprecision(10);
cout << x / t << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double t, x;
cin >> t >> x;
cout << fixed << setprecision(10);
cout << t / x << endl;
} | [
"expression.operation.binary.remove"
] | 934,125 | 934,126 | u201928947 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int t, x, k;
cin >> t >> x;
k = t / x;
cout << k;
}
| #include <iostream>
using namespace std;
int main() {
float t, x, k;
cin >> t >> x;
k = t / x;
cout << k;
}
| [
"variable_declaration.type.primitive.change"
] | 934,130 | 934,131 | u406246506 | cpp |
p03135 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(n) for (int i = 0; i < n; i++)
int N, M;
vector<int> x, d;
int main() {
scanf("%d %d", &N, &M);
printf("%d", (double)N / M);
} | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(n) for (int i = 0; i < n; i++)
int N, M;
vector<int> x, d;
int main() {
scanf("%d %d", &N, &M);
printf("%f", (double)N / M);
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 934,138 | 934,139 | u128572736 | cpp |
p03135 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(n) for (int i = 0; i < n; i++)
int N, M;
vector<int> x, d;
int main() {
scanf("%d %d ", &N, &M);
printf("%d", N / M);
} | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(n) for (int i = 0; i < n; i++)
int N, M;
vector<int> x, d;
int main() {
scanf("%d %d", &N, &M);
printf("%f", (double)N / M);
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 934,140 | 934,139 | u128572736 | cpp |
p03135 | #include <bits/stdc++.h>
#include <math.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1001001001;
const int mINF = -1001001001;
int main() {
int x, y, z;
cin >> x >> y;
double ans = x /... | #include <bits/stdc++.h>
#include <math.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1001001001;
const int mINF = -1001001001;
int main() {
double x, y, z;
cin >> x >> y;
double ans = ... | [
"variable_declaration.type.primitive.change"
] | 934,141 | 934,142 | u281876921 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
double T, X;
cin >> T, X;
cout << T / X << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
cout << T / X << endl;
} | [] | 934,143 | 934,144 | u762259033 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T, X;
cout << T / X << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
cout << T / X << endl;
} | [
"variable_declaration.type.primitive.change"
] | 934,145 | 934,144 | u762259033 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double ans = T / X;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
double ans = T / X;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 934,148 | 934,149 | u811472478 | cpp |
p03135 | // Entrance Examination
#include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
cout << T / X << endl;
return 0;
} | // Entrance Examination
#include <bits/stdc++.h>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
cout << T / X << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 934,150 | 934,151 | u896325626 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
cout << t / x << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
cout << (double)t / (double)x << endl;
return 0;
} | [
"type_conversion.add"
] | 934,152 | 934,153 | u611571299 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
double X;
double T;
double ans;
cin >> X >> T;
ans = T / X;
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
double X;
double T;
double ans;
cin >> T >> X;
ans = T / X;
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 934,154 | 934,155 | u644568158 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int X;
int T;
double ans;
cin >> T >> X;
ans = T / X;
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
double X;
double T;
double ans;
cin >> T >> X;
ans = T / X;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 934,156 | 934,155 | u644568158 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int X;
int T;
double ans;
cin >> X >> T;
ans = T / X;
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
double X;
double T;
double ans;
cin >> T >> X;
ans = T / X;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"expression.operation.binary.remove"
] | 934,157 | 934,155 | u644568158 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 934,158 | 934,159 | u740054550 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double x = T / X;
printf("%lf\n", x);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
double x = T / X;
printf("%lf\n", x);
} | [
"variable_declaration.type.primitive.change"
] | 934,160 | 934,161 | u820224016 | cpp |
p03135 | #include <stdio.h>
int main(void) {
int t, x;
scanf("%d%d", &t, &x);
printf("%.12f\n", t / x);
return 0;
} | #include <stdio.h>
int main(void) {
int t, x;
scanf("%d%d", &t, &x);
printf("%.12f\n", (double)t / x);
return 0;
} | [
"type_conversion.add"
] | 934,162 | 934,163 | u088895504 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
cout << T / X << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
float T, X;
cin >> T >> X;
cout << T / X << endl;
} | [
"variable_declaration.type.primitive.change"
] | 934,168 | 934,169 | u217508499 | cpp |
p03135 | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
int main() {
double t, x;
scanf("%lf", &t, &x);
printf("[%.5f]\n", t / x);
return 0;
}
| #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
int main() {
double t, x;
scanf("%lf %lf", &t, &x);
printf("%.5f\n", t / x);
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 934,173 | 934,174 | u201553784 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return tr... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return tr... | [
"variable_declaration.type.change",
"io.output.change"
] | 934,175 | 934,176 | u316322317 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
cout << fixed << setprecision(10);
int a, b;
cin >> a >> b;
cout << a / b << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
cout << fixed << setprecision(13);
int a, b;
cin >> a >> b;
cout << (double)a / b << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 934,177 | 934,178 | u613960672 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
double t, x;
cin >> t >> x;
double ans = t / x;
cout << fixed << setprecision(10) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
double t, x;
cin >> t >> x;
double ans = t / x;
cout << fixed << setprecision(10) << ans << endl;
}
| [
"io.output.change"
] | 934,179 | 934,180 | u559578080 | cpp |
p03135 | #include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
typedef long long int ll;
using namespace std;
int main() {
double t, x;
cin >> t >> x;
cout << x / t << endl;
} | #include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
typedef long long int ll;
using namespace std;
int main() {
double t, x;
cin >> t >> x;
cout << t / x << endl;
}
| [
"expression.operation.binary.remove"
] | 934,185 | 934,186 | u473023730 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll(i) = 0; i < (n); ++(i))
#define print(a) cout << (a) << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll x, t;
cin >> t >> x;
double ans = t / x;
printf("%.10f", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll(i) = 0; i < (n); ++(i))
#define print(a) cout << (a) << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
double x, t;
cin >> t >> x;
double ans = t / x;
printf("%.10f", ans);
return 0;
}
| [
"variable_declaration.type.change"
] | 934,195 | 934,196 | u894339989 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll(i) = 0; i < (n); ++(i))
#define print(a) cout << (a) << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll x, t;
cin >> x >> t;
double ans = t / x;
printf("%.10f", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll(i) = 0; i < (n); ++(i))
#define print(a) cout << (a) << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
double x, t;
cin >> t >> x;
double ans = t / x;
printf("%.10f", ans);
return 0;
}
| [
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 934,197 | 934,196 | u894339989 | cpp |
p03135 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int T, X;
cin >> T >> X;
double ans = T / X;
printf("%.10f", ans);
cout << endl;
return 0;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int T, X;
cin >> T >> X;
double ans = (double)T / X;
printf("%.10f", ans);
cout << endl;
r... | [
"type_conversion.add"
] | 934,198 | 934,199 | u828388155 | cpp |
p03135 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int T, X;
cin >> T >> X;
int ans = T / X;
printf("%.10f", ans);
cout << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int T, X;
cin >> T >> X;
double ans = (double)T / X;
printf("%.10f", ans);
cout << endl;
r... | [
"variable_declaration.type.primitive.change"
] | 934,200 | 934,199 | u828388155 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int t;
int x;
cin >> t >> x;
cout << t / x << endl;
} | #include <iostream>
using namespace std;
int main() {
double t;
double x;
cin >> t >> x;
cout << t / x << endl;
} | [
"variable_declaration.type.primitive.change"
] | 934,201 | 934,202 | u600215903 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int t;
int x;
cin >> t >> x;
cout << x / t << endl;
} | #include <iostream>
using namespace std;
int main() {
double t;
double x;
cin >> t >> x;
cout << t / x << endl;
} | [
"variable_declaration.type.primitive.change",
"expression.operation.binary.remove"
] | 934,203 | 934,202 | u600215903 | cpp |
p03135 | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#define endl "\n"
#define all(v) v.begin(), v.end()
#define allr(s) s.rbegin(), s.rend()
#define RT(s) return cout << s, 0
#define watch(x) cout << (#x) << " = " << x << endl
#define sz(s) (int)(s.size())
#define PI acos(-1)
#define EPS 1... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#define endl "\n"
#define all(v) v.begin(), v.end()
#define allr(s) s.rbegin(), s.rend()
#define RT(s) return cout << s, 0
#define watch(x) cout << (#x) << " = " << x << endl
#define sz(s) (int)(s.size())
#define PI acos(-1)
#define EPS 1... | [
"call.remove"
] | 934,206 | 934,207 | u824459059 | cpp |
p03133 | #include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long n, m, a[333][333], pw[666], cnt, pos, cur, upper;
/*long long Guass(long long Row,long long Column)
{
long long row=1,col=1,max_r;
for(row=1;row<=Row&&col<=Column;row++,col++)
{
max_r=row;
for(long long ... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long n, m, a[333][333], pw[666], cnt, pos, cur, upper;
/*long long Guass(long long Row,long long Column)
{
long long row=1,col=1,max_r;
for(row=1;row<=Row&&col<=Column;row++,col++)
{
max_r=row;
for(long long ... | [
"assignment.change"
] | 934,229 | 934,230 | u900309151 | cpp |
p03133 | //
// binary 行列 (行列累乗と、掃き出し法)
//
// verified:
// みんなのプロコン 2019 E - Odd Subrectangles
// https://atcoder.jp/contests/yahoo-procon2019-qual/tasks/yahoo_procon2019_qual_e
//
#include <bitset>
#include <iostream>
#include <vector>
using namespace std;
const int MAX_ROW = 510; // to be set
const int MAX_COL = 510; /... | //
// binary 行列 (行列累乗と、掃き出し法)
//
// verified:
// みんなのプロコン 2019 E - Odd Subrectangles
// https://atcoder.jp/contests/yahoo-procon2019-qual/tasks/yahoo_procon2019_qual_e
//
#include <bitset>
#include <iostream>
#include <vector>
using namespace std;
const int MAX_ROW = 510; // to be set
const int MAX_COL = 510; /... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 934,236 | 934,237 | u692336506 | cpp |
p03133 | #include <bits/stdc++.h>
using namespace std;
//#define che
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define MK make_pair
#define PB push_back
#define fi first
#define se second
typedef long long LL;
typedef pair<int, int> PII;
const int N = 303;
const LL MOD = 998244353;
typedef bitset<N> bs;
bs a[N];
LL pw[N... | #include <bits/stdc++.h>
using namespace std;
//#define che
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define MK make_pair
#define PB push_back
#define fi first
#define se second
typedef long long LL;
typedef pair<int, int> PII;
const int N = 303;
const LL MOD = 998244353;
typedef bitset<N> bs;
bs a[N];
LL pw[N... | [
"control_flow.loop.for.initializer.change"
] | 934,238 | 934,239 | u460246101 | cpp |
p03133 | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
const int maxd = 998244353, N = 100000;
const double pi = acos(-1.0);
typedef long long ll;
int n, m, cnt = 0;
ll b... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
const int maxd = 998244353, N = 100000;
const double pi = acos(-1.0);
typedef long long ll;
int n, m, cnt = 0;
ll b... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"assignment.variable.change"
] | 934,240 | 934,241 | u473013083 | cpp |
p03133 | #include <bits/stdc++.h>
#define rep(i, k, n) for (int i = k; i <= n; i++)
#define rep2(i, k, n) for (int i = k; i >= n; i--)
#define mod 998244353
using namespace std;
inline void upd(int &x, int y) {
x += y;
x -= (x >= mod) ? mod : 0;
}
const int N = 305;
int pw[N << 1], f[N], a[N][N], n, m;
int main() {
pw[0] ... | #include <bits/stdc++.h>
#define rep(i, k, n) for (int i = k; i <= n; i++)
#define rep2(i, k, n) for (int i = k; i >= n; i--)
#define mod 998244353
using namespace std;
inline void upd(int &x, int y) {
x += y;
x -= (x >= mod) ? mod : 0;
}
const int N = 305;
int pw[N << 1], f[N], a[N][N], n, m;
int main() {
pw[0] ... | [
"call.arguments.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 934,252 | 934,253 | u266485840 | cpp |
p03133 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#incl... | [
"literal.number.change"
] | 934,256 | 934,257 | u628047647 | cpp |
p03133 | #include <algorithm>
#include <bitset>
#include <cstdio>
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
using namespace std;
const int N = 510, mod = 998244353;
int n, m, y, rk, ans, a[N][N], pw[N];
bitset<N> b[N];
int main() {
scanf("%d%d", &n, &m);
pw[0] = 1;
rep(i, 1, n) {
bitset<N> x(0);
rep(... | #include <algorithm>
#include <bitset>
#include <cstdio>
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
using namespace std;
const int N = 510, mod = 998244353;
int n, m, y, rk, ans, a[N][N], pw[N];
bitset<N> b[N];
int main() {
scanf("%d%d", &n, &m);
pw[0] = 1;
rep(i, 1, n) {
bitset<N> x(0);
rep(... | [
"misc.opposites",
"assignment.variable.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 934,260 | 934,261 | u706008189 | cpp |
p03133 | #include <bits/stdc++.h>
using namespace std;
// define
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)), UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a + mod - b) % mod
#define MUL(a, b) a = (a * b) % mod
#define rollcall cout << "I'm Sucu." ... | #include <bits/stdc++.h>
using namespace std;
// define
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)), UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a + mod - b) % mod
#define MUL(a, b) a = (a * b) % mod
#define rollcall cout << "I'm Sucu." ... | [
"identifier.change",
"call.function.change",
"call.arguments.add"
] | 934,271 | 934,272 | u691493208 | cpp |
p03133 | #include <bits/stdc++.h>
using namespace std;
const int p = 998244353;
int a[305][305], b[305][305];
int read() {
char c = getchar();
int x = 0, f = 1;
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
... | #include <bits/stdc++.h>
using namespace std;
const int p = 998244353;
int a[305][305], b[305][305];
int read() {
char c = getchar();
int x = 0, f = 1;
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change"
] | 934,297 | 934,298 | u860104539 | cpp |
p03133 | #include <bits/stdc++.h>
#define MOD 998244353
using namespace std;
int pow(int x, int pow) {
int res = 1, t = x;
while (pow) {
if (pow & 1) {
res = 1LL * res * t % MOD;
}
t = 1LL * t * t % MOD;
pow >>= 1;
}
return res;
}
int main() {
int n, m;
cin >> n >> m;
int **mat = new int ... | #include <bits/stdc++.h>
#define MOD 998244353
using namespace std;
int pow(int x, int pow) {
int res = 1, t = x;
while (pow) {
if (pow & 1) {
res = 1LL * res * t % MOD;
}
t = 1LL * t * t % MOD;
pow >>= 1;
}
return res;
}
int main() {
int n, m;
cin >> n >> m;
int **mat = new int ... | [
"control_flow.loop.for.condition.change"
] | 934,307 | 934,308 | u891482208 | cpp |
p03133 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
const int N = 305;
const int mod = 998244353;
int a[N][N];
int main() {
int n, m, i, j, k;
scanf("%i %i", &n, &m);
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++)
scanf("%i", &a[i][j]);
int r... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
const int N = 305;
const int mod = 998244353;
int a[N][N];
int main() {
int n, m, i, j, k;
scanf("%i %i", &n, &m);
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++)
scanf("%i", &a[i][j]);
int r... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 934,321 | 934,322 | u939096624 | cpp |
p03133 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
const int N = 305;
const int mod = 998244353;
int a[N][N];
int main() {
int n, m, i, j, k;
scanf("%i %i", &n, &m);
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++)
scanf("%i", &a[i][j]);
int r... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
const int N = 305;
const int mod = 998244353;
int a[N][N];
int main() {
int n, m, i, j, k;
scanf("%i %i", &n, &m);
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++)
scanf("%i", &a[i][j]);
int r... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 934,323 | 934,322 | u939096624 | cpp |
p03133 | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 998244353;
int64_t power_mod(int64_t num, int64_t power) {
int64_t prod = 1;
num %= MOD;
while (power > 0) {
if (power & 1)
prod = prod * num % MOD;
num = num * num % MOD;
power >>= 1;
}
return prod;
}
int main() {
int N,... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 998244353;
int64_t power_mod(int64_t num, int64_t power) {
int64_t prod = 1;
num %= MOD;
while (power > 0) {
if (power & 1)
prod = prod * num % MOD;
num = num * num % MOD;
power >>= 1;
}
return prod;
}
int main() {
int N,... | [
"assignment.compound.bitwise.replace.add",
"expression.operator.bitwise.replace.remove",
"expression.operation.binary.change"
] | 934,341 | 934,342 | u314396879 | cpp |
p03133 | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 998244353;
int64_t power_mod(int64_t num, int64_t power) {
int64_t prod = 1;
num %= MOD;
while (power > 0) {
if (power & 1)
prod = prod * num % MOD;
num = num * num % MOD;
power >>= 1;
}
return prod;
}
int main() {
int N,... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 998244353;
int64_t power_mod(int64_t num, int64_t power) {
int64_t prod = 1;
num %= MOD;
while (power > 0) {
if (power & 1)
prod = prod * num % MOD;
num = num * num % MOD;
power >>= 1;
}
return prod;
}
int main() {
int N,... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.compound.bitwise.replace... | 934,343 | 934,342 | u314396879 | cpp |
p03133 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define EACH(i, c) ... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define EACH(i, c) ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.unary.arithmetic.add"
] | 934,360 | 934,359 | u805729268 | cpp |
p03134 | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) { ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) { ... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 934,377 | 934,378 | u022832318 | cpp |
p03134 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 998244353;
int dp[5000][5000];
int sum[5000], sum2[5000];
int main() {
string s;
cin >> s;
rep(i, s.size() * 2) {
if (i)
sum[i] += sum[i - 1], s... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 998244353;
int dp[5000][5000];
int sum[5000], sum2[5000];
int main() {
string s;
cin >> s;
rep(i, s.size() * 2) {
if (i)
sum[i] += sum[i - 1], s... | [
"call.arguments.change"
] | 934,381 | 934,382 | u781091740 | cpp |
p03134 | #include <iostream>
#include <string>
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
int r[4003], b[4003];
ll dp[2][4003][4003];
int main() {
string s;
cin >> s;
int n = s.size();
for (int i = 0; i < n; i++) {
if (s[i] == '0')
r[i] += 2;
if (s[i] == '1') {
r[i]++;
... | #include <iostream>
#include <string>
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
int r[4003], b[4003];
ll dp[2][4003][4003];
int main() {
string s;
cin >> s;
int n = s.size();
for (int i = 0; i < n; i++) {
if (s[i] == '0')
r[i] += 2;
if (s[i] == '1') {
r[i]++;
... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"io.output.change",
"expression.operation.binary.remove"
] | 934,397 | 934,398 | u681557252 | cpp |
p03134 | #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9 + 7)
#define inf (int)(3e18)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define P std::pair<int, int>
#define PiP std::pair<int, std::pair<int, int>>
#define all(v) v.begin(), v.end()
#define mkp std::m... | #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9 + 7)
#define inf (int)(3e18)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define P std::pair<int, int>
#define PiP std::pair<int, std::pair<int, int>>
#define all(v) v.begin(), v.end()
#define mkp std::m... | [
"expression.operation.binary.add"
] | 934,399 | 934,400 | u147049801 | cpp |
p03134 | //#pragma GCC optimize ("-O3","unroll-loops")
#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 - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(... | //#pragma GCC optimize ("-O3","unroll-loops")
#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 - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(... | [
"call.remove",
"call.arguments.change"
] | 934,403 | 934,402 | u859396346 | cpp |
p03134 | #include <bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
#define inf 1000000007
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
int dp[4010][4010];
int ka[214514], inv[214514];
void setkaijo(int n) {
ka[0] = 1;
for (int i = 1; i <= n; i++) {
ka[i] = k... | #include <bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
#define inf 998244353
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
int dp[4010][4010];
int ka[214514], inv[214514];
void setkaijo(int n) {
ka[0] = 1;
for (int i = 1; i <= n; i++) {
ka[i] = ka... | [
"preprocessor.define.value.change",
"literal.integer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 934,408 | 934,409 | u335590796 | cpp |
p03134 | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
... | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 934,410 | 934,411 | u003873207 | cpp |
p03134 | #include <bits/stdc++.h>
using namespace std;
#define showoff \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb pus... | #include <bits/stdc++.h>
using namespace std;
#define showoff \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb pus... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 934,426 | 934,427 | u869644355 | cpp |
p03134 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll... | [
"assignment.change"
] | 934,430 | 934,431 | u107292917 | cpp |
p03134 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int dp[4001][4001];
int MOD = 998244353;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
int n = s.size();
for (int i = 0; i <= 2 * n; i++)
for (int j = 0; j <= 2 * n; j++)
dp[i][j] = 0;
dp[0... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int dp[4001][4001];
int MOD = 998244353;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
int n = s.size();
for (int i = 0; i <= 2 * n; i++)
for (int j = 0; j <= 2 * n; j++)
dp[i][j] = 0;
dp[0... | [
"assignment.change"
] | 934,444 | 934,445 | u053547321 | cpp |
p03134 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define llong long long
using namespace std;
const int N = 4000;
const int P = 998244353;
llong dp[N + 3][N + 3];
char str[N + 3];
int sa[N + 3], sb[N + 3];
int n;
int main() {
scanf("%s", str + 1);
n = strlen(str + 1);
for (int i = 1;... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define llong long long
using namespace std;
const int N = 4000;
const int P = 998244353;
llong dp[N + 3][N + 3];
char str[N + 3];
int sa[N + 3], sb[N + 3];
int n;
int main() {
scanf("%s", str + 1);
n = strlen(str + 1);
for (int i = 1;... | [
"control_flow.loop.for.condition.change"
] | 934,454 | 934,455 | u396278429 | cpp |
p03134 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF (1 << 29)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long Int;
typedef pa... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 998244353
#define INF (1 << 29)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long Int;
typedef pai... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 934,456 | 934,457 | u299869545 | cpp |
p03134 | #include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#... | #include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#... | [
"assignment.add"
] | 934,469 | 934,470 | u269175074 | cpp |
p03134 | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
typedef long long ll;
const int N = 200010;
const int mod = 998244353;
const int oo = 1e9;
const int base = 27;
typedef pair<int, int> pii;
int dp[4010][4010], f1[4001], f2[4001];
string s;
ll adl(ll a, ll b) { return (1ll * a + b) % mo... | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
typedef long long ll;
const int N = 200010;
const int mod = 998244353;
const int oo = 1e9;
const int base = 27;
typedef pair<int, int> pii;
int dp[4010][4010], f1[4001], f2[4001];
string s;
ll adl(ll a, ll b) { return (1ll * a + b) % mo... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 934,479 | 934,480 | u417705043 | cpp |
p03134 | #include <bits/stdc++.h>
using namespace std;
;
#define ll long long
#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++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define INF 1 << 30
#define LINF 1LL << 62
#define all(x)... | #include <bits/stdc++.h>
using namespace std;
;
#define ll long long
#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++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define INF 1 << 30
#define LINF 1LL << 62
#define all(x)... | [
"expression.operation.binary.add"
] | 934,485 | 934,486 | u013628553 | cpp |
p03134 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int ... | [
"assignment.change"
] | 934,506 | 934,507 | u557275893 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
double a, b;
cin >> a, b;
cout << fixed << setprecision(5);
cout << a / b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
double a, b;
cin >> a >> b;
cout << fixed << setprecision(5);
cout << a / b << endl;
return 0;
}
| [] | 934,526 | 934,527 | u883297128 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
double ans = double(t) / x;
cout << fixed << setprecision << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
double ans = double(t) / x;
cout << setprecision(10) << ans << endl;
return 0;
} | [
"expression.operation.binary.remove",
"call.arguments.add"
] | 934,528 | 934,529 | u129177780 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
double ans = double(t) / x;
cout << setprecision << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
double ans = double(t) / x;
cout << setprecision(10) << ans << endl;
return 0;
} | [
"call.arguments.add"
] | 934,530 | 934,529 | u129177780 | cpp |
p03135 | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int T, X;
cin >> T >> X;
cout.s... | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
float T, X;
cin >> T >> X;
cout... | [
"variable_declaration.type.primitive.change"
] | 934,541 | 934,542 | u557207741 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
long double T, X;
cin >> T >> X;
cout << fixed << setprecision(15) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long double T, X;
cin >> T >> X;
cout << fixed << setprecision(15) << T / X << endl;
}
| [
"io.output.change"
] | 934,543 | 934,544 | u187772564 | cpp |
p03135 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll INFll = 1ll << 60;
int main() {
int t, x;
cin >> t >> x;
cout << t / x << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll INFll = 1ll << 60;
int main() {
double t, x;
cin >> t >> x;
cout << t / x << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 934,549 | 934,550 | u735008991 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
double A;
int T, X;
cin >> T >> X;
A = T / X;
cout << A << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double A, T, X;
cin >> T >> X;
A = T / X;
cout << A << endl;
}
| [] | 934,553 | 934,554 | u936105062 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
double ans = A / B / 1.0;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
double ans = A * 1.0 / B;
cout << ans << endl;
} | [
"expression.operation.binary.remove"
] | 934,555 | 934,556 | u347057617 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
double ans = A / B;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
double ans = A * 1.0 / B;
cout << ans << endl;
} | [
"assignment.change"
] | 934,557 | 934,556 | u347057617 | cpp |
p03135 | #include <stdio.h>
int t, x;
int main() {
scanf("%d %d", &t, &x);
printf("%0.2lf", (double)t / x);
} | #include <stdio.h>
int t, x;
int main() {
scanf("%d %d", &t, &x);
printf("%0.4lf", (double)t / x);
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 934,560 | 934,561 | u691912637 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
int time = t / x;
cout << time << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
double t, x;
cin >> t >> x;
double time = t / x;
cout << time << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 934,569 | 934,570 | u356754940 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, t;
cin >> x >> t;
double res = x / t;
cout << fixed << setprecision(10) << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double x, t;
cin >> x >> t;
double res = x / t;
cout << fixed << setprecision(10) << res << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 934,573 | 934,574 | u430341757 | cpp |
p03135 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
int t, x;
cin >> t >> x;
cout << (double)(t / x);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
int t, x;
cin >> t >> x;
cout << (t / (double)x);
return 0;
} | [
"type_conversion.add"
] | 934,575 | 934,576 | u021358975 | cpp |
p03135 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
int t, x;
cin >> t >> x;
cout << (double)(t / x);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
int t, x;
cin >> t >> x;
cout << ((double)t / (double)x);
return 0;
} | [
"type_conversion.add"
] | 934,575 | 934,577 | u021358975 | cpp |
p03135 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define all(x) (x).begin(), (x).end()
typedef long long int ll;
using namespace std;
int main() {
double t, x;
cin >> t >> x;
cout << setprecision(10) << x / t << endl;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define all(x) (x).begin(), (x).end()
typedef long long int ll;
using namespace std;
int main() {
double t, x;
cin >> t >> x;
cout << setprecision(10) << t / x << endl;
}
| [
"expression.operation.binary.remove"
] | 934,578 | 934,579 | u138062788 | cpp |
p03135 | #include <bits/stdc++.h>
#define rep(var, cnt) for (int(var) = 0; (var) < (int)(cnt); ++(var))
#define Rep(var, init, cnt) for (int(var) = (init); (var) < (int)(cnt); ++(var))
#define ran(var, vec) for (auto &(var) : (vec))
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define SORT(v) s... | #include <bits/stdc++.h>
#define rep(var, cnt) for (int(var) = 0; (var) < (int)(cnt); ++(var))
#define Rep(var, init, cnt) for (int(var) = (init); (var) < (int)(cnt); ++(var))
#define ran(var, vec) for (auto &(var) : (vec))
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define SORT(v) s... | [
"type_conversion.add"
] | 934,580 | 934,581 | u143572112 | cpp |
p03135 | #include <stdio.h>
int main() {
int t, x;
scanf("%d %d", &t, &x);
printf("%d", t / x);
return 0;
}
| #include <stdio.h>
int main() {
int t, x;
scanf("%d %d", &t, &x);
printf("%f", (double)(t) / x);
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 934,584 | 934,585 | u309151030 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
cout << x * t << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
double t, x;
cin >> t >> x;
cout << t / x << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"expression.operation.binary.remove"
] | 934,586 | 934,587 | u741144749 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
cout << fixed << setprecision(10) << (t / x);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
cout << fixed << setprecision(10) << (double)(t) / x;
return 0;
} | [
"type_conversion.add"
] | 934,588 | 934,589 | u130797451 | cpp |
p03135 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int x, t;
cin >> t >> x;
cout << double(t / x) << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
double x, t;
cin >> t >> x;
cout << t / x << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"call.remove",
"call.arguments.change"
] | 934,590 | 934,591 | u904995051 | cpp |
p03135 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
//素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) ... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
//素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) ... | [
"variable_declaration.type.primitive.change"
] | 934,594 | 934,595 | u355371431 | cpp |
p03135 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int t, x;
cin >> t >> x;
double ans = t / x;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int t, x;
cin >> t >> x;
double ans = (double)t / x;
cout << ans << endl;
return 0;
} | [
"type_conversion.add"
] | 934,596 | 934,597 | u915797797 | cpp |
p03135 | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b;
float f;
f = (float)(a / b);
cout << f;
} | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b;
float f;
f = ((float)a / b);
cout << f;
} | [] | 934,598 | 934,599 | u259356079 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
long double a, b, k;
cin >> a >> b;
k = b / a;
cout << fixed << setprecision(7) << k;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long double a, b, k;
cin >> a >> b;
k = a / b;
cout << fixed << setprecision(8) << k;
}
| [
"expression.operation.binary.remove",
"assignment.change",
"literal.number.change",
"io.output.change"
] | 934,600 | 934,601 | u376946371 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int T, X;
cin >> T >> X;
cout << T / X << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
double T, X;
cin >> T >> X;
cout << T / X << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 934,610 | 934,611 | u281840563 | cpp |
p03135 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int t, x;
cin >> t >> x;
cout << t / x << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
double t, x;
cin >> t >> x;
cout << t / x << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 934,612 | 934,613 | u479097347 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
cout << t / x << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double t, x;
cin >> t >> x;
cout << t / x << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 934,614 | 934,615 | u857640866 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a / b << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b;
cin >> a >> b;
cout << a / b << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 934,616 | 934,617 | u530329977 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.