Cod sursa(job #1141152)
| Utilizator | Data | 12 martie 2014 17:43:13 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
int n,m,i,a[100],sol[100];
ifstream f("combinari.in");
ofstream g("combinari.out");
void afis(){
int i;
for(i=1;i<=m;i++) g<<a[sol[i]]<<" ";
g<<"\n";}
void back(int k){
int i;
if(k>m) afis();
else for(i=sol[k-1]+1;i<=n;i++){
sol[k]=i;
back(k+1);
}
}
int main()
{
f>>n>>m;
sol[0]=0;
for(i=1;i<=n;i++) a[i]=i;
back(1);
f.close();
g.close();
return 0;
}
