Cod sursa(job #421836)
Utilizator | Data | 21 martie 2010 18:18:10 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,m;
int v[25];
void back(int k)
{
int i;
if(k==m){
for(i=0;i<m;i++)
out<<v[i]<<" ";
out<<'\n';}
else
for(i=v[k-1]+1;i<=n;i++)
v[k]=i,back(k+1);
}
int main ()
{
int i;
in>>n>>m;
for(i=1;i<=n;i++)
{
v[0]=i;
back(1);
}
}