Pagini recente » Cod sursa (job #1574587) | Cod sursa (job #105627) | Cod sursa (job #2986650) | Cod sursa (job #2360943) | Cod sursa (job #741633)
Cod sursa(job #741633)
#include <fstream>
using namespace std;
int x[100], n, m;
ifstream f("combinari.in");
ofstream g("combinari.out");
bool ok()
{
int i, j;
for(i=1; i<m; i++)
{
for(j=i+1; j<=m; j++)
{
if(x[i]==x[j])
return false;
}
}
return true;
}
void back(int k)
{
int i, j;
if(k==m)
{
for(j=1; j<=m; j++)
{
g<<x[j]<<" ";
}
g<<"\n";
}
else
{
for(i=x[k]+1; i<=n; i++)
{
x[k+1]=i;
back(k+1);
}
}
}
int main()
{
f>>n>>m;
back(0);
}