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 |
|---|---|---|---|---|---|---|---|
p03168 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
double dp[n + 1][n + 1];
memset(dp, 0.0, sizeof(dp));
dp[0][0] = 1.0;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= i; j++) {
if (j == 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
double dp[n + 1][n + 1];
memset(dp, 0.0, sizeof(dp));
dp[0][0] = 1.0;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= i; j++) {
if (j == 0) {
... | [
"io.output.change"
] | 977,405 | 977,406 | u362252986 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define is(a, b) a == b
#define len(v) ll(v.size())
const ll INF = 1LL << 58;
// xより以下の要素へのindex
template <class T> int former(const ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define is(a, b) a == b
#define len(v) ll(v.size())
const ll INF = 1LL << 58;
// xより以下の要素へのindex
template <class T> int former(const ... | [
"call.arguments.change"
] | 977,416 | 977,417 | u340010271 | cpp |
p03168 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
std::cout << fixed << setprecision(10);
int n;
cin >... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
std::cout << fixed << setprecision(10);
int n;
cin >... | [
"call.arguments.change",
"control_flow.loop.for.initializer.change"
] | 977,423 | 977,424 | u834415466 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<double>> dp(n + 1, vector<double>(n + 1));
dp[0][0] = 1;
for (int i = 1; i <= n; ++i) {
double p;
cin >> p;
for (int j = 0; j <= i; ++j) {
if (j != 0) {
dp[i][j] += dp[i - 1][j - 1] * p;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<double>> dp(n + 1, vector<double>(n + 1));
dp[0][0] = 1;
for (int i = 1; i <= n; ++i) {
double p;
cin >> p;
for (int j = 0; j <= i; ++j) {
if (j != 0) {
dp[i][j] += dp[i - 1][j - 1] * p;
... | [
"io.output.change"
] | 977,425 | 977,426 | u995090660 | cpp |
p03168 | //
// ROIGold.cpp
// Main calisma
//
// Created by Rakhman on 05/02/2019.
// Copyright © 2019 Rakhman. All rights reserved.
//
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#... | //
// ROIGold.cpp
// Main calisma
//
// Created by Rakhman on 05/02/2019.
// Copyright © 2019 Rakhman. All rights reserved.
//
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#... | [
"literal.number.change",
"io.output.change"
] | 977,431 | 977,432 | u796195598 | cpp |
p03168 | #include <algorithm>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <vector>
int MOD = 1e9 + 7;
using namespace std;
int main() {
int n;
cin >> n;
vector<double> vec(n);
for (int i = 0; i < n; i++) {
double x;
cin >> x;
vec[i] = x;
}
double dp[n + 1][n +... | #include <algorithm>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <vector>
int MOD = 1e9 + 7;
using namespace std;
int main() {
int n;
cin >> n;
vector<double> vec(n);
for (int i = 0; i < n; i++) {
double x;
cin >> x;
vec[i] = x;
}
double dp[n + 1][n +... | [
"assignment.change"
] | 977,433 | 977,434 | u759162415 | cpp |
p03168 | /*
概率DP，背包模型
dp[i][j]表示前i枚硬币中，有j枚头朝上的概率
*/
#include <algorithm>
#include <cstdio>
#include <vector>
#define MAXN 3005
double dp[MAXN][MAXN];
double p[MAXN];
int n;
double ans;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%lf", &p[i]);
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
dp[... | /*
概率DP，背包模型
dp[i][j]表示前i枚硬币中，有j枚头朝上的概率
*/
#include <algorithm>
#include <cstdio>
#include <vector>
#define MAXN 3005
double dp[MAXN][MAXN];
double p[MAXN];
int n;
double ans;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%lf", &p[i]);
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
dp[... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 977,435 | 977,436 | u133805688 | cpp |
p03168 | #include <iostream>
using namespace std;
#include <bits/stdc++.h>
#include <iomanip>
#include <string.h>
#define ll long long
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define mod 100... | #include <iostream>
using namespace std;
#include <bits/stdc++.h>
#include <iomanip>
#include <string.h>
#define ll long long
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define mod 100... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"io.output.change"
] | 977,447 | 977,448 | u088730629 | cpp |
p03168 | #include <iostream>
using namespace std;
#include <bits/stdc++.h>
#include <iomanip>
#include <string.h>
#define ll long long
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define mod 100... | #include <iostream>
using namespace std;
#include <bits/stdc++.h>
#include <iomanip>
#include <string.h>
#define ll long long
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define mod 100... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"io.output.change"
] | 977,449 | 977,448 | u088730629 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
int n;
double p[3030], dp[3030][3030], ans = 0;
void pri() {
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++)
cout << dp[i][j] << ", ";
cout << endl;
}
cout << endl;
}
int main() {
cout << fixed << setprecision(3);
cin >> n;
for (int i =... | #include <bits/stdc++.h>
using namespace std;
int n;
double p[3030], dp[3030][3030], ans = 0;
void pri() {
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++)
cout << dp[i][j] << ", ";
cout << endl;
}
cout << endl;
}
int main() {
cout << fixed << setprecision(20);
cin >> n;
for (int i ... | [
"literal.number.change",
"io.output.change"
] | 977,456 | 977,457 | u974098214 | cpp |
p03168 | #include "bits/stdc++.h"
#define REP(i, x, y) for (int i = (x); i < (y); i++)
#define RREP(i, x, y) for (int i = (y)-1; i >= (x); i--)
#define all(x) (x).begin(), (x).end()
// #define int long long
using namespace std;
// conversion
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v... | #include "bits/stdc++.h"
#define REP(i, x, y) for (int i = (x); i < (y); i++)
#define RREP(i, x, y) for (int i = (y)-1; i >= (x); i--)
#define all(x) (x).begin(), (x).end()
// #define int long long
using namespace std;
// conversion
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v... | [
"expression.operation.binary.add"
] | 977,458 | 977,459 | u535555850 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> p(N + 1);
for (int i = 1; i <= N; i++)
cin >> p[i];
vector<vector<double>> dp;
dp = vector<vector<double>>(N + 1, vector<double>(N + 1, 0));
dp[0][0] = 1;
for (int i = 1; i <= N; i++) {
dp[i][0] = 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> p(N + 1);
for (int i = 1; i <= N; i++)
cin >> p[i];
vector<vector<double>> dp;
dp = vector<vector<double>>(N + 1, vector<double>(N + 1, 0));
dp[0][0] = 1;
for (int i = 1; i <= N; i++) {
dp[i][0] = 1;
... | [
"literal.number.change",
"io.output.change"
] | 977,460 | 977,461 | u119098168 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
double dp[3000][3000];
int main() {
int n;
double p[3001];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
dp[0][0] = 1;
for (int j = 1; j <= n; j++) {
dp[0][j] = dp[0][j - 1] * (1 - p[j - 1]);
for (int i = 1; i <= j; i++) {
dp[i][j] ... | #include <bits/stdc++.h>
using namespace std;
double dp[3000][3000];
int main() {
int n;
double p[3001];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
dp[0][0] = 1;
for (int j = 1; j <= n; j++) {
dp[0][j] = dp[0][j - 1] * (1 - p[j - 1]);
for (int i = 1; i <= j; i++) {
dp[i][j] ... | [
"io.output.change"
] | 977,464 | 977,465 | u107412005 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
double dp[3001][3001]; // prob of j heads in first i coins
int main() {
int i, j, n;
double p[3001];
cin >> n;
for (i = 0; i < n; i++)
cin >> p[i];
for (i = 0; i < n; i++) {
for (j = 0; j <= i + 1; j++) {
if (i == 0) {
if (j == 0)
d... | #include <bits/stdc++.h>
using namespace std;
double dp[3001][3001]; // prob of j heads in first i coins
int main() {
int i, j, n;
double p[3001];
cin >> n;
for (i = 0; i < n; i++)
cin >> p[i];
for (i = 0; i < n; i++) {
for (j = 0; j <= i + 1; j++) {
if (i == 0) {
if (j == 0)
d... | [
"io.output.change"
] | 977,468 | 977,469 | u484972704 | cpp |
p03168 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define dump(x) cout << #x << " = " << (x) << endl;
... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define dump(x) cout << #x << " = " << (x) << endl;
... | [
"io.output.change"
] | 977,472 | 977,473 | u520129469 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VI = vector<LL>;
using VVI = vector<VI>;
using VB = vector<bool>;
using VS = vector<string>;
using PII = pair<LL, LL>;
using VP = vector<PII>;
#define PB push_back
#define MP make_pair
#define SZ(a) LL((a).size())
#define EACH(x, c) for (auto x :... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VI = vector<LL>;
using VVI = vector<VI>;
using VB = vector<bool>;
using VS = vector<string>;
using PII = pair<LL, LL>;
using VP = vector<PII>;
#define PB push_back
#define MP make_pair
#define SZ(a) LL((a).size())
#define EACH(x, c) for (auto x :... | [
"io.output.change"
] | 977,474 | 977,475 | u816800341 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
const int maxn = 3000;
double dp[maxn][maxn];
signed main() {
int n;
cin >> n;
vector<double> p(n);
for (auto &&u : p)
cin >> u;
fill(dp[0], dp[maxn], 0.0);
dp[0][0] = 1.0;
rep(i, n) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
const int maxn = 3000;
double dp[maxn][maxn];
signed main() {
int n;
cin >> n;
vector<double> p(n);
for (auto &&u : p)
cin >> u;
fill(dp[0], dp[maxn], 0.0);
dp[0][0] = 1.0;
rep(i, n) ... | [
"io.output.change"
] | 977,476 | 977,477 | u731175398 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> ostream &operator<<(ostream &os, vector<T> v) {
for (auto &i : v)
os << i << " ";
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &i : v)
is >> i;
return is;
}
templ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> ostream &operator<<(ostream &os, vector<T> v) {
for (auto &i : v)
os << i << " ";
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &i : v)
is >> i;
return is;
}
templ... | [
"assignment.value.change"
] | 977,478 | 977,479 | u171804186 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> ostream &operator<<(ostream &os, vector<T> v) {
for (auto &i : v)
os << i << " ";
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &i : v)
is >> i;
return is;
}
templ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> ostream &operator<<(ostream &os, vector<T> v) {
for (auto &i : v)
os << i << " ";
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &i : v)
is >> i;
return is;
}
templ... | [
"assignment.value.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 977,480 | 977,479 | u171804186 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ops cout << "ops" << endl;
#define freopens \
freopen("cowpatibility.in", "r", stdin); \
freopen("cowpatibility.out", "w", stdout);
#define fast ... | #include <bits/stdc++.h>
using namespace std;
#define ops cout << "ops" << endl;
#define freopens \
freopen("cowpatibility.in", "r", stdin); \
freopen("cowpatibility.out", "w", stdout);
#define fast ... | [
"literal.number.change",
"io.output.change"
] | 977,488 | 977,489 | u113008684 | cpp |
p03168 | // https://atcoder.jp/contests/dp/tasks/dp_i
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define lengthof(x) (sizeof(x) / sizeof(*(x)))
#define EPS (1e-7)
#define INF (1e9)
#define MODI (1000000007)
typedef long long ll;
typedef pair<int, int> PII;
typ... | // https://atcoder.jp/contests/dp/tasks/dp_i
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define lengthof(x) (sizeof(x) / sizeof(*(x)))
#define EPS (1e-7)
#define INF (1e9)
#define MODI (1000000007)
typedef long long ll;
typedef pair<int, int> PII;
typ... | [
"assignment.change"
] | 977,493 | 977,494 | u858107870 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
const int MOD = 1e9 + 7;
const ll INF = 1e18;
const double EPS = 1e-6;
const int MAX_N = 3005;
int N;
double prob[MAX_N];
double dp[MAX_N];
int main() {
ios_b... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
const int MOD = 1e9 + 7;
const ll INF = 1e18;
const double EPS = 1e-6;
const int MAX_N = 3005;
int N;
double prob[MAX_N];
double dp[MAX_N];
int main() {
ios_b... | [
"literal.number.change",
"assignment.value.change"
] | 977,508 | 977,509 | u738069880 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define PI 3.14159265
#define int long long
#define f first
#define s second
#define mtup make_tuple
#define nl '\n'
#define FLASH \
... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define PI 3.14159265
#define int long long
#define f first
#define s second
#define mtup make_tuple
#define nl '\n'
#define FLASH \
... | [
"io.output.change"
] | 977,516 | 977,517 | u687041259 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long double> f(n + 1);
f[0] = 1;
for (int i = 0; i < n; i++) {
long double p0;
cin >> p0;
for (int j = n - 1; j >= 0; j--) {
f[j + 1] += p0 * f[j];
f[j] += (1 - p0) * f[j];
}
}
long double pr = 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long double> f(n + 1);
f[0] = 1;
for (int i = 0; i < n; i++) {
long double p0;
cin >> p0;
for (int j = n - 1; j >= 0; j--) {
f[j + 1] += p0 * f[j];
f[j] *= (1 - p0);
}
}
long double pr = 0;
for... | [
"expression.operator.change",
"expression.operation.binary.remove"
] | 977,538 | 977,539 | u251828455 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define tr(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
#define scontains(c, x) ((c).find(x) != (c).end()) // O(log n)
#define contains(c, x) (find((c).begin(), ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define tr(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
#define scontains(c, x) ((c).find(x) != (c).end()) // O(log n)
#define contains(c, x) (find((c).begin(), ... | [
"io.output.change"
] | 977,542 | 977,543 | u093219895 | cpp |
p03168 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define OO 2e18
#define oo 1e9
#define yalla ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define FILES \
freopen("input.txt", "r", stdin); ... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define OO 2e18
#define oo 1e9
#define yalla ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define FILES \
freopen("input.txt", "r", stdin); ... | [
"io.output.change",
"literal.number.change"
] | 977,552 | 977,551 | u412213585 | cpp |
p03168 | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define Test \
ll t; \
cin >> t; \
wh... | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define Test \
ll t; \
cin >> t; \
wh... | [
"literal.number.change",
"io.output.change"
] | 977,553 | 977,554 | u693452116 | cpp |
p03168 | #include <cstdio>
#include <iostream>
#define MAXN 3500
using namespace std;
int n;
double answer;
double p[MAXN];
double ans[MAXN][MAXN];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p[i];
}
ans[1][1] = 1 - p[1];
ans[1][2] = p[1];
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= ... | #include <cstdio>
#include <iostream>
#define MAXN 3500
using namespace std;
int n;
double answer;
double p[MAXN];
double ans[MAXN][MAXN];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p[i];
}
ans[1][1] = 1 - p[1];
ans[1][2] = p[1];
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= ... | [
"literal.number.change",
"io.output.change"
] | 977,571 | 977,572 | u290335371 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, i, j;
cin >> n;
double a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
double dp[n + 1];
dp[0] = 1;
for (i = 0; i < n; i++) {
for (j = i + 1; j > 0; j--) {
dp[j] = (1 - a[i]) * dp[j] + (a[i] * dp[j - 1])... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, i, j;
cin >> n;
double a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
double dp[n + 1] = {0};
dp[0] = 1;
for (i = 0; i < n; i++) {
for (j = i + 1; j > 0; j--) {
dp[j] = (1 - a[i]) * dp[j] + (a[i] * dp[j... | [
"variable_declaration.value.change"
] | 977,575 | 977,576 | u388528458 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
double *DP = new double[n + 1];
DP[0] = 1;
for (int i = 1; i <= n; i++)
DP[i] = 0;
for (int i = 0; i < n; i++) {
double p;
cin >> p;
for (int j = i + 1; j > 0; j--) {
DP[j] = DP[j] * (1 - p) + DP[j - 1] *... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
double *DP = new double[n + 1];
DP[0] = 1;
for (int i = 1; i <= n; i++)
DP[i] = 0;
for (int i = 0; i < n; i++) {
double p;
cin >> p;
for (int j = i + 1; j > 0; j--) {
DP[j] = DP[j] * (1 - p) + DP[j - 1] *... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 977,578 | 977,579 | u352811222 | cpp |
p03168 | #include <cstdio>
double dp[3000][3000];
int main() {
int n;
scanf("%d", &n);
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
double p;
scanf("%lf", &p);
dp[i][0] = dp[i - 1][0] * (1 - p);
for (int j = 1; j < i; j++)
dp[i][j] = dp[i - 1][j - 1] * p + dp[i - 1][j] * (1 - p);
dp[i][i] = dp[... | #include <cstdio>
double dp[3000][3000];
int main() {
int n;
scanf("%d", &n);
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
double p;
scanf("%lf", &p);
dp[i][0] = dp[i - 1][0] * (1 - p);
for (int j = 1; j < i; j++)
dp[i][j] = dp[i - 1][j - 1] * p + dp[i - 1][j] * (1 - p);
dp[i][i] = dp[... | [] | 977,590 | 977,591 | u350561621 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int hell = 1e9 + 7;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, i, j;
cin >> n;
vector<double> P(n);
for (i = 0; i < n; i++)
cin >> P[i];
vector<vector<double>> dp(n, vector<double>(n + 1, 0));... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int hell = 1e9 + 7;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, i, j;
cin >> n;
vector<double> P(n);
for (i = 0; i < n; i++)
cin >> P[i];
vector<vector<double>> dp(n, vector<double>(n + 1, 0));... | [
"io.output.change"
] | 977,601 | 977,602 | u310367652 | cpp |
p03168 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define ... | [
"io.output.change"
] | 977,607 | 977,608 | u242680486 | cpp |
p03168 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define ... | [
"io.output.change"
] | 977,609 | 977,610 | u242680486 | cpp |
p03168 | #include <cstdio>
#include <vector>
int main() {
int n;
scanf("%d", &n);
std::vector<double> dp(n);
dp[0] = 1;
for (int i = 0; i < n; ++i) {
std::vector<double> g(n);
double p;
scanf("%lf", &p);
for (int j = 0; j <= i; ++j) {
g[j] += dp[j] * (1 - p);
g[j + 1] += dp[j] * p;
}
... | #include <cstdio>
#include <vector>
int main() {
int n;
scanf("%d", &n);
std::vector<double> dp(n + 1);
dp[0] = 1;
for (int i = 0; i < n; ++i) {
std::vector<double> g(n + 1);
double p;
scanf("%lf", &p);
for (int j = 0; j <= i; ++j) {
g[j] += dp[j] * (1 - p);
g[j + 1] += dp[j] * p;... | [
"assignment.change"
] | 977,617 | 977,618 | u064708782 | cpp |
p03168 | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
const int MOD = 1000000007;
const int nmax = 3123;
int n;
double p[nmax], ch[nmax], res;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
cin >> p[i];
// scanf("%f",&p[i]);
}
ch[0] = 1;
for (in... | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
const int MOD = 1000000007;
const int nmax = 3123;
int n;
double p[nmax], ch[nmax], res;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
cin >> p[i];
// scanf("%f",&p[i]);
}
ch[0] = 1;
for (in... | [
"io.output.change"
] | 977,621 | 977,622 | u787228883 | cpp |
p03168 | #include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
typedef long long ll;
double dp[3002][3002], p[3002];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> p[i];
dp[0][0] = 1;
for (int pos = 1; pos <= n; ++pos) {
for (int heads = 0; heads <= pos; ++heads) {
d... | #include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
typedef long long ll;
double dp[3002][3002], p[3002];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> p[i];
dp[0][0] = 1;
for (int pos = 1; pos <= n; ++pos) {
for (int heads = 0; heads <= pos; ++heads) {
d... | [
"io.output.change"
] | 977,623 | 977,624 | u810831468 | cpp |
p03168 | /* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
// container library
#include <array>
#include <bitset>
#include <deque>
#i... | /* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
// container library
#include <array>
#include <bitset>
#include <deque>
#i... | [
"io.output.change"
] | 977,625 | 977,626 | u853132965 | cpp |
p03168 | #include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> p;
p.resize(n + 1);
int i, j, k;
for (i = 1; i <= n; i++)
cin >> p[i];
vector<vector<double>> prob;
prob.resize(n + 1);
for (i = 0; i <= n; i++)
prob[i].resize(n);
prob... | #include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> p;
p.resize(n + 1);
int i, j, k;
for (i = 1; i <= n; i++)
cin >> p[i];
vector<vector<double>> prob;
prob.resize(n + 1);
for (i = 0; i <= n; i++)
prob[i].resize(n + 1);
... | [
"expression.operation.binary.add"
] | 977,631 | 977,632 | u491400073 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
/// freopen("input.txt", "r", stdin);
int n;
cin >> n;
vector<long double> a(n);
for (auto &x : a)
cin >> x;
const int base = n;
vector<vector<long double>>... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
/// freopen("input.txt", "r", stdin);
int n;
cin >> n;
vector<long double> a(n);
for (auto &x : a)
cin >> x;
const int base = n;
vector<vector<long double>>... | [] | 977,635 | 977,636 | u784576081 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define scanVec(vec, n) \
for (int i = 0; i < n; i++) { \
cin >> vec[i]; ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define scanVec(vec, n) \
for (int i = 0; i < n; i++) { \
cin >> vec[i]; ... | [
"io.output.change"
] | 977,639 | 977,640 | u319322407 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
double a[3000];
double f[3000][3000];
int main() {
int n, i, j;
double ans = 0;
scanf("%d", &n);
f[0][0] = 1;
f[0][1] = 0;
for (i = 1; i <= n; i++) {
scanf("%llf", &a[i]);
f[i][0] = f[i - 1][0] * (1 - a[i]);
}
for (i = 1; i <= n; i++) {
for (j = ... | #include <bits/stdc++.h>
using namespace std;
double a[3000];
double f[3000][3000];
int main() {
int n, i, j;
double ans = 0;
scanf("%d", &n);
f[0][0] = 1;
f[0][1] = 0;
for (i = 1; i <= n; i++) {
scanf("%lf", &a[i]);
f[i][0] = f[i - 1][0] * (1 - a[i]);
}
for (i = 1; i <= n; i++) {
for (j = 1... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 977,664 | 977,665 | u356929542 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
using ld = long double;
int main() {
int n;
cin >> n;
vector<ld> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
vector<vector<ld>> dp(n + 1, vector<ld>(n + 1, 0));
dp[0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < i; j++) {
dp[i + ... | #include <bits/stdc++.h>
using namespace std;
using ld = long double;
int main() {
int n;
cin >> n;
vector<ld> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
vector<vector<ld>> dp(n + 1, vector<ld>(n + 1, 0));
dp[0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i; j++) {
dp[i +... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 977,666 | 977,667 | u283229916 | cpp |
p03168 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define ll long long
using namespace std;
#define BUF_SIZE 1048576
char _buf[BUF_SIZE], *_is = _buf, *_it = _buf;
inline char rdc() {
if (_is == _it)
... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define ll long long
using namespace std;
#define BUF_SIZE 1048576
char _buf[BUF_SIZE], *_is = _buf, *_it = _buf;
inline char rdc() {
if (_is == _it)
... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 977,668 | 977,669 | u378667182 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M 1000000007
double dp[3002][3002];
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M 1000000007
double dp[3002][3002];
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0); ... | [
"io.output.change"
] | 977,670 | 977,671 | u834901453 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
double p;
double dp[n + 1][n + 1] = {0};
dp[0][0] = 1;
rep(i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
double p;
double dp[n + 1][n + 1] = {0};
dp[0][0] = 1;
rep(i... | [
"io.output.change"
] | 977,706 | 977,707 | u604231488 | cpp |
p03168 | #include "bits/stdc++.h"
#define Rep(i, n) for (int i = 0; i < n; i++)
#define For(i, n1, n2) for (int i = n1; i < n2; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define put(a) cout << a << endl;
#define all(a) (a).begin(), (a).end()
#define SORT(c) sort((c).be... | #include "bits/stdc++.h"
#define Rep(i, n) for (int i = 0; i < n; i++)
#define For(i, n1, n2) for (int i = n1; i < n2; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define put(a) cout << a << endl;
#define all(a) (a).begin(), (a).end()
#define SORT(c) sort((c).be... | [
"expression.operation.binary.add"
] | 977,722 | 977,723 | u030685402 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
float a[3001], f[3001][3001];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
f[1][1] = a[1];
f[1][0] = (double)(1 - a[1]);
for (int i = 2; i <= n; i++) {
for (int j = 0; j <= i; j++) {
f[i][j] = f[i - 1][j] * (1.0 - ... | #include <bits/stdc++.h>
using namespace std;
double a[3001], f[3001][3001];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
f[1][1] = a[1];
f[1][0] = (double)(1 - a[1]);
for (int i = 2; i <= n; i++) {
for (int j = 0; j <= i; j++) {
f[i][j] = f[i - 1][j] * (1.0 -... | [
"variable_declaration.type.primitive.change"
] | 977,747 | 977,748 | u201455094 | cpp |
p03168 | #include <bits/stdc++.h>
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz size
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in i... | #include <bits/stdc++.h>
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz size
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in i... | [
"literal.number.change",
"io.output.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 977,753 | 977,754 | u022510862 | cpp |
p03168 | #include <bits/stdc++.h>
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz size
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in i... | #include <bits/stdc++.h>
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz size
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in i... | [
"literal.number.change",
"io.output.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 977,755 | 977,754 | u022510862 | cpp |
p03168 | #include <bits/stdc++.h>
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz size
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in i... | #include <bits/stdc++.h>
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz size
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in i... | [
"literal.number.change",
"io.output.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 977,756 | 977,754 | u022510862 | cpp |
p03168 | #include <bits/stdc++.h>
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz size
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in i... | #include <bits/stdc++.h>
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz size
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in i... | [
"literal.number.change",
"io.output.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 977,757 | 977,754 | u022510862 | cpp |
p03168 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | [
"variable_declaration.type.narrow.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 977,764 | 977,765 | u898651494 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int64 INF = 1LL << 59;
const int mod = 1e9 + 7;
int N;
double P[3000];
double dp[6002][3000];
bool memo[6002][3000];
double rec(int up, int idx) {
if (idx == N)
return up > 3000 ? 1.0 : 0.0;
if (exchange(memo[up][idx], true))
r... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int64 INF = 1LL << 59;
const int mod = 1e9 + 7;
int N;
double P[3000];
double dp[6002][3000];
bool memo[6002][3000];
double rec(int up, int idx) {
if (idx == N)
return up > 3000 ? 1.0 : 0.0;
if (exchange(memo[up][idx], true))
r... | [
"literal.number.change",
"io.output.change"
] | 977,767 | 977,768 | u524343822 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
const int N = 3e3 + 5;
int n;
double dp[N][N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
dp[0][0] = 1;
for (int i = 1; i <= n; ++i) {
double p;
cin >> p;
for (int j = 0; j <= i; ++j) {
int k = i - j;
... | #include <bits/stdc++.h>
using namespace std;
const int N = 3e3 + 5;
int n;
double dp[N][N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
dp[0][0] = 1;
for (int i = 1; i <= n; ++i) {
double p;
cin >> p;
for (int j = 0; j <= i; ++j) {
int k = i - j;
... | [] | 977,776 | 977,777 | u760290068 | cpp |
p03168 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 3e3 + 7;
long double p[N], f[N][N];
int main() {
int n;
long double ans = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%Lf", &p[i]);
}
f[1][1] = p[1];
f[1][0] = 1 - p[1];
for (int i = 2; i <= n; i++) {
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 3e3 + 7;
long double p[N], f[N][N];
int main() {
int n;
long double ans = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%Lf", &p[i]);
}
f[1][1] = p[1];
f[1][0] = 1 - p[1];
for (int i = 2; i <= n; i++) {
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 977,789 | 977,790 | u171891488 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define scd(t) scanf("%d", &t)
#define scld(t) scanf("%ld", &t)
#define sclld(t) scanf("%lld", &t)
#define scc(t) scanf("%c", &t)
#define scs(t) scanf("%s", t)
#define scf(t) scanf("%f", &t)
#define sclf(t) scanf("%lf", &t)
#define MEM(a, b) memset(a, (b), sizeof(a))
#defin... | #include <bits/stdc++.h>
using namespace std;
#define scd(t) scanf("%d", &t)
#define scld(t) scanf("%ld", &t)
#define sclld(t) scanf("%lld", &t)
#define scc(t) scanf("%c", &t)
#define scs(t) scanf("%s", t)
#define scf(t) scanf("%f", &t)
#define sclf(t) scanf("%lf", &t)
#define MEM(a, b) memset(a, (b), sizeof(a))
#defin... | [
"io.output.change"
] | 977,801 | 977,802 | u696401314 | cpp |
p03169 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
double sol(int i, int j, int k, vector<vector<vector<double>>> &dp) {
if (dp[i][j][k] or i + j + k ==... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
double sol(int i, int j, int k, vector<vector<vector<double>>> &dp) {
if (dp[i][j][k] or i + j + k ==... | [
"type_conversion.add"
] | 977,817 | 977,818 | u127285813 | cpp |
p03169 | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
#define rep(a, n) for (ll a = 0; a < n; a++)
#define repi(a, b, ... | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
#define rep(a, n) for (ll a = 0; a < n; a++)
#define repi(a, b, ... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 977,819 | 977,820 | u834771741 | cpp |
p03169 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define nn 301
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define nn 301
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"literal.number.change",
"call.arguments.change"
] | 977,821 | 977,822 | u093748998 | cpp |
p03169 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define nn 301
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define nn 301
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"literal.number.change",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.unary.arithmetic.remove"
] | 977,823 | 977,822 | u093748998 | cpp |
p03169 | #include <bits/stdc++.h>
using namespace std;
#define d double
const int sz = 301;
d dp[301][301][301];
d solve(int one, int two, int three, int n) {
if (one == 0 and two == 0 and three == 0)
return 0;
if (one < 0 or two < 0 or three < 0)
return 0.0;
if (dp[one][two][three] > -0.9)
return dp[one][two]... | #include <bits/stdc++.h>
using namespace std;
#define d double
const int sz = 301;
d dp[301][301][301];
d solve(int one, int two, int three, int n) {
if (one == 0 and two == 0 and three == 0)
return 0;
if (one < 0 or two < 0 or three < 0)
return 0.0;
if (dp[one][two][three] > -0.9)
return dp[one][two]... | [] | 977,828 | 977,829 | u579458117 | cpp |
p03169 | #include <bits/stdc++.h>
#define int long long int
using namespace std;
const int N = 320;
int n, a, b[3];
long double d[N], dp[N][N][N];
int32_t main() {
cout << setprecision(20) << fixed;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
b[a - 1]++;
}
for (int i = 0; i <= n; i++) {
int h = 10... | #include <bits/stdc++.h>
#define int long long int
using namespace std;
const int N = 320;
int n, a, b[3];
long double d[N], dp[N][N][N];
int32_t main() {
cout << setprecision(20) << fixed;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
b[a - 1]++;
}
for (int i = 0; i <= n; i++) {
int h = 10... | [
"literal.number.change",
"variable_declaration.value.change"
] | 977,834 | 977,835 | u917609891 | cpp |
p03169 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
#define MEM(a, b) memset(a, (b), sizeof(a))
double dp[303][303][303] = {};
double dfs(int i, int j, int k, int n) {
// if(dp[i][j][k]!=-1) return dp[i][j][k];
if ((i < 0) || (j < 0) || (k < 0))
return 0;
else if ((i == 0) && (j == 0) ... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
#define MEM(a, b) memset(a, (b), sizeof(a))
double dp[303][303][303] = {};
double dfs(int i, int j, int k, int n) {
// if(dp[i][j][k]!=-1) return dp[i][j][k];
if ((i < 0) || (j < 0) || (k < 0))
return 0;
else if ((i == 0) && (j == 0) ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 977,839 | 977,840 | u863091189 | cpp |
p03169 | /***************************************** START OF TEMPLATE
* *********************************************/
#include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(0); ... | /***************************************** START OF TEMPLATE
* *********************************************/
#include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(0); \... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 977,843 | 977,844 | u622748505 | cpp |
p03169 | /***************************************** START OF TEMPLATE
* *********************************************/
#include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(0); ... | /***************************************** START OF TEMPLATE
* *********************************************/
#include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(0); \... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 977,845 | 977,844 | u622748505 | cpp |
p03169 | /***************************************** START OF TEMPLATE
* *********************************************/
#include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(0); ... | /***************************************** START OF TEMPLATE
* *********************************************/
#include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(0); \... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 977,846 | 977,844 | u622748505 | cpp |
p03169 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 5e18;
vector<vector<vector<double>>>
dp(301, vector<vector<double>>(301, vector<double>(301, -1)));
ll n;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 5e18;
vector<vector<vector<double>>>
dp(301, vector<vector<double>>(301, vector<double>(301, -1)));
ll n;
... | [
"literal.number.change",
"assignment.value.change"
] | 977,849 | 977,850 | u718758485 | cpp |
p03169 | // atCoder - Sushi
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#incl... | // atCoder - Sushi
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#incl... | [
"literal.number.change",
"io.output.change"
] | 977,851 | 977,852 | u048224524 | cpp |
p03169 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1000000007
using namespace std;
int n;
double dp[310][310][310];
double rec(int i, int j, int k) {
if (dp[i][j][k] >= 0)
return dp[i][j][k];
if (i == 0 && j == 0 && k == 0)
return 0.0;
double res = 0.0;
if (i > 0)
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1000000007
using namespace std;
int n;
double dp[310][310][310];
double rec(int i, int j, int k) {
if (dp[i][j][k] >= 0)
return dp[i][j][k];
if (i == 0 && j == 0 && k == 0)
return 0.0;
double res = 0.0;
if (i > 0)
... | [
"assignment.change"
] | 977,853 | 977,854 | u110006361 | cpp |
p03169 | //{{{
#include <bits/stdc++.h>
using namespace std;
#define putchar(x) cout << (x)
#define repeat(x) \
int _ = 0; \
_ < (x); ... | //{{{
#include <bits/stdc++.h>
using namespace std;
#define putchar(x) cout << (x)
#define repeat(x) \
int _ = 0; \
_ < (x); ... | [
"variable_declaration.value.change"
] | 977,865 | 977,866 | u097873932 | cpp |
p03169 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 302;
int n;
double dp[MAXN][MAXN][MAXN];
bool vis[MAXN][MAXN][MAXN];
double solve(int x, int y, int z) {
if (vis[x][y][z])
return dp[x][y][z];
vis[x][y][z] = 1;
if (!x && !y && !z)
return dp[x][y][z] = 0;
int total = x + y + z;
doubl... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 302;
int n;
double dp[MAXN][MAXN][MAXN];
bool vis[MAXN][MAXN][MAXN];
double solve(int x, int y, int z) {
if (vis[x][y][z])
return dp[x][y][z];
vis[x][y][z] = 1;
if (!x && !y && !z)
return dp[x][y][z] = 0;
int total = x + y + z;
doubl... | [
"type_conversion.add"
] | 977,875 | 977,876 | u158312277 | cpp |
p03169 | #ifndef BZ
#pragma GCC optimize "-Ofast"
#endif
#include <bits/stdc++.h>
#define FASTIO
#define ALL(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i < (r); ++i)
#ifdef FASTIO
#define scanf abacaba
#define printf abacaba
#endif
typedef long long ll;
typedef double ld;
typedef unsigned long long ull;... | #ifndef BZ
#pragma GCC optimize "-Ofast"
#endif
#include <bits/stdc++.h>
#define FASTIO
#define ALL(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i < (r); ++i)
#ifdef FASTIO
#define scanf abacaba
#define printf abacaba
#endif
typedef long long ll;
typedef double ld;
typedef unsigned long long ull;... | [
"assignment.value.change"
] | 977,878 | 977,879 | u279347994 | cpp |
p03169 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
map<int, int> mp;
for (auto it : a) {
mp[it]++;
}
int N = n + 5;
double dp[N][N][N];
// dp[i][j][k]:1枚の皿がi枚、2枚の... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
map<int, int> mp;
for (auto it : a) {
mp[it]++;
}
int N = n + 5;
double dp[N][N][N];
// dp[i][j][k]:1枚の皿がi枚、2枚の... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 977,880 | 977,881 | u282228874 | cpp |
p03169 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
//#define int ll
//#define endl '\n'
// use unique(x) - removec consecutive items, returns vec.begin() + number of
// items for vector: sort(all(vec)); vec.erase(unique(all(vec)), vec.end()); use
// i... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
//#define int ll
//#define endl '\n'
// use unique(x) - removec consecutive items, returns vec.begin() + number of
// items for vector: sort(all(vec)); vec.erase(unique(all(vec)), vec.end()); use
// i... | [
"variable_declaration.type.change",
"call.function.change",
"expression.operation.binary.change"
] | 977,902 | 977,903 | u711923246 | cpp |
p03169 | #include <bits/stdc++.h>
using namespace std;
double dp[301][301][301];
double solve(int x, int y, int z, int &n) {
if (x < 0 || y < 0 || z < 0)
return 0;
if (x == 0 && y == 0 && z == 0)
return 0;
if (dp[x][y][z] > -0.9)
return dp[x][y][z];
int exp = n + x * solve(x - 1, y, z, n) + y * solve(x... | #include <bits/stdc++.h>
using namespace std;
double dp[301][301][301];
double solve(int x, int y, int z, int &n) {
if (x < 0 || y < 0 || z < 0)
return 0;
if (x == 0 && y == 0 && z == 0)
return 0;
if (dp[x][y][z] > -0.9)
return dp[x][y][z];
double exp = n + x * solve(x - 1, y, z, n) + y * solv... | [
"variable_declaration.type.primitive.change"
] | 977,917 | 977,918 | u495505677 | cpp |
p03169 | #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); ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 977,938 | 977,939 | u709648815 | cpp |
p03169 | #include <bits/stdc++.h>
double dp[301][301][301];
using namespace std;
void setdp() {
for (int i = 1; i < 301; i++) {
for (int j = 1; j < 301; j++) {
for (int k = 1; k < 301; k++) {
dp[i][j][k] = -1;
}
}
}
}
double solve(int x, int y, int z, int n) {
if (x < 0 || y < 0 || z < 0) {
... | #include <bits/stdc++.h>
double dp[301][301][301];
using namespace std;
void setdp() {
for (int i = 0; i < 301; i++) {
for (int j = 0; j < 301; j++) {
for (int k = 0; k < 301; k++) {
dp[i][j][k] = -1;
}
}
}
}
double solve(int x, int y, int z, int &n) {
if (x < 0 || y < 0 || z < 0) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 977,958 | 977,956 | u973316555 | cpp |
p03169 | #include <bits/stdc++.h>
using namespace std;
#define pr_double(x) cout << fixed << setprecision(10) << x;
double dp[301][301][301];
double solve(int x, int y, int z, int &n) {
if (x < 0 || y < 0 || z < 0) {
return 0;
}
if (x == 0 && y == 0 && z == 0) {
return 0;
}
if (dp[x][y][z] > -0.9) {
r... | #include <bits/stdc++.h>
using namespace std;
#define pr_double(x) cout << fixed << setprecision(10) << x;
double dp[301][301][301];
double solve(int x, int y, int z, int &n) {
if (x < 0 || y < 0 || z < 0) {
return 0;
}
if (x == 0 && y == 0 && z == 0) {
return 0;
}
if (dp[x][y][z] > -0.9) {
r... | [
"function.return_value.change"
] | 977,959 | 977,960 | u983104183 | cpp |
p03169 | #include <bits/stdc++.h>
using namespace std;
#define pr_double(x) cout << fixed << setprecision(10) << x;
double dp[301][301][301];
double solve(int x, int y, int z, int &n) {
if (x < 0 || y < 0 || z < 0) {
return 0;
}
if (x == 0 && y == 0 && z == 0) {
return 0;
}
if (dp[x][y][z] > -0.9) {
r... | #include <bits/stdc++.h>
using namespace std;
#define pr_double(x) cout << fixed << setprecision(10) << x;
double dp[301][301][301];
double solve(int x, int y, int z, int &n) {
if (x < 0 || y < 0 || z < 0) {
return 0;
}
if (x == 0 && y == 0 && z == 0) {
return 0;
}
if (dp[x][y][z] > -0.9) {
r... | [
"function.return_value.change"
] | 977,961 | 977,960 | u983104183 | cpp |
p03169 | #include <bits/stdc++.h>
using namespace std;
double dp[301][301][301];
double solve(int x, int y, int z, int &n) {
if (x < 0 || y < 0 || z < 0)
return 0;
if (x == 0 && y == 0 && z == 0)
return 0;
if (dp[x][y][z] > -0.9)
return dp[x][y][z];
double exp = n + x * solve(x - 1, y, z, n) + y * solve(x + ... | #include <bits/stdc++.h>
using namespace std;
double dp[301][301][301];
double solve(int x, int y, int z, int &n) {
if (x < 0 || y < 0 || z < 0)
return 0;
if (x == 0 && y == 0 && z == 0)
return 0;
if (dp[x][y][z] > -0.9)
return dp[x][y][z];
double exp = n + x * solve(x - 1, y, z, n) + y * solve(x +... | [
"literal.number.change",
"io.output.change"
] | 977,962 | 977,963 | u922620013 | cpp |
p03169 |
#include <bits/stdc++.h>
using namespace std;
double dp[301][301][301];
double solve(int x, int y, int z, int &n) {
if (x < 0 || y < 0 || z < 0) {
return 0;
}
if (dp[x][y][z] > -0.9) {
return dp[x][y][z];
}
if (x == 0 && y == 0 && z == 0) {
return 0;
}
double exp = n + x * solve(x - 1, ... |
#include <bits/stdc++.h>
using namespace std;
double dp[301][301][301];
double solve(int x, int y, int z, int &n) {
if (x < 0 || y < 0 || z < 0) {
return 0;
}
if (dp[x][y][z] > -0.9) {
return dp[x][y][z];
}
if (x == 0 && y == 0 && z == 0) {
return 0;
}
double exp = n + x * solve(x - 1, ... | [
"variable_declaration.value.change"
] | 977,968 | 977,969 | u348267046 | cpp |
p03169 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define rep(i, n) for (int i = 0; i < (n); i++)
int n;
double dp[310][310][310];
double rec(int a, int b, int c) {
if (dp[a][b][c] >= 0)
return dp[a][b][c];
if (a == 0 && b == 0 && c == 0)
return 0.0;
double res = 0.0;
if (a > 0)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define rep(i, n) for (int i = 0; i < (n); i++)
int n;
double dp[310][310][310];
double rec(int a, int b, int c) {
if (dp[a][b][c] >= 0)
return dp[a][b][c];
if (a == 0 && b == 0 && c == 0)
return 0.0;
double res = 0.0;
if (a > 0)... | [
"assignment.change"
] | 977,972 | 977,973 | u436660228 | cpp |
p03169 | #include <bits/stdc++.h>
#define ll long long
#define MAX 300005
#define pp pair<int, pair<int, int>>
#define pb push_back
#define mod 1000000007
#define mx 305
using namespace std;
/*
* author: Kruti_20
*/
ll power(ll x, ll y);
ll gcd(ll a, ll b);
double dp[mx][mx][mx];
int main() {
ios_base::sync_with_stdio... | #include <bits/stdc++.h>
#define ll long long
#define MAX 300005
#define pp pair<int, pair<int, int>>
#define pb push_back
#define mod 1000000007
#define mx 305
using namespace std;
/*
* author: Kruti_20
*/
ll power(ll x, ll y);
ll gcd(ll a, ll b);
double dp[mx][mx][mx];
int main() {
ios_base::sync_with_stdio... | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 978,000 | 978,001 | u352059674 | cpp |
p03169 | #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 long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair... | #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 long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair... | [
"assignment.change"
] | 978,002 | 978,003 | u493750228 | cpp |
p03169 | #include <bits/stdc++.h>
using namespace std;
int n;
int a[4];
double dp[305][305][305];
void solve() {
dp[0][0][0] = 0;
for (int k = 0; k <= 300; k++)
for (int j = 0; j + k <= 300; j++)
for (int i = 0; i + j + k <= 300; i++) {
if (!i && !j && !k)
continue;
int N = i + j + k;
... | #include <bits/stdc++.h>
using namespace std;
int n;
int a[4];
double dp[305][305][305];
void solve() {
dp[0][0][0] = 0;
for (int k = 0; k <= 300; k++)
for (int j = 0; j + k <= 300; j++)
for (int i = 0; i + j + k <= 300; i++) {
if (!i && !j && !k)
continue;
int N = i + j + k;
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 978,006 | 978,007 | u304050136 | cpp |
p03169 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | [
"control_flow.branch.if.condition.change",
"literal.number.change",
"call.arguments.change"
] | 978,014 | 978,015 | u874996917 | cpp |
p03169 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | [
"control_flow.branch.if.condition.change"
] | 978,016 | 978,015 | u874996917 | cpp |
p03169 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | [
"control_flow.branch.if.condition.change"
] | 978,017 | 978,015 | u874996917 | cpp |
p03169 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | [
"control_flow.branch.if.condition.change"
] | 978,017 | 978,018 | u874996917 | cpp |
p03169 | #include <bits/stdc++.h>
using namespace std;
#define FastRead \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll unsig... | #include <bits/stdc++.h>
using namespace std;
#define FastRead \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long ... | [
"control_flow.branch.if.condition.change"
] | 978,034 | 978,035 | u612858131 | cpp |
p03169 | #include <bits/stdc++.h>
using namespace std;
#define FastRead \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll unsig... | #include <bits/stdc++.h>
using namespace std;
#define FastRead \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long ... | [
"control_flow.branch.if.condition.change"
] | 978,036 | 978,035 | u612858131 | cpp |
p03169 | // Daritys Morgho ban Rovegrie
// Math = ♥
// Sometimes it is people that no one imagines anything of who do things that no
// one can imagine After all this time? Always
#include <bits/stdc++.h> // uncomment before submission
//#include <ext/pb_ds/assoc_container.hpp> // uncomment before
//submission
//#include <ext... | // Daritys Morgho ban Rovegrie
// Math = ♥
// Sometimes it is people that no one imagines anything of who do things that no
// one can imagine After all this time? Always
#include <bits/stdc++.h> // uncomment before submission
//#include <ext/pb_ds/assoc_container.hpp> // uncomment before
//submission
//#include <ext... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 978,055 | 978,056 | u299029266 | cpp |
p03169 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (l... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (l... | [] | 978,068 | 978,069 | u103850114 | cpp |
p03169 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <vector>
using namespace std;
int arr[4], n;
double dp[305][305][305];
double dfs(int a, int b, int c) {
if (a... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <vector>
using namespace std;
int arr[4], n;
double dp[305][305][305];
double dfs(int a, int b, int c) {
if (a... | [
"identifier.change",
"expression.operation.binary.change"
] | 978,070 | 978,071 | u198862456 | cpp |
p03169 | #include <bits/stdc++.h>
#define XD (a + b + c)
using namespace std;
const int maxn = 302;
bool bylo[maxn][maxn][maxn];
double dp[maxn][maxn][maxn];
int n;
double calc(int a, int b, int c) {
if (a == -1 || b == -1 || c == -1)
return 0;
if (a == 0 && b == 0 && c == 0)
return 0;
if (bylo[a][b][c])
ret... | #include <bits/stdc++.h>
#define XD (a + b + c)
using namespace std;
const int maxn = 302;
bool bylo[maxn][maxn][maxn];
double dp[maxn][maxn][maxn];
int n;
double calc(int a, int b, int c) {
// printf("a=%d b=%d c=%d\n",a,b,c);
if (a == -1 || b == -1 || c == -1)
return 0;
if (a == 0 && b == 0 && c == 0)
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 978,081 | 978,082 | u376648895 | cpp |
p03169 | #include <bits/stdc++.h>
#define XD (a + b + c)
using namespace std;
const int maxn = 302;
bool bylo[maxn][maxn][maxn];
double dp[maxn][maxn][maxn];
int n;
double calc(int a, int b, int c) {
if (a == -1 || b == -1 || c == -1)
return 0;
if (a == 0 && b == 0 && c == 0)
return 0;
if (bylo[a][b][c])
ret... | #include <bits/stdc++.h>
#define XD (a + b + c)
using namespace std;
const int maxn = 302;
bool bylo[maxn][maxn][maxn];
double dp[maxn][maxn][maxn];
int n;
double calc(int a, int b, int c) {
// printf("a=%d b=%d c=%d\n",a,b,c);
if (a == -1 || b == -1 || c == -1)
return 0;
if (a == 0 && b == 0 && c == 0)
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 978,083 | 978,082 | u376648895 | cpp |
p03169 | #include <iomanip>
#include <iostream>
using namespace std;
double solver(int i, int j, int k, double ***dp, int n) {
if (dp[i][j][k] >= 0)
return dp[i][j][k];
if (i == 0 and j == 0 and k == 0)
return 0;
double ret = 0.0;
if (i > 0)
ret += solver(i - 1, j, k, dp, n) * i;
if (j > 0 and i < n)
... | #include <iomanip>
#include <iostream>
using namespace std;
double solver(int i, int j, int k, double ***dp, int n) {
if (dp[i][j][k] >= 0)
return dp[i][j][k];
if (i == 0 and j == 0 and k == 0)
return 0;
double ret = 0.0;
if (i > 0)
ret += solver(i - 1, j, k, dp, n) * i;
if (j > 0 and i < n)
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 978,094 | 978,095 | u534223360 | cpp |
p03169 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> s(3);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
s.at(a - 1)++;
}
vector<vector<vector<double>>> dp(
n + 1, vector<vector<double>>(n + 1, vector<double>(n + 1)));
for (int k = 0; k <= n; k++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> s(3);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
s.at(a - 1)++;
}
vector<vector<vector<double>>> dp(
n + 1, vector<vector<double>>(n + 1, vector<double>(n + 1)));
for (int k = 0; k <= n; k++) {
... | [
"control_flow.loop.for.condition.change"
] | 978,100 | 978,101 | u697658632 | cpp |
p03169 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int n;
double memo[901][601][301];
double dfs(int a, int b, int c) {
if (a + b + c == 0)
return 0;
if (memo[a][b][c] != -1)
return memo[a][b][c];
double r = 1.0 * (n - a - b - c) / n, sum = 1;
if (a > 0)
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int n;
double memo[301][301][301];
double dfs(int a, int b, int c) {
if (a + b + c == 0)
return 0;
if (memo[a][b][c] != -1)
return memo[a][b][c];
double r = 1.0 * (n - a - b - c) / n, sum = 1;
if (a > 0)
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.remove"
] | 978,102 | 978,103 | u781095600 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.