Mễ Văn Thuận

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

Code:: #include <iostream>
#include <string.h>
#include <stdlib.h>
using namespace std;
int main()
{
char s[1000];
gets(s);
char*token=strtok(s,"QWERTYUIOPASDFGHJKLZXCVBNMasdfghjklqwertyuiopzxcvbnm");
while (token!=NULL)
{
cout<<token;
token=strtok(NULL,"QWERTYUIOPASDFGHJKLZXCVBNMasdfghjklqwertyuiopzxcvbnm");
}
return 0;
}

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

Code:: #include <iostream>
#include <fstream>
using namespace std;
void doctep();
void nhiphan(long i);
void xuat();
long n,a[100000],k;
int main()
{
   doctep();
   nhiphan(1);
   return 0;
}
void doctep()
{
   ifstream fi("DQBIT05.inp");
   fi>>n>>k;
   fi.close();
}
void nhiphan(long i)
{
   for (long j=0;j<=1;j++)
   {
   a[i]=j;
   if (i==n) xuat();
   else nhiphan(i+1);
   }
}
void xuat()
{
   long d=0;
   for (long i=1;i<=n;i++)
   if (a[i]==1)
   {
   d++;
   if (d>k) return;
   }
   for (long i=1;i<=n;i++)
   cout<<a[i]<<" ";
   cout<<endl;
}

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

Code:: #include <fstream>
#include <math.h>
#include <limits.h>
#include <iostream>
using namespace std;
void doctep();
void sinh(int i);
void xuat();
void ghitep();
long n,k,a[10000],res=INT_MIN,b[10000],d=0;
int main()
{
doctep();
ghitep();
return 0;
}
void doctep()

{
ifstream fi("DQBIT06.inp");
fi>>n>>k;
for (int i=1;i<=n;i++)
fi>>a[i];
fi.close();
}
void sinh(int i)
{
for (int j=0;j<=1;j++)
{
b[i]=j;
if (i==n) xuat();
else sinh(i+1);
}
}
void xuat()
{
long s=0;
d=0;
for (int i=1;i<=n;i++)
if (b[i]==1)
{
s+=a[i];
if (s>k) return;
d++;
}
if (s==k)
res=max(res,d);

}
void ghitep()
{
sinh(1);
ofstream fo("DQBIT06.out");
fo<<res;
fo.close();
}

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

Code:: #include <iostream>
#include <fstream>
#include <limits.h>
#include <math.h>
using namespace std;
void doctep();
void sinh(int i);
void xuat();
ofstream fo;
int n, a[30],b[30],p=0,s=0;
int main()
{
   fo.open("DQBIT07.out");
   doctep();
   if (p==0) fo<<-1;
   fo.close();
   return 0;
}
void doctep()
{
   ifstream fi("DQBIT07.inp");
   fi>>n;
   for (int i=1;i<=n;i++)
   {
   fi>>a[i];
   s+=a[i];
   }
   if (s%2==1) p=0;
   else sinh(1);
   fi.close();
}
void sinh(int i)
{
   for (int j=0;j<=1;j++)
   {
   b[i]=j;
   if (i==n) xuat();
   else sinh(i+1);
   }
}
void xuat()
{
   long s1=0;
   for (int i=1;i<=n;i++)
   if (b[i]==1)
   s1+=a[i];
   if (2*s1==s)
   {
   p=1;
   for (int i=1;i<=n;i++)
   fo<<b[i]<<" ";
   fo<<endl;
   }

}

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

Code:: #include <iostream>
#include <fstream>
#include <math.h>
#include <limits.h>
using namespace std;
void doctep();
void sinh(int i);
void xuat();
void ghitep();
long n,a[10000],c[10000],res=INT_MIN,b[10000];
int main()
{
   doctep();
   sinh(1);
   ghitep();
   return 0;
}
void doctep()
{
   ifstream fi("DQBIT08.inp");
   fi>>n;
   for (int i=1;i<=n;i++)
   fi>>a[i];
   fi.close();
}
void sinh(int i)
{
   for (int j=0;j<=1;j++)
   {
   b[i]=j;
   if (i==n) xuat();
   else sinh(i+1);
   }
}
void xuat()
{
   for (long i=1;i<=n-2;i++)
   if (b[i]+b[i+1]+b[i+2]==3) return;
   long long s=0;
   for (long i=1;i<=n;i++)
   if (b[i]==1)
   s+=a[i];
   if (res<s)
   {
   long k=0;
   res=s;
   for (long i=1;i<=n;i++)
   {
   k++;
   c[k]=b[i];
   }
   }
}
void ghitep()
{
ofstream fo("DQBIT08.out");
fo<<res<<endl;
for (long i=1;i<=n;i++)
   fo<<c[i]<<" ";
}

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

