Problem-Set | Sample Program in using console in C

When creating a workflow using Sharepoint Designer (linked to a form library) none of my fields from my form show up when I use actions like "set field in current item" or "update list item". The only two fields that show are

"Title" "Name (for use in forms)"

I have already tried to upload the form as a site content type but was still not able to get the items on my form (using the solution posted here https://social.msdn.microsoft.com/Forums/lync/en-US/37db5742-79ba-49cb-bda5-69172786a339/spd-field-lookup-problem-set-field-in-current-item?forum=sharepointcustomizationlegacy)

please help me ,this problem is hurting my brain :'(

I'm following an online course in which one of the assignments is to implement a dynamic programming algorithm to solve the Traveling Salesman Problem (TSP). My Python implementation works for small cases (~5 cities), but for the 'real' application of 25 cities it seems to be very slow. I'm looking for suggestions to speed up the algorithm.

The algorithm is described in the following excerpts:

The dynamic programming solution is also described at http://www.geeksforgeeks.org/travelling-salesman-problem-set-1/, where additional references are given.

The problem statement of the assignment is:

I've implemented the pseudocode using a pandas DataFrame object for the array A. Since sets are not hashable and can't be used as indices, I've instead used tuples, taking care to sort them in order to make them unique representations of sets. Here is the code along with several test cases of increasing size:

I'm just starting out with Tinkerpop and looking for the best way to achieve the following:

• in the beginning, there is a small 'starting-graph'
• a couple of scripts, each having some functions, will interact with this graph
• each script will:
• 1) read and interpret nodes, edges, their attributes and ideally also perform some network metrics to understand the 'current structure'
• 2) based on rules in the functions, update (properties of) nodes & edges
• within each script, there is also some interaction between the functions, in terms of "if these nodes are >x, call function B"
• the problem-set is actually a bit larger than this..

But understanding how to work on (simultaneously running instances of) scripts for graph traversal / interpretation / updating is already very valuable.

I prefer to use Python, but willing to dive into other things if needed :)

I wrote some code to solve the problem below. I have trid some test cases and they all pass, but when I submit my answer for automatic marking, the result is a fail. I have no idea where is the problem.

Here is the problem and the corresponding link:

1005 Spell It Right （20 分)
Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English.

Input Specification:
Each input file contains one test case. Each case occupies one line which contains an N (≤10^100​​).

Output Specification:
For each test case, output in one line the digits of the sum in English words. There must be one space between two consecutive words, but no extra space at the end of a line.

Sample Input:

Hello everyone!

I am writing a program to play the Game of Fifteen.  

So, I am writing the code that moves the tiles within the board. I'll copy it herein and explain it afterwards, step by step.