Pagini recente » Cod sursa (job #1869802) | Cod sursa (job #1937795) | Borderou de evaluare (job #2777269) | Borderou de evaluare (job #2959234) | Cod sursa (job #950703)
Cod sursa(job #950703)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int s[20], n, k;
void back(int l)
{
if (l=k)
{
for (int i=1; i<=k; i++) g<<s[i]<<' '; g<<'\n';
}
else
{
for (int i=s[l]+1; i<=n; i++)
{
s[l+1]=i; back(l+1);
}
}
}
int main()
{
f>>n>>k;
back(0);
f.close(); g.close();
return 0;
}