Cod sursa(job #2030587)
| Utilizator | Data | 1 octombrie 2017 19:52:02 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, k, a[20];
int conditie(int x)
{
for(int i=1;i<x;i++)
if((a[i]==a[x])||a[i]>a[x])
return 0;
return 1;
}
void back(int x)
{
if(x>k)
{
for(int i=1;i<=k;i++)
g<<a[i]<<" ";
g<<"\n";
}
else
{
for(int i=1;i<=n;i++)
{
a[x]=i;
if(conditie(x)==1)
back(x+1);
}
}
}
int main()
{
f>>n>>k;
back(1);
return 0;
}
