B21Dccn453 nguyễn duy khánh

aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa dăng ky dăng nhap dang xuat

include <iostream>

using namespace std;

int UCLN(int a, int b)

{

while ( a != b)

{

if (a > b)

a = a - b;

else

b = b - a;

}

return a; // or return b; a = b }

int BCNN(int a, int b)

{

int result = UCLN(a, b);

return a * b / result;

}

int main()

{

int a, b;

cout << "a = ";

cin >> a;

cout << "b = ";

cin >> b;

int result = UCLN(a, b);

cout << "UCLN : "<<result;

cout << "\n";

result = BCNN(a, b);

cout << "BCNN : " << result << endl; system("pause");

Bài 2

#include<bits/stdc++.h>

using namespace std;

int main (){

int t;

cin>>t;

while(t ){

string s;

if(s[0]==s[n-1]) cout<<"YES"<<endl; else cout<<"NO"<<endl;

}

}

Bai 3

#include <iostream>

using namespace std;

bool checkDoiXung(int n, int A[]){

for(int i = 0;i<n/2;i++){

if(A[i] != A[n-i-1]) return false;

}

return true;

}

int main()

{

int n;

cout<<"Nhap so phan tu: ";

cin>>n;

int A[n];

int i;

for(i = 0; i<n;i++){

cout<<"A["<<n<<"] = ";

cin>>A[i];

}

cout<<"\nMang vua nhap:\n";

for(i = 0; i<n;i++){

cout<<A[i]<<" ";

}

if(checkDoiXung(n, A)) cout<<”YES”<<endl; else cout<<”NO”<<endl;

Bai 4

#include <iostream>

#include <cmath>

using namespace std;

/**

* Phan tich so nguyen n thanh tich cac thua so nguyen to */

void phanTichSoNguyen(int n) {

int i = 2;

int dem = 0;

int a[100];

// phan tich

while (n > 1) {

if (n % i == 0) {

n = n / i;

a[dem++] = i;

} else {

i++;

}

}

// neu dem = 0 thi n la nguyen to

if (dem == 0) {

a[dem++] = n;

}

// in ket qua ra man hinh

for (i = 0; i < dem - 1; i++) {

printf("%d x ", a[i]);

}

printf("%d", a[dem - 1]);

}

/**

* Ham main

*/

int main() {

int n;

cout << "Nhap so nguyen duong n = ";

cin >> n;

// phan tich so nguyen duong n

phanTichSoNguyen(n);

}

Bai 5

using namespace std;

int main (){

string s;

cin>>s;

if(s[0]-'0'+s[4]-'0'==s[9]-'0') cout<<"YES"<<endl; else cout<<"NO"<<endl;

}

Bai 6

#include<bits/stdc++.h>

using namespace std;

int snt(int n){

if(n < 2) return 0;

for(int i = 2 ; i <= sqrt(n) ; i++){

if(n % i == 0) return 0; }

return 1;

}

int tang(int i){

while(i){

int x = i%10;

int y = (i/10)%10; if(y >= x) return 0; i/=10;

}

return 1;

}

int giam(int k){

while(k>9){

int x = k%10;

int y = (k/10)%10; if(y <= x) return 0; k/=10;

}

return 1;

}

int main(){

int t; cin>>t;

while(t ){

int n;

cin>>n;

int tmp = n;

int l , r =1;

while(tmp){

r *= 10;

tmp ;

if(tmp == 1) l = r; }

int cnt= 0;

for(int i = l ; i< r;i++){

if(tang(i)|| giam(i)){

if(snt(i)) cnt++; }

} cout<<cnt<<endl;

}

}

Bai 7

#include <bits/stdc++.h>

using namespace std;

void chuyendoi(string &x){

x[0] = toupper(x[0]);

for(int i = 1; i < x.length(); i++){

x[i] = tolower(x[i]);

}

}

int main (){

string s;

getline(cin ,s);

for(char &x : s) x = toupper(x); stringstream ss(s);

string tmp ;

vector<string > v;

while( ss >> tmp){

v.push_back(tmp);

}

for(int i = 0 ; i< v.size()-1;i++){ chuyendoi(v[i]);

cout<<v[i];

if( i != v.size()-2) cout<<" "; else cout<<", ";

}

cout << v.back() << endl;

}

Bai 8

#include<bits/stdc++.h>

using namespace std;

string chuanhoa(string s){

for(int i = 0 ; i < s.size() ; i++){

s[i] = tolower(s[i]);

}

s[0]=toupper(s[0]);

return s;

}

int main(){

int t; cin>>t;

while(t ){

int n ; cin>>n;

cin.ignore();

string s ; getline(cin , s);

vector< string> v;

stringstream ss(s);

string tmp;

while(ss >> tmp){

v.push_back(tmp);

} for(int i = 0 ; i < v.size(); i++){

v[i] = chuanhoa(v[i]);

} if(n==1){

cout<<v[v.size()-1]<<" "; for(int i = 0 ; i < v.size()-1;i++){

cout<<v[i]<<" "; }

} if(n==2){

for(int i = 1 ; i < v.size();i++){

cout<<v[i]<<" "; }

cout<<v[0];

} cout<<endl;

}

}

Bai 10

#include<bits/stdc++.h>

using namespace std;

int main(){

int t; cin>>t;

while(t ){

int n;

cin>>n;

int dem =0;

int t;

for(int i = 1; i< sqrt(n);i++){

if(n%i==0){

t=n/i;

if(i%2==0 && t %2==0) dem+=2; if(i%2!=0 && t %2==0) dem+=1; if(i%2==0 && t %2!=0) dem+=1; }

} int d;

if((int)(sqrt(n))== sqrt(n)){

d=sqrt(n);

if(d%2 ==0 ) dem++;

} cout<<dem<<endl;

}

}