//b1
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,i;
cin>>n;
int a[n];
for(i=0;i<n;i++){
cin>>a[i];
}
int ma=a[0];
int mi=a[0];
for(i=0;i<n;i++){
if(a[i]>ma) ma=a[i];
if(a[i]<mi) mi=a[i];
}
cout<<ma<<endl<<mi;
return 0;
}
//b2
#include <bits/stdc++.h>
using namespace std;
const max=100;
int main()
{
int n,i,sc=0,sl=0,a[max];
cin>>n;
for(i=0;i<=n;i++){
do{ cin>>a[i];}
while(a[i]<=0);
}
for(i=0;i<=n;i++){
if(a[i]%2==0) {sc+=a[i];}
else {sl+=a[i];}
}
int hieu=sc-sl;
cout<<sc<<" "<<sl<<" "<<hieu;
return 0;
}
//b4
c1:
#include <bits/stdc++.h>
using namespace std;
bool laSoNguyenTo(int n) {
if (n <= 1) return false;
for (int i = 2; i <= sqrt(n); ++i) {
if (n % i == 0) {
return false;
}
}
return true;
}
int main() {
int n;
cin >> n;
int A[n];
for (int i = 0; i < n; ++i) {
cin >> A[i];
}
for (int i = 0; i < n; ++i) {
if (laSoNguyenTo(A[i])) {
cout << A[i] << " ";
}
}
cout << endl;
return 0;
}
c2:
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,i,a[100];
cin>>n;
for( i=0;i<n;i++)
{ cin>>a[i];}
int dem =0,ok;
for(int i=0;i<n;i++){
ok=1;
for(int j=2;j<=sqrt(a[i]);j++){//ktra so n co ph la snt hay ko
if(a[i]%j==0){ ok=0;break;}
if(a[i]<=1){ok=0;}
if(ok==1) {cout<<a[i]<<" ";
dem++;}
}
}
cout<<endl<<dem;
return 0;
}
//b3
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,i,s=0;
cin>>n;
int a[n];
for( i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++)
if(i%2!=0 && a[i]%2==0) s+=a[i];
cout<<s;
return 0;}
//b5
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,i,a[100],dem=0,k;
cin>>n>>k;
for( i=0;i<n;i++)
{ cin>>a[i];
while(a[i]>0){
if(a[i]%10==k) dem++;
a[i]/=10;
}}
cout<<dem;
return 0;
}
b6:
Nhap vao so n nguyen dg ktra xem n co ph la so hoan hao hay khong?
shh la so co tong cac uoc =2 lan chinh no.
vd: n=6 co uoc 1+2+3+6=2*6;
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,s=0;
cin>> n;
for(int i=1;i<=n;i++){
if(n%i==0) {s+=i;}}
if(s=n) cout<< "shh";
else cout<<"khong hoan hao";
return 0;
}
//b7: nhap so n va mang a[n] ftu dem va in ra cac so hoan hao cua mang
#include <bits/stdc++.h>
#define faster ios_base::sync_with_stdio(0);[Link](0);[Link](0);
using namespace std;
int n,t,a[100005];
int main()
{
faster;
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
{
for(int j=1;j<a[i];j++)
if(a[i]%j==0) t+=j;
if(t==a[i]) cout<<a[i];
t=0;
}
return 0;
}
b8:nhap so n, mang a[n] ftu va so x tim va in ra vi tri xuat hien dau tien cua x.
khong tim thx in ra 0
#include <bits/stdc++.h>
#define faster ios_base::sync_with_stdio(0);[Link](0);[Link](0);
using namespace std;
int n,x,a[100005];
int main()
{
faster;
cin>>n>>x;
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
{
if(a[i]==x)
{cout<<i;
return 0;
}
}
return 0;
}
//b9:nhap so n va mang a[n] ftu nhap so k dem xem mang co bn cap so co tong =k
CACH 1:
#include <bits/stdc++.h>
#define faster ios_base::sync_with_stdio(0);[Link](0);[Link](0);
using namespace std;
int dem,n,k,a[100005];
int main()
{
faster;
cin>>n>>k;
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
if(a[i]+a[j]==k) dem++;
}
}
cout<<dem/2;
return 0;
}
CACH 2:
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a[100],k,i,j,dem=0;
cin>>n>>k;
for(i=0;i<=n-2;i++){cin>>a[i];}
for(i=0;i<n;i++){
for(j=i+1;j<=n-1;j++){
if(a[i]+a[j]==k) dem++;
}}
cout<<endl<<dem;
return 0;
}
//10:nhap so n va mang a[n] ftu tim max min cua mang in ra vi tri xuat hien dau
tien cua max va vi tri xuat hien cuoi cung cua min
#include <bits/stdc++.h>
#define faster ios_base::sync_with_stdio(0);[Link](0);[Link](0);
using namespace std;
int n,ln=-1e+9,nn=1e+9;
int a[100005];
int main()
{
faster;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i];
ln=max(ln,a[i]);
nn=min(nn,a[i]);
}
for(int i=0;i<n;i++)
{
if(a[i]==ln)
{cout<<ln<<" "<<i;
break;
}
}
for(int i=n-1;i>=0;i--)
{
if(a[i]==nn)
{cout<<endl<<nn<<" "<<i;
break;
}
}
return 0;
}
