Nguyễn Nhật Quân

Tiêu đề: ILUCKY Sun Jun 26, 2022 3:34 pm

Code:: #include <bits/stdc++.h>
#define nmax 100007
#define f(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
int a[nmax],s[nmax];
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
freopen("ILUCKY.inp","r",stdin);
freopen("ILUCKY.out","w",stdout);
int n,i;
cin>>n;
f(i,1,n) cin>>a[i];
s[0]=0;
f(i,1,n)
s[i]=s[i-1]+a[i];
int p=0;
f(i,1,n)
{
if(2*s[i]==s[n])
{
cout<<i<<" ";
return 0;
}
else
p=-1;
}
if(p==-1) cout<<-1;
return 0;
}

Tiêu đề: PMIN Sun Jun 26, 2022 3:39 pm

Code:: #include <bits/stdc++.h>
#define nmax 100007
#define f(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
int n, a[nmax];
void nhap()
{
   cin>>n;
   f(i,1,n) cin>>a[i];
}
void xuli()
{
   int rmin=trunc(1e9);
   for(int i=1;i<=n;i++)
   rmin=min(rmin,a[i]);
   for(int i=1;i<=n;i++)
   if(rmin==a[i])
   cout<<i<<" ";
}
int main()
{
   ios_base::sync_with_stdio(false); cin.tie(NULL);
   freopen("PMIN.inp","r",stdin);
   freopen("PMIN.out","w",stdout);
   nhap();
   xuli();
   return 0;
}

Tiêu đề: PSECOND Sun Jun 26, 2022 4:15 pm

Code:: #include <bits/stdc++.h>
#define nmax 100007
#define f(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
int n, a[nmax],c[nmax],b[nmax];
void nhap()
{
   cin>>n;
   f(i,1,n) cin>>a[i];
}
void del()
{
   int k=0;
   f(i,1,n)
   if(a[i]!=a[i+1])
   {
   k++;
   c[k]=a[i];
   }
}
bool check()
{
   int i;
   int rmax=a[1];
   int rmin=a[1];
   f(i,1,n)
   {
   rmax=max(rmax,a[i]);
   rmin=min(rmin,a[i]);
   }
   if(rmax!=rmin) return true;
   else return false;
}
void xuli()
{
   if(check())
   {
   del();
   sort(c+1,c+n+1);
   int rnhi=c[2];
   for(int i=1;i<=n;i++)
   b[i]=a[i];
   f(i,1,n)
   if(rnhi==b[i])
   cout<<b[i]<<" "<<i<<endl;
   }
   else cout<<-1;
}
int main()
{
   ios_base::sync_with_stdio(false); cin.tie(NULL);
   freopen("PSECOND.inp","r",stdin);
   freopen("PSECOND.out","w",stdout);
   nhap();
   xuli();
   return 0;
}

Tiêu đề: ARR2DSQU Wed Jun 29, 2022 9:05 pm

Code:: #include <bits/stdc++.h>
#define arr2d 100
#define nmax 100007
#define for(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
int a[arr2d][arr2d],s[arr2d][arr2d];
int m,n,k;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
   freopen("ARR2DSQU.inp","r",stdin);
   freopen("ARR2DSQU.out","w",stdout);
   cin>>m>>n>>k;
   int i,j,i0,j0;
   int p;
   for(i,1,m)
   for(j,1,n)
   cin>>a[i][j];
   s[0][0]=0;
   for(i,1,m)
   for(j,1,n)
   s[i][j]=s[i][j-1]+s[i-1][j]-s[i-1][j-1]+a[i][j];
   int resmax=-trunc(1e9);
   for(i,1,m-k+1)
   for(j,1,n-k+1)
   {
   p=s[i+k-1][j+k-1]-s[i-1][j+k-1]-s[i+k-1][j-1]+s[i-1][j-1];
   if(p>resmax)
   {
   resmax=p;
   i0=i; j0=j;
   }
   }
   cout<<p<<endl;
   cout<<i0<<" "<<j0;
   return 0;
}

