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 |
|---|---|---|---|---|---|---|---|
p03167 | #include <bits/stdc++.h>
using namespace std;
char board[1005][1005];
int dp[1005][1005];
int H, W;
const int mod = (int)1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> H >> W;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> board[i][j];
}... | #include <bits/stdc++.h>
using namespace std;
char board[1005][1005];
int dp[1005][1005];
int H, W;
const int mod = (int)1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> H >> W;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> board[i][j];
}... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 975,762 | 975,763 | u963948625 | cpp |
p03167 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<in... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<in... | [
"assignment.change"
] | 975,776 | 975,777 | u682269149 | cpp |
p03167 | #include <iostream>
#include <vector>
using namespace std;
#define mod 1000000007
long rec(char **grid, int h, int w, int i, int j, long **mem) {
if (i == h - 1 && h == w - 1)
return 1;
if (i >= h or j >= w)
return 0;
if (mem[i][j] != -1)
return mem[i][j];
if (grid[i][j] == '#') {
mem[i][j] = ... | #include <iostream>
#include <vector>
using namespace std;
#define mod 1000000007
long rec(char **grid, int h, int w, int i, int j, long **mem) {
if (i == h - 1 && j == w - 1)
return 1;
if (i >= h or j >= w)
return 0;
if (mem[i][j] != -1)
return mem[i][j];
if (grid[i][j] == '#') {
mem[i][j] = ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 975,844 | 975,845 | u933124026 | cpp |
p03167 | #include <iostream>
using namespace std;
const int mod = 1000000007;
int H, W;
int ok[1009][1009];
int dp[1009][1009];
int main() {
cin >> H >> W;
for (int i = 0; i < H; i++)
for (int j = 0; j < W; j++) {
char c;
cin >> c;
ok[i][j] = (c == '.'); // 壁なら 0, そうでないなら 1
}
dp[0][0] = 1;
... | #include <iostream>
using namespace std;
const int mod = 1000000007;
int H, W;
int ok[1009][1009];
int dp[1009][1009];
int main() {
cin >> H >> W;
for (int i = 0; i < H; i++)
for (int j = 0; j < W; j++) {
char c;
cin >> c;
ok[i][j] = (c == '.'); // 壁なら 0, そうでないなら 1
}
dp[0][0] = 1;
... | [
"expression.operation.binary.add"
] | 975,856 | 975,857 | u047554023 | cpp |
p03167 | #include <bits/stdc++.h>
using namespace std;
#define max1 1005
#define siz 100000
#define mod 1000000009
#define inf 1e18 + 5
#define ll long long int
#define debug(x) cout << #x << " " << x << endl
#define jam(x) cout << "Case #" << x << ": "
typedef pair<ll, ll> pr;
vector<vector<ll>> dp(max1, vector<ll>(max1, -1));... | #include <bits/stdc++.h>
using namespace std;
#define max1 1005
#define siz 100000
#define mod 1000000007
#define inf 1e18 + 5
#define ll long long int
#define debug(x) cout << #x << " " << x << endl
#define jam(x) cout << "Case #" << x << ": "
typedef pair<ll, ll> pr;
vector<vector<ll>> dp(max1, vector<ll>(max1, -1));... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 975,858 | 975,859 | u781876525 | cpp |
p03167 | #include <algorithm>
#include <climits>
#include <cstring>
#include <fstream>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
#define ll long long
#define mod 1000000007
int h, w;
char a[1001][1001];
ll dp[1001][1001];
ll solve() {
dp[h - 1][w - 1] = 1;
for (int i = h - 1; i >= 0; i... | #include <algorithm>
#include <climits>
#include <cstring>
#include <fstream>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
#define ll long long
#define mod 1000000007
int h, w;
char a[1001][1001];
ll dp[1001][1001];
ll solve() {
dp[h - 1][w - 1] = 1;
for (int i = h - 1; i >= 0; i... | [
"assignment.change"
] | 975,864 | 975,865 | u634851584 | cpp |
p03167 | #include <bits/stdc++.h>
#define x first
#define y second
#define fastio ios_base::sync_with_stdio(0), cin.tie(0)
#define pb push_back
#define rep(i, a, b) for (int i = a; i < b; i++)
#define mem(i) memset((i), (-1), (sizeof(i)))
#define all(i) (i).begin(), (i).end()
using namespace std;
typedef pair<int, int> pii;
ty... | #include <bits/stdc++.h>
#define x first
#define y second
#define fastio ios_base::sync_with_stdio(0), cin.tie(0)
#define pb push_back
#define rep(i, a, b) for (int i = a; i < b; i++)
#define mem(i) memset((i), (-1), (sizeof(i)))
#define all(i) (i).begin(), (i).end()
using namespace std;
typedef pair<int, int> pii;
ty... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 975,870 | 975,871 | u938143205 | cpp |
p03167 | #include <bits/stdc++.h>
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cerr.tie(NULL);
#define dbg... | #include <bits/stdc++.h>
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cerr.tie(NULL);
#define dbg... | [
"literal.string.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 975,879 | 975,880 | u771565679 | cpp |
p03167 | /*
_____ ____ _____ ___ ___ ___ ___
|_ _/ __ \_ _| |__ \ / _ \ |__ \ / _ \
| || | | || | ) | | | | ) | | | |
| || | | || | / /| | | | / /| | | |
_| || |__| || |_ / /_| |_| | / /_| |_| |
|_____\____/_____| |____|\___/ |____|\___/
*/
#include <bits/stdc++.h>
#include <fstream>
#define re... | /*
_____ ____ _____ ___ ___ ___ ___
|_ _/ __ \_ _| |__ \ / _ \ |__ \ / _ \
| || | | || | ) | | | | ) | | | |
| || | | || | / /| | | | / /| | | |
_| || |__| || |_ / /_| |_| | / /_| |_| |
|_____\____/_____| |____|\___/ |____|\___/
*/
#include <bits/stdc++.h>
#include <fstream>
#define re... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 975,881 | 975,882 | u054759548 | cpp |
p03167 | #include <bits/stdc++.h>
#include <fstream>
using namespace std;
#define intMax 1000000000000;
#define rep(i, a, b) for (long long i = a; i < b; i++)
#define repp(i, a, b) for (long long i = a; i >= b; i--)
#define be(a) (a.begin(), a.end())
#define rbe(p) (p.rbegin(), p.rend())
#define pb push_back
int main() {
io... | #include <bits/stdc++.h>
#include <fstream>
using namespace std;
#define intMax 1000000000000;
#define rep(i, a, b) for (long long i = a; i < b; i++)
#define repp(i, a, b) for (long long i = a; i >= b; i--)
#define be(a) (a.begin(), a.end())
#define rbe(p) (p.rbegin(), p.rend())
#define pb push_back
int main() {
io... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 975,887 | 975,888 | u793264122 | cpp |
p03167 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PII pair<ll, ll>
#define VI vector<ll>
#define VB vector<bool>
#define VVI vector<vector<ll>>
#define VS vector<string>
#define VP vector<PII>
#define lf(i, a, b) for (ll i = a; i <= b; i++)
#define lr(i, a, b) for (ll i = a; i >= b; i--)
#defin... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PII pair<ll, ll>
#define VI vector<ll>
#define VB vector<bool>
#define VVI vector<vector<ll>>
#define VS vector<string>
#define VP vector<PII>
#define lf(i, a, b) for (ll i = a; i <= b; i++)
#define lr(i, a, b) for (ll i = a; i >= b; i--)
#defin... | [
"assignment.change"
] | 975,899 | 975,900 | u752324944 | cpp |
p03167 | // GRID-H_dp
#include <bits/stdc++.h>
#define modulu 1000000007
using namespace std;
char grid[1001][1001];
int dp[1001][1001];
int NoOFPaths(char grid[1001][1001], int r, int c) {
if (dp[r][c] != 0)
return (dp[r][c] % modulu);
for (int i = 1; i <= c; i++) { // for 1st row
if (grid[1][i] != '#') {
... | // GRID-H_dp
#include <bits/stdc++.h>
#define modulu 1000000007
using namespace std;
char grid[1001][1001];
int dp[1001][1001];
int NoOFPaths(char grid[1001][1001], int r, int c) {
if (dp[r][c] != 0)
return (dp[r][c] % modulu);
for (int i = 1; i <= c; i++) { // for 1st row
if (grid[1][i] != '#') {
... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"identifier.replace.remove",
"literal.replace.add"
] | 975,920 | 975,921 | u751364359 | cpp |
p03167 |
// GRID-H_dp
#include <bits/stdc++.h>
#define modulu 1000000007
using namespace std;
char grid[1001][1001];
int dp[1001][1001];
int NoOFPaths(char grid[1001][1001], int r, int c) {
if (dp[r][c] != 0)
return (dp[r][c] % modulu);
for (int i = 1; i <= c; i++) { // for 1st row
if (grid[1][i] != '#') {
... | // GRID-H_dp
#include <bits/stdc++.h>
#define modulu 1000000007
using namespace std;
char grid[1001][1001];
int dp[1001][1001];
int NoOFPaths(char grid[1001][1001], int r, int c) {
if (dp[r][c] != 0)
return (dp[r][c] % modulu);
for (int i = 1; i <= c; i++) { // for 1st row
if (grid[1][i] != '#') {
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"identifier.replace.remove",
"literal.replace.add"
] | 975,922 | 975,921 | u751364359 | cpp |
p03167 |
// GRID-H_dp
#include <bits/stdc++.h>
#define modulu 1000000007
using namespace std;
char grid[1001][1001];
int dp[1001][1001];
int NoOFPaths(char grid[1001][1001], int r, int c) {
if (dp[r][c] != 0)
return (dp[r][c] % modulu);
for (int i = 1; i <= c; i++) { // for 1st row
if (grid[1][i] != '#') {
... | // GRID-H_dp
#include <bits/stdc++.h>
#define modulu 1000000007
using namespace std;
char grid[1001][1001];
int dp[1001][1001];
int NoOFPaths(char grid[1001][1001], int r, int c) {
if (dp[r][c] != 0)
return (dp[r][c] % modulu);
for (int i = 1; i <= c; i++) { // for 1st row
if (grid[1][i] != '#') {
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"identifier.replace.remove",
"literal.replace.add"
] | 975,923 | 975,921 | u751364359 | cpp |
p03167 | #include <bits/stdc++.h>
#define ll long long
const int mxn = 1e3, mod = 1e9 + 7;
using namespace std;
int dp[mxn + 1][mxn + 1], grid[mxn + 1][mxn + 1];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
memset(dp, 0, sizeof(dp) / sizeof(int));
int n, m;
cin >> n >> m;
for (int i = 1; i <= n... | #include <bits/stdc++.h>
#define ll long long
const int mxn = 1e3, mod = 1e9 + 7;
using namespace std;
int dp[mxn + 1][mxn + 1], grid[mxn + 1][mxn + 1];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
memset(dp, 0, sizeof(dp) / sizeof(int));
int n, m;
cin >> n >> m;
for (int i = 1; i <= n... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 975,928 | 975,929 | u124430580 | cpp |
p03167 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
#define MAXN 1123
int H, W;
int grid[MAXN][MAXN];
int vis[MAXN][MAXN];
ll memo[MAXN][MAXN];
ll solve(int h, int w) {
if (h == H - 1 && w == W - 1)
return 1;
if (vis[h][w] == 1)
return memo[h][w];
vis[h][w] = 1;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
#define MAXN 1123
int H, W;
int grid[MAXN][MAXN];
int vis[MAXN][MAXN];
ll memo[MAXN][MAXN];
ll solve(int h, int w) {
if (h == H - 1 && w == W - 1)
return 1;
if (vis[h][w] == 1)
return memo[h][w];
vis[h][w] = 1;
... | [] | 975,960 | 975,961 | u413315284 | cpp |
p03167 | #include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
#define f(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
char a[1001][1001], dp[1001][1001];
int h, w;
int main() {
cin >> h >> w;
f(i, 1, h) {
f(j, 1, w) { cin >> a[i][j]; }
}
memset(dp, 0, sizeof(dp));
f(i, 1, h) {
... | #include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
#define f(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
char a[1001][1001];
long long int dp[1001][1001];
int h, w;
int main() {
cin >> h >> w;
f(i, 1, h) {
f(j, 1, w) { cin >> a[i][j]; }
}
memset(dp, 0, sizeof(dp));
... | [
"variable_declaration.type.widen.change"
] | 975,974 | 975,975 | u185496177 | cpp |
p03167 | #include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
#define f(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
char a[1001][1001], dp[1001][1001];
int h, w;
int main() {
cin >> h >> w;
f(i, 1, h) {
f(j, 1, w) { cin >> a[i][j]; }
}
memset(dp, 0, sizeof(dp));
f(i, 1, h) {
... | #include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
#define f(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
char a[1001][1001];
long long int dp[1001][1001];
int h, w;
int main() {
cin >> h >> w;
f(i, 1, h) {
f(j, 1, w) { cin >> a[i][j]; }
}
memset(dp, 0, sizeof(dp));
... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 975,976 | 975,975 | u185496177 | cpp |
p03167 | #include <bits/stdc++.h>
using namespace std;
int mod = 1e9 + 7;
int cal(int i, int j, vector<vector<int>> &dp, vector<vector<char>> &grid) {
if (i >= grid.size() || j >= grid[0].size())
return 0;
if (i == grid.size() - 1 || j == grid[0].size())
return 1;
if (dp[i][j] == -1) {
if (grid[i][j] == '#')
... | #include <bits/stdc++.h>
using namespace std;
int mod = 1e9 + 7;
int cal(int i, int j, vector<vector<int>> &dp, vector<vector<char>> &grid) {
if (i >= grid.size() || j >= grid[0].size())
return 0;
if (i == grid.size() - 1 && j == grid[0].size() - 1)
return 1;
if (dp[i][j] == -1) {
if (grid[i][j] == '#... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 976,027 | 976,028 | u073062346 | cpp |
p03167 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <vector>
#define f cin
#define NMAX 100010
#define MOD 1000000007
using namespace std;
// ifstream f("date.in");
long long int n, m;
char a[1010][1010];
long long int dp[1010][1010];
int main() {
f >> n >> m;
for (int i = 0; i... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <vector>
#define f cin
#define NMAX 100010
#define MOD 1000000007
using namespace std;
// ifstream f("date.in");
long long int n, m;
char a[1010][1010];
long long int dp[1010][1010];
int main() {
f >> n >> m;
for (int i = 0; i... | [] | 976,039 | 976,040 | u648916139 | cpp |
p03167 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <vector>
#define f cin
#define NMAX 100010
#define MOD 1000000007
using namespace std;
// ifstream f("date.in");
int n, m;
char a[1010][1010];
int dp[1010][1010];
int main() {
f >> n >> m;
for (int i = 0; i < n; ++i) {
for... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <vector>
#define f cin
#define NMAX 100010
#define MOD 1000000007
using namespace std;
// ifstream f("date.in");
long long int n, m;
char a[1010][1010];
long long int dp[1010][1010];
int main() {
f >> n >> m;
for (int i = 0; i... | [
"variable_declaration.type.widen.change"
] | 976,041 | 976,040 | u648916139 | cpp |
p03167 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD 1000000007
using namespace std;
long long dp[1010][1010];
signed main() {
cin.tie(0)... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD 1000000007
using namespace std;
long long dp[1010][1010];
signed main() {
cin.tie(0)... | [] | 976,042 | 976,043 | u809287016 | cpp |
p03167 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e3 + 5;
const int INF = 1e9 + 7;
#define ll long long
#define pb push_back
#define endl '\n'
#define fast_io \
ios_base::sync_with_stdio(false); \
... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e3 + 5;
const int INF = 1e9 + 7;
#define ll long long
#define pb push_back
#define endl '\n'
#define fast_io \
ios_base::sync_with_stdio(false); \
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 976,091 | 976,092 | u839285395 | cpp |
p03167 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int n, m;
const int Mod = 1e9 + 7;
long long f[1010][1010];
int main() {
scanf("%d%d", &n, &m);
f[1][1] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
char c;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int n, m;
const int Mod = 1e9 + 7;
long long f[1010][1010];
int main() {
scanf("%d%d", &n, &m);
f[1][1] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
char c;
... | [
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 976,093 | 976,094 | u623001370 | cpp |
p03167 | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
typedef unsigned long long int uli;
typedef long double Lf;
#define fastIO \
std::ios::sync_with_stdio(false); \
cin.tie(NULL)
#define mod... | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
typedef unsigned long long int uli;
typedef long double Lf;
#define fastIO \
std::ios::sync_with_stdio(false); \
cin.tie(NULL)
#define mod... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 976,131 | 976,132 | u290300767 | cpp |
p03167 | #include <bits/stdc++.h>
using namespace std;
long dp[1005][1005];
char grid[1005][1005];
#define mod 1000000009
long solve(int m, int n) {
if (m < 0 || n < 0) {
return 0;
}
if (grid[m][n] == '#') {
return 0;
}
if (dp[m][n] != -1) {
return dp[m][n] % mod;
}
dp[m][n] = solve(m - 1, n) % mod + ... | #include <bits/stdc++.h>
using namespace std;
long dp[1005][1005];
char grid[1005][1005];
#define mod 1000000007
long solve(int m, int n) {
if (m < 0 || n < 0) {
return 0;
}
if (grid[m][n] == '#') {
return 0;
}
if (dp[m][n] != -1) {
return dp[m][n] % mod;
}
dp[m][n] = solve(m - 1, n) % mod + ... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 976,146 | 976,147 | u427698913 | cpp |
p03167 | /*
tarun360
IIT Indore
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ll_s long
#define mod 1000000007
#define forn(i, start, lim) for (ll i = start; i < lim; i++)
#define forn_d(i, start, lim) for (ll i = start; i >= lim; i--)
#define forn_s(i, start, lim) for (ll_s i = start; i < lim; i... | /*
tarun360
IIT Indore
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ll_s long
#define mod 1000000007
#define forn(i, start, lim) for (ll i = start; i < lim; i++)
#define forn_d(i, start, lim) for (ll i = start; i >= lim; i--)
#define forn_s(i, start, lim) for (ll_s i = start; i < lim; i... | [
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"identifier.replace.add",
"literal.replace.remove"
] | 976,150 | 976,151 | u772514767 | cpp |
p03167 | #include <bits/stdc++.h>
#define ll long long int
#define M 1000000000000000002
#define N 400003
#define pb push_back
#define endl "\n"
char a[3000][3000];
ll b[3000][3000];
using namespace std;
int main() {
ll h, w;
cin >> h >> w;
for (ll i = 0; i < h; i++) {
for (ll j = 0; j < w; j++) {
cin >> a[i][j... | #include <bits/stdc++.h>
#define ll long long int
#define M 1000000000000000002
#define N 400003
#define pb push_back
#define endl "\n"
char a[3000][3000];
ll b[3000][3000];
using namespace std;
int main() {
ll h, w;
cin >> h >> w;
for (ll i = 0; i < h; i++) {
for (ll j = 0; j < w; j++) {
cin >> a[i][j... | [
"assignment.change"
] | 976,158 | 976,159 | u677600881 | cpp |
p03167 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define loop(i, l, r) for (int i = l; i < r; i++)
#define all(x) (x).begin(), (x).end()
typedef long lon... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define loop(i, l, r) for (int i = l; i < r; i++)
#define all(x) (x).begin(), (x).end()
typedef long lon... | [] | 976,194 | 976,195 | u754144235 | cpp |
p03167 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define loop(i, l, r) for (int i = l; i < r; i++)
#define all(x) (x).begin(), (x).end()
typedef long lon... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define loop(i, l, r) for (int i = l; i < r; i++)
#define all(x) (x).begin(), (x).end()
typedef long lon... | [
"assignment.change"
] | 976,196 | 976,195 | u754144235 | cpp |
p03167 | #include <bits/stdc++.h>
#define ll long long
#define ui unsigned int
#define ull unsigned long long
#define bug(x) cerr << (#x) << " = " << (x) << endl;
#define REP0(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REP1(i, n) for (int i = 1, _n = (n); i <= _n; ++i)
#define REPB0(i, n) for (int i = (n)-1; i >= 0; -... | #include <bits/stdc++.h>
#define ll long long
#define ui unsigned int
#define ull unsigned long long
#define bug(x) cerr << (#x) << " = " << (x) << endl;
#define REP0(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REP1(i, n) for (int i = 1, _n = (n); i <= _n; ++i)
#define REPB0(i, n) for (int i = (n)-1; i >= 0; -... | [
"call.remove",
"literal.string.change",
"call.arguments.change"
] | 976,197 | 976,198 | u300556027 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
vector<int> from[100001];
vector<int> dp;
int df(int i) {
if (dp[i] != -1)
return dp[i];
dp[i] = 0;
for (int f : from[i])
dp[i] = max(dp[i], df(f) + 1);
return dp[i];
}
int main() {
int N, M;
cin >> N >> M;
for (int i = 0; i < M; ... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
vector<int> from[100001];
vector<int> dp;
int df(int i) {
if (dp[i] != -1)
return dp[i];
dp[i] = 0;
for (int f : from[i])
dp[i] = max(dp[i], df(f) + 1);
return dp[i];
}
int main() {
int N, M;
cin >> N >> M;
for (int i = 0; i < M; ... | [
"expression.operation.binary.add"
] | 976,217 | 976,218 | u296096665 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
vector<int> dp;
int helperfn(int i, vector<vector<int>> &matrix) {
// cout<<"helperfn"<<" "<<i<<endl;
if (matrix[i].size() == 0)
return 0;
if (dp[i] != -1)
return dp[i];
int maxi = 0;
for (int j = 0; j <= matrix[i].size(); j++) {
maxi = max(maxi, 1 +... | #include <bits/stdc++.h>
using namespace std;
vector<int> dp;
int helperfn(int i, vector<vector<int>> &matrix) {
// cout<<"helperfn"<<" "<<i<<endl;
if (matrix[i].size() == 0)
return 0;
if (dp[i] != -1)
return dp[i];
int maxi = 0;
for (int j = 0; j < matrix[i].size(); j++) {
maxi = max(maxi, 1 + ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 976,219 | 976,220 | u971084072 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | [
"expression.operation.binary.add"
] | 976,230 | 976,231 | u452725238 | cpp |
p03167 | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
ll mod = 1e9 + 7;
#define EPS 1e-1
#define PI 3.14159265
#define iofile \
freopen("input.txt", "r", stdin); ... | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
ll mod = 1e9 + 7;
#define EPS 1e-1
#define PI 3.14159265
#define iofile \
freopen("input.txt", "r", stdin); ... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 976,244 | 976,245 | u767097637 | cpp |
p03167 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// ... | [
"expression.operation.binary.remove"
] | 976,252 | 976,253 | u621104964 | cpp |
p03167 | #include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define pb push_back
#define pii pair<int64_t, int64_t>
#define mp make_pair
#define whole(v) begin(v), end(v)
#define print(c, n) \
for (int64_t i = 0; i < n; i++) ... | #include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define pb push_back
#define pii pair<int64_t, int64_t>
#define mp make_pair
#define whole(v) begin(v), end(v)
#define print(c, n) \
for (int64_t i = 0; i < n; i++) ... | [
"assignment.variable.change",
"identifier.change"
] | 976,264 | 976,265 | u806721693 | cpp |
p03167 | #include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;
const ld PI = 3.14159265359;
const ll MO... | #include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;
const ld PI = 3.14159265359;
const ll MO... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 976,280 | 976,281 | u787690200 | cpp |
p03167 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e3 + 5, MOD = 1e9 + 7;
int H, W;
char grid[MAXN][MAXN];
int dp[MAXN][MAXN];
int calcDp(int r, int c) {
if (r < 0 || c < 0 || grid[r][c] == '#')
return 0;
if (dp[r][c] != -1)
return dp[r][c];
if (r == 0 && c == 0)
dp[r][c] = 1;
else
... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e3 + 5, MOD = 1e9 + 7;
int H, W;
char grid[MAXN][MAXN];
int dp[MAXN][MAXN];
int calcDp(int r, int c) {
if (r < 0 || c < 0 || grid[r][c] == '#')
return 0;
if (dp[r][c] != -1)
return dp[r][c];
if (r == 0 && c == 0)
dp[r][c] = 1;
else
... | [
"assignment.change"
] | 976,307 | 976,308 | u883813944 | cpp |
p03167 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#inclu... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#inclu... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 976,309 | 976,310 | u566864240 | cpp |
p03167 | #include <bits/stdc++.h>
#define MAXN 1010
#define pii pair<int, int>
#define pb push_back
typedef long long ll;
using namespace std;
int n, m, dp[MAXN][MAXN], mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; ... | #include <bits/stdc++.h>
#define MAXN 1010
#define pii pair<int, int>
#define pb push_back
typedef long long ll;
using namespace std;
int n, m, dp[MAXN][MAXN], mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; ... | [] | 976,315 | 976,316 | u190314045 | cpp |
p03167 | #include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define read() f... | #include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define read() f... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 976,355 | 976,356 | u302781973 | cpp |
p03167 | #include <bits/stdc++.h>
using namespace std;
long n, m, kq = 0;
long f[2000][2000], a[2000][2000];
vector<long> c[100005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> m >> n;
for (long i = 1; i <= m; i++) {
for (long j = 1; j <= n; j++) {
char v;
cin >> v;
... | #include <bits/stdc++.h>
using namespace std;
long n, m, kq = 0;
long f[2000][2000], a[2000][2000];
vector<long> c[100005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> m >> n;
for (long i = 1; i <= m; i++) {
for (long j = 1; j <= n; j++) {
char v;
cin >> v;
... | [
"assignment.change"
] | 976,357 | 976,358 | u927331900 | cpp |
p03167 | #include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define FASTIO \
ios_base::sync_with_stdio(0); \
cin.tie... | #include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define FASTIO \
ios_base::sync_with_stdio(0); \
cin.tie... | [
"call.arguments.add",
"call.arguments.change"
] | 976,386 | 976,387 | u030635914 | cpp |
p03167 | #include <iostream>
#include <queue>
using namespace std;
int main() {
int MOD = 1e9 + 7;
int dp[1003][1003];
char map[1003][1003];
int H, W;
cin >> H >> W;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> map[i][j];
}
}
for (int i = 0; i <= H; i++) {
for (int j = 0; ... | #include <iostream>
#include <queue>
using namespace std;
int main() {
int MOD = 1e9 + 7;
int dp[1003][1003];
char map[1003][1003];
int H, W;
cin >> H >> W;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> map[i][j];
}
}
for (int i = 0; i <= H; i++) {
for (int j = 0; ... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 976,395 | 976,396 | u058186113 | cpp |
p03167 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
ll mod = 1e9 + 7;
int main() {
fast();
ll r, c;
cin >> r >> c;
ll dp[r][c];
char arr[r][c];
for (ll i = 0; i < r; i++) {
for (ll j = 0; j <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
ll mod = 1e9 + 7;
int main() {
fast();
ll r, c;
cin >> r >> c;
ll dp[r][c];
char arr[r][c];
for (ll i = 0; i < r; i++) {
for (ll j = 0; j <... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 976,403 | 976,404 | u811604715 | cpp |
p03167 | #include <bits/stdc++.h>
using namespace std;
long long n, m, dp[1005][1005], mod = 1e9 + 5;
char grid[1005][1005];
long long go(int i, int j) {
if (i == n || j == m || grid[i][j] == '#')
return 0;
else if (i == n - 1 && j == m - 1)
return 1;
if (dp[i][j] != -1)
return dp[i][j];
return dp[i][j] = (g... | #include <bits/stdc++.h>
using namespace std;
long long n, m, dp[1005][1005], mod = 1e9 + 7;
char grid[1005][1005];
long long go(int i, int j) {
if (i == n || j == m || grid[i][j] == '#')
return 0;
else if (i == n - 1 && j == m - 1)
return 1;
if (dp[i][j] != -1)
return dp[i][j];
return dp[i][j] = (g... | [
"literal.number.change",
"expression.operation.binary.change"
] | 976,431 | 976,432 | u427647736 | cpp |
p03167 | /*
ID: computerbox --> Huseyn Hajiyev
LANG: C++
TASK: target_mode_on
*/
#include <bits/stdc++.h>
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#define _CRT_SECURE_NO_... | /*
ID: computerbox --> Huseyn Hajiyev
LANG: C++
TASK: target_mode_on
*/
#include <bits/stdc++.h>
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#define _CRT_SECURE_NO_... | [
"literal.number.change",
"variable_declaration.value.change"
] | 976,439 | 976,440 | u805343140 | cpp |
p03168 | #pragma GCC optimize("O3")
#include <algorithm>
#include <bits/stdc++.h>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#define forr(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define input \
ios_bas... | #pragma GCC optimize("O3")
#include <algorithm>
#include <bits/stdc++.h>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#define forr(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define input \
ios_bas... | [
"literal.number.change",
"io.output.change"
] | 976,449 | 976,450 | u922603181 | cpp |
p03168 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | [
"io.output.change"
] | 976,457 | 976,458 | u430536466 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define F first
#define S second
#define mod 1000000007
int main() {
int n, i, j, k, l, p;
cin >> n;
vector<double> prob(n);
vector<vector<double>> dp(n + 1, vector<double>(n + 1, 0));
dp[0][0] = 1;
for (auto &i : ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define F first
#define S second
#define mod 1000000007
int main() {
int n, i, j, k, l, p;
cin >> n;
vector<double> prob(n);
vector<vector<double>> dp(n + 1, vector<double>(n + 1, 0));
dp[0][0] = 1;
for (auto &i : ... | [
"io.output.change",
"call.arguments.change"
] | 976,459 | 976,460 | u883654549 | cpp |
p03168 | /*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<ll, pair<ll, ll>> plll;
#define fastread() (ios_base::sync_with_std... | /*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<ll, pair<ll, ll>> plll;
#define fastread() (ios_base::sync_with_std... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 976,485 | 976,486 | u089230684 | cpp |
p03165 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll int64_t
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair<i... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll int64_t
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair<i... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 976,538 | 976,539 | u493750228 | cpp |
p03165 | /*
_ _ ___ __ _ _ _ _
_ _ ___| | |/ _ \__ __/ _| | || | ___| |__
| | | |/ _ \ | | | | \ \ /\ / / |_| | || |_/ __| '_ \
| |_| | __/ | | |_| |\ V V /| _| |__ _\__ \ | | |
\__, |\___|_|_|\___/ \_/\_/ |_| |_| |_| |___/_| |_|
|___/
*/
#include <bits/stdc++.h>
using namespa... | /*
_ _ ___ __ _ _ _ _
_ _ ___| | |/ _ \__ __/ _| | || | ___| |__
| | | |/ _ \ | | | | \ \ /\ / / |_| | || |_/ __| '_ \
| |_| | __/ | | |_| |\ V V /| _| |__ _\__ \ | | |
\__, |\___|_|_|\___/ \_/\_/ |_| |_| |_| |___/_| |_|
|___/
*/
#include <bits/stdc++.h>
using namespa... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 976,564 | 976,565 | u278136654 | cpp |
p03165 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<vector<int>> dp(s.size() + 1, vector<int>(t.size() + 1));
for (int i = 1; i <= s.size(); i++) {
for (int j = 1; j <= t.size(); j++) {
if (s[i - 1] == t[j - 1])
dp[i][j] = max(dp[i][j], 1 + dp[i - 1][j... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<vector<int>> dp(s.size() + 1, vector<int>(t.size() + 1));
for (int i = 1; i <= s.size(); i++) {
for (int j = 1; j <= t.size(); j++) {
if (s[i - 1] == t[j - 1])
dp[i][j] = max(dp[i][j], 1 + dp[i - 1][j... | [
"control_flow.loop.condition.change"
] | 976,581 | 976,582 | u658234551 | cpp |
p03165 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
u... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
u... | [
"assignment.value.change",
"assignment.change"
] | 976,583 | 976,584 | u135572611 | cpp |
p03165 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
u... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
u... | [
"expression.operation.binary.add"
] | 976,585 | 976,584 | u135572611 | cpp |
p03168 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef... | [
"call.arguments.add",
"assignment.value.change"
] | 976,591 | 976,592 | u828388155 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N;
cin >> N;
long double arr[N];
for (int i = 0; i < N; ++i) {
cin >> arr[i];
}
long double dp[N + 1][N + 1];
dp[0][0] = 1.0;
for (int i = 1; i < N + 1; ++i) {
dp[i][0] = dp[i - 1... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N;
cin >> N;
long double arr[N];
for (int i = 0; i < N; ++i) {
cin >> arr[i];
}
long double dp[N + 1][N + 1];
dp[0][0] = 1.0;
for (int i = 1; i < N + 1; ++i) {
dp[i][0] = dp[i - 1... | [
"io.output.change"
] | 976,593 | 976,594 | u951243324 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define itn int
#define rep(i, n) for (int i = 0; i < n; i++)
long double dp[3000][3000];
int main() {
int n;
cin >> n;
long double p[n];
for (int i = 0; i < n; i++)
cin >> p[i];
dp[0][0] = 1;
for (int i = 0; i < n; i++) {
for (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define itn int
#define rep(i, n) for (int i = 0; i < n; i++)
long double dp[3000][3000];
int main() {
int n;
cin >> n;
long double p[n];
for (int i = 0; i < n; i++)
cin >> p[i];
dp[0][0] = 1;
for (int i = 0; i < n; i++) {
for (... | [
"io.output.change"
] | 976,595 | 976,596 | u512624048 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define lc "\n"
#define fast_io \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0)
#... | #include <bits/stdc++.h>
using namespace std;
#define lc "\n"
#define fast_io \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0)
#... | [
"literal.number.change",
"io.output.change"
] | 976,627 | 976,628 | u900229905 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define lc "\n"
#define fast_io \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0)
#... | #include <bits/stdc++.h>
using namespace std;
#define lc "\n"
#define fast_io \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0)
#... | [] | 976,629 | 976,628 | u900229905 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double p[n + 1], dp[n + 1][n + 1], h = 1;
for (int i = 1; i <= n; i++)
cin >> p[i];
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
dp[i][i] = dp[i - 1][i - 1] * p[i];
dp[i][0] = dp[i - 1][0] * (1 - p[i]);
}
for (int i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double p[n + 1], dp[n + 1][n + 1], h = 0;
for (int i = 1; i <= n; i++)
cin >> p[i];
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
dp[i][i] = dp[i - 1][i - 1] * p[i];
dp[i][0] = dp[i - 1][0] * (1 - p[i]);
}
for (int i ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 976,635 | 976,636 | u698089327 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
typedef double ll;
int main() {
int n, i, j;
cin >> n;
ll a[n + 2];
for (i = 1; i <= n; i++)
cin >> a[i];
vector<vector<ll>> dp(n + 1, vector<ll>(n + 2, 0.000000));
dp[0][0] = 1.000000;
// dp[0][1]=a[1];
for (i = 1; i <= n; i++)
dp[0][i] = dp[0][i ... | #include <bits/stdc++.h>
using namespace std;
typedef double ll;
int main() {
int n, i, j;
cin >> n;
ll a[n + 2];
for (i = 1; i <= n; i++)
cin >> a[i];
vector<vector<ll>> dp(n + 1, vector<ll>(n + 2, 0.000000));
dp[0][0] = 1.000000;
// dp[0][1]=a[1];
for (i = 1; i <= n; i++)
dp[0][i] = dp[0][i ... | [
"literal.number.change",
"variable_declaration.value.change",
"io.output.change"
] | 976,641 | 976,642 | u431812145 | cpp |
p03168 | #include "bits/stdc++.h"
#define ll long long
#define inf 100005
#define mod 1000000007
using namespace std;
vector<vector<ll>> g(inf);
vector<ll> indgree(inf);
vector<ll> dist(inf);
bool visted[inf];
int main() {
ll n;
cin >> n;
vector<double> p(n + 1);
for (ll i = 1; i <= n; i++) {
cin >> p[i];
}
... | #include "bits/stdc++.h"
#define ll long long
#define inf 100005
#define mod 1000000007
using namespace std;
vector<vector<ll>> g(inf);
vector<ll> indgree(inf);
vector<ll> dist(inf);
bool visted[inf];
int main() {
ll n;
cin >> n;
vector<double> p(n + 1);
for (ll i = 1; i <= n; i++) {
cin >> p[i];
}
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 976,645 | 976,646 | u165543937 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double arr[n + 1];
arr[0] = 0.0;
for (int i = 1; i <= n; i++)
cin >> arr[i];
double dp[n + 1][n + 1];
dp[0][0] = 1.0; // 0 heads lane ki probability whith 0 coins
for (int i = 1; i <= n; i++) // number of coins
{
fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double arr[n + 1];
arr[0] = 0.0;
for (int i = 1; i <= n; i++)
cin >> arr[i];
double dp[n + 1][n + 1];
dp[0][0] = 1.0; // 0 heads lane ki probability whith 0 coins
for (int i = 1; i <= n; i++) // number of coins
{
fo... | [
"io.output.change"
] | 976,654 | 976,655 | u733347296 | cpp |
p03168 | // code.begin();
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define what_is(x) cerr << #x << " is " << x << endl;
#define print(v) ... | // code.begin();
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define what_is(x) cerr << #x << " is " << x << endl;
#define print(v) ... | [
"assignment.change"
] | 976,665 | 976,666 | u089014020 | cpp |
p03168 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
double dp[3001][3001];
double solve(double p[], int i, int x) {
if (x == 0)
return 1;
if (i == 0)
return 0;
if (dp[i][x] > -0.9)
return dp[i][x];
return dp[i][x] =
p[i] * solve(p, i - 1, x - 1) + (1 - p[i] * solve(p, i -... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
double dp[3001][3001];
double solve(double p[], int i, int x) {
if (x == 0)
return 1;
if (i == 0)
return 0;
if (dp[i][x] > -0.9)
return dp[i][x];
return dp[i][x] =
p[i] * solve(p, i - 1, x - 1) + (1 - p[i]) * solve(p, i ... | [
"function.return_value.change",
"call.arguments.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.cha... | 976,667 | 976,668 | u746113754 | cpp |
p03168 | #include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL)
#define f(i, a, b) for (i = a; i < ... | #include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL)
#define f(i, a, b) for (i = a; i < ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.string.change",
"io.output.change"
] | 976,671 | 976,672 | u733037402 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
vector<vector<double>> dp;
double solve(double a[], int i, int x) {
if (x == 0)
return 1;
if (i == 0)
return 0;
if (dp[i][x] >= -0.9)
return dp[i][x];
return dp[i][x] = (a[i] * solve(a, i - 1, x - 1)) +
((1 - a[i]) * solve(a, i - 1, x... | #include <bits/stdc++.h>
using namespace std;
vector<vector<double>> dp;
double solve(double a[], int i, int x) {
if (x == 0)
return 1;
if (i == 0)
return 0;
if (dp[i][x] >= -0.9)
return dp[i][x];
return dp[i][x] = (a[i] * solve(a, i - 1, x - 1)) +
((1 - a[i]) * solve(a, i - 1, x... | [
"expression.operation.binary.add"
] | 976,675 | 976,676 | u590450959 | cpp |
p03168 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long int ll;
void solve() {
int n;
cin >> n;
vector<double> dp(n + 1);
dp[0] = 1;
for (int i = 0; i < n; i++) {
double p;
cin >> p;
for (int j = i + 1; j >= 0; j--) {
dp[j] = (j > 0 ? dp[j - 1] * p : 0) + dp[j] ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long int ll;
void solve() {
int n;
cin >> n;
vector<double> dp(n + 1);
dp[0] = 1;
for (int i = 0; i < n; i++) {
double p;
cin >> p;
for (int j = i + 1; j >= 0; j--) {
dp[j] = (j > 0 ? dp[j - 1] * p : 0) + dp[j] ... | [
"io.output.change"
] | 976,680 | 976,681 | u633290196 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<float> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
vector<vector<float>> v1(n + 1, vector<float>(n + 1));
v1[0][0] = 1.0;
for (int i = 1; i <= n; i++) {
v1[i][0] = 0;
}
for (int i = 1; i <= n; i++) {
v1[0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
vector<vector<double>> v1(n + 1, vector<double>(n + 1));
v1[0][0] = 1.0;
for (int i = 1; i <= n; i++) {
v1[i][0] = 0;
}
for (int i = 1; i <= n; i++) {
v... | [
"variable_declaration.type.primitive.change"
] | 976,688 | 976,689 | u486307811 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
double a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
double dp[n + 1][n + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
if (i == 0 && j == 0) {
dp[i][j] = 1;
} else if... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
double a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
double dp[n + 1][n + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
if (i == 0 && j == 0) {
dp[i][j] = 1;
} else if... | [
"io.output.change"
] | 976,712 | 976,713 | u466076667 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double p[n];
int i, j;
for (i = 0; i < n; i++)
cin >> p[i];
double dp[n + 1][n + 1];
for (i = 0; i <= n; i++)
dp[0][i] = 0.0;
dp[0][0] = 1.0;
for (i = 1; i <= n; i++)
dp[i][0] = dp[i - 1][0] * (1 - p[i - 1]);
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double p[n];
int i, j;
for (i = 0; i < n; i++)
cin >> p[i];
double dp[n + 1][n + 1];
for (i = 0; i <= n; i++)
dp[0][i] = 0.0;
dp[0][0] = 1.0;
for (i = 1; i <= n; i++)
dp[i][0] = dp[i - 1][0] * (1 - p[i - 1]);
for... | [
"io.output.change"
] | 976,714 | 976,715 | u483599072 | cpp |
p03168 | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<ll> vll;
typedef vector<char> vc;
typedef ve... | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<ll> vll;
typedef vector<char> vc;
typedef ve... | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 976,716 | 976,717 | u361568750 | cpp |
p03168 | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<ll> vll;
typedef vector<char> vc;
typedef ve... | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<ll> vll;
typedef vector<char> vc;
typedef ve... | [
"variable_declaration.type.primitive.change"
] | 976,716 | 976,718 | u361568750 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define forr(i, n) for (ll i = 0; i < n; i++)
#define f(i, a, b) for (int i = a; i < b; i++)
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define vi vector<ll>
#define endl '\n'
#define ce(ele) cout << ele << ' '
#define c... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define forr(i, n) for (ll i = 0; i < n; i++)
#define f(i, a, b) for (int i = a; i < b; i++)
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define vi vector<ll>
#define endl '\n'
#define ce(ele) cout << ele << ' '
#define c... | [
"assignment.change"
] | 976,724 | 976,725 | u987274574 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
//#define ll long long;
double a[3000][3000] = {0};
int main() {
int n, i, j, l;
double k;
cin >> n;
double pro[n];
for (i = 0; i < n; i++) {
cin >> pro[i];
if (i == 0)
a[0][i] = pro[i];
else {
a[0][i] = pro[i] * a[0][i - 1];
}
}
a... | #include <bits/stdc++.h>
using namespace std;
//#define ll long long;
double a[3000][3000] = {0};
int main() {
int n, i, j, l;
double k;
cin >> n;
double pro[n];
for (i = 0; i < n; i++) {
cin >> pro[i];
if (i == 0)
a[0][i] = pro[i];
else {
a[0][i] = pro[i] * a[0][i - 1];
}
}
a... | [
"io.output.change"
] | 976,735 | 976,736 | u222821788 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
double dp[3001][3001] = {};
double solve(double *arr, int n, int head) {
if (head == 0)
return 1;
if (n == 0)
return 0;
if (dp[n][head] != -1)
return dp[n][head];
return dp[n][head] = (arr[n]) * solve(arr, n - 1, head - 1) +
(1 -... | #include <bits/stdc++.h>
using namespace std;
double dp[3001][3001] = {};
double solve(double *arr, int n, int head) {
if (head == 0)
return 1;
if (n == 0)
return 0;
if (dp[n][head] > -1)
return dp[n][head];
return dp[n][head] = (arr[n]) * solve(arr, n - 1, head - 1) +
(1 - ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 976,737 | 976,738 | u659210268 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long double p[n + 1], dp[n + 1][n + 1], s = 0.0;
for (int i = 1; i <= n; i++)
cin >> p[i];
dp[0][0] = 1.0;
for (int i = 1; i <= n; i++)
dp[i][0] = dp[i - 1][0] * (1.0 - p[i]);
for (int i = 1; i <= n; i++)
dp[i][i] = dp... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long double p[n + 1], dp[n + 1][n + 1], s = 0.0;
for (int i = 1; i <= n; i++)
cin >> p[i];
dp[0][0] = 1.0;
for (int i = 1; i <= n; i++)
dp[i][0] = dp[i - 1][0] * (1.0 - p[i]);
for (int i = 1; i <= n; i++)
dp[i][i] = dp... | [
"io.output.change"
] | 976,741 | 976,742 | u659211619 | cpp |
p03168 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
const int mod = 1e9 + 7;
int main() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
//#endif
int n;
cin >> n;
vector<long double> in(n);
for (int i = 0; i < n; i++)
cin >> in[i];
... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
const int mod = 1e9 + 7;
int main() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
//#endif
int n;
cin >> n;
vector<long double> in(n);
for (int i = 0; i < n; i++)
cin >> in[i];
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 976,745 | 976,746 | u064544517 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
// DEFINE and
// TYPEDEF--------------------------------------------------------------
// For actual content check from line 85
#define FORG(i, a, n) \
for (lld i = (lld)a; a < n ? i < (lld)n : (lld)n < i; ... | #include <bits/stdc++.h>
using namespace std;
// DEFINE and
// TYPEDEF--------------------------------------------------------------
// For actual content check from line 85
#define FORG(i, a, n) \
for (lld i = (lld)a; a < n ? i < (lld)n : (lld)n < i; ... | [
"io.output.change"
] | 976,752 | 976,753 | u531151228 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define Int int32_t
#define all(c) c.begin(), c.end()
#define FAST ios_base::sync_with_stdio(false), cin.tie(NULL);
#define pii pair<int, int>
#define pb push_back
#define F first
#define S second
#define endl "\n"
#define bitcnt(n) __builtin_popcountl... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define Int int32_t
#define all(c) c.begin(), c.end()
#define FAST ios_base::sync_with_stdio(false), cin.tie(NULL);
#define pii pair<int, int>
#define pb push_back
#define F first
#define S second
#define endl "\n"
#define bitcnt(n) __builtin_popcountl... | [
"expression.operation.binary.change",
"call.arguments.add"
] | 976,761 | 976,762 | u272870143 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
vector<double> p(3000, 0);
int n;
vector<vector<double>> dp(3000, vector<double>(3000, -1));
double totalP(int i, int cnt) {
if (i == n) {
if (cnt > n / 2)
return 1;
return 0;
}
if (dp[i][cnt] != -1)
return dp[i][cnt];
else {
dp[i][cnt] =
... | #include <bits/stdc++.h>
using namespace std;
vector<double> p(3000, 0);
int n;
vector<vector<double>> dp(3000, vector<double>(3000, -1));
double totalP(int i, int cnt) {
if (i == n) {
if (cnt > n / 2)
return 1;
return 0;
}
if (dp[i][cnt] != -1)
return dp[i][cnt];
else {
dp[i][cnt] =
... | [
"io.output.change"
] | 976,769 | 976,770 | u061594873 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define uu unsigned
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define MOD 1000000007
#define p... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define uu unsigned
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define MOD 1000000007
#define p... | [] | 976,779 | 976,780 | u652421746 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define uu unsigned
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define MOD 1000000007
#define p... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define uu unsigned
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define MOD 1000000007
#define p... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 976,781 | 976,780 | u652421746 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define uu unsigned
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define MOD 1000000007
#define p... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define uu unsigned
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define MOD 1000000007
#define p... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 976,782 | 976,780 | u652421746 | cpp |
p03168 | using namespace std;
#include <bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define vect vector<ll>
#define maap map<ll, ll>
#define MOD 1000000007
#define mit map::iterator
#define pii pair<ll, ll>
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define fast ... | using namespace std;
#include <bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define vect vector<ll>
#define maap map<ll, ll>
#define MOD 1000000007
#define mit map::iterator
#define pii pair<ll, ll>
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define fast ... | [
"io.output.change"
] | 976,783 | 976,784 | u379844185 | cpp |
p03168 | #include <bits/stdc++.h>
#define F first
#define S second
#define REP(i, a, b, c) for (int i = a; i <= b; i += c)
#define pb push_back
#define int long long int
#define MOD 1000000007
using namespace std;
double dp[3001][3001];
int32_t main() {
ios ::sync_with_stdio(false);
cin.tie(0);
int t = 1;
for (int i9 ... | #include <bits/stdc++.h>
#define F first
#define S second
#define REP(i, a, b, c) for (int i = a; i <= b; i += c)
#define pb push_back
#define int long long int
#define MOD 1000000007
using namespace std;
double dp[3001][3001];
int32_t main() {
ios ::sync_with_stdio(false);
cin.tie(0);
int t = 1;
for (int i9 ... | [
"io.output.change"
] | 976,799 | 976,800 | u833947449 | cpp |
p03168 | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
double a[n + 1];
double dp[n + 1][n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[0][0] = 1;
for (int i = 1; i <= n; i++)
dp[0][i] = dp[0][i - 1] * ... | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
double a[n + 1];
double dp[n + 1][n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[0][0] = 1;
for (int i = 1; i <= n; i++)
dp[0][i] = dp[0][i - 1] * ... | [
"io.output.change"
] | 976,812 | 976,813 | u928828066 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define watch(x) cout << (#x) << " is " << (x) << "\n"
#define MOD 1000000007
ll power(ll a, ll b) { // a^b
ll r... | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define watch(x) cout << (#x) << " is " << (x) << "\n"
#define MOD 1000000007
ll power(ll a, ll b) { // a^b
ll r... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 976,814 | 976,815 | u859671712 | cpp |
p03168 | #include <cmath>
#include <iostream>
#include <vector>
typedef long long int ll;
using namespace std;
double foo(vector<double> &prob) {
int n = prob.size();
vector<vector<double>> dp(n + 1, vector<double>(n + 1));
dp[0][0] = 1;
for (int i = 1; i <= n; ++i) {
dp[i][0] = dp[i - 1][0] * (1 - prob[i - 1])... | #include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
typedef long long int ll;
using namespace std;
double foo(vector<double> &prob) {
int n = prob.size();
vector<vector<double>> dp(n + 1, vector<double>(n + 1));
dp[0][0] = 1;
for (int i = 1; i <= n; ++i) {
dp[i][0] = dp[i - 1][0] ... | [
"import.add"
] | 976,820 | 976,821 | u197841453 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vl vector<long long int>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vl vector<long long int>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | [
"io.output.change"
] | 976,828 | 976,829 | u709648815 | cpp |
p03168 | #pragma region
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define tr t[root]
#define lson t[root << 1]
#define rson t[root << 1 | 1]
#define rep(i, a, n) for (long long i = a; i... | #pragma region
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define tr t[root]
#define lson t[root << 1]
#define rson t[root << 1 | 1]
#define rep(i, a, n) for (long long i = a; i... | [
"call.arguments.change",
"call.arguments.add"
] | 976,832 | 976,833 | u035226457 | cpp |
p03168 | #pragma region
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define tr t[root]
#define lson t[root << 1]
#define rson t[root << 1 | 1]
#define rep(i, a, n) for (long long i = a; i... | #pragma region
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define tr t[root]
#define lson t[root << 1]
#define rson t[root << 1 | 1]
#define rep(i, a, n) for (long long i = a; i... | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"call.arguments.add"
] | 976,832 | 976,834 | u035226457 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
double recurse(int i, int j, vector<vector<double>> &dp, vector<double> &arr) {
// i denotes the number of heads, j denotes the number of items remaining.
if (i == 0 && j == 0)
return 1;
else if (i > 0 && j == 0)
return 0;
else if (i == 0 && j > 0) {
i... | #include <bits/stdc++.h>
using namespace std;
double recurse(int i, int j, vector<vector<double>> &dp, vector<double> &arr) {
// i denotes the number of heads, j denotes the number of items remaining.
if (i == 0 && j == 0)
return 1;
else if (i > 0 && j == 0)
return 0;
else if (i == 0 && j > 0) {
i... | [
"io.output.change"
] | 976,837 | 976,838 | u270850105 | cpp |
p03168 | // ABHISHEK AGRAWAL//
// Newbie......You have to be odd to be no. ONE :)//
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define fl float
#define lcm(a, b) (a * (b / __gcd(a, b)))
#define vs vector<string>
#define vc vector<char>
#define vll vector<ll>
#define sll set<ll>... | // ABHISHEK AGRAWAL//
// Newbie......You have to be odd to be no. ONE :)//
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define fl float
#define lcm(a, b) (a * (b / __gcd(a, b)))
#define vs vector<string>
#define vc vector<char>
#define vll vector<ll>
#define sll set<ll>... | [
"io.output.change"
] | 976,845 | 976,846 | u625460396 | cpp |
p03168 | #include <bits/stdc++.h>
#define endl '\n'
#define N 1000001
#define mod 1e9 + 7
using namespace std;
typedef long long ll;
double p[3000];
double dp[3000][3000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
cin >> n;
for (ll i = 0; i < n; i++) {
cin >> p[i];
}
... | #include <bits/stdc++.h>
#define endl '\n'
#define N 1000001
#define mod 1e9 + 7
using namespace std;
typedef long long ll;
double p[3000];
double dp[3000][3000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
cin >> n;
for (ll i = 0; i < n; i++) {
cin >> p[i];
}
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 976,849 | 976,850 | u447009922 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... | [] | 976,859 | 976,860 | u184335045 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define endl '\n'
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define rep(i, a, b) for (ll i = a; i < (b); ++i)
#define reb(i, a, b) for (ll i = a; i >= (b); --i)
#define trav(a, x) for (auto &a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define endl '\n'
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define rep(i, a, b) for (ll i = a; i < (b); ++i)
#define reb(i, a, b) for (ll i = a; i >= (b); --i)
#define trav(a, x) for (auto &a... | [
"literal.number.change",
"call.arguments.change"
] | 976,871 | 976,872 | u309862422 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.