Cod sursa(job #1301778)
Utilizator | Data | 26 decembrie 2014 13:18:33 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
using namespace std;
ofstream g("combinari.out");
int t[20],n,k;
void b(int j)
{
int i;
for(i=t[j-1]+1;i<=n;i++)
{
t[j]=i;
if(j==k)
{
for(int a=1;a<=k;a++)
g<<t[a]<<" ";
g<<"\n";
}
else b(j+1);
}
}
int main()
{
ifstream f("combinari.in");
f>>n>>k;
b(1);
f.close();
g.close();
return 0;
}