Lê Thị Thanh Nhàn

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

day5bai2,3: em thấy b2,3 giống nhau

Code:: #include <bits/stdc++.h>
using namespace std;
int a[301][301],m,n;
bool kt[10001];
void sang(int n)
{
kt[1]=false;
for(int i=2;i<=n;i++)
{
kt[i]=true;
}
for(int i=2;i*i<=n;i++)
{
if(kt[i])
{
for(int j=2;i*j<=n;j++)
{
kt[i*j]=false;
}
}
}
}
int main()
{
sang(10000);
cin>>m>>n;
for(int i=1;i<=m;i++)
{
for(int j=1;j<=n;j++)
{
cin>>a[i][j];
}
}
int d=0;
for(int i=1;i<=m;i++)
{
for(int j=1;j<=n;j++)
{
if(kt[a[i][j]])
{
cout<<i<<" "<<j<<endl;
d=1;
}
}
}
if(d==0)cout<<-1;
return 0;
}

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

cb:day4b4subtask1:

Code:: #include <bits/stdc++.h>
using namespace std;
int main()
{
   int n;
   cin>>n;
   int q=0;
   int a[100];
   int i=2;
   while (n>1)
   {
   while(n%i==0)
   {
   q++;
   a[q]=i;
   n/=i;
   }
   i++;
   }
   for(int i=1;i<=q;i++)
   {
   cout<<a[i]<<" ";
   }
   return 0;
}

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

cb:day4bai4subtask2:

Code:: #include <bits/stdc++.h>
using namespace std;
int a[100];
int q=0;
int n;
void phantich(int u)
{
   int i=2;
   while (i*i<=u)
   {
   if(u%i==0)
   {
   q++;
   a[q]=i;
   u/=i;
   }
   else i++;
   }
   if(u>1)
   {
   q++;
   a[q]=u;
   }
}
int main()
{
   cin>>n;
   phantich(n);
   for(int i=1;i<=q;i++)
   {
   cout<<a[i]<<" ";
   }
   return 0;
}

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

cbday4bai5:

Code:: #include <bits/stdc++.h>
using namespace std;
int p;
bool kt(int u)
{
if(u<=1) return false;
for(int i=2;i*i<=u;i++)
{
if(u%i==0)
{
return false;
}
}
return true;
}
int main()
{
cin>>p;
int i=p+1;
while(kt(i)==false)
{
i++;
}
cout<<i;
return 0;
}

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

cb:mr1:

Code:: #include <bits/stdc++.h>
using namespace std;
int p;
bool kt(int u)
{
if(u<=1) return false;
for(int i=2;i*i<=u;i++)
{
if(u%i==0)
{
return false;
}
}
return true;
}
int main()
{
cin>>p;
int i=p-1;
while(kt(i)==false)
{
i--;
}
cout<<i;
return 0;
}

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

cb:day4bai6:

Code:: #include <bits/stdc++.h>
using namespace std;
int n;
bool kt(int u)
{
if(u<=1) return false;
for(int i=2;i*i<=u;i++)
{
if(u%i==0)
{
return false;
}
}
return true;
}
int main()
{
cin>>n;
while(n!=0)
{
n=n/10;
if(kt(n))
{
cout<<n;
return 0;
}
else n=n/10;
}
cout<<"NONE";
return 0;
}

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

cb:day4bai7:

Code:: #include <bits/stdc++.h>
using namespace std;
int n,a[100],q=0;
void phantich(int u)
{
int i=2;
while (i*i<=u)
{
if(u%i==0)
{
q++;
a[q]=i;
u/=i;
}
else i++;
}
if(u>1)
{
q++;
a[q]=u;
}
}
int main()
{
cin>>n;
phantich(n);
cout<<a[q];
return 0;
}

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

day9/12:
arr2hvs1:
subtask1:

Code:: #include <bits/stdc++.h>
using namespace std;
int a[102][102];
int s,m,n,t,lmin,lmax;
int main()
{
cin>>m>>n>>s;
for(int i=1;i<=m;i++)
{
for(int j=1;j<=n;j++)
{
cin>>a[i][j];
}
}
for(int i=1;i<=m;i++)
{
for(int j=1;j<=n;j++)
{
lmin=0;
lmax=min((m-i),(n-j));
while(lmin<=lmax)
{
t=0;
for(int u=i;u<=i+lmin;u++)
for(int v=j;v<=j+lmin;v++)
t+=a[u][v];
if(t==s) cout<<i<<" "<<j<<" "<<lmin+1<<endl;
lmin++;
}
}
}
return 0;
}

