Cod sursa(job #2516168)
| Utilizator | Data | 30 decembrie 2019 15:38:18 | |
|---|---|---|---|
| Problema | Combinari | Scor | 80 |
| Compilator | py | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
def bkt_combinari(n,k):
lista=[0]
def combinari(n,k):
if len(lista)==k+1:
for j in range(k):
f.write(str(lista[j+1])+' ')
f.write('\n')
else:
for i in range(1,n+1):
if i not in lista and lista[-1]<i:
lista.append(i)
combinari(n,k)
lista.pop(-1)
combinari(n,k)
f=open('combinari.in')
text=f.read()
n=int(text.split()[0])
k=int(text.split()[1])
f.close()
f=open('combinari.out','w')
bkt_combinari(n,k)