Code:: #include <iostream>
#include <fstream>
#include <math.h>
#include <algorithm>
using namespace std;
void doctep();
bool ngto(long long u);
void xuli();
void ghitep();
long n,m,a[10000],c[10000],k=0,f[50];
int main()
{
doctep();
ghitep();
return 0;
}
void doctep()
{
ifstream fi("FIBPRIME.inp");
fi>>m>>n;
fi.close();
}
bool ngto(long long u)
{
if (u<2) return false;
if (u<4) return true;
for (long i=2;i<=round(sqrt(u));i++)
if (u%i==0) return false;
return true;
}
void xuli()
{
f[1]=0; f[2]=1;
for (long i=3;i<=50;i++)
f[i]=f[i-1]+f[i-2];
for (long i=1;i<=50;i++)
cout<<f[i]<<" ";
for (long i=m;i<=n;i++)
if (ngto(i)==true && binary_search(f+1,f+50+1,i)==true)
{
k++;
c[k]=i;
}
}
void ghitep()
{
xuli();
ofstream fo("FIBPRIME.out");
for (long i=1;i<=k;i++)
fo<<c[i]<<" ";
fo.close();
}

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

Code:: #include <fstream>
#include <iostream>
#include <math.h>
using namespace std;
void doctep();
void sinh(int i);
void xuat();
ofstream fo;
int a[30],b[30],c[30],n;
int main()
{
doctep();
fo.open("PPSTN.out");
sinh(1);
fo.close();
return 0;
}
void doctep()
{
ifstream fi("PPSTN.inp");
fi>>n;
for (long i=1;i<=n;i++)
fi>>a[i];
fi.close();
}
void sinh(int i)
{
for (long j=0;j<=1;j++)
{
b[i]=j;
if (i==n) xuat();
else sinh(i+1);
}
}
void xuat()
{
int k=0;
for (long i=1;i<=n;i++)
if (b[i]==1)
{
k++;
c[k]=a[i];
}
if (k<2) return;
for (int i=1;i<=k-1;i++)
if (c[i]>c[i+1]) return;
for (int i=1;i<=k;i++)
fo<<c[i]<<" ";
fo<<endl;
}

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

Code:: include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
void doctep();
void thu(int i);
void xuat();
ofstream fo;
int n,k,a[30];
int main()
{
doctep();
fo.open("DQCKN1.out");
thu(1);
fo.close();
return 0;
}
void doctep()
{
ifstream fi("DQCKN1.inp");
fi>>n>>k;
fi.close();
}
void thu(int i)
{
for (int j=a[i-1]+1;j<=n-k+i;j++)
{
a[i]=j;
if (i==k) xuat();
else thu(i+1);
}
}
void xuat()
{
for (long i=1;i<=k;i++)
fo<<a[i]<<" ";
fo<<endl;
}

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

Code:: #include <iostream>
#include <fstream>
#include <math.h>
#include <limits.h>
#include <algorithm>
using namespace std;
void doctep();
void thu(int i);
void xuat();
ofstream fo;
int n,k,a[30],b[30],nmax=INT_MIN,nmin=INT_MAX,u,v;
int main()
{
doctep();
fo.open("DQCKN51.out");
thu(1);
fo.close();
return 0;
}
void doctep()
{
ifstream fi("DQCKN51.inp");
fi>>n>>k;
for (int i=1;i<=n;i++)
{
fi>>b[i];
if (nmax<a[i])
{
nmax=a[i];
u=i;
}
if (nmin>a[i])
{
nmin=a[i];
v=i;
}
}
fi.close();
}
void thu(int i)
{
for (int j=a[i-1]+1;j<=n-k+i;j++)
{
a[i]=j;
if (i==k) xuat();
else thu(i+1);
}
}
void xuat()
{
if (binary_search(b+1,b+n+1,u)==true && binary_search(b+1,b+n+1,v)==true)
for (long i=1;i<=k;i++)
fo<<b[a[i]]<<" ";
fo<<endl;
}

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

