Pagini recente » Cod sursa (job #382100) | Cod sursa (job #1681829) | Cod sursa (job #2003005) | Cod sursa (job #3193388) | Cod sursa (job #3303278)
#include <fstream>
#include <iostream>
using namespace std;
const int Max = 25;
ifstream f("ans.in");
ofstream g("ans.out");
int N, M, ans, K;
double s[Max], v[Max];
bool val(int n)
{
for(int i = 1; i < n; ++i)
if(s[i] == s[n])
return 0;
return 1;
}
void backer(int n)
{
for(int i = 1; i <= N; ++i)
{
s[n] = i;
if(val(n))
{
if(n == K)
{
double a = 1;
for(int i = 1; i <= K; ++i)
{
a *= s[i];
}
ans += a/6;
}
else
backer(n+1);
}
}
}
int main()
{
f >> N >> K;
for(int i = 1; i <= N; ++i)
{
f >> v[i];
}
backer(1);
g << ans;
}