Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- int CheckDauCuoi(long long n){
- long long a, b=n, i=0;
- while(n>0){
- a = n % 10;
- n = n / 10;
- }
- long long dau = a;
- long long cuoi = b % 10;
- if(dau == 2*cuoi || cuoi == 2* dau){
- return 1;
- } else {
- return 0;
- }
- }
- int SoChuSo(long long n){
- int a = 0;
- while(n>=10){
- n = n/10;
- a++;
- }
- return a;
- }
- long long BoDauCuoi(long long n){
- long long a;
- long long d = n;
- while(d >0){
- a = d % 10;
- d = d / 10;
- }
- long long g = n % 10;
- long long e = pow(10,SoChuSo(n));
- long long f = ((n - (a*e))-g)/10;
- return f;
- }
- int STN(long long x){
- long long n = BoDauCuoi(x);
- int a[20];
- int dem = 0, i;
- do {
- a[dem++] = (n % 10);
- n = n / 10;
- } while (n>0);
- for (i = 0; i<(dem/2); i++){
- if(a[i] != a[(dem - i -1)]){
- return 0;
- }
- }
- return 1;
- }
- int main(){
- int t;
- scanf("%d", &t);
- while(t--){
- long long n;
- scanf("%lld", &n);
- if(CheckDauCuoi(n)==1&&STN(n)==1){
- printf("YES");
- } else {
- printf("NO");
- }
- printf("\n");
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement