Pagini recente » Cod sursa (job #2299066) | Cod sursa (job #1766489) | Cod sursa (job #218845) | Cod sursa (job #187853) | Cod sursa (job #163350)
Cod sursa(job #163350)
#include <fstream.h>
ofstream g("combinari.out");
int sol[10],n,kk;
int cond(int a){
for (int i=0;i<a;i++)
if (sol[i]==sol[a]) return 0;
return 1;
}
void afisare(int a){
for (int i=1;i<=a;i++)
g<<sol[i]<<" ";
g<<"\n";
}
int main(){
ifstream f("combinari.in");
int k,p;
f>>n;
f>>kk;
k=1;sol[k]=1;
while (k>0){
if (sol[k]>n) sol[--k]++;
else if (k==n) {if(k==kk)afisare(k);sol[k]++;}
else if (k<n) {if (k==kk)afisare(k); sol[++k]=sol[k-1]+1;}
}
f.close();
g.close();
}