Cod sursa(job #1821059)
Utilizator | Data | 2 decembrie 2016 15:33:06 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
#include<iostream>
using namespace std;
short n,z,v[20];
ifstream in("combinari.in");
ofstream out("combinari.out");
void afis()
{
for(int i=1;i<=z;i++)
out<<v[i]<<" ";
out<<'\n';
}
void back(int k)
{
if(k==z+1)
afis();
else
for(v[k]=v[k-1]+1;v[k]<=n-z+k;v[k]++)
back(k+1);
}
int main()
{
in>>n>>z;
back(1);
}