Cod sursa(job #232174)
Utilizator | Data | 14 decembrie 2008 21:26:48 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
ifstream f ("combinari.in");
ofstream g ("combinari.out");
int n,k,v[20];
void afis(int p)
{
for(int i=1;i<=p;i++) g<<v[i]<<" ";
g<<"\n";
}
void back(int c)
{
int i;
if(c==k) afis(k);
else for(i=v[c]+1;i<=n;i++)
{
v[c+1]=i;
back(c+1);
}
}
int main()
{
f>>n>>k;
back(0);
}