Cod sursa(job #1010001)
Utilizator | Data | 14 octombrie 2013 09:33:37 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
int n,k,sol[100],m;
ifstream f("combinari.in");
ofstream g("combinari.out");
void afis(){
int i;
for(i=1;i<n;++i)
g<<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;
back(1);
return 0;
}