Tiêu đề: ARR2HVS1. Sun Jul 03, 2022 10:19 am

Code:: #include <bits/stdc++.h>
#define arr2 100
#define nmax 100007
#define for(i,a,b) for(int i=a;i<=b;i++)
#define ford(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
int m,n,s1;
int a[arr2][arr2],s[arr2][arr2];
void nhap()
{
   cin>>m>>n>>s1;
   for(i,1,m)
   for(j,1,n)
   cin>>a[i][j];
}
void xuli()
{
   int i,j,i0,j0;
   int p,k;
   s[0][0]=0;
   for(i,1,m)
   for(j,1,n)
   s[i][j]=s[i][j-1]+s[i-1][j]-s[i-1][j-1]+a[i][j];
   int rmin=min(m,n);
   for(k,1,rmin)
   for(i,1,m-k+1)
   for(j,1,n-k+1)
   {
   p=s[i+k-1][j+k-1]-s[i-1][j+k-1]-s[i+k-1][j-1]+s[i-1][j-1];
   if(p==s1)
   {
   cout<<i<<" "<<j<<" "<<k;
   cout<<endl;
   }
   }
}
int main()
{
   ios_base::sync_with_stdio(false); cin.tie(NULL);
   freopen("inp","r",stdin);
   freopen("ARR2HVS1.out","w",stdout);
   nhap();
   xuli();
   return 0;
}

Tiêu đề: ARR2HVS2 Sun Jul 03, 2022 10:27 am

Code:: #include <bits/stdc++.h>
#define arr2 100
#define nmax 100007
#define for(i,a,b) for(int i=a;i<=b;i++)
#define ford(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
int m,n,s1;
int a[arr2][arr2],s[arr2][arr2];
void nhap()
{
   cin>>m>>n>>s1;
   for(i,1,m)
   for(j,1,n)
   cin>>a[i][j];
}
void xuli()
{
   int i,j,i0,j0;
   int p,k;
   s[0][0]=0;
   for(i,1,m)
   for(j,1,n)
   s[i][j]=s[i][j-1]+s[i-1][j]-s[i-1][j-1]+a[i][j];
   int rmin=min(m,n),rmax=-trunc(1e9);
   for(k,1,rmin)
   for(i,1,m-k+1)
   for(j,1,n-k+1)
   {
   p=s[i+k-1][j+k-1]-s[i-1][j+k-1]-s[i+k-1][j-1]+s[i-1][j-1];
   rmax=max(rmax,k);
   }
   cout<<rmax;
}
int main()
{
   ios_base::sync_with_stdio(false); cin.tie(NULL);
   freopen("ARR2HVS2.inp","r",stdin);
   freopen("ARR2HVS2.out","w",stdout);
   nhap();
   xuli();
   return 0;
}

Tiêu đề: ARR2REC1(Sub 1) Wed Jul 06, 2022 8:04 pm

Code:: #include <bits/stdc++.h>
#define arr2 100
#define nmax 100007
using namespace std;
int m,n;
int a[arr2][arr2];
int h[nmax],l[nmax],r[nmax];
void nhap()
{
   cin>>m>>n;
   for(int i=1;i<=m;i++)
   for(int j=1;j<=n;j++)
   cin>>a[i][j];
}
void xuli()
{
   int res;
   h[0]=-1; h[n+1]=-1;
   for(int i=1;i<=m;i++)
   {
   for(int j=1;j<=n;j++)
   h[j]=a[i][j]*(h[j]+1);
   for(int j=1;j<=n;j++)
   {
   l[j]=j;
   while(h[l[j]]-1>=h[j])
   l[j] = l[l[j]-1];
   }
   for(int j=n;j>=1;j--)
   {
   r[j]=j;
   while(h[r[j]+1]>=h[j])
   r[j]=r[r[j]+1];
   }
   for(int j=1;j<=n;j++)
   res=max(res,h[j]*(r[j]-l[j]+1));
   }
   cout<<res;
}
int main()
{
   freopen("ARR2REC1.inp","r",stdin);
   freopen("ARR2REC1.out","w",stdout);
   nhap();
   xuli();
   return 0;
}

