San Song Daddy :)

For the appeal we make does not spring from error or impure motives, nor are we trying to trick you.  (1 Thessalonians 2:3 NIV) 我们的劝勉不是出于错误，不是出于污秽，也不是用诡诈。  (帖撒罗尼迦前书 2:3 和合本) On the contrary, we speak as those approved by God to be entrusted with the gospel. We are not trying to please people but God, who tests our hearts.  (1 Thessalonians 2:4 NIV) 但　神既然验中了我们，把福音托付我们，我们就照样讲，不是要讨人喜欢，乃是要讨那察验我们心的　神喜欢。  (帖撒罗尼迦前书 2:4 和合本)

knapsack problem Question: give two integer n and m, select rand numbers from 1,2,3,...,n-1, n,  let the sum of the combination is equal to  m. print out all possible combinations. Examples: n = 8 m = 10 8 2 7 3 7 2 1 6 4 6 3 1 5 4 1 5 3 2 4 3 2 1 Answer: #include <iostream> #include <vector> using namespace std; void printNumbersWithSum(int n, int m, vector<int>& numbers) {   if (m <= 0 || n <= 0)     return;   if (m == n) {     for (int number : numbers)       cout << number << " ";     cout << n << endl;   }   numbers.push_back(n);   printNumbersWithSum(n-1, m - n, numbers);   numbers.pop_back();   printNumbersWithSum(n-1, m, numbers); } int main() {   vector<int> numbers;   int n, m;   cin >> n >> m;   printNumbersWithSum(n, m, numbers);   return 0; }

First please refer to : https://docs.ghost.org/v1.0.0/docs/mail-config As you may know, Google Cloud Platform doesn't allow outbound connection to ports 25, 465 and 587. https://cloud.google.com/compute/docs/tutorials/sending-mail/ So you just change port of MailGun to other port such as 2525, it will work. "mail": { "transport": "SMTP", "options": { "service": "Mailgun", "port": 2525, "auth": { "user": "yourname", "pass": "yourpasswd" } } }, When you have finished making changes to you config file don't forget to restart Ghost. ( ghost stop ghost start )

Refers: https://docs.ghost.org/docs/working-with-ghost

God saw all that he had made, and it was very good. And there was evening, and there was morning—the sixth day. (Genesis 1:31 NIV) 　神看着一切所造的都甚好。有晚上，有早晨，是第六日。 (创世记 1:31 和合本)

Question: Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its area. Example For example, given the following matrix: 1 0 1 0 0 1 0 1 1 1 1 1 1 1 1 1 0 0 1 0 Return 4 . Answer: #include <cstdlib> #include <ctime> #include <iostream> #include <vector> using namespace std; int maxSquarea(vector<vector<int> >& matrix) {   int m = matrix.size();   int n = matrix[0].size();   vector<vector<int> >  matrix_flag = matrix;   int r = 0;   for (int i = 0; i < m; i++)     for (int j = 0; j < n; j++)       matrix_flag[i][j] = 0;   for (int i = 0; i < m; i++) {     for (int j = 0; j < n; j++) {       if (matrix[i][j] == 0)         continue;       if (matrix_flag[i][j] == 1)         continue;       int k = 1;       while (1) {         bool all1 = true;         int ii = i + k;         int jj;         for (jj = 0; jj <= k && ii < m && j+jj

#include <cstdlib> #include <iostream> #include <ctime> using namespace std; /* 0~9, a~z, A~z */ void randstring(int n, char* s) {   int fn = rand() % n;   if (fn <= n/2)     fn = (n+1) / 2;   for (int i = 0; i < fn; i++) {     int t = rand() % 3;     char c;     if (t == 0)       s[i] = '0' + (rand()%10);     else if (t == 1)       s[i] = 'a' + (rand()%26);     else       s[i] = 'A' + (rand()%26);   }   for (int i = fn; i < n; i++) {     s[i] = s[rand()%fn];   } } int main() {   srand(time(0));   int n = 20;   char* s = new char[n+1];   s[n] = '\0';   randstring(n, s);   cout << s << endl;   int n2 = (n+1)*2 + 1;   char* ns = new char[n2];   ns[0] = '$';   ns[1] = '#';   int j;   int i;   for (i = 0, j = 2; i < n; i++) {     ns[j] = s[i];     ns[++j] = '#';     j++;   }   ns[j] = '#';   ns[n2-1] = '\0';   cout << ns << endl;   int* p = new int[n2];   for (i = 0