Cod sursa(job #1117490)
Utilizator | Data | 23 februarie 2014 16:25:00 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m[100],p;
void print(int y)
{int i;
for(i=1;i<=y;i++)
g<<m[i]<<" ";
g<<"\n";
}
void com(int k,int l)
{
int i;
if(l==p)
print(p);
for(i=k+1;i<=n;i++)
{
m[l+1]=i;
com(i,l+1);
}
}
int main()
{
f>>n>>p;
com(0,0);
return 0;
}