subtask2:

Code:: #include <bits/stdc++.h>
using namespace std;
int a[102][102], s[102][102];
int ss,m,n;
int main()
{
cin>>m>>n>>ss;
for(int i=1;i<=m;i++)
{
for(int j=1;j<=n;j++)
{
cin>>a[i][j];
}
}
s[0][0]=0;
for(int i=1;i<=m;i++)
for(int j=1;j<=n;j++)
{
s[i][j] = s[i][j-1] + s[i-1][j] - s[i-1][j-1] + a[i][j];
}
int kmax=min(m,n);
for(int k=kmax;k>=1;k--)
for(int i=1;i<=m-k+1;i++)
for(int j=1;j<=n-k+1;j++)
{
int p=s[i+k-1][j+k-1]-s[i+k-1][j-1]-s[i-1][j+k-1]+a[i-1][j-1];
if(p==ss) cout<<i<<" "<<j<<" "<<k<<endl;
}
return 0;
}

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

day9/12:
arr2hvs1:

Code:: #include <bits/stdc++.h>
using namespace std;
int a[102][102], s[102][102];
int ss,m,n;
int main()
{
cin>>m>>n>>ss;
for(int i=1;i<=m;i++)
{
for(int j=1;j<=n;j++)
{
cin>>a[i][j];
}
}
s[0][0]=0;
for(int i=1;i<=m;i++)
for(int j=1;j<=n;j++)
{
s[i][j] = s[i][j-1] + s[i-1][j] - s[i-1][j-1] + a[i][j];
}
int kmax=min(m,n);
for(int k=kmax;k>=1;k--)
for(int i=1;i<=m-k+1;i++)
for(int j=1;j<=n-k+1;j++)
{
int p=s[i+k-1][j+k-1]-s[i+k-1][j-1]-s[i-1][j+k-1]+a[i-1][j-1];
if(p==ss)
{
cout<<k;
return 0;
}

}
return 0;
}

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

day5bai2:
sub1:

Code:: #include <bits/stdc++.h>
using namespace std;
int a[1000][1000],m,n;
bool ngto(int u)
{
if(u<=1)return false;
for(int i=2;i*i<=u;i++)
if(u%i==0)return false;
return true;
}
int main()
{
freopen("Bai2.INP","r",stdin);
freopen("Bai2.OUT","w",stdout);
int p=0;
cin>>m>>n;
for(int i=1;i<=m;i++)
for(int j=1;j<=n;j++)
cin>>a[i][j];
for(int i=1;i<=m;i++)
for(int j=1;j<=n;j++)
if(ngto(a[i][j]))
{
cout<<i<<" "<<j<<endl;
p=1;
}
if(p==0) cout<<-1;
return 0;
}

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

day2,baif3,sub2:

Code:: #include <bits/stdc++.h>
using namespace std;
int a[301][301],m,n;
bool kt[10001];
void sang(int n)
{
kt[1]=false;
for(int i=2;i<=n;i++)
{
kt[i]=true;
}
for(int i=2;i*i<=n;i++)
{
if(kt[i])
{
for(int j=2;i*j<=n;j++)
{
kt[i*j]=false;
}
}
}
}
int main()
{
int rmax=0;

cin>>m>>n;
for(int i=1;i<=m;i++)
{
for(int j=1;j<=n;j++)
{
cin>>a[i][j];
rmax=max(rmax,a[i][j]);
}
}
sang(rmax);
int d=0;
for(int i=1;i<=m;i++)
{
for(int j=1;j<=n;j++)
{
if(kt[a[i][j]])
{
cout<<i<<" "<<j<<endl;
d=1;
}
}
}
if(d==0)cout<<-1;
return 0;
}

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

qhd1:

Code:: #include <bits/stdc++.h>
using namespace std;
int p,a[100000],n,u[100000],v[100000];
long long s[100000],kq[100000];
int main()
{
s[0]=0;
cin>>n>>p;
for(int i=1;i<=n;i++)
{
cin>>a[i];
s[i]=s[i-1]+a[i];
}
for(int i=1;i<=p;i++)
{
cin>>u[i]>>v[i];
kq[i]=s[v[i]]-s[u[i]-1];
}
for(int i=1;i<=p;i++)
{
cout<<kq[i]<<endl;
}
return 0;
}

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

