Cod sursa(job #2381061)
Utilizator | Data | 15 martie 2019 22:23:34 | |
---|---|---|---|
Problema | Combinari | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.82 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,r,b=1;
f>>k;
f>>n;
int v[n];
int a[n];
for(int i=0;i<n;i++){
v[i]=i+1;
a[i]=v[i];
}
while(b==1){
for(int i=0;i<n;i++){
g<<a[i]<<" ";
}
a[n-1]++;
g<<endl;
r=0;
for(int i=n-1;i>0;i--){
if(a[i]>k-r){
a[i-1]++;
for(int j=i;j<=n-1;j++){
a[j]=a[j-1]+1;
}
}
r++;
}
if(a[0]==k-n+2){
b=0;
}
}
g.close();
return 0;
}