Cod sursa(job #1130536)
Utilizator | Data | 28 februarie 2014 13:53:54 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,x,s[30];
void back (int k)
{ int i,j,t;
if(k==x){
for(i=1;i<=k;i++)
g<<s[i]<<" ";
g<<endl;
}
else
for(i=1;i<=n;i++){
s[k+1]=i;
t=1;
for(j=1;j<=k;j++)
if(s[k+1]<=s[j]) t=0;
if (t==1) back(k+1);
}
}
int main()
{f>>n;f>>x;
back(0);
}