qhd3:
sub2:

Code:: #include <bits/stdc++.h>
using namespace std;
int p,a[100000],n,u[100000],v[100000];
long long s[100000];
bool ngto(int u)
{
if(u<=1) return false;
for(int i=2;i*i<=u;i++)
{
if(u%i==0)return false;
}
return true;
}
int main()
{
long long rmax=0;
s[0]=0;
cin>>n>>p;
for(int i=1;i<=n;i++)
{
cin>>a[i];
s[i]=s[i-1]+a[i];
}
for(int i=1;i<=p;i++)
{
cin>>u[i]>>v[i];
int q=s[v[i]]-s[u[i]-1];
if(ngto(q))
{
if(q>rmax)
{
rmax=q;
}
}
}
cout<<rmax;
return 0;
}

sub3:

Code:: #include <bits/stdc++.h>
const int N=1e5;
using namespace std;
int p,a[N],n,u[N],v[N];
long long s[N],q[N];
bool f[N];
void sang(long long u)
{
f[1]=false;
f[0]=false;
for(int i=2;i<=u;i++) f[i]=true;
for(int i=2;i*i<=u;i++)
if(f[i])
{
for(int j=2;j*i<=u;j++)
f[i*j]=false;
}
}
int main()
{
long long qmax=0;
int amax=0;
s[0]=0;
cin>>n>>p;
for(int i=1;i<=n;i++)
{
cin>>a[i];
s[i]=s[i-1]+a[i];
amax=max(amax,a[i]);
}
for(int i=1;i<=p;i++)
{
cin>>u[i]>>v[i];
q[i]=s[v[i]]-s[u[i]-1];
if(q[i]>qmax)
{
qmax=q[i];
}
}
sang(qmax);
long long res=0;
for(int i=1;i<=p;i++)
if(f[q[i]])
if(res<q[i])
res=q[i];
cout<<res;
return 0;
}

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

qhd4:

Code:: #include <bits/stdc++.h>
using namespace std;
int p,a[100000],n,u[100000],v[100000];
long long s[100000],kq[100000];
int k;
bool phantich(long long u,int k)
{
int res=0;
for(int i=1;i*i<=u;i++)
{
if(u%i==0) res+=2;
if(i*i==u)res--;
}
if(res==k) return true;
else return false;
}
int main()
{
s[0]=0;
cin>>n>>p>>k;
for(int i=1;i<=n;i++)
{
cin>>a[i];
s[i]=s[i-1]+a[i];
}

for(int i=1;i<=p;i++)
{
cin>>u[i]>>v[i];

}
for(int i=1;i<=p;i++)
{
kq[i]=s[v[i]]-s[u[i]-1];
if(phantich(kq[i],k))
cout<<kq[i]<<endl;
}
return 0;
}

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

qhd5:

Code:: #include <bits/stdc++.h>
using namespace std;
int p,a[100000],n,u[100000],v[100000];
long long s[100000],kq[100000];
int k;
bool phantich(long long u)
{
int b[10];
int i=0;
while(u>0)
{
i++;
b[i]=u%10;
u=u/10;
}
int j=1;
while(j<=i)
{
if(b[i]!=b[j]) return false;
i--;j++;
}
return true;
}
int main()
{
s[0]=0;
cin>>n>>p>>k;
for(int i=1;i<=n;i++)
{
cin>>a[i];
s[i]=s[i-1]+a[i];
}

for(int i=1;i<=p;i++)
{
cin>>u[i]>>v[i];

}
for(int i=1;i<=p;i++)
{
kq[i]=s[v[i]]-s[u[i]-1];
if(phantich(kq[i]))
cout<<kq[i]<<endl;
}
return 0;
}

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

qhd6:

Code:: #include <bits/stdc++.h>
using namespace std;
int p,a[100000],n,u[100000],v[100000];
long long s[100000],kq[100000];
bool phantich(long long u)
{
int i=0;
while(i*i<u)
{
i++;
}
if(i*i==u) return true;
else return false;
}

