Cod sursa(job #1908655)
| Utilizator | Data | 7 martie 2017 09:51:50 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int x[20];
int main()
{
int n,k,i,j;
f>>n>>k;
for(i=1;i<=k;i++)
{
x[i]=i;
g<<x[i]<<' ';
}
i--;
x[i+1]=i+2;
g<<'\n';
while(x[0]==0)
{
if(x[i]<x[i+1]-1)
x[i]++;
else
{
i--;
x[i]++;
}
for(j=1;j<=k;j++)
g<<x[j]<<' ';
g<<'\n';
}
return 0;
}
