Cod sursa(job #990891)
Utilizator | Data | 29 august 2013 10:38:26 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, m, a[20];
void back(int k){
if(k==m+1)
{
for(int i=1; i<=m; i++)
g<<a[i]<<' ';
g<<"\n";
}
else
{
for(int i=a[k-1]+1; i<=n; i++)
{
a[k]=i;
back(k+1);
}
}
}
int main(){
f>>n>>m;
back(1);
return 0;
}