int main()
{
s[0]=0;
cin>>n>>p;
for(int i=1;i<=n;i++)
{
cin>>a[i];
s[i]=s[i-1]+a[i];
}
for(int i=1;i<=p;i++)
{
cin>>u[i]>>v[i];
kq[i]=s[v[i]]-s[u[i]-1];
}
for(int i=1;i<=p;i++)
if(phantich(kq[i]))
cout<<kq[i]<<endl;
return 0;
}

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

qhd7:

Code:: #include <bits/stdc++.h>
using namespace std;
int a[100000],n;
long long s[100000],kq[1000][1000],da[100000];
bool phantich(long long u)
{
int i=0;
while(i*i<u)
{
i++;
}
if(i*i==u) return true;
else return false;
}

int main()
{
s[0]=0;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
s[i]=s[i-1]+a[i];
}
int res=0;
for(int i=1;i<=n;i++)
for(int j=i;j<=n;j++)
{
kq[i][j]=s[j]-s[i-1];
if(phantich(kq[i][j]))
{
res++;
da[res]=kq[i][j];
}
}
for(int i=1;i<=res;i++)
cout<<da[i]<<" ";
return 0;
}

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

qhd8:

Code:: #include <bits/stdc++.h>
using namespace std;
int a[100000],n;
long long s[100000],kq[1000][1000];
bool ngto(int u)
{
if(u<=1) return false;
for(int i=2;i*i<=u;i++)
{
if(u%i==0)return false;
}
return true;
}

int main()
{
s[0]=0;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
s[i]=s[i-1]+a[i];
}
long long da=-1;
for(int i=1;i<=n;i++)
for(int j=i;j<=n;j++)
{
kq[i][j]=s[j]-s[i-1];
if(ngto(kq[i][j]))
{
if(da<kq[i][j])
da=kq[i][j];
}
}
cout<<da;
return 0;
}

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

qhd9:

Code:: #include <bits/stdc++.h>
using namespace std;
int a[100000],s[100000],n,k,d,kq=0;
int main()
{
s[0]=0;
cin>>n>>k;
for(int i=1;i<=n;i++)
{
cin>>a[i];
s[i]=s[i-1]+a[i];
}
for(int l=n;l>=1;l--)
for(int i=1;i<=n-l+1;i++)
{
int j=i+l-1;
d=s[j]-s[i-1];
if(d%k==0)
{
cout<<l;
return 0;
}
}
return 0;
}

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

ARR2HVS1:

Code:: #include <bits/stdc++.h>
using namespace std;
int a[102][102], s[102][102];
int ss,m,n;
int main()
{
cin>>m>>n>>ss;
for(int i=1;i<=m;i++)
{
for(int j=1;j<=n;j++)
{
cin>>a[i][j];
}
}
s[0][0]=0;
for(int i=1;i<=m;i++)
for(int j=1;j<=n;j++)
{
s[i][j] = s[i][j-1] + s[i-1][j] - s[i-1][j-1] + a[i][j];
}
int res=0;
int kmax=min(m,n);
for(int k=kmax;k>=1;k--)
for(int i=1;i<=m-k+1;i++)
for(int j=1;j<=n-k+1;j++)
{
int p=s[i+k-1][j+k-1]-s[i+k-1][j-1]-s[i+1][j+k-1]+a[i-1][j-1];
if(p==ss)
{
cout<<i<<" "<<j<<" "<<k<<endl;
res=1;
}
}
if(res==0)cout<<-1;
return 0;
}

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

ARR2HCN1:

Code:: #include <bits/stdc++.h>
using namespace std;
int a[102][102], s[102][102];
int ss,m,n;
int main()
{
freopen("ARR2HCN1.INP","r",stdin);
freopen("ARR2HCN1.OUT","w",stdout);
cin>>m>>n>>ss;
s[0][0]=0;
for(int i=1;i<=m;i++)
{
for(int j=1;j<=n;j++)
{
cin>>a[i][j];
s[i][j] = s[i][j-1] + s[i-1][j] - s[i-1][j-1] + a[i][j];
}
}
int res=0;
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++)
{
int p=s[x2][y2]-s[x1-1][y2]-s[x2][y1-1]+s[x1-1][y1-1];
if(p==ss)
{
cout<<x1<<" "<<y1<<" "<<x2<<" "<<y2<<endl;
res=1;
}
}
if(res==0)cout<<-1;
return 0;
}

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

ARR2HCN2:
subtask1:

