Mai intai trebuie sa te autentifici.
Cod sursa(job #1010085)
| Utilizator | Data | 14 octombrie 2013 11:39:11 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,i,a[20],t,k,sol[20],m;
bool ok[20];
void afis()
{
int i;
for(i=1; i<=m; i++)
g<<a[sol[i]]<<' ';
}
void back(int k)
{
int i;
if(k>m) {afis();g<<'\n';}
else
for(i=sol[k-1]+1; i<=n; i++)
{
sol[k]=i;
back(k+1);
}
}
int main()
{
f>>n>>m;
for(i=1; i<=n; i++)
a[i]=i;
k=1;
back(k);
return 0;
}
