Cod sursa(job #1362242)
Utilizator | Data | 26 februarie 2015 11:14:19 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int a[100],sol[100],i,n,k,m;
void afis(){
int i;
for(i=1;i<=m;i++)
g<<a[sol[i]]<<" ";
g<<endl;
}
void back(int k){
int i;
if(k>m) afis();
else for(i=sol[k-1]+1;i<=n;i++)
{
sol[k]=i;
back(k+1);
}
}
int main()
{
f>>n>>m;
for(i=1;i<=n;i++) a[i]=i;
back(1);
return 0;
}