Code:: #include <bits/stdc++.h>
using namespace std;
int a[102][102], s[102][102];
int k,m,n;
int main()
{
   freopen("ARR2HCN2.INP","r",stdin);
   freopen("ARR2HCN2.OUT","w",stdout);
   cin>>m>>n>>k;
   s[0][0]=0;
   for(int i=1;i<=m;i++)
   {
   for(int j=1;j<=n;j++)
   {
   cin>>a[i][j];
   s[i][j] = s[i][j-1] + s[i-1][j] - s[i-1][j-1] + a[i][j];
   }
   }
   int res=0;
   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++)
   {
   int p=s[x2][y2]-s[x1-1][y2]-s[x2][y1-1]+s[x1-1][y1-1];
   if(p%k==0)
   {
   res++;
   }
   }
   cout<<res;
   return 0;
}

subtask2:

Code:: #include <bits/stdc++.h>
using namespace std;
int a[102][102], s[102][102];
int k,m,n;
int main()
{
   freopen("ARR2HCN2.INP","r",stdin);
   freopen("ARR2HCN2.OUT","w",stdout);
   cin>>m>>n>>k;
   s[0][0]=0;
   int x;
   for(int i=1;i<=m;i++)
   {
   for(int j=1;j<=n;j++)
   {
   cin>>x;
   a[i][j]=x/k;
   s[i][j] = s[i][j-1] + s[i-1][j] - s[i-1][j-1] + a[i][j];
   }
   }
   int res=0;
   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++)
   {
   int p=s[x2][y2]-s[x1-1][y2]-s[x2][y1-1]+s[x1-1][y1-1];
   if(p%k==0)
   {
   res++;
   }
   }
   cout<<res;
   return 0;
}

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

ARR2REC1:

Code:: #include <bits/stdc++.h>
using namespace std;
int a[102][102], s[102][102];
int m,n,kq=0;
int main()
{
freopen("ARR2REC1.INP","r",stdin);
freopen("ARR2REC1.OUT","w",stdout);
cin>>m>>n;
s[0][0]=0;
for(int i=1;i<=m;i++)
{
for(int j=1;j<=n;j++)
{
cin>>a[i][j];
s[i][j] = s[i][j-1] + s[i-1][j] - s[i-1][j-1] + a[i][j];
}
}
int res=0;
for(int x1=1;x1<=m;x1++)
for(int y1=1;y1<=n;y1++)
for(int x2=m;x2>=x1;x2--)
for(int y2=n;y2>=y1;y2--)
{
int p=s[x2][y2]-s[x1-1][y2]-s[x2][y1-1]+s[x1-1][y1-1];
int d=x2-x1+1;
int r=y2-x1+1;
if(d*r==p)
{
cout<<p;
return 0;
}
}
cout<<kq;
if(res==0)cout<<-1;
return 0;
}

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

ARR2REC1:

Code:: #include <bits/stdc++.h>
using namespace std;
int a[102][102], s[102][102];
int m,n,kq=0;
int main()
{
   freopen("ARR2REC1.INP","r",stdin);
   freopen("ARR2REC1.OUT","w",stdout);
   cin>>m>>n;
   s[0][0]=0;
   for(int i=1;i<=m;i++)
   {
   for(int j=1;j<=n;j++)
   {
   cin>>a[i][j];
   s[i][j] = s[i][j-1] + s[i-1][j] - s[i-1][j-1] + a[i][j];
   }
   }
   int res=0;
   for(int x1=1;x1<=m;x1++)
   for(int y1=1;y1<=n;y1++)
   for(int x2=m;x2>=x1;x2--)
   for(int y2=n;y2>=y1;y2--)
   {
   int p=s[x2][y2]-s[x1-1][y2]-s[x2][y1-1]+s[x1-1][y1-1];
   int d=x2-x1+1;
   int r=y2-x1+1;
   if(d*r==p)
   {
   cout<<p;
   return 0;
   }
   }
   cout<<kq;
   if(res==0)cout<<-1;
   return 0;
}

Tiêu đề: Re: Lê Thị Thanh Nhàn Tue Dec 13, 2022 4:52 pm

"int d=x2-x1+1;
int r=y2-x1+1;"

sửa thành
int d=x2-x1+1;
int r=y2-y1+1;

» Lê Thị Thanh Nhàn
» Nguyễn Thanh Hải
» Đỗ Thị Thanh Tâm - CVA
» KTLT4. Thành luỹ
» Nguyễn Thanh Tú