Tiêu đề: ARR2REC1 Wed Jul 06, 2022 9:27 pm

Code:: #include <bits/stdc++.h>
#define arr2 100
#define nmax 100007
using namespace std;
int m,n;
int a[arr2][arr2];
int h[nmax],l[nmax],r[nmax],s[arr2][arr2];
void nhap()
{
cin>>m>>n;
for(int i=1;i<=m;i++)
for(int j=1;j<=n;j++)
cin>>a[i][j];
}
void sub1()
{
int res;
h[0]=-1; h[n+1]=-1;
for(int i=1;i<=m;i++)
{
for(int j=1;j<=n;j++)
h[j]=a[i][j]*(h[j]+1);
for(int j=1;j<=n;j++)
{
l[j]=j;
while(h[l[j]]-1>=h[j])
l[j] = l[l[j]-1];
}
for(int j=n;j>=1;j--)
{
r[j]=j;
while(h[r[j]+1]>=h[j])
r[j]=r[r[j]+1];
}
for(int j=1;j<=n;j++)
res=max(res,h[j]*(r[j]-l[j]+1));
}
cout<<res;
}
void sub2()
{
int p;
s[0][0]=0;
for(int i=1;i<=m;i++)
for(int j=1;j<=n;j++)
s[i][j]=s[i-1][j]+s[i][j-1]-s[i-1][j-1]+a[i][j];
int resmax=-trunc(1e9);
for(int x1=1;x1<=m;x1++)
for(int y1=1;y1<=n;y1++)
for(int x2=x1;x2<=m;x2++)
for(int y2=y1;y2<=n;y2++)
{
p=s[x2][y2]-s[x1-1][y2]-s[x2][y1-1]+s[x1-1][y1-1];
resmax=max(resmax,p);
}
cout<<resmax;
}
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
freopen("ARR2REC1.inp","r",stdin);
freopen("ARR2REC1.out","w",stdout);
nhap();
sub2();
return 0;
}

Tiêu đề: Re: Nguyễn Nhật Quân Wed Jul 06, 2022 9:39 pm

Code:: program XTIEN;
uses math;
const
fi = 'XTIEN.inp';
fo = 'XTIEN.out';
var x,t50,t20,t10,a,b,c,d,s:longint;
begin
assign(input,fi); reset(input);
assign(output,fo); rewrite(output);
readln(x);
a:=x div 50; x:=x mod 50;
b:=x div 20; x:=x mod 20;
c:=x div 10; x:=x mod 10;
d:=x div 5; x:=x mod 5;
if(x>0) then write(-1)
else
begin
s:=a+b+c+d;
write(s);
end;
close(input); close(output);
end.

Tiêu đề: DNP1 Thu Aug 11, 2022 2:18 pm

Code:: //Code by Vaniii_ <3
#include <bits/stdc++.h>
#define nmax 1000007
#define f(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)

using namespace std;

int n, a[nmax];