Code:: #include <iostream>
#include <fstream>
using namespace std;
void doctep();
void ghitep();
long n,p,a[10000],u[10000],v[10000];
long long s[10000];
int main()
{
   doctep();
   ghitep();
   return 0;
}
void doctep()
{
   ifstream fi("QHD1.inp");
   fi>>n>>p;
   for (int i=1;i<=n;i++)
   fi>>a[i];
   for (int i=1;i<=p;i++)
   fi>>u[i]>>v[i];
   s[0]=0;
   for (int i=1;i<=n;i++)
   s[i]=s[i-1]+a[i];
   fi.close();
}
void ghitep()
{
   ofstream fo("QHD1.out");
   for (int i=1;i<=p;i++)
   {
   fo<<s[v[i]]-s[u[i]-1]<<" ";
   fo<<endl;
   }
   fo.close();
}

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

Code:: #include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
void doctep();
bool ngto(long long u);
void ghitep();
long n,p,a[10000],u[10000],v[10000],res=INT_MIN;
long long s[10000];
int main()
{
doctep();
ghitep();
return 0;
}
void doctep()
{
ifstream fi("QHD3.inp");
fi>>n>>p;
for (int i=1;i<=n;i++)
fi>>a[i];
for (int i=1;i<=p;i++)
fi>>u[i]>>v[i];
s[0]=0;
for (int i=1;i<=n;i++)
s[i]=s[i-1]+a[i];
fi.close();
}
bool ngto(long long u)
{
if (u<2) return false;
if (u<4) return true;
for (long i=2;i<=round(sqrt(u));i++)
if (u%i==0) return false;
return true;
}
void ghitep()
{
ofstream fo("QHD3.out");
for (int i=1;i<=p;i++)
{
long long q=0;
q=s[v[i]]-s[u[i]-1];
if (ngto(q)==true)
if (res<q)
res=q;
}
fo<<res;
fo.close();
}

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

Code:: #include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
void doctep();
void ghitep();
long n,k,x,u[10000],v[10000],res=INT_MIN,s[10000],a[10000];
int main()
{
doctep();
ghitep();
return 0;
}
void doctep()
{
ifstream fi("QHD9.inp");
fi>>n>>k;
for (int i=1;i<=n;i++)
{
fi>>x;
a[i]=x%k;
}
s[0]=0;
for (int i=1;i<=n;i++)
s[i]=s[i-1]+a[i];
fi.close();
}

void ghitep()
{
ofstream fo("QHD9.out");
for (long i=1;i<=n;i++)
for (long j=i;j<=n;j++)
{
long q=0;
q=s[j]-s[i-1];
if (q%k==0)
res=max(res,j-i+1);
}
fo<<res;
fo.close();
}

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

Code:: #include <iostream>
#include <fstream>
#include <math.h>
#include <algorithm>
using namespace std;
void doctep();
void kiemtra(long u);
void ghitep();
long n,res=INT_MIN,s[10000],a[10000],f[10000],i0=2;
int main()
{
doctep();
ghitep();
return 0;
}
void doctep()
{
ifstream fi("QHD10.inp");
fi>>n;
s[0]=0;
for (int i=1;i<=n;i++)
{
fi>>a[i];
s[i]=s[i-1]+a[i];
}
fi.close();
}
void kiemtra(long u)
{
f[0]=0;
f[1]=1;
f[2]=1;
while (f[i0]<=u)
{
f[i0]=f[i0-1]+f[i0-2];
cout<<f[i0];
if (f[i0]>=u) break;
i0++;
}
}
void ghitep()
{
kiemtra(s[n]);
ofstream fo("QHD10.out");
for (long i=1;i<=n;i++)
for (long j=i;j<=n;j++)
{
long q=0;
q=s[j]-s[i-1];
if (binary_search(f+1,f+i0+1,q)==true)
res=max(res,j-i+1);
}
fo<<res;
fo.close();
}

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

