Cod sursa(job #1799438)
| Utilizator | Data | 6 noiembrie 2016 12:57:44 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream>
using namespace std;
ifstream fi("combinari.in");
ofstream fo("combinari.out");
int n,m,S[20];
void g(int k)
{
int i;
if(k==m)
{
for(i=1; i<=m; i++)
fo<<S[i]<<" ";
fo<<"\n";
}
else
{
for(i=S[k]+1; i<=n; i++)
{
S[k+1]=i;
g(k+1);
}
}
}
int main()
{
fi>>n>>m;
g(0);
return 0;
}