vector <int> p;
void xuli(){
   f(i,1,n)
   cout<<a[i]<<" ";
   cout<<endl;
*/

void thu(int i){
   for(int j=0;j<=1;j++){
   a[i]=j;
   if(i==n){
   xuli();
   }else{
   thu(i+1);
   }
   }
}

int main()
{
   std::cin>>n;
   thu(1);
   return 0;
}

Tiêu đề: DNP2 Thu Aug 11, 2022 2:19 pm

Code:: //Code by Vaniii_ <3
#include <bits/stdc++.h>
#define nmax 1000007
#define f(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)

using namespace std;

int n, a[nmax];

vector <int> p;
void xuli(){
int d=0, d2=0, p=0;
f(i,1,n)
if(a[i]==0)
d++;
else d2++;
f(i,1,n)
if(d==d2){
cout<<a[i]<<" ";
}
cout<<endl;
}
/*
void thus(){ //dang fail
int i, j;
memset(a,sizeof(a),0);
i=n;
while(i>0){
i=n;
while(a[i]==1){
i--;
}
a[i]=1;
f(j,i+1,n)
a[j]=0;
xuli();
}
}
*/

void thu(int i){
for(int j=0;j<=1;j++){
a[i]=j;
if(i==n){
xuli();
}else{
thu(i+1);
}
}
}

int main()
{
std::cin>>n;
thu(1);
return 0;
}

Tiêu đề: DQBN6 Thu Aug 11, 2022 2:36 pm

Code:: #include <bits/stdc++.h>
#define nmax 1000007
#define f(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)

using namespace std;

int n, k, a[nmax], b[nmax];
int p=1, res=0;

void xuli(){
   int d=0, s=0;
   f(i,1,n)
   if(b[i]==1){
   s+=a[i];
   d++;
   if(s>k){
   return;
   }
   }
   res=max(res,d);
   f(i,1,n)
   if(b[i]==1)
   cout<<a[i]<<" ";
   //std::printf("%d ", res);
}

void thu(int i){
   for(int j=0;j<=1;j++){
   b[i]=j;
   if(i==n){
   xuli();
   }else{
   thu(i+1);
   }
   }
}

int main()
{
   cin>>n>>k;
   f(i,1,n)
   cin>>a[i];
   thu(1);
   return 0;
}

Tiêu đề: DQBN6 Thu Aug 11, 2022 2:36 pm

Code:: #include <bits/stdc++.h>
#define nmax 1000007
#define f(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)

using namespace std;

int n, k, a[nmax], b[nmax];
int p=1, res=0;

void xuli(){
   int d=0, s=0;
   f(i,1,n)
   if(b[i]==1){
   s+=a[i];
   d++;
   if(s>k){
   return;
   }
   }
   res=max(res,d);
   f(i,1,n)
   if(b[i]==1)
   cout<<a[i]<<" ";
   //std::printf("%d ", res);
}

void thu(int i){
   for(int j=0;j<=1;j++){
   b[i]=j;
   if(i==n){
   xuli();
   }else{
   thu(i+1);
   }
   }
}

int main()
{
   cin>>n>>k;
   f(i,1,n)
   cin>>a[i];
   thu(1);
   return 0;
}

Tiêu đề: DQBN4 Thu Aug 11, 2022 2:39 pm

Code:: //DQBN4
#include <bits/stdc++.h>
#define nmax 1000007
#define f(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)

using namespace std;

int n, k, a[nmax];

void xuli(){
   int d=0, p=1;
   f(i,1,n){
   d+=a[i];
   if(d>k){
   p=0;
   break;
   }
   }
   if(p==1&&d==k){
   f(i,1,n)
   cout<<a[i]<<" ";
   cout<<endl;
   }

}

void thu(int i){
   for(int j=0;j<=1;j++){
   a[i]=j;
   if(i==n){
   xuli();
   }else{
   thu(i+1);
   }
   }
}

int main()
{
   cin>>n>>k;
   thu(1);
   return 0;
}

Tiêu đề: Re: Nguyễn Nhật Quân Thu Aug 11, 2022 2:57 pm

Code:: //DQNB7
#include <bits/stdc++.h>
#define nmax 1000007
#define f(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)

using namespace std;

int n, k, a[nmax], b[nmax];
int p=1, s=0;

void xuli(){
int s1=0;
f(i,1,n)
if(b[i]==1){
s1+=a[i];
if(s1*2>s)
return;
}
if(2*s1==s){
f(i,1,n)
if(b[i]==1)
cout<<i<<" ";
cout<<endl;
f(i,1,n)
if(b[i]==0)
cout<<i<<" ";
}

}

void thu(int i){
for(int j=0;j<=1;j++){
b[i]=j;
if(i==n){
xuli();
}else{
thu(i+1);
}
}
}

int main()
{
cin>>n;
f(i,1,n)
cin>>a[i];
thu(1);
return 0;
}

Tiêu đề: Re: Nguyễn Nhật Quân Thu Aug 11, 2022 3:24 pm

Code:: //DQBN8
#include <bits/stdc++.h>
#define ll long long
#define nmax 1000007
using namespace std;

const int inf = trunc(1e9) + 7;
int n, a[nmax], b[nmax], k;
ll s;

void xuli(){
int d=0, res=-inf, s1=0;
for(int i=1;i<=n;i++){
if(b[i]==1){
s1+=a[i];
d++;
}
}
if(s1%k==0){
res=max(res,d);
}
}

void xuli2(){
int d=0, res=-inf, s1=0;
for(int i=1;i<=n;i++){
if(b[i]==1){
s1+=a[i];
d++;
}
}
if(s1%k==0&&d==res){
for(int i=1;i<=n;i++)
if(b[i]==1)
cout<<i<<" ";
cout<<endl;
}
}

void thu(int i){
for(int j=0;j<=1;j++){
b[i]=j;
if(i==n)
xuli();
else thu(i+1);
}
}

void thu2(int i){
for(int j=0;j<=1;j++){
b[i]=j;
if(i==n)
xuli2();
else thu(i+1);
}
}

int main()
{
cin>>n>>k;
for(int i=1;i<=n;i++)
cin>>a[i];
thu(1);
thu2(1);
return 0;
}

Tiêu đề: DQBN12 Thu Aug 11, 2022 8:47 pm

Code:: //DQBN12
#include <bits/stdc++.h>
#define nmax 1000007
#define f(i,a,b) for(int i=a;i<=b;i++)

using namespace std;

const int inf = trunc(1e9) + 7;
int a[nmax], n, b[nmax], c[nmax];
int k, res=-inf, m;

void xuli(){
   int sb=0, sc=0;
   f(i,1,n){
   if(a[i]==1){
   sb+=b[i];
   sc+=c[i];
   }
   res=max(res, sc);
   }
}

void xuli2(){
   int sb=0, sc=0;
   f(i,1,n){
   if(a[i]==1){
   sb+=b[i];
   sc+=c[i];
   }
   }
   if(sb<=k&&sc==res)
   f(i,1,n){
   if(a[i]==0)
   cout<<b[i]<<" ";
   }
   cout<<"\n "<<res;
}

void thu(int i){
   f(j,0,1){
   a[i]=j;
   if(i==n)
   xuli();
   else thu(i+1);
   }
}

void thu2(int i){
   f(j,0,1){
   a[i]=j;
   if(i==n)
   xuli2();
   else thu(i+1);
   }
}

int main()
{
   ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
   std::cin>>n>>k;
   f(i,1,n) cin>>b[i];
   f(i,1,n) cin>>c[i];
   thu(1);
   thu2(1);
   return 0;
}

Tiêu đề: DQBN22 Fri Aug 19, 2022 8:57 am

Code:: //DQBN22
#if //input
5
3 1 2 6 5
#endif
#if //output
5
6 5
2
2 5
2 6 5
1 6
1 2
3
3 2
3 2 6
3 1 2 5
3 1 2 6 5
#endif

#include <bits/stdc++.h>
#define nmax 1000007
#define f(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
using namespace std;

int n, a[nmax], b[nmax], s=0;

bool snt(int u){
if(u==1) return false;
if(u==2||u==3) return true;
for(int i=2;i*i<=u;i++)
if(u%i==0)
return false;
return true;
}

void xuli(){
int sp=0, d=0;
f(i,1,n){
if(b[i]==1)
sp+=a[i];
d++;
}
if(snt(sp)){
//cout<<d<<"\n";
f(i,1,n)
if(b[i]==1)
cout<<a[i]<<" ";
cout<<endl;
}
}

void thu(int i){
f(j,0,1){
b[i]=j;
if(i==n){
xuli();
}else{
thu(i+1);
}
}
}

int main()
{
freopen("DQBN22.inp","r",stdin);
freopen("DQBN22.out","w",stdout);
memset(b,sizeof(b),0);
cin>>n;
f(i,1,n){
cin>>a[i];
s+=a[i];
}
thu(1);
return 0;
}
//Code by Quandz <3

Tiêu đề: DQBN23 Fri Aug 19, 2022 9:07 am

Code:: //DQBN23
//inp
/*
5
3 1 6 7 2
*/
//out
/*
19
*/
#include <bits/stdc++.h>
#define nmax 1000007
#define f(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)

using namespace std;

int n, a[nmax], b[nmax], s=0;
int res=-trunc(1e9);
bool snt(int u){
   if(u==1) return false;
   if(u==2||u==3) return true;
   for(int i=2;i*i<=u;i++)
   if(u%i==0)
   return false;
   return true;
}

void xuli(){
   int sp=0, d=0;
   f(i,1,n){
   if(b[i]==1){
   sp+=a[i];
   d++;
   }
   }
   if(snt(sp)){
   f(i,1,n){
   res=max(res,s);
   }
   }
}

void thu(int i){
   f(j,0,1){
   b[i]=j;
   if(i==n){
   xuli();
   }else{
   thu(i+1);
   }
   }
}

int main()
{
   ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
   freopen("DQBN23.inp","r",stdin);
   freopen("DQBN23.out","w",stdout);
   memset(b,sizeof(b),0);
   cin>>n;
   f(i,1,n){
   cin>>a[i];
   s+=a[i];
   }
   thu(1);
   printf("%d ", res);
   return 0;
}

Tiêu đề: Emerald Fri Aug 19, 2022 9:34 am

Code:: //Emerald
#include <bits/stdc++.h>
#define nmax 1000007
#define f(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)

using namespace std;

int n, a[nmax], b[nmax], s=0;
int res=-trunc(1e9);
bool test=false;

void xuli(){
   int sp=0, d=0;
   f(i,1,n){
   if(b[i]==1){
   sp+=a[i];
   d++;
   }
   }
   if(3*sp==s){
   test=true;
   cout<<d<<endl;
   f(i,1,n){
   if(b[i]==1)
   cout<<i<<" ";
   }
   }
}

void thu(int i){
   f(j,0,1){
   b[i]=j;
   if(test){
   return;
   }
   if(i==n){
   xuli();
   }else{
   thu(i+1);
   }
   }
}

int main()
{
   ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
   freopen("Emerald.inp","r",stdin);
   freopen("Emerald.out","w",stdout);
   memset(b,sizeof(b),0);
   cin>>n;
   f(i,1,n){
   cin>>a[i];
   s+=a[i];
   }
   thu(1);
   return 0;
}

Tiêu đề: BINARY Fri Aug 19, 2022 10:43 am

Code:: //BINARY
#include <bits/stdc++.h>
#include <string.h>

using namespace std;

int n, res=0;
string s, sa;
char a[100007];

void xuli(){
   sa="";
   for(int i=1;i<=n;i++)
   sa+=a[i];
   //cout<<sa<<endl;
   //cout<<sa.find(s)<<endl;
   if(sa.find(s)+1>0)
   res++;
}

void thu(int i){
   for(char j='0'; j<='1'; j++){
   a[i]=j;
   if(i==n){
   xuli();
   }else{
   thu(i+1);
   }
   }
}
int main()
{
   freopen("BINARY.inp","r",stdin);
   freopen("BINARY.out","w",stdout);
   cin>>n;
   cin>>s;
   thu(1);
   cout<<res;
   return 0;
}

Tiêu đề: DQCKN1 Mon Aug 22, 2022 8:01 pm

Code:: [left]#include <bits/stdc++.h>
#define nmax 1000007
#define f(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
int n, k, a[nmax];

/*
#ifdef
DQCKN1.inp
5 3
DQCKN1.out
1 2 3
1 2 4
1 2 5
1 3 4
1 3 5
1 4 5
2 3 4
2 3 5
2 4 5
3 4 5
#endif
*/

void xuli(){
   f(i,1,k){
   cout<<a[i]<<" ";
   }
   cout<<endl;
}

void thu(int i){
   f(j,a[i-1]+1,n-k+i){
   a[i]=j;
   if(i==k){
   xuli();
   }else{
   thu(i+1);
   }
   }
}
int main()
{
   ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
   freopen("DQCKN1.inp","r",stdin);
   freopen("DQCKN1.out","w",stdout);
   memset(a,sizeof(a),0);
   cin>>n>>k;
   thu(1);
   return 0;
}
[/left]

Tiêu đề: DQCKN4 Mon Aug 22, 2022 9:15 pm

Code:: #include <bits/stdc++.h>
#define nmax 1000007
#define f(i,a,b) for(int i=a;i<=b;i++)
using namespace std;

int n, k, a[nmax], b[nmax];
int rmax=-trunc(1e9);

bool palidrom(int u){
   int s, r, temp;
   for(temp=u;u!=0;u=u/10){
   r=u%10;
   s=s*10+r;
   }
   if(temp==s)
   return true;
   else return false;

}

void xuli(){
   int rs=0;
   f(i,1,k){
   rs+=b[a[i]];
   }
   if(palidrom(rs)){
   rmax=max(rmax,rs);
   }
}

void thu(int i){
   f(j,a[i-1]+1,n-k+i){
   b[i]=j;
   if(i==k){
   xuli();
   }else{
   thu(i+1);
   }
   }
}
int main()
{
   ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
   //freopen("DQCKN4.inp","r",stdin);
   //freopen("DQCKN4.out","w",stdout);
   memset(b,sizeof(b),0);
   cin>>n>>k;
   f(i,1,n) cin>>a[i];
   thu(1);
   cout<<rmax;
   return 0;
}

Tiêu đề: DQCKN6 Mon Aug 29, 2022 8:59 pm

Code:: #include <bits/stdc++.h>
#define nmax 1000007
#define f(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
#define jack 5000000
#define datvilla 400000000
#define jonnydark 35000000000

using namespace std;

int n, k, m, a[nmax], b[nmax], c[nmax];
int res=-trunc(1e9);

void xuli(){
   int rs=0, rs2=0;
   f(i,1,k){
   rs+=b[a[i]];
   if(rs>m)
   break;
   }
   f(i,1,k){
   rs2+=c[a[i]];
   }
   f(i,1,k)
   if(rs<=m)
   res=max(res, rs2);
}

void thu(int i){
   f(j,a[i-1]+1,n-k+i){
   a[i]=j;
   if(i==k){
   xuli();
   }else{
   thu(i+1);
   }
   }
}
int main()
{
   ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
   freopen("DQCKN6.inp","r",stdin);
   freopen("DQCKN6.out","w",stdout);
   memset(a,sizeof(a),0);
   cin>>n>>k>>m;
   f(i,1,n)
   cin>>b[i]>>c[i];
   thu(1);
   cout<<res;
   return 0;
}

Tiêu đề: Re: Nguyễn Nhật Quân Sat Sep 03, 2022 8:14 pm

Code:: //Code by QunHaker :3
//QLCHKN
#include <iostream>
#include <cstring>
#define nmax 1000007
#define ll long long
#define fre freopen
#define f(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)

using namespace std;

int a[nmax], n, k;

void xuli(){
f(i,1,k){
cout<<a[i]<<" ";
}
cout<<endl;
}

void thu(int i){
f(j,a[i-1]+1,n-k+i){
a[i]=j;
if(i==k){
xuli();
}else{
thu(i+1);
}
}
}

int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
fre("QLCHKN.inp","r",stdin);
fre("QLCHKN.out","w",stdout);
memset(a,sizeof(a),0);
cin>>n>>k;
thu(1);
return 0;
}

» Nguyễn Nhật Quân
» Nguyễn Nhật Quân
» BÀI 54: ƯỚC NGUYÊN TỐ LỚN NHẤT
» Bài 54: Ước nguyên tố lớn nhất
» Nguyễn Đoàn Minh Nhật