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 |
// Contest : AtCoder - Educational DP Contest
// URL : https://atcoder.jp/contests/dp/tasks/dp_i
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define fs second
#define lb lower_bound
#de... |
// Contest : AtCoder - Educational DP Contest
// URL : https://atcoder.jp/contests/dp/tasks/dp_i
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define fs second
#define lb lower_bound
#de... | [
"variable_declaration.type.narrow.change",
"literal.number.change",
"io.output.change"
] | 976,875 | 976,876 | u415771232 | cpp |
p03168 | #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 ff first
#define ss second
#define endl "\n"
#define loop(i, s, e) for (int i = s; i < e; i++)
#define int long long
#define vi vector<int>
#define S(v) sort(v... | #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 ff first
#define ss second
#define endl "\n"
#define loop(i, s, e) for (int i = s; i < e; i++)
#define int long long
#define vi vector<int>
#define S(v) sort(v... | [
"literal.number.change",
"io.output.change"
] | 976,877 | 976,878 | u685006919 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double p[n + 1], q[n + 1];
for (int i = 1; i < n + 1; i++) {
cin >> p[i];
q[i] = 1 - p[i];
}
double dp[n + 1][n + 1];
for (int i = 0; i < n + 1; i++) {
for (int j = 0; j < n + 1; j++)
dp[i][j] = 0;
}
dp[0][0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double p[n + 1], q[n + 1];
for (int i = 1; i < n + 1; i++) {
cin >> p[i];
q[i] = 1 - p[i];
}
double dp[n + 1][n + 1];
for (int i = 0; i < n + 1; i++) {
for (int j = 0; j < n + 1; j++)
dp[i][j] = 0;
}
dp[0][0... | [
"io.output.change"
] | 976,883 | 976,884 | u544893860 | cpp |
p03168 | #include <bits/stdc++.h>
#include <math.h>
#define N 100005
#define K 200005
#define MOD (int)1e9 + 7
#define ll long long int
using namespace std;
int main() {
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... | #include <bits/stdc++.h>
#include <math.h>
#define N 100005
#define K 200005
#define MOD (int)1e9 + 7
#define ll long long int
using namespace std;
int main() {
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... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 976,885 | 976,886 | u232473835 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
double a[n + 1];
a[0] = 0.0;
for (int i = 1; i <= n; i++)
cin >> a[i];
double dp[n + 1][n + 1];
memset(dp, 0, sizeof dp);
dp[0][0] = 1.0;
if (n == 1)
cout << a[1] << "\n";
else {
for (int... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
double a[n + 1];
a[0] = 0.0;
for (int i = 1; i <= n; i++)
cin >> a[i];
double dp[n + 1][n + 1];
memset(dp, 0, sizeof dp);
dp[0][0] = 1.0;
if (n == 1)
cout << a[1] << "\n";
else {
for (int... | [
"io.output.change"
] | 976,887 | 976,888 | u507549471 | cpp |
p03168 | #include <bits/stdc++.h>
#define next_permutation np // next_permutation(s.begin(),s.end())or arr,arr+3
// qsort( str, size, sizeof( str[0] ), compare ); for strings
// ceil/floor funtion
// upper_bound() return an iterator(important);
// map<pair<int, int>, int> vis;vos({0,0},1) used for positon ;//pair<int ,int
// >c... | #include <bits/stdc++.h>
#define next_permutation np // next_permutation(s.begin(),s.end())or arr,arr+3
// qsort( str, size, sizeof( str[0] ), compare ); for strings
// ceil/floor funtion
// upper_bound() return an iterator(important);
// map<pair<int, int>, int> vis;vos({0,0},1) used for positon ;//pair<int ,int
// >c... | [
"io.output.change"
] | 976,891 | 976,892 | u898632998 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
typedef double ff;
#define ari \
for (int i = 1; i <= n; i++) \
cin >> p[i];
int n;
ff p[3002], dp[3002];
int main() {
cin >> n;
ari;
dp[0] = 1.00... | #include <bits/stdc++.h>
using namespace std;
typedef double ff;
#define ari \
for (int i = 1; i <= n; i++) \
cin >> p[i];
int n;
ff p[3002], dp[3002];
int main() {
cin >> n;
ari;
dp[0] = 1.00... | [
"io.output.change"
] | 976,895 | 976,896 | u681396939 | cpp |
p03168 | #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_que... | #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_que... | [
"call.remove"
] | 976,905 | 976,906 | u996425102 | cpp |
p03168 | // coins problem
#include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#define ll long double
using namespace std;
void printmat(vector<vector<ll>> &dp, ll n) {
for (ll i = 0; i <= n; i++) {
for (ll j = 0; j <= n; j++) {
cout << setw(6) << dp[i][j] << " ";
}
cout << e... | // coins problem
#include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#define ll long double
using namespace std;
void printmat(vector<vector<ll>> &dp, ll n) {
for (ll i = 0; i <= n; i++) {
for (ll j = 0; j <= n; j++) {
cout << setw(6) << dp[i][j] << " ";
}
cout << e... | [
"io.output.change"
] | 976,909 | 976,910 | u297190465 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ll long long // Short form for long long
#define ld long double // Short form for long double
#define fl float
typedef pair<ll, ll> pii; // Pair of long long
typedef vector<ll> vi; // Vector of long long
typedef vector<fl> vf;
typedef vector<ld> vd; // Vector ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long // Short form for long long
#define ld long double // Short form for long double
#define fl float
typedef pair<ll, ll> pii; // Pair of long long
typedef vector<ll> vi; // Vector of long long
typedef vector<fl> vf;
typedef vector<ld> vd; // Vector ... | [
"expression.operation.binary.remove",
"literal.number.change",
"io.output.change"
] | 976,911 | 976,912 | u151623721 | cpp |
p03168 | #include <bits/stdc++.h>
#define prDouble(x) cout << fixed << setprecision(10) << x
using namespace std;
double dp[3001][3001];
double probability(double *arr, int i, int x) {
if (x == 0) {
return 1;
}
if (i == 0) {
return 0;
}
if (dp[i][x] > -0.1) {
return dp[i][x];
}
return dp[i][x] = arr[... | #include <bits/stdc++.h>
#define prDouble(x) cout << fixed << setprecision(10) << x
using namespace std;
double dp[3001][3001];
double probability(double *arr, 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] = arr[... | [
"literal.number.change",
"control_flow.branch.if.condition.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.change"
] | 976,913 | 976,914 | u510516229 | cpp |
p03168 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 976,930 | 976,931 | u379804877 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define vec(x) vector<x>
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pair<int, int>>
#define matrix(x) vector<vector<x>>
#define all(v) v.begin(), v.end()
#define mem(a, b) memset(a, b, s... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define vec(x) vector<x>
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pair<int, int>>
#define matrix(x) vector<vector<x>>
#define all(v) v.begin(), v.end()
#define mem(a, b) memset(a, b, s... | [
"io.output.change"
] | 976,932 | 976,933 | u088871523 | cpp |
p03168 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define MAX 3000
#define ll long long
int main() {
int n;
cin >> n;
double a[n];
double dp[n + 1][n + 1];
int i, j;
double sum = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
}
dp[0][0] = 1;
for (i = 1; i <= n; i++) {
dp[0][i] = ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define MAX 3000
#define ll long long
int main() {
int n;
cin >> n;
double a[n];
double dp[n + 1][n + 1];
int i, j;
double sum = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
}
dp[0][0] = 1;
for (i = 1; i <= n; i++) {
dp[0][i] = ... | [
"io.output.change"
] | 976,934 | 976,935 | u759567410 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define pb pu... | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define pb pu... | [
"io.output.change"
] | 976,936 | 976,937 | u886696637 | cpp |
p03168 | // itne me hi thakk gaye?
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("-O3")
#define ll long long
#define ull unsigned long long
using ld = long double;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
const ll rk = 256;
const ld PI = 3.141592653589793;
#define pb push_back
#define mp make_pair
#defi... | // itne me hi thakk gaye?
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("-O3")
#define ll long long
#define ull unsigned long long
using ld = long double;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
const ll rk = 256;
const ld PI = 3.141592653589793;
#define pb push_back
#define mp make_pair
#defi... | [
"io.output.change"
] | 976,938 | 976,939 | u207533939 | cpp |
p03168 | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef priority_queue<int... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef priority_queue<int... | [
"io.output.change"
] | 976,942 | 976,943 | u075255886 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll l... | #include <bits/stdc++.h>
using namespace std;
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll l... | [
"assignment.change"
] | 976,946 | 976,947 | u294694938 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll l... | #include <bits/stdc++.h>
using namespace std;
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll l... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 976,948 | 976,947 | u294694938 | cpp |
p03168 | /************
* @Just Another Source code by: ankit.sangwan1999
* @created on: 22 May 2020
*/
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL... | /************
* @Just Another Source code by: ankit.sangwan1999
* @created on: 22 May 2020
*/
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL... | [
"io.output.change"
] | 976,949 | 976,950 | u808647942 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvd = vector<vector<double>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvd = vector<vector<double>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 976,951 | 976,952 | u493928141 | cpp |
p03168 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pb push_back
#define mp make_pair
#define sp(x) fixed << setprecision(x)
#define fast_io \
ios_base::sync_with_stdio(false); ... |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pb push_back
#define mp make_pair
#define sp(x) fixed << setprecision(x)
#define fast_io \
ios_base::sync_with_stdio(false); ... | [
"assignment.change"
] | 976,955 | 976,956 | u441400811 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double p[n];
for (int i = 0; i < n; i++) {
/* code */
cin >> p[i];
}
// for (int i = 0; i < n; i++)
// {
// /* code */
// cout<<p[i]<<" ";
// }
double dp[n + 1][n + 1];
for (int i = 0; i < n + 1; ++i) {
/... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double p[n];
for (int i = 0; i < n; i++) {
/* code */
cin >> p[i];
}
// for (int i = 0; i < n; i++)
// {
// /* code */
// cout<<p[i]<<" ";
// }
double dp[n + 1][n + 1];
for (int i = 0; i < n + 1; ++i) {
/... | [
"io.output.change"
] | 976,957 | 976,958 | u589362760 | cpp |
p03168 | // Created by Tanuj Jain
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
template <class T>
using oset =
tree<T, null_ty... | // Created by Tanuj Jain
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
template <class T>
using oset =
tree<T, null_ty... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 976,966 | 976,967 | u604854220 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int n;
cin >> n;
double p[n + 1];
for (ll i = 1; i <= n; i++)
cin >> p[i];
double dp[n + 1][n + 1];
for (ll i = 0; i <= n; i++)
for (ll j = ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int n;
cin >> n;
double p[n + 1];
for (ll i = 1; i <= n; i++)
cin >> p[i];
double dp[n + 1][n + 1];
for (ll i = 0; i <= n; i++)
for (ll j = ... | [
"literal.number.change",
"io.output.change"
] | 976,974 | 976,975 | u429860633 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int n;
cin >> n;
double p[n + 1];
for (ll i = 1; i <= n; i++)
cin >> p[i];
double dp[n + 1][n + 1];
for (ll i = 0; i <= n; i++)
for (ll j = ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int n;
cin >> n;
double p[n + 1];
for (ll i = 1; i <= n; i++)
cin >> p[i];
double dp[n + 1][n + 1];
for (ll i = 0; i <= n; i++)
for (ll j = ... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"literal.number.change",
"io.output.change"
] | 976,976 | 976,975 | u429860633 | cpp |
p03168 | #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 int long long
#define pb push_back
#define pii pair<int, int>
#define fr(i, n) for (int i = 0; i < n; i++)
#define F first
#define S second
#define nl '\n'
#... | #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 int long long
#define pb push_back
#define pii pair<int, int>
#define fr(i, n) for (int i = 0; i < n; i++)
#define F first
#define S second
#define nl '\n'
#... | [
"io.output.change"
] | 976,977 | 976,978 | u146209432 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void cc_env() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
//
#endif
}
int main() {
// cc_env();
// input part
int N;
cin >> N;
vector<double> inputArr(N);
for (int i = 0; i < N; i++)
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void cc_env() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
//
#endif
}
int main() {
// cc_env();
// input part
int N;
cin >> N;
vector<double> inputArr(N);
for (int i = 0; i < N; i++)
... | [
"io.output.change"
] | 976,989 | 976,990 | u733591334 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
void start() {
ios_base::sync_with_stdio(false);
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
void start() {
ios_base::sync_with_stdio(false);
... | [
"variable_declaration.remove"
] | 977,002 | 977,003 | u948429045 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Field = vector<vector<int>>;
using Graph = vector<vector<int>>;
using VI = vector<int>;
using VC = vector<char>;
using PI = pair<int, int>;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) x.begin(), x.end()
const long long INF ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Field = vector<vector<int>>;
using Graph = vector<vector<int>>;
using VI = vector<int>;
using VC = vector<char>;
using PI = pair<int, int>;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) x.begin(), x.end()
const long long INF ... | [
"literal.number.change",
"io.output.change"
] | 977,004 | 977,005 | u848058000 | cpp |
p03168 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#define gc(x) \
do { \
while ((x = getchar()) < '0') ... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#define gc(x) \
do { \
while ((x = getchar()) < '0') ... | [
"io.output.change"
] | 977,006 | 977,007 | u514882008 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef set<int>::iterator sit;
typedef map<int, int>::iterator mit;
typedef vector<int>::iterator vit;
const int INF = 1e9 + 7;
const int MOD = 1e9 +... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef set<int>::iterator sit;
typedef map<int, int>::iterator mit;
typedef vector<int>::iterator vit;
const int INF = 1e9 + 7;
const int MOD = 1e9 +... | [
"io.output.change"
] | 977,008 | 977,009 | u670454361 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n;
cin >> n;
double arr[n + 1];
for (ll i = 1; i <= n; i++)
cin >> arr[i];
double dp[n + 1][n + 1];
memset(dp, 0.0, sizeof(dp));
dp[0][0] = 1.0;
for (ll i = 1; i <= n; i++) {
for (ll j = 0; j <= n; j++) {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n;
cin >> n;
double arr[n + 1];
for (ll i = 1; i <= n; i++)
cin >> arr[i];
double dp[n + 1][n + 1];
memset(dp, 0.0, sizeof(dp));
dp[0][0] = 1.0;
for (ll i = 1; i <= n; i++) {
for (ll j = 0; j <= n; j++) {
... | [
"io.output.change"
] | 977,012 | 977,013 | u876721855 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int mxN = 4000;
int n;
double p[mxN];
double dp[mxN][mxN];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
if (fopen("input.in", "r")) {
freopen("input.in", "r", stdin);
freop... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int mxN = 4000;
int n;
double p[mxN];
double dp[mxN][mxN];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
if (fopen("input.in", "r")) {
freopen("input.in", "r", stdin);
freop... | [
"io.output.change"
] | 977,018 | 977,019 | u142188850 | cpp |
p03168 | // https://atcoder.jp/contests/dp/tasks/dp_i
#include <bits/stdc++.h>
using namespace std;
typedef long double dl;
int main() {
int n, i, j;
cin >> n;
dl arr[n + 1], dp[n + 1][n + 1],
ans = 0.0; // dp[i][j] means in pos j there are i heads
for (i = 1; i <= n; i++)
cin >> arr[i];
/* for(i=0;i<n;i++)... | // https://atcoder.jp/contests/dp/tasks/dp_i
#include <bits/stdc++.h>
using namespace std;
typedef long double dl;
int main() {
int n, i, j;
cin >> n;
dl arr[n + 1], dp[n + 1][n + 1],
ans = 0.0; // dp[i][j] means in pos j there are i heads
for (i = 1; i <= n; i++)
cin >> arr[i];
/* for(i=0;i<n;i++)... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 977,022 | 977,023 | u736529159 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> a(n + 1);
vector<vector<double>> dp(n + 1, vector<double>(n + 1));
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= n; j++) {
dp[i][j] = dp[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> a(n + 1);
vector<vector<double>> dp(n + 1, vector<double>(n + 1));
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= n; j++) {
dp[i][j] = dp[i... | [
"io.output.change"
] | 977,036 | 977,037 | u895283116 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define loop(i, a, b) for (int i = (a); i < (b); i++)
#define loopb(i, a, b) for (int i = (a); i > (b); --i)
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vl;
c... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define loop(i, a, b) for (int i = (a); i < (b); i++)
#define loopb(i, a, b) for (int i = (a); i > (b); --i)
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vl;
c... | [] | 977,044 | 977,045 | u332824951 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
double a[n];
ll i, j;
for (i = 0; i < n; i++)
cin >> a[i];
double sol[n][n + 1];
sol[0][0] = 1 - a[0];
sol[0][1] = a[0];
for (i = 2; i <= n; i++)
sol[0][i] = 0;
double sum = 0;
for (i = 1; i < n... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
double a[n];
ll i, j;
for (i = 0; i < n; i++)
cin >> a[i];
double sol[n][n + 1];
sol[0][0] = 1 - a[0];
sol[0][1] = a[0];
for (i = 2; i <= n; i++)
sol[0][i] = 0;
double sum = 0;
for (i = 1; i < n... | [
"io.output.change"
] | 977,056 | 977,057 | u975400222 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define int long long
#define mp make_pair
#define endl "\n"
#define pii pair<int, int>
#define ff first
#define ss second
#define mii map<int, int>
#define si set<int>
#define sti stack<int>
#define qi queue<int>
#define vi vector<int>
#define pq prior... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define int long long
#define mp make_pair
#define endl "\n"
#define pii pair<int, int>
#define ff first
#define ss second
#define mii map<int, int>
#define si set<int>
#define sti stack<int>
#define qi queue<int>
#define vi vector<int>
#define pq prior... | [
"io.output.change"
] | 977,058 | 977,059 | u231918578 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
double p;
double dp[n + 1][n + 1];
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
cin >> p;
for (int j = 0; j <= i; j++) {
if (j)
dp[i][j] += p * dp[i - 1][j - 1];
dp[i][j] += (1 - p) * dp[i - 1][j];
... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
double p;
double dp[n + 5][n + 5];
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
cin >> p;
for (int j = 0; j <= i; j++) {
if (j)
dp[i][j] += p * dp[i - 1][j - 1];
dp[i][j] += (1 - p) * dp[i - 1][j];
... | [
"literal.number.change",
"expression.operation.binary.change"
] | 977,062 | 977,063 | u049015919 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
double p;
double dp[n + 1][n + 1];
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
cin >> p;
for (int j = 0; j <= i; j++) {
if (j)
dp[i][j] += p * dp[i - 1][j - 1];
dp[i][j] += (1 - p) * dp[i - 1][j];
... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
double p;
double dp[n + 5][n + 5];
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
cin >> p;
for (int j = 0; j <= i; j++) {
if (j)
dp[i][j] += p * dp[i - 1][j - 1];
dp[i][j] += (1 - p) * dp[i - 1][j];
... | [
"literal.number.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 977,064 | 977,063 | u049015919 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define COUT(x) cout << (x) << endl
#define dump(x) cout << #x << " = " << (x) << endl;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
using M = map<int, int>;
using PQ = priority_queue<int>;
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define COUT(x) cout << (x) << endl
#define dump(x) cout << #x << " = " << (x) << endl;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
using M = map<int, int>;
using PQ = priority_queue<int>;
... | [
"variable_declaration.type.primitive.change"
] | 977,065 | 977,066 | u303884911 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, l) for (lli i = s; i < l; i++)
#define DEBUG 0
#define INF (1LL << 50)
#define MOD 1000000007
signed main() {
lli n;
cin >> n;
vector<double> p(n);
REP(i, 0, n) cin >> p[i];
double dp[3010] = {0};
dp[0] = 1.0;
... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, l) for (lli i = s; i < l; i++)
#define DEBUG 0
#define INF (1LL << 50)
#define MOD 1000000007
signed main() {
lli n;
cin >> n;
vector<double> p(n);
REP(i, 0, n) cin >> p[i];
double dp[3010] = {0};
dp[0] = 1.0;
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 977,071 | 977,072 | u041513069 | cpp |
p03168 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define endl '\n'
#define maxl __LONG_LONG_MAX__
#define pb push_back
#define F first
#define S second
#define mp make_pair
#define rep(i, n) for (int i = 0; i < n; i++)
#define rev(i, n) for (int i = n - ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define endl '\n'
#define maxl __LONG_LONG_MAX__
#define pb push_back
#define F first
#define S second
#define mp make_pair
#define rep(i, n) for (int i = 0; i < n; i++)
#define rev(i, n) for (int i = n - ... | [
"io.output.change"
] | 977,073 | 977,074 | u035933444 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
#define pi 3.141592653589793
#define mod 998244353
#define pb push_back
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
#define pi 3.141592653589793
#define mod 998244353
#define pb push_back
#d... | [
"io.output.change"
] | 977,080 | 977,081 | u059026899 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> A(n, 0);
for (int i = 0; i < n; i++)
cin >> A[i];
vector<vector<double>> dp(n + 1, vector<double>(n + 1, 0.0));
dp[0][0] = 1.0;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= i; j++) {
if (j ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> A(n, 0);
for (int i = 0; i < n; i++)
cin >> A[i];
vector<vector<double>> dp(n + 1, vector<double>(n + 1, 0.0));
dp[0][0] = 1.0;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= i; j++) {
if (j ... | [
"io.output.change"
] | 977,084 | 977,085 | u876488889 | cpp |
p03168 | #include <bits/stdc++.h>
#define ll long long
#define M 1000000007
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m, a, b;
cin >> n;
vector<vector<double>> dp(n, vector<double>(n + 1));
vector<double> jp(n);
for (int i = 0; i < n; i++) {
cin >> jp[i];
}
d... | #include <bits/stdc++.h>
#define ll long long
#define M 1000000007
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m, a, b;
cin >> n;
vector<vector<double>> dp(n, vector<double>(n + 1));
vector<double> jp(n);
for (int i = 0; i < n; i++) {
cin >> jp[i];
}
d... | [
"io.output.change"
] | 977,088 | 977,089 | u213570908 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using namespace std;
#define INF ((1 << 30) - 1)
#define LLINF (1LL << 60)
#define EPS (1e-10)
// どういうDPか
// dp[i][j] := i枚目のコインを投げたとき，表がj枚である確率
// 計算方法
// 1-index
// dp[0][0] = 1.0
// dp[i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using namespace std;
#define INF ((1 << 30) - 1)
#define LLINF (1LL << 60)
#define EPS (1e-10)
// どういうDPか
// dp[i][j] := i枚目のコインを投げたとき，表がj枚である確率
// 計算方法
// 1-index
// dp[0][0] = 1.0
// dp[i... | [
"assignment.change"
] | 977,100 | 977,101 | u482544950 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using namespace std;
#define INF ((1 << 30) - 1)
#define LLINF (1LL << 60)
#define EPS (1e-10)
// 分解
// dp[i][j] := i番目までのコインを投げて，表がちょうどj枚になる確率
double dp[3030][3030];
// dp[i][j] = dp[i-1]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using namespace std;
#define INF ((1 << 30) - 1)
#define LLINF (1LL << 60)
#define EPS (1e-10)
// 分解
// dp[i][j] := i番目までのコインを投げて，表がちょうどj枚になる確率
double dp[3030][3030];
// dp[i][j] = dp[i-1]... | [
"assignment.change"
] | 977,102 | 977,103 | u482544950 | cpp |
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][n + 1];
dp[0][0] = 1.0 - p[0];
dp[0][1] = p[0];
for (int i = 2; i < n + 1; i++)
dp[0][i] = 0;
for (int i = 1; i < n; i++)
dp[i][0] = dp[i - 1][... | #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][n + 1];
dp[0][0] = 1.0 - p[0];
dp[0][1] = p[0];
for (int i = 2; i < n + 1; i++)
dp[0][i] = 0;
for (int i = 1; i < n; i++)
dp[i][0] = dp[i - 1][... | [
"io.output.change"
] | 977,116 | 977,117 | u740900993 | cpp |
p03168 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
ll n;
vector<double> p;
void solve() {
// dp[i]: the probability of getting i heads
vector<double> dp1(n + 1);
vector<double> dp2(n + 1);
dp1[0] = 1;
for (int i = 0; i < n; ++i) {
for (int j = 0; j <= n; ++j) ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
ll n;
vector<double> p;
void solve() {
// dp[i]: the probability of getting i heads
vector<double> dp1(n + 1);
vector<double> dp2(n + 1);
dp1[0] = 1;
for (int i = 0; i < n; ++i) {
for (int j = 0; j <= n; ++j) ... | [
"io.output.change"
] | 977,118 | 977,119 | u656351541 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
bool vec[3000][3000];
long double res[3000][3000];
long double pro(vector<long double> v, ll n, ll m) {
if (vec[n][m] != 0) {
return vec[n][m];
}
res[1][1] = v[0];
double k = 1;
for (ll i = 1; i <= n; i++) {
k *= (1 - v[i - 1]);
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
bool vec[3000][3000];
long double res[3000][3000];
long double pro(vector<long double> v, ll n, ll m) {
if (vec[n][m] != 0) {
return vec[n][m];
}
res[1][1] = v[0];
double k = 1;
for (ll i = 1; i <= n; i++) {
k *= (1 - v[i - 1]);
... | [
"io.output.change"
] | 977,122 | 977,123 | u454402890 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define all(v) ((v).begin()), ((v).end())
#define allr(v) ((v).rbegin()), ((v).rend())
#define sz(v) ((int)((v).size()))
#define ll long long
#define pb push_back
#define fIO \
ios_base::sync_with_stdio(... | #include <bits/stdc++.h>
using namespace std;
#define all(v) ((v).begin()), ((v).end())
#define allr(v) ((v).rbegin()), ((v).rend())
#define sz(v) ((int)((v).size()))
#define ll long long
#define pb push_back
#define fIO \
ios_base::sync_with_stdio(... | [
"literal.number.change"
] | 977,136 | 977,137 | u294397492 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, k, n;
cin >> n;
double dp[n + 1][n + 1];
double p[n + 1];
for (i = 1; i <= n; i++) {
cin >> p[i];
}
if (n == 1) {
cout << p[1];
return 0;
}
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (i = 1; i <= n; i++) {
for (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, k, n;
cin >> n;
double dp[n + 1][n + 1];
double p[n + 1];
for (i = 1; i <= n; i++) {
cin >> p[i];
}
if (n == 1) {
cout << p[1];
return 0;
}
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (i = 1; i <= n; i++) {
for (... | [
"io.output.change"
] | 977,146 | 977,147 | u531129785 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
vector<vector<double>> dp(3010, vector<double>(3010, -1));
vector<double> x;
double n, a;
double ans(int curr, int k) {
if (curr == n) {
if (k >= n / 2 + 0.5) {
return 1;
}
return 0;
}
if (dp[curr][k] != -1) {
return dp[curr][k];
}
double re... | #include <bits/stdc++.h>
using namespace std;
vector<vector<double>> dp(3010, vector<double>(3010, -1));
vector<double> x;
double n, a;
double ans(int curr, int k) {
if (curr == n) {
if (k >= n / 2 + 0.5) {
return 1;
}
return 0;
}
if (dp[curr][k] != -1) {
return dp[curr][k];
}
double re... | [
"literal.number.change",
"io.output.change"
] | 977,166 | 977,167 | u689442090 | cpp |
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];
float dp[n + 1][n + 1];
for (int i = 0; i <= n; i++)
for (int j = 0; j <= n; j++)
dp[i][j] = 0.0;
dp[0][0] = 1.0;
for (int i = 1; i <= n; i++)
for (int j = ... | #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];
for (int i = 0; i <= n; i++)
for (int j = 0; j <= n; j++)
dp[i][j] = 0.0;
dp[0][0] = 1.0;
for (int i = 1; i <= n; i++)
for (int j =... | [
"variable_declaration.type.primitive.change"
] | 977,171 | 977,172 | u647025182 | cpp |
p03168 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;... | [
"io.output.change"
] | 977,173 | 977,174 | u786837146 | cpp |
p03168 | #include <bits/stdc++.h>
#define LL long long int
#define Max(x, y) (x > y ? x : y)
#define Min(x, y) (x < y ? x : y)
#define Abs(x) ((x) > 0 ? (x) : -(x))
#define Swap(x, y) \
do { \
... | #include <bits/stdc++.h>
#define LL long long int
#define Max(x, y) (x > y ? x : y)
#define Min(x, y) (x < y ? x : y)
#define Abs(x) ((x) > 0 ? (x) : -(x))
#define Swap(x, y) \
do { \
... | [
"io.output.change"
] | 977,178 | 977,179 | u369631563 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, f, e) for (int(i) = (f); (i) < (e); (i)++)
#define repr(i, e, f) for (int(i) = (e - 1); (i) >= (f); (i)--)
const ll MOD = 1e9 + 7;
const int INF = (int)1e9 + 7;
// vector<tuple<long,long>> items; // (value, weight)
// auto item = items[... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, f, e) for (int(i) = (f); (i) < (e); (i)++)
#define repr(i, e, f) for (int(i) = (e - 1); (i) >= (f); (i)--)
const ll MOD = 1e9 + 7;
const int INF = (int)1e9 + 7;
// vector<tuple<long,long>> items; // (value, weight)
// auto item = items[... | [
"io.output.change"
] | 977,182 | 977,183 | u068277996 | cpp |
p03168 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using ll = long long;
using pll = pair<ll, ll>;
constexpr ll INF = (1LL << 60);
constexpr ll MOD = (1e9 + 7);
// constexpr ll MOD = (99824... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using ll = long long;
using pll = pair<ll, ll>;
constexpr ll INF = (1LL << 60);
constexpr ll MOD = (1e9 + 7);
// constexpr ll MOD = (99824... | [
"variable_declaration.type.narrow.change"
] | 977,192 | 977,193 | u924406834 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long mod = 1000000007;
int main() {
ll n, i, j;
cin >> n;
double p[n];
for (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 += 1) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long mod = 1000000007;
int main() {
ll n, i, j;
cin >> n;
double p[n];
for (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 += 1) {
... | [
"io.output.change"
] | 977,194 | 977,195 | u919005705 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 977,196 | 977,197 | u452819435 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
... | [
"literal.number.change",
"variable_declaration.value.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 977,198 | 977,197 | u452819435 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
... | [
"literal.number.change",
"variable_declaration.value.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 977,199 | 977,197 | u452819435 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fr(i, a, b) for (int i = (a); i < (b); i++)
#define frr(i, a, b) for (int i = (a - 1); i >= (b); i--)
#define vi vector<int>
#define de deque<int>
#define del deque<ll>
#define vl vector<ll>
#define pb push_back
#define ppb pop_back()
#define p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fr(i, a, b) for (int i = (a); i < (b); i++)
#define frr(i, a, b) for (int i = (a - 1); i >= (b); i--)
#define vi vector<int>
#define de deque<int>
#define del deque<ll>
#define vl vector<ll>
#define pb push_back
#define ppb pop_back()
#define p... | [
"io.output.change"
] | 977,202 | 977,203 | u616159561 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
int main() {
double n;
scanf("%lf", &n);
vector<double> dp(n + 1);
dp[0] = 1;
for (int i = 0; i < n; i++) {
double r;
scanf("%lf", &r);
for (int j = i + 1; j >= 0; j--) {
dp[j] = (j == 0 ? 0 : dp[j - 1] * (r)) + dp[j] * (1 - r);
}
}
doubl... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<double> dp(n + 1);
dp[0] = 1;
for (int i = 0; i < n; i++) {
double r;
scanf("%lf", &r);
for (int j = i + 1; j >= 0; j--) {
dp[j] = (j == 0 ? 0 : dp[j - 1] * (r)) + dp[j] * (1 - r);
}
}
double re... | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 977,223 | 977,222 | u129437649 | cpp |
p03168 | #include <bits/stdc++.h>
#define loop(x) for (int i = 0; i < x; i++)
#define deb(x) cout << #x << x << " "
#define ll long long
#define LINF 1e18L + 5
#define INF 1e9 + 7
using namespace std;
const int max_size = 1e5 + 5;
int totalMax = 0;
int maxAmount = -400;
vector<int> visited(max_size, 0);
vector<int> maxLength... | #include <bits/stdc++.h>
#define loop(x) for (int i = 0; i < x; i++)
#define deb(x) cout << #x << x << " "
#define ll long long
#define LINF 1e18L + 5
#define INF 1e9 + 7
using namespace std;
const int max_size = 1e5 + 5;
int totalMax = 0;
int maxAmount = -400;
vector<int> visited(max_size, 0);
vector<int> maxLength... | [
"io.output.change"
] | 977,229 | 977,230 | u698912407 | cpp |
p03168 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define double long double
using datas = pair<ll, ll>;
using ddatas = pair<double, double>;
using tdata = pair<ll, datas>;
using vec = vector<ll>;
using mat = vector<vec>;
using pvec = vector<datas>;
using pmat = vector<pv... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define double long double
using datas = pair<ll, ll>;
using ddatas = pair<double, double>;
using tdata = pair<ll, datas>;
using vec = vector<ll>;
using mat = vector<vec>;
using pvec = vector<datas>;
using pmat = vector<pv... | [
"expression.operation.binary.add"
] | 977,231 | 977,232 | u251847465 | cpp |
p03168 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define pb push_back
#define ins insert
#define pob pop_back
#define er erase
#define emp empty
#define f first
#define s second
#define ff f.f
#define fs f.s
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define pb push_back
#define ins insert
#define pob pop_back
#define er erase
#define emp empty
#define f first
#define s second
#define ff f.f
#define fs f.s
... | [
"io.output.change"
] | 977,239 | 977,240 | u979412452 | cpp |
p03168 | #include <iomanip>
#include <iostream>
using namespace std;
float dp[3005][3005];
int main() {
int n;
double p[3005], rez = 0.0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p[i];
}
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= i; j++) {
if (j != 0)
dp[i][j] = ... | #include <iomanip>
#include <iostream>
using namespace std;
double dp[3005][3005];
int main() {
int n;
double p[3005], rez = 0.0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p[i];
}
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= i; j++) {
if (j != 0)
dp[i][j] =... | [
"variable_declaration.type.primitive.change"
] | 977,243 | 977,242 | u756453937 | cpp |
p03168 | #include <iomanip>
#include <iostream>
using namespace std;
float dp[3005][3005];
int main() {
int n;
double p[3005], rez = 0.0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p[i];
}
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= i; j++) {
if (j != 0)
dp[i][j] = ... | #include <iomanip>
#include <iostream>
using namespace std;
double dp[3005][3005];
int main() {
int n;
double p[3005], rez = 0.0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p[i];
}
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= i; j++) {
if (j != 0)
dp[i][j] =... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"io.output.change"
] | 977,243 | 977,245 | u756453937 | cpp |
p03168 | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(c) (c).rbegin(), (c).rend()
#define mp make_pair
typedef long long ll;
t... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(c) (c).rbegin(), (c).rend()
#define mp make_pair
typedef long long ll;
t... | [
"io.output.change"
] | 977,250 | 977,251 | u339937125 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < n; ++i)
#pragma region Debug
template <typename T> void view(const std::vector<T> &v) {
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <ty... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < n; ++i)
#pragma region Debug
template <typename T> void view(const std::vector<T> &v) {
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <ty... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 977,256 | 977,257 | u395620499 | cpp |
p03168 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
t... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
t... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 977,258 | 977,259 | u355335354 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
double dp[3000][3000];
int n;
double arr[3000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
dp[i][0] = (1.00 - ar... | #include <bits/stdc++.h>
using namespace std;
double dp[3000][3000];
int n;
double arr[3000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
dp[i][0] = (1.00 - ar... | [
"identifier.change",
"io.output.change",
"literal.number.change"
] | 977,260 | 977,261 | u064458730 | cpp |
p03168 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
cons... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
cons... | [
"io.output.change"
] | 977,266 | 977,267 | u963903527 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using P = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using P = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;... | [
"io.output.change"
] | 977,272 | 977,273 | u611777990 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> p... | #include <bits/stdc++.h>
using namespace std;
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> p... | [
"io.output.change"
] | 977,278 | 977,277 | u132033278 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1e9 + 7
#define pll pair<long long, long long>
#define pdd pair<long double, long double>
#define vll vector<ll>
#define rep(i, j, n) for (int i = j; i < n; i++)
#define mp make_pair
#define pb push_back
#define pf push_front
#define inf 1e... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1e9 + 7
#define pll pair<long long, long long>
#define pdd pair<long double, long double>
#define vll vector<ll>
#define rep(i, j, n) for (int i = j; i < n; i++)
#define mp make_pair
#define pb push_back
#define pf push_front
#define inf 1e... | [
"io.output.change"
] | 977,279 | 977,280 | u029479695 | cpp |
p03168 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(j, n) for (int j = 0; j < (n); ++j)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define sre... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(j, n) for (int j = 0; j < (n); ++j)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define sre... | [
"io.output.change"
] | 977,286 | 977,287 | u340293807 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define all(x) x.begin(), x.end()
#define MOD 1000000007
#define vi vector<int>
#define pii pair<int, int>
#define INF (int)1e9
#define pb push_back
#define fastIO \
ios::sync_with_st... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define all(x) x.begin(), x.end()
#define MOD 1000000007
#define vi vector<int>
#define pii pair<int, int>
#define INF (int)1e9
#define pb push_back
#define fastIO \
ios::sync_with_st... | [
"io.output.change"
] | 977,288 | 977,289 | u254167435 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define MOD ((int)(1e9) + 7)
#define fast \
cin.tie(0); \
cout.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define MOD ((int)(1e9) + 7)
#define fast \
cin.tie(0); \
cout.tie(0); ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 977,294 | 977,295 | u997979021 | cpp |
p03168 | /*
Author: Racer5x
*************************************** UNAUTHORISED COPYING OF CODE
PROHIBITED **********************************
*/
/*#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")*/
... | /*
Author: Racer5x
*************************************** UNAUTHORISED COPYING OF CODE
PROHIBITED **********************************
*/
/*#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")*/
... | [
"io.output.change"
] | 977,302 | 977,303 | u488763956 | cpp |
p03168 | /*
Author: Racer5x
*************************************** UNAUTHORISED COPYING OF CODE
PROHIBITED **********************************
*/
/*#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")*/
... | /*
Author: Racer5x
*************************************** UNAUTHORISED COPYING OF CODE
PROHIBITED **********************************
*/
/*#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")*/
... | [
"io.output.change"
] | 977,304 | 977,305 | u488763956 | cpp |
p03168 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int n;
bool visited[3000][3000];
double dp[3000][3000];
double solve(int h, int t, double *p) {
if (visited[h][t] == true)
return dp[h][t];
else {
if (h > t) {
dp[h][t] = 0;
visited[h][t] = true;
return 0;
}
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int n;
bool visited[3000][3000];
double dp[3000][3000];
double solve(int h, int t, double *p) {
if (visited[h][t] == true)
return dp[h][t];
else {
if (h > t) {
dp[h][t] = 0;
visited[h][t] = true;
return 0;
}
... | [] | 977,310 | 977,311 | u791283132 | cpp |
p03168 |
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define ll long long
#define pi pair<int, int>
#define pl pair<ll, ll>
#define pd pair<double, double>
#define ld long double
#define pld pair<ld, ld>
#define lg length()
#define sz size()
#define vi vector<int>
#define vl vector<ll>
#defin... |
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define ll long long
#define pi pair<int, int>
#define pl pair<ll, ll>
#define pd pair<double, double>
#define ld long double
#define pld pair<ld, ld>
#define lg length()
#define sz size()
#define vi vector<int>
#define vl vector<ll>
#defin... | [
"io.output.change"
] | 977,312 | 977,313 | u663257960 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define ull unsigned long long
#define mp make_pair
#define F first
#define S second
#define mod 1000000007
double dp[3005];
int main() {
int n;
cin >> n;
do... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define ull unsigned long long
#define mp make_pair
#define F first
#define S second
#define mod 1000000007
double dp[3005];
int main() {
int n;
cin >> n;
do... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 977,318 | 977,319 | u923368296 | cpp |
p03168 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 977,326 | 977,327 | u900727536 | cpp |
p03168 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define pie 3.141592653589793238462643383279
#define int long long
#define mod 10000
#define INF 114514... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define pie 3.141592653589793238462643383279
#define int long long
#define mod 10000
#define INF 114514... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 977,332 | 977,333 | u277153875 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<long double>;
using vvd = vector<vd>;
void pdp(vvd dp) {
int n_ = dp.size();
cout << "----------s------------" << ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<long double>;
using vvd = vector<vd>;
void pdp(vvd dp) {
int n_ = dp.size();
cout << "----------s------------" << ... | [
"io.output.change"
] | 977,339 | 977,340 | u631914718 | cpp |
p03168 | // In The Name Of Allah
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e12;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;
const ll mod = 1e9 + 7;
void faster() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
const ll M = 26 + 10;
const ll N = ... | // In The Name Of Allah
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e12;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;
const ll mod = 1e9 + 7;
void faster() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
const ll M = 26 + 10;
const ll N = ... | [] | 977,347 | 977,348 | u080245145 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define N 1000000007
#define pll pair<ll, ll>
#define fill(A, n) \
for (int i = 0; i < n; i++) \
cin >> A[i];
int m... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define N 1000000007
#define pll pair<ll, ll>
#define fill(A, n) \
for (int i = 0; i < n; i++) \
cin >> A[i];
int m... | [
"io.output.change"
] | 977,351 | 977,352 | u419307807 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define vd vector<double>
int main() {
int n;
cin >> n;
vd prb(n + 1, 0);
prb[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> prb[i];
}
vd dp(n + 1, 0);
dp[0] = 1;
for (int i = 1; i <= n; i++) {
double prev;
for (int j = 0; j <= i; j++) {
d... | #include <bits/stdc++.h>
using namespace std;
#define vd vector<double>
int main() {
int n;
cin >> n;
vd prb(n + 1, 0);
prb[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> prb[i];
}
vd dp(n + 1, 0);
dp[0] = 1;
for (int i = 1; i <= n; i++) {
double prev;
for (int j = 0; j <= i; j++) {
d... | [
"io.output.change"
] | 977,363 | 977,364 | u527834199 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n + 1][n + 1];
dp[1][0] = 1 - a[0];
dp[1][1] = a[0];
for (int i = 2; i <= n; i++) {
for (int j = 0; j <= i; j++) {
if (j == 0) {
dp[i][j] = dp[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
double dp[n + 1][n + 1];
dp[1][0] = 1 - a[0];
dp[1][1] = a[0];
for (int i = 2; i <= n; i++) {
for (int j = 0; j <= i; j++) {
if (j == 0) {
dp[i][j] = ... | [
"variable_declaration.type.primitive.change"
] | 977,367 | 977,368 | u200439351 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long double prob[n];
for (int i = 0; i < n; i++)
cin >> prob[i];
vector<vector<long double>> dp(n + 1, vector<long double>(n + 1, 0));
// i head and j tail
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n - i; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long double prob[n];
for (int i = 0; i < n; i++)
cin >> prob[i];
vector<vector<long double>> dp(n + 1, vector<long double>(n + 1, 0));
// i head and j tail
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n - i; j++) {
... | [
"io.output.change"
] | 977,369 | 977,370 | u194359166 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
double a[n + 1], h[n + 1], t[n + 1];
a[0] = 0;
h[0] = 1;
t[0] = 1;
for (int i = 1; i <= n; i++) {
cin >> a[i];
h[i] = h[i - 1] ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
double a[n + 1], h[n + 1], t[n + 1];
a[0] = 0;
h[0] = 1;
t[0] = 1;
for (int i = 1; i <= n; i++) {
cin >> a[i];
h[i] = h[i - 1] ... | [
"io.output.change"
] | 977,379 | 977,380 | u222329105 | cpp |
p03168 | #pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<ld, ld> pld;
typedef pair<string, string> pss;
#define pb(x) push_back(x)
#define ts(x) to_string(x)... | #pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<ld, ld> pld;
typedef pair<string, string> pss;
#define pb(x) push_back(x)
#define ts(x) to_string(x)... | [
"io.output.change"
] | 977,381 | 977,382 | u838685314 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
/*
g++ -std=c++11 i-coins.cpp -o k
*/
int main() {
int i, j, N;
cin >> N;
float p[N];
float m[N + 1][N + 1];
for (i = 0; i < N; i++) {
m[0][i] = 0.0;
cin >> p[i];
}
m[0][0] = 1.0;
m[0][N] = 0.0;
for (i = 1; i <= N; i++) {
// coin i is indexed ... | #include <bits/stdc++.h>
using namespace std;
/*
g++ -std=c++11 i-coins.cpp -o k
*/
int main() {
int i, j, N;
cin >> N;
double p[N];
// m[coins i][heads j]
double m[N + 1][N + 1];
for (i = 0; i < N; i++) {
m[0][i] = 0.0;
cin >> p[i];
}
m[0][0] = 1.0;
m[0][N] = 0.0;
for (i = 1; i <= N; i++) ... | [
"variable_declaration.type.primitive.change",
"io.output.change"
] | 977,387 | 977,388 | u758170215 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
double dp[3000][3000];
double p[3000], ans;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p[i];
}
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= i; j++) {
dp[i][j] += dp[i - 1][j] * (1 - p[i]);
dp[i... | #include <bits/stdc++.h>
using namespace std;
double dp[3000][3000];
double p[3000], ans;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p[i];
}
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= i; j++) {
dp[i][j] += dp[i - 1][j] * (1 - p[i]);
dp[i... | [
"io.output.change"
] | 977,389 | 977,390 | u809374784 | cpp |
p03168 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
using ll = long long;
const int INF = 1e9 + 5;
const int N = 1000 + 5;
const int mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
// freopen("input.txt","r",stdin);
int n;
cin >> n;
vector<double> dp... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
using ll = long long;
const int INF = 1e9 + 5;
const int N = 1000 + 5;
const int mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
// freopen("input.txt","r",stdin);
int n;
cin >> n;
vector<double> dp... | [
"io.output.change"
] | 977,401 | 977,402 | u254886300 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.