Cod sursa(job #1252247)
Utilizator | Data | 30 octombrie 2014 16:23:18 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,i,j,a[19];
int main()
{
f>>n>>k;
for(i=1;i<=k;i++) {a[i]=i; g<<i<<" ";}
a[i]=n; g<<'\n';
for(i=k;i>=1;i--)
{
while(a[i]<a[i+1])
{
a[i]++;
for(j=1;j<=k;j++)
g<<a[j]<<" ";
g<<'\n';
}
}
return 0;
}