Cod sursa(job #1179615)
Utilizator | Data | 28 aprilie 2014 22:39:00 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
//VASS PETER LTC 2014-04-28 :-)
#include <fstream>
using namespace std;
int a[18];
int N,K;
inline void out(){}
int main(){
ifstream ifs("combinari.in");
ofstream ofs("combinari.out");
ifs>>N>>K;
int l=0;
while(l>=0){
if(l==K){
for(int i=0;i<K;i++)ofs<<a[i]<<" ";ofs<<"\n";
l--;
}
else{
if(a[l]==N)
l--;
else{
a[l]++;
a[++l]=a[l-1];
}
}
}
}