Cod sursa(job #1459178)
Utilizator | Data | 9 iulie 2015 12:15:49 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,i,a[19],j;
int main()
{
f>>n>>k;
for(i=1; i<=k; i++)
a[i]=i;
while(a[0]==0)
{
for(i=1; i<=k; i++)
g<<a[i]<<" ";
g<<'\n';
i=k;
while(a[i]==n-k+i)
i--;
a[i]++;
for(j=i+1; j<=k; j++)
a[j]=a[i]+j-i;
}
f.close(); g.close();
}