Code:: #include <bits/stdc++.h>
using namespace std;
void doctep();
void thu(int i);
void xuat();
void ghitep();
long n,b[10000],c[10000],a[10000],res=0;
long long s=0,s1;
int main()
{
   doctep();
   ghitep();
   return 0;
}
void doctep()
{
   ifstream fi("EMERALD.inp");
   fi>>n;
   for (long i=1;i<=n;i++)
   {
   fi>>a[i];
   s+=a[i];
   }
   fi.close();
}
void thu(int i)
{
   for (int j=0;j<=1;j++)
   {
   b[i]=j;
   if (i==n) xuat();
   else thu(i+1);
   }
}
void xuat()
{
   long d=0;
   s1=0;
   for (long i=1;i<=n;i++)
   if (b[i]==1)
   {
   d++;
   s1+=a[i];
if (3*s[1]>s) return;
   }
   if (3*s1==s)
   {
   res=d;
   for (long i=1;i<=n;i++)
   c[i]=b[i];
   }
}
void ghitep()
{
   thu(1);
   ofstream fo("EMERALD.out");
   if (res==0)
   fo<<0;
   else
   {
   fo<<res<<endl;
   for (long i=1;i<=n;i++)
   if (c[i]==1)
   fo<<i<<" ";
   }
   fo.close();
}

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

Code:: #include <bits/stdc++.h>
using namespace std;
void doctep();
void thu(int i);
void xuat();
void ghitep();
long m,n,a[10000],b[10000],c[10000],d[10000],res=0;
int main()
{
   doctep();
   ghitep();
   return 0;
}
void doctep()
{
   ifstream fi("MODM.inp");
   fi>>n>>m;
   for (long i=1;i<=n;i++)
   fi>>a[i];
   fi.close();
}
void thu(int i)
{
   for (long j=0;j<=1;j++)
   {
   b[i]=j;
   if (i==n) xuat();
   else thu(i+1);
   }
}
void xuat()
{
   long k=0;
   for (long i=1;i<=n;i++)
   if (b[i]==1)
   {
   k++;
   c[k]=a[i];
   }
   for (long i=1;i<=k-1;i++)
   for (long j=i+1;j<=k;j++)
   if ((c[i]+c[j])%m==0) return;
   if (res<k)
   {
   res=k;
   for (long i=1;i<=n;i++)
   d[i]=b[i];
   }
}
void ghitep()
{
   thu(1);
   ofstream fo("MODM.out");
   fo<<res<<endl;
   for (long i=1;i<=n;i++)
if (d[i]==1)
   fo<<i<<" ";
   fo.close();
}

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

Code:: #include <bits/stdc++.h>
using namespace std;
void doctep();
void thu(int i);
void xuat();
void ghitep();
long m,n,a[10000],b[10000],c[10000],d[10000],res=0;
int main()
{
doctep();
ghitep();
return 0;
}
void doctep()
{
ifstream fi("FINANCIAL.inp");
fi>>n>>m;
for (long i=1;i<=n;i++)
fi>>a[i];
fi.close();
}
void thu(int i)
{
for (long j=0;j<=1;j++)
{
b[i]=j;
if (i==n) xuat();
else thu(i+1);
}
}
void xuat()
{
long k=0;
for (long i=1;i<=n;i++)
if (b[i]==1)
{
k++;
c[k]=a[i];
}
for (long i=1;i<=k-1;i++)
if (abs(c[i]-c[i+1])<m) return;
if (res<k)
{
res=k;
for (long i=1;i<=k;i++)
d[i]=c[i];
}
}
void ghitep()
{
thu(1);
ofstream fo("FINANCIAL.out");
fo<<res<<endl;
for (long i=1;i<=res;i++)
fo<<d[i]<<" ";
fo.close();
}

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

