Cod sursa(job #1411197)
Utilizator | Data | 31 martie 2015 15:33:36 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream fi("back.in");
ofstream fo("back.out");
int n,a[50],i,j,k;
bool ok;
int main()
{
fi>>n>>k;
i=1;
while(i>0){
if(i==k+1){
for(j=1;j<=i-1;j++) fo<<a[j]<<" ";
fo<<'\n';
i--;
}
else
if(a[i]<n){
a[i]++;
ok=true;
for(j=1;j<i;j++)
if(a[i]==a[j])ok=false;
if(ok==true) i++;
}
else {a[i]=0;i--;}
}
return 0;
}