Cod sursa(job #1941852)
Utilizator | Data | 27 martie 2017 17:01:25 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<bits/stdc++.h>
using namespace std;
int N,K, a[30];
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void back(int poz, int k)
{
if(k > K)
{
for (int i = 1; i <= K; i++)
{
fout << a[i] << " ";
}
fout << "\n";
return;
}
for(int i = poz ; i <= N - K + k; i++)
{
a[k] = i;
back(i+1, k+1);
}
}
int main()
{
fin >> N >> K;
back (1,1);
}