Pagini recente » Cod sursa (job #144748) | Cod sursa (job #2433604) | Cod sursa (job #305397) | Cod sursa (job #675129) | Cod sursa (job #2173205)
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define mp make_pair
#define CHECK(x) if(!(x)) return false;
typedef pair<int, int> pii;
#ifdef INFOARENA
#define ProblemName "dezastru"
#endif
#define MCONCAT(A, B) A B
#ifdef ProblemName
#define InFile MCONCAT(ProblemName, ".in")
#define OuFile MCONCAT(ProblemName, ".out")
#else
#define InFile "fis.in"
#define OuFile "fis.out"
#endif
const int MAXN = 30;
double p[MAXN];
int N, K;
double s = 0;
double cur = 1.0;
void bkt(int l) {
if (l == K) {
s += cur;
return;
}
}
int main() {
assert(freopen(InFile, "r", stdin));
assert(freopen(OuFile, "w", stdout));
scanf("%d%d", &N, &K);
for (int i = 0; i < N; ++i)
scanf("%lf", &p[i]);
return 0;
}