Cod sursa(job #305920)
Utilizator | Bula Ionut cosser | Data | 18 aprilie 2009 21:14:54 |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.75 kb |
#include<iostream>
#include<fstream>
using namespace std;
int n,st[100],m,o;
int valid(int k)
{ int j;
return 0;
return 1;
}
void bkt(int k)
{
int i,j,s;
for(i=1;i<=n;i++)
{
st[k]=i;
o=1;
for(j=1;j<k;j++)
if(st[k]==st[j] || st[k]<st[j])
o=0;
if(o)
if(k==m)
{
for(s=1;s<=k;s++)
cout<<st[s]<<" ";
cout<<"\n";
}
else
bkt(k+1);
}
}
int main()
{
ifstream f ("combinari.in");
ofstream o ("combinari.out");
f>>n>>m;
bkt(1);
return 0;}