Cod sursa(job #268377)
| Utilizator |  X si Y NorthGBY |
Data | 1 martie 2009 10:56:03 |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include<stdio.h>
int x[20],n,k,i;
void readd(),back(),afisare();
int main()
{
readd();
back();
return 0;
}
void readd()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
}
void back(int poz)
{
if(poz==k+1){afisare();return;}
for(i=x[poz-1]+1;i<=n-k+poz;i++);
{x[poz]=i;back(poz+1);}