Code:: #include <bits/stdc++.h>
using namespace std;
void doctep();
void duyet(int i);
long demvlt();
long a[100][100],n,m,u,v,res=0;
void ghitep();
bool fre[100];
int main()
{
   doctep();
   for (long i=1;i<=n;i++)
   fre[i]=true;
   ghitep();
   return 0;
}
void doctep()
{
   ifstream fi("DFSVLT.inp");
   fi>>n>>m;
   for (long i=1;i<=m;i++)
   {
   fi>>u>>v;
   a[u][v]=1;
   a[v][u]=1;
   }
   fi.close();
}
void duyet(int i)
{
   fre[i]=false;
   for (long j=1;j<=n;j++)
   if (fre[j]==true && a[i][j]==1)
   duyet(j);
}
long demvlt()
{
   for (long i=1;i<=n;i++)
   if (fre[i]==true)
   {
   duyet(i);
   res++;
   }
   return res;
}
void ghitep()
{
   ofstream fo("DFSVLT.out");
   fo<<demvlt();
   fo.close();
}

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

Code:: #include <bits/stdc++.h>
using namespace std;
void doctep();
void duyet(int i);
void demvlt();
long a[100][100],n,m,u,v,k=0,c[100];
ofstream fo;
bool fre[100];
int main()
{
doctep();
fo.open("DFSVLT.out");
for (long i=1;i<=n;i++)
fre[i]=true;
demvlt();
fo.close();
return 0;
}
void doctep()
{
ifstream fi("DFSVLT.inp");
fi>>n>>m;
for (long i=1;i<=m;i++)
{
fi>>u>>v;
a[u][v]=1;
a[v][u]=1;
}
fi.close();
}
void duyet(int i)
{
fre[i]=false;
k++;
c[k]=i;
for (long j=1;j<=n;j++)
if (fre[j]==true && a[i][j]==1)
duyet(j);
}
void demvlt()
{
for (long i=1;i<=n;i++)
if (fre[i]==true)
{
duyet(i);
for (long i=1;i<=k;i++)
fo<<c[i]<<" ";
fo<<endl;
k=0;
}
}

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

Code:: #include <bits/stdc++.h>
using namespace std;
void doctep();
void duyet(int i);
void demvlt();
void ghitep();
long a[100][100],n,m,u,v,k,res=0,l,c[100],d[100];
bool fre[100];
int main()
{
doctep();
for (long i=1;i<=n;i++)
fre[i]=true;
demvlt();
ghitep();
return 0;
}
void doctep()
{
ifstream fi("DFSMVLT.inp");
fi>>n>>m;
for (long i=1;i<=m;i++)
{
fi>>u>>v;
a[u][v]=1;
a[v][u]=1;
}
fi.close();
}
void duyet(int i)
{
fre[i]=false;
k++;
c[k]=i;
for (long j=1;j<=n;j++)
if (fre[j]==true && a[i][j]==1)
duyet(j);
}
void demvlt()
{
for (long i=1;i<=n;i++)
if (fre[i]==true)
{
k=0;
duyet(i);
if (res<k)
{
res=k;
for (long x=1;x<=k;x++)
d[x]=c[x];
l=k;
}
}
}
void ghitep()
{
ofstream fo("DFSMVLT.out");
sort(d+1,d+k+1);
fo<<res<<endl;
for (long i=1;i<=l;i++)
fo<<d[i]<<" ";
fo.close();
}

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

Code:: #include <bits/stdc++.h>
using namespace std;
void doctep();
bool kiemtra(long long u);
void xuli();
void ghitep();
ofstream fo;
long long a[100000];
long n;
int main()
{
doctep();
fo.open("SNT.out");
xuli();
fo.close();
return 0;
}
void doctep()
{
ifstream fi("SNT.inp");
fi>>n;
for (int i=1;i<=n;i++)
fi>>a[i];
fi.close();
}
bool kiemtra(long long u)
{
long d=0;
for (long i=1;i<=round(sqrt(u));i++)
if (u%i==0)
{
d++;
if (i!=u/i) d++;
if (d>3) return false;
}
if (d==3) return true;
return false;

}
void xuli()
{
for (long i=1;i<=n;i++)
if (kiemtra(a[i])==true)
fo<<"YES"<<endl;
else fo<<"NO"<<endl;
}

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

