Cod sursa(job #1254106)
Utilizator | Data | 2 noiembrie 2014 10:49:55 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,i,j,x[20];
int main()
{
f>>n>>k;
for(i=1;i<=k;i++)
x[i]=i;
for(;;)
{
for(i=1;i<=k;i++)
g<<x[i]<<" ";
g<<"\n";
for(i=k,j=n;x[i]==j&&i>=1;i--,j--);
if(i==0)
break;
x[i]++;
for(i++;i<=k;i++)
x[i]=x[i-1]+1;
}
return 0;
}