Pagini recente » Cod sursa (job #2401381) | Cod sursa (job #872920) | Cod sursa (job #1993893) | Cod sursa (job #2587987) | Cod sursa (job #3161285)
#include <iostream>
using namespace std;
int n, m, a[17][17], v[35],maxi=-10000000;
int x[35];
void suma(int o[][17],int x,int y)
{
long long sum=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
sum+=o[i][j];
if(maxi<sum)
maxi=sum;
}
void prelucare(int k)
{
for (int i = 1; i <= k; i++)
cout<<v[i]<<" ";
cout<<'\n';
}
void back(int k)
{
for (int i = v[k-1]+1; i <= n; i++)
{
v[k] = i;
prelucare(k);
back(k + 1);
}
}
int main()
{
cin >> n;
back(1);
}