Code:: #include <bits/stdc++.h>
#define cst 6000000
using namespace std;
void doctep();
void xuli();
void snt(long u);
void ghitep();
long a[cst],c[cst],n,y=0,d,res=0;
bool f[cst];
ofstream fo;
int main()
{
fo.open("BERTRAN.out");
doctep();
snt(res);
xuli();
fo.close();
return 0;
}
void doctep()
{
ifstream fi("BERTRAN.inp");
while (!fi.eof())
{
y++;
fi>>c[y];
if (c[y]==0) y--;
res=max(res,2*c[y]);
}
fi.close();
}
void snt(long u)
{
for (int i=1;i<=u;i++)
f[i]=true;
f[1]=false;
for (int i=2;i<=round(sqrt(u));i++)
if (f[i]==true)
{
long k=2;
while (i*k<=u)
{
f[i*k]=false;
k++;
}
}
}
void xuli()
{
for (long i=1;i<=y;i++)
{
for (long j=c[i]+1;j<2*c[i];j++)
if (f[j]==true) d++;
fo<<d<<endl;
d=0;
}
}

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

Code:: #include <bits/stdc++.h>
using namespace std;
void doctep();
void sub1();
void sub2();
long long tongcs(long long u);
void ghitep();
long long res=1,n;
int main()
{
doctep();
//sub1();
sub2();
ghitep();
return 0;
}
void doctep()
{
ifstream fi("DIGITS.inp");
fi>>n;
fi.close();
}
long long tongcs(long long u)
{
int s=0;
while (u>0)
{
s+=u%10;
u/=10;
}
return s;
}
void sub1()
{
for (int i=1;i<=n;i++)
res*=i;
}
void sub2()
{
long long tam=0;
for ( long i=1;i<=n;i++)
{
tam=tongcs(i);
res=res*tam;
while (res>=10)
res=tongcs(res);
}
}
void ghitep()
{
ofstream fo("DIGITS.out");
//fo<<tongcs(res);//sub1;
fo<<res;
fo.close();
}

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

Code:: #include <bits/stdc++.h>
#define ll 1000000
using namespace std;
void doctep();
void snt(long u);
void xuli();
bool palin(long u);
void ghitep();
long a[ll],n,res=0;
bool f[ll];
int main()
{
doctep();
snt(n);
xuli();
ghitep();
return 0;
}
void doctep()
{
ifstream fi("CPPR.inp");
fi>>n;
fi.close();
}
void snt(long u)
{
for (long i=1;i<=u;i++)
f[i]=true;
f[1]=false;
for (long i=2;i<=round(sqrt(u));i++)
if (f[i]==true)
{
long k=2;
while (i*k<=u)
{
f[i*k]=false;
k++;
}
}
}
bool palin(long u)
{
long tam=0,v=u;
while (u>0)
{
tam=tam*10+u%10;
u/=10;
}
if (tam==v) return true;
else return false;
}
void xuli()
{
for (long i=1;i<=n;i++)
if (f[i]==true && palin(i)==false)
res++;
}
void ghitep()
{
ofstream fo("CPPR.out");
fo<<res;
fo.close();
}

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

Code:: #include <bits/stdc++.h>
using namespace std;
void doctep();
void xuli();
void uoc(long u);
void ghitep();
long n,a[1000],k=0,c[100];
int main()
{
doctep();
ghitep();
return 0;
}
void doctep()
{
ifstream fi("CSPASS.inp");
fi>>n;
for (int i=1;i<=n;i++)
fi>>a[i];
fi.close();
}
void uoc(long u)
{
for (int i=1;i*i<u;i++)
if (u%i==0)
{
k++;
c[k]=i;//priority_queue;
if (i!=u/i) {
k++;
c[k]=u/i;
}

}
}
void ghitep()
{
ofstream fo("CSPASS.out");
for (int i=1;i<=n;i++)
{uoc(a[i]);
sort(c+1,c+k+1);
for (int i=1;i<=k;i++)
fo<<c[i];
for (int i=1;i<=n;i++)
c[i]=0;
k=0;
fo<<" ";
}
fo.close();
}