Nguyễn Xuân Mạnh

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
using namespace std;

int n,k,ans=0;

struct node
{
int value;
node * next;
};
node * L;

void push(node * &L, int x)
{
node * q;
q = new node;
q -> value = x;
q -> next = L;
L = q;
}

void chenx(node * L)
{
node * p;
p = L;
node * pre;
pre = L;
bool kt=false;
while (p != NULL)
{
pre = p;
p = p -> next;
if (p -> value == k)
{
node * tmp;
pre -> next = tmp;
tmp -> next = p;
tmp -> value = x;
kt = true;
}
}
if (kt = false)
{
node * tmp;
tmp -> next = L;
tmp -> value = x;
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
L = NULL;
cin >> n >> k >> x;
for (int i=1; i<=n; i++)
{
int temp;
cin >> temp;
push(L,temp);
}
cout << inds(L);
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: // liệt kê dãy nhị phân độ dài n
#include<bits/stdc++.h>
using namespace std;

int n,A[100001];

void nhap()
{
   cin >> n;
}

void sinh(int i)
{
   for (int j=0; j<=1; j++)
   {
   A[i] = j;
   if (i == n)
   {
   for (int i=1; i<=n; i++)
   cout << A[i];
   cout << "\n";
   }
   else sinh(i+1);
   }
}

int main()
{
   ios_base::sync_with_stdio(0); cin.tie(0);
   freopen("xdd1.inp","r",stdin);
   freopen("xdd1.out","w",stdout);
   nhap();
   sinh(1);
   return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: // liệt kê dãy nhị phân độ dài n có số lượng số 0 bằng số 1
#include<bits/stdc++.h>
using namespace std;

int n,A[100001];

void nhap()
{
   cin >> n;
   if (n%2 == 1)
   {
   cout << -1;
   exit(0);
   }
}

void sinh(int i)
{
   for (int j=0; j<=1; j++)
   {
   A[i] = j;
   if (i == n)
   {
   int dem0=0,dem1=0;
   for (int i=1; i<=n; i++)
   if (A[i] == 0) dem0++;
   else if (A[i] == 1) dem1++;
   if (dem0 == dem1)
   {
   for (int i=1; i<=n; i++)
   {
   cout << A[i];
   }
   cout << "\n";
   }
   }
   else sinh(i+1);
   }
}

int main()
{
   ios_base::sync_with_stdio(0); cin.tie(0);
   freopen("xdd1.inp","r",stdin);
   freopen("xdd1.out","w",stdout);
   nhap();
// cout << n << endl;
   sinh(1);
   return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: // liệt kê dãy nhị phân độ dài n không có 3 số 1 đứng cạnh nhau
#include<bits/stdc++.h>
using namespace std;

int n,A[100001];

void nhap()
{
cin >> n;
if (n < 3)
{
cout << -1;
exit(0);
}
}

void sinh(int i)
{
for (int j=0; j<=1; j++)
{
A[i] = j;
if (i == n)
{
bool check = true;
for (int i=1; i<=n-2; i++)
{
if (A[i] + A[i+1] + A[i+2] == 3)
{
check = false;
break;
}
}
if (check == true)
{
for (int i=1; i<=n; i++)
{
cout << A[i];
}
cout << '\n';
}
}
else sinh(i+1);
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd1.inp","r",stdin);
freopen("xdd1.out","w",stdout);
nhap();
// cout << n << endl;
sinh(1);
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: // liệt kê dãy nhị phân độ dài n có đúng k số 1
#include<bits/stdc++.h>
using namespace std;

int n,k,A[100001];

void nhap()
{
cin >> n >> k;
if (n < k)
{
cout << -1;
exit(0);
}
}

void sinh(int i)
{
for (int j=0; j<=1; j++)
{
A[i] = j;
if (i == n)
{
int dem=0;
for (int i=1; i<=n; i++)
{
if (A[i] == 1) dem++;
}
if (dem == k)
{
for (int i=1; i<=n; i++)
{
cout << A[i];
}
cout << '\n';
}
}
else sinh(i+1);
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd1.inp","r",stdin);
freopen("xdd1.out","w",stdout);
nhap();
// cout << n << endl;
sinh(1);
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: // cho dãy n phần tử, liệt kê các cách chọn 1 số phần tử có tổng bằng k
#include<bits/stdc++.h>
using namespace std;

int n,k,A[100001],B[100001];

void nhap()
{
cin >> n >> k;
for (int i=1; i<=n; i++)
{
cin >> B[i];
}
}

void sinh(int i)
{
for (int j=0; j<=1; j++)
{
A[i] = j;
if (i == n)
{
int temp = 0;
for (int i=1; i<=n; i++)
{
if (A[i] == 1) temp += B[i];
if (temp > k) break;
}
if (temp == k)
{
for (int i=1; i<=n; i++)
{
if (A[i] == 1)
cout << B[i] << ' ';
}
cout << '\n';
}
}
else sinh(i+1);
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd1.inp","r",stdin);
freopen("xdd1.out","w",stdout);
nhap();
// cout << n << endl;
sinh(1);
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
using namespace std;

int n;
vector <int> ans;

void nhap()
{
cin >> n;
for (int i=1; i<=n; i++)
{
int tmp;
cin >> tmp;
ans.push_back(tmp);
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
nhap();
for (int i=ans.size()-1; i>=0; i--) cout << ans[i] << ' ' ;
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

meliodasssf đã viết:

Code:: #include <bits/stdc++.h>
using namespace std;

int n;
vector <int> ans;

void nhap()
{
   cin >> n;
   for (int i=1; i<=n; i++)
   {
   int tmp;
   cin >> tmp;
   ans.push_back(tmp);
   }
}

int main()
{
   ios_base::sync_with_stdio(0); cin.tie(0);
   freopen("xdd.inp","r",stdin);
   freopen("xdd.out","w",stdout);
   nhap();
   for (int i=ans.size()-1; i>=0; i--) cout << ans[i] << ' ' ;
   return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: #include <bits/stdc++.h>
using namespace std;

int n;
vector <int> ans;

void nhap()
{
cin >> n;
for (int i=1; i<=n; i++)
{
int tmp;
cin >> tmp;
ans.push_back(tmp);
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
nhap();
for (int i : ans) cout << i << ' ' ;
for (int i : ans) cout << i << ' ' ;
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

meliodasssf đã viết:

Code:: #include <bits/stdc++.h>
using namespace std;

int n;
vector <int> ans;

void nhap()
{
   cin >> n;
   for (int i=1; i<=n; i++)
   {
   int tmp;
   cin >> tmp;
   ans.push_back(tmp);
   }
}

int main()
{
   ios_base::sync_with_stdio(0); cin.tie(0);
   freopen("xdd.inp","r",stdin);
   freopen("xdd.out","w",stdout);
   nhap();
   for (int i : ans) cout << i << ' ' ;
   for (int i : ans) cout << i << ' ' ;
   return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: //B7 tìm kiếm nhị phân
#include <bits/stdc++.h>
using namespace std;

int n,k,A[110],B[110],ans=0;

void nhap()
{
cin >> n >> k;
for (int i=1; i<=n; i++)
{
cin >> B[i];
}
}

void sinh(int i)
{
for (int j=0; j<=1; j++)
{
A[i] = j;
if (i == n)
{
int sum=0,dem=0;
for (int i=1; i<=n; i++)
{
if (A[i] == 1)
{
sum += B[i];
dem++;
}
}
if (sum <= k) ans = max(ans,dem);
}
else sinh(i+1);
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
// freopen("xdd.inp","r",stdin);
// freopen("xdd.out","w",stdout);
nhap();
sinh(1);
cout << ans;
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: //B7 tìm kiếm nhị phân
#include <bits/stdc++.h>
using namespace std;

int n,k,A[110],B[110],ans=0;

void nhap()
{
cin >> n >> k;
for (int i=1; i<=n; i++)
{
cin >> B[i];
}
}

void sinh(int i)
{
for (int j=0; j<=1; j++)
{
A[i] = j;
if (i == n)
{
int sum=0,dem=0;
for (int i=1; i<=n; i++)
{
if (A[i] == 1)
{
sum += B[i];
dem++;
}
}
if (sum <= k) ans = max(ans,dem);
}
else sinh(i+1);
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
// freopen("xdd.inp","r",stdin);
// freopen("xdd.out","w",stdout);
nhap();
sinh(1);
cout << ans;
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: //B8 tìm kiếm nhị phân
#include <bits/stdc++.h>
using namespace std;

int n,A[110],B[110],ans=0;
long long s=0;
bool kt=false;

void nhap()
{
cin >> n;
for (int i=1; i<=n; i++)
{
cin >> B[i];
s += B[i];
}
if (s % 2 == 1)
{
cout << -1;
exit(0);
}
}

void sinh(int i)
{
for (int j=0; j<=1; j++)
{
A[i] = j;
if (i == n)
{
bool check=true;
int s1=0,s2=0;
for (int i=1; i<=n; i++)
{
if (A[i] == 1)
{
s1 += B[i];
if (s1 > s/2)
{
check = false;
break;
}
}
else
{
s2 += B[i];
if (s2 > s/2)
{
check = false;
break;
}
}
}
if (check == true && s1 == s2)
{
for (int i=1; i<=n; i++)
if (A[i] == 1)
cout << i << ' ';
cout << '\n';
for (int i=1; i<=n; i++)
if (A[i] == 0)
cout << i << ' ';
cout << '\n' << '\n';
kt = true;
}
}
else sinh(i+1);
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
// freopen("xdd.inp","r",stdin);
// freopen("xdd.out","w",stdout);
nhap();
sinh(1);
if (kt == false) cout << -1;
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: //B9 tìm kiếm nhị phân
#include <bits/stdc++.h>
using namespace std;

int n,k,A[110],B[110],maxx=0;
int ans[110];
bool kt = true;

void nhap()
{
cin >> n >> k;
for (int i=1; i<=n; i++)
{
cin >> B[i];
}
}

void sinh(int i)
{
for (int j=0; j<=1; j++)
{
A[i] = j;
if (i == n)
{
int s=0,dem=0;
for (int i=1; i<=n; i++)
{
if (A[i] == 1)
{
s += B[i];
dem++;
}
}
if (dem > maxx && s%k == 0)
{
maxx = dem;
dem=0;
for (int i=1; i<=n; i++)
if (A[i] == 1)
ans[++dem] = i;
kt = true;
}

}
else sinh(i+1);
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
// freopen("xdd.inp","r",stdin);
// freopen("xdd.out","w",stdout);
nhap();
sinh(1);
if (kt == false) cout << -1;
else
for (int i=1; i<=maxx; i++)
cout << ans[i] << ' ';
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: //B10 tìm kiếm nhị phân
#include <bits/stdc++.h>
using namespace std;

int n,k,A[110],B[110],minn=INT_MAX;
int ans1[110],dem1=0,ans2[110],dem2=0;

void nhap()
{
cin >> n;
for (int i=1; i<=n; i++)
{
cin >> B[i];
}
}

void sinh(int i)
{
for (int j=0; j<=1; j++)
{
A[i] = j;
if (i == n)
{
int s1=0,s2=0;
for (int i=1; i<=n; i++)
{
if (A[i] == 1)
s1 += B[i];
else
s2 += B[i];
}
if (minn > abs(s2-s1))
{
minn = abs(s2-s1);
dem1=0,dem2=0;
for (int i=1; i<=n; i++)
{
if (A[i] == 1) ans1[++dem1] = i;
else ans2[++dem2] = i;
}
}

}
else sinh(i+1);
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
// freopen("xdd.inp","r",stdin);
// freopen("xdd.out","w",stdout);
nhap();
sinh(1);
cout << minn << '\n';
for (int i=1; i<=dem1; i++) cout << ans1[i] << ' ';
cout << '\n';
for (int i=1; i<=dem2; i++) cout << ans2[i] << ' ';
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: //B11 tìm kiếm nhị phân
#include <bits/stdc++.h>
using namespace std;

int n,k,A[110],B[110],maxx=0;
int ans[110],dem=0;
bool kt = true;

void nhap()
{
cin >> n >> k;
for (int i=1; i<=n; i++)
{
cin >> B[i];
}
}

void sinh(int i)
{
for (int j=0; j<=1; j++)
{
A[i] = j;
if (i == n)
{
int s=0;
for (int i=1; i<=n; i++)
{
if (A[i] == 1)
{
s += B[i];
}
}
if (s > maxx && s%k == 0)
{
maxx = s;
dem=0;
for (int i=1; i<=n; i++)
if (A[i] == 1)
ans[++dem] = B[i];
kt = true;
}

}
else sinh(i+1);
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
// freopen("xdd.inp","r",stdin);
// freopen("xdd.out","w",stdout);
nhap();
sinh(1);
if (kt == false) cout << -1;
else
for (int i=1; i<=dem; i++)
cout << ans[i] << ' ';
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: //B12 tìm kiếm nhị phân
#include <bits/stdc++.h>
using namespace std;

int n,k,A[110],B[110],maxx=INT_MIN;
int ans[110],dem=0;

void nhap()
{
cin >> n >> k;
for (int i=1; i<=n; i++)
{
cin >> B[i];
}
}

void sinh(int i)
{
for (int j=0; j<=1; j++)
{
A[i] = j;
if (i == n)
{
int sum=0,dem=0;
for (int i=1; i<=n; i++)
if (A[i] == 1)
sum += B[i];
if (sum == k)
{
for (int i=1; i<=n; i++)
if (A[i] == 1) cout << i << ' ';
exit(0);
}
if (sum < k && sum > maxx)
{
maxx = sum;
dem=0;
for (int i=1; i<=n; i++)
if (A[i] == 1)
ans[++dem] = i;
}
}
else sinh(i+1);
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
// freopen("xdd.inp","r",stdin);
// freopen("xdd.out","w",stdout);
nhap();
sinh(1);
for (int i=1; i<=dem; i++) cout << ans[i] << ' ';
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: //B13 tìm kiếm nhị phân
#include <bits/stdc++.h>
using namespace std;

int n,k,A[110],B[110],maxx=INT_MIN;
int ans[110],dem=0;
bool kt=false;

void nhap()
{
cin >> n >> k;
for (int i=1; i<=n; i++)
{
cin >> B[i];
}
}

void sinh(int i)
{
for (int j=0; j<=1; j++)
{
A[i] = j;
if (i == n)
{
int sum=0,amax=INT_MIN,amin=INT_MAX;
for (int i=1; i<=n; i++)
if (A[i] == 1)
{
sum += B[i];
amax = max(amax,B[i]);
amin = min(amin,B[i]);
}
if (sum == k && maxx < abs(amax-amin))
{
kt = true;
dem = 0;
maxx = abs(amax-amin);
for (int i=1; i<=n; i++)
if (A[i] == 1)
ans[++dem] = i;
}
}
else sinh(i+1);
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
// freopen("xdd.inp","r",stdin);
// freopen("xdd.out","w",stdout);
nhap();
sinh(1);
cout << maxx << '\n';
for (int i=1; i<=dem; i++) cout << ans[i] << ' ';
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: //B14 tìm kiếm nhị phân
#include <bits/stdc++.h>
using namespace std;

int n,k,A[110],B[110],C[110];
int ans[110],maxx=INT_MIN;

void nhap()
{
cin >> n >> k;
for (int i=1; i<=n; i++)
{
cin >> B[i];
}
for (int i=1; i<=n; i++)
{
cin >> C[i];
}
}

void sinh(int i)
{
for (int j=0; j<=1; j++)
{
A[i] = j;
if (i == n)
{
bool check=true;
int sum=0,dem=0;
for (int i=1; i<=n; i++)
{
if (A[i] == 1)
{
sum += B[i] + C[i];
dem++;
if (dem > k)
{
check = false;
break;
}
}
}
if (dem == k && check == true && sum > maxx)
{
maxx = sum;
dem = 0;
for (int i=1; i<=n; i++)
if (A[i] == 1)
ans[++dem] = i;
}
}
else sinh(i+1);
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
// freopen("xdd.inp","r",stdin);
// freopen("xdd.out","w",stdout);
nhap();
sinh(1);
cout << maxx << '\n';
for (int i=1; i<=n; i++) cout << ans[i] << ' ';
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: // hoán vị
#include <bits/stdc++.h>
using namespace std;

int A[100010],n;
bool check[100010];

void nhap()
{
cin >> n;
memset(check,true,sizeof(check));
}

void xl()
{
for (int i=1; i<=n; i++) cout << A[i];
cout << '\n';
}

void thu(int i)
{
for (int j=1; j<=n; j++)
{
if (check[j] == true)
{
A[i] = j;
check[j] = false;
if (i == n) xl();
else thu(i+1);
check[j] = true;
}
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
nhap();
thu(1);
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: //DQHV2
#include <bits/stdc++.h>
using namespace std;

int A[100010],n,B[100010],dem=1;
bool check[100010];

void nhap()
{
   cin >> n;
   for (int i=1; i<=n; i++) cin >> B[i];
   memset(check,true,sizeof(check));
}

void xl()
{
   for (int i=1; i<=n; i++)
   {
   if (A[i] != B[i]) return;
   }
   cout << dem;
   exit(0);
}

void thu(int i)
{
   for (int j=1; j<=n; j++)
   {
   if (check[j] == true)
   {
   A[i] = j;
   check[j] = false;
   if (i == n)
   {
   xl();
   dem++;
   }
   else thu(i+1);
   check[j] = true;
   }
   }
}

int main()
{
   ios_base::sync_with_stdio(0); cin.tie(0);
   freopen("xdd.inp","r",stdin);
   freopen("xdd.out","w",stdout);
   nhap();
   thu(1);
   return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: //DQHV3
#include <bits/stdc++.h>
using namespace std;

int A[100010],k,n,dem=0;
bool check[100010];

void nhap()
{
cin >> n >> k;
memset(check,true,sizeof(check));
}

void xl()
{
for (int i=1; i<=n; i++) cout << A[i] << ' ';
}

void thu(int i)
{
for (int j=1; j<=n; j++)
{
if (check[j] == true)
{
A[i] = j;
check[j] = false;
if (i == n)
{
dem++;
if (dem == k)
{
xl();
exit(0);
}
}
else thu(i+1);
check[j] = true;
}
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
nhap();
thu(1);
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: //DQHV4
#include <bits/stdc++.h>
using namespace std;

int A[100010],n,B[100010];
bool check[100010],kt=false;

void nhap()
{
cin >> n;
for (int i=1; i<=n; i++) cin >> B[i];
memset(check,true,sizeof(check));
}

void xl()
{
for (int i=1; i<=n; i++)
{
if (A[i] != B[i]) return;
}
kt = true;
}

void thu(int i)
{
for (int j=1; j<=n; j++)
{
if (check[j] == true)
{
A[i] = j;
check[j] = false;
if (i == n)
{
if (kt == true)
{
for (int i=1; i<=n; i++) cout << A[i] << ' ';
exit(0);
}
else xl();
}
else thu(i+1);
check[j] = true;
}
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
nhap();
thu(1);
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: //DQHV5
#include <bits/stdc++.h>
using namespace std;

int A[100010],n,B[100010],ans=INT_MAX;
bool check[100010];

void nhap()
{
cin >> n;
for (int i=1; i<=n; i++) cin >> B[i];
memset(check,true,sizeof(check));
}

int xl()
{
int C[100010];
memset(C,0,sizeof(C));
for (int i=1; i<=n; i++)
{
C[i] = B[A[i]];
}

long long sum=0;
for (int i=2; i<=n; i++)
{
sum += abs(C[i-1] - C[i]);
}
return sum;
}

void thu(int i)
{
for (int j=1; j<=n; j++)
{
if (check[j] == true)
{
A[i] = j;
check[j] = false;
if (i == n)
{
ans = min(ans,xl());
}
else thu(i+1);
check[j] = true;
}
}
}

int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("xdd.inp","r",stdin);
freopen("xdd.out","w",stdout);
nhap();
thu(1);
cout << ans;
return 0;
}

Tổng số bài gửi : 71 Join date : 10/05/2022

Code:: //DQHV6
#include <bits/stdc++.h>
using namespace std;

int A[100010],n,B[100010],minn=INT_MAX,maxx=0,dem=1;
int ans[1010][1010];
bool check[100010];

void nhap()
{
   cin >> n;
   if (n < 3)
   {
   cout << -1;
   exit(0);
   }
   for (int i=1; i<=n; i++) cin >> B[i];
   memset(check,true,sizeof(check));
}

void xl()
{
   int C[100010];
   for (int i=1; i<=n; i++)
   {
   C[i] = B[A[i]];
   }

   int sum=0;
   for (int i=3; i<=n; i++)
   {
   sum += abs(C[i-2] - C[i-1] + C[i]);
   }
   minn = min(minn,sum);

   if (sum > maxx)
   {
   dem=1;
   maxx = sum;
   for (int i=1; i<=n; i++)
   ans[dem][i] = C[i];
   }
   if (sum == maxx)
   {
   dem++;
   for (int i=1; i<=n; i++)
   ans[dem][i] = C[i];
   }
}

void thu(int i)
{
   for (int j=1; j<=n; j++)
   {
   if (check[j] == true)
   {
   A[i] = j;
   check[j] = false;
   if (i == n) xl();
   else thu(i+1);
   check[j] = true;
   }
   }
}

int main()
{
   ios_base::sync_with_stdio(0); cin.tie(0);
   freopen("xdd.inp","r",stdin);
   freopen("xdd.out","w",stdout);
   nhap();
   thu(1);
   cout << minn << '\n';
   for (int i=1; i<=dem; i++)
   {
   for (int j=1; j<=n; j++)
   {
   cout << ans[i][j] << ' ' ;
   }
   cout << '\n';
   }
   return 0;
}

» Nguyen Xuan Nghia
» Nguyễn Xuân Long
» Nguyễn Đức Mạnh bài 8
» Nguyễn Đức Mạnh
» Nguyễn Đức Mạnh