From 56fd726302eab4e11560768d0be5b265cd7ccfb7 Mon Sep 17 00:00:00 2001
From: Oliver Lew <oliver_lew@outlook.com>
Date: Tue, 8 May 2018 22:16:31 +0800
Subject: [PATCH] a1019, test point 4 failed

---
 PATAdvanced/1019.c | 75 ++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 75 insertions(+)
 create mode 100644 PATAdvanced/1019.c

diff --git a/PATAdvanced/1019.c b/PATAdvanced/1019.c
new file mode 100644
index 0000000..e7ddf68
--- /dev/null
+++ b/PATAdvanced/1019.c
@@ -0,0 +1,75 @@
+/**
+ * 1019. General Palindromic Number (20)
+ *
+ * A number that will be the same when it is written forwards or backwards is
+ * known as a Palindromic Number. For example, 1234321 is a palindromic number.
+ * All single digit numbers are palindromic numbers.
+ *
+ * Although palindromic numbers are most often considered in the decimal system,
+ * the concept of palindromicity can be applied to the natural numbers in any
+ * numeral system. Consider a number N > 0 in base b >= 2, where it is written
+ * in standard notation with k+1 digits ai as the sum of (aibi) for i from 0 to
+ * k. Here, as usual, 0 <= ai < b for all i and ak is non-zero. Then N is
+ * palindromic if and only if ai = ak-i for all i. Zero is written 0 in any base
+ * and is also palindromic by definition.
+ *
+ * Given any non-negative decimal integer N and a base b, you are supposed to
+ * tell if N is a palindromic number in base b.
+ *
+ * Input Specification:
+ *
+ * Each input file contains one test case. Each case consists of two non-
+ * negative numbers N and b, where 0 <= N <= 109 is the decimal number and
+ * 2 <= b <= 109 is the base. The numbers are separated by a space.
+ *
+ * Output Specification:
+ *
+ * For each test case, first print in one line "Yes" if N is a palindromic
+ * number in base b, or "No" if not. Then in the next line, print N as the
+ * number in base b in the form "ak ak-1 ... a0". Notice that there must be no
+ * extra space at the end of output.
+ * Sample Input 1:
+ *
+ * 27 2
+ *
+ * Sample Output 1:
+ *
+ * Yes
+ * 1 1 0 1 1
+ *
+ * Sample Input 2:
+ *
+ * 121 5
+ *
+ * Sample Output 2:
+ *
+ * No
+ * 4 4 1
+ **/
+
+#include <stdio.h>
+
+int main()
+{
+    int N, b, c, isPalindromicNumber = 1;
+    char b_base[30] = {0};
+
+    scanf("%d %d", &N, &b);
+    /* Actually store the number reversely */
+    for(c = 0; N; N /= b)
+        b_base[c++] = N % b;
+
+    /* Check if it is palindromic number */
+    for(int i = 0; i < c / 2; i++)
+        if(b_base[i] != b_base[c - i - 1])
+            isPalindromicNumber = 0;
+    puts(isPalindromicNumber ? "Yes" : "No");
+
+    if(c == 0)
+        printf("0");
+    /* Reversely printing is the correct order */
+    while(c--)      /* not --c */
+        printf("%d%c", b_base[c], c ? ' ' : '\0');
+
+    return 0;
+}