TI-BASIC Code to C# Code example, C#

Language: Layout:

//Rextester.Program.Main is the entry point for your code. Don't change it.
//Compiler version 4.0.30319.17929 for Microsoft (R) .NET Framework 4.5

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text.RegularExpressions;

namespace Rextester
{
    public class Program
    {
        public static void Main(string[] args)
        {
            //I wrote a program on my TI-83 plus to find the factors 2 numbers share. 
            //The raw TI-BASIC code will be at the bottom, and each part of the C# code
            //will have its equivalent part in my calculator program next to it.
            //note that for each of the two numbers I used different variables 
            //(like L1 and L2 for the factors lists), but the ideas and types are the same
            //Console.Write("?");
            //int num1 = int.Parse(Console.ReadLine()); //Input Z
            //Console.Write("?");
            //int num2 = int.Parse(Console.ReadLine()); //Input Y
            //I'll just put default numbers here, you can change it
            int num1 = 60;
            int num2 = 24;
            int[] f1 = FindFactors(num1); //L1
            int[] f2 = FindFactors(num2); //L2
            //X is L1's length, W is L2's length (see FindFactors)
            int i1 = 1; //2->A (I reused A here, and lists are 1-based, not 0-based like C#)
            int i2;
            int comp1, comp2; //z,y
            List<int> found = new List<int>(){1}; //{1}->L3
            do //Lbl 0
            {
                comp1 = f1[i1]; //L1(A)->Z (again I reused a variable)
                i2 = 1; //2->B
                do //Lbl 1
                {
                    comp2 = f2[i2]; //L2(B)->Y
                    if (comp1 == comp2)
                        found.Add(comp1); //augment(L3,{Z})->L3
                    i2++; //B+1->B
                } while(i2 < f2.Length); //If B<=W:Goto 1
                i1++; //A+1->A
            } while(i1 < f1.Length); //If A<=X:Goto 0
            Console.WriteLine(DescColl(found)); //Disp L3
        }
        static int[] FindFactors(int num) //num is Z
        {
            List<int> factors = new List<int>() {1}; //{1}->L1
            int curr = 2; //2->A
            //I also used 1->X to keep the length of the factors as lists do not
            //have a length property, but in this I'll just use .Length/Count
            //Also, I could've used a for loop, but it's easier to represent gotos this way
            do //Lbl A
            {
                if (num % curr == 0) //If gcd(Z,A)=A (there's no mod)
                { //Then
                    factors.Add(curr); //augment(L1,{A})->L1
                    //X+1->X
                } //End
                curr++; //A+1->A
            } while (curr <= num); //If A<=Z:Goto A
            return factors.ToArray();
        }
        static string DescColl<T>(IEnumerable<T> i){
            string s = "{";
            foreach(T t in i) s += t.ToString() + ", ";
            return s.Remove(s.Length-2) + "}";
        }
    }
}

//RAW TI-BASIC CODE:
/*
Input Z
Input Y
{1}->L1
2->A
1->X
Lbl A
If gcd(Z,A)=A
Then
augment(L1,{A})->L1
X+1->X
End
A+1->A
IfA<=Z
Goto A
{1}->L2
2->A
1->W
Lbl B
If gcd(Y,A)=A
Then
augment(L2,{A})->L2
W+1->W
End
A+1->A
IfA<=Y
Goto A
@->A
{1}->L3
Lbl 0
L1(A)->Z
2->B
Lbl 1
L2(B)->Y
If Z=Y
augment(L3,{Z})->L3
B+1->B
If B<=W
Goto 1
A+1->A
If A<=X
Goto 0
Disp L3
*/

Show compiler warnings [ - ] Show input
Compilation time: 0,14 sec, absolute running time: 0,08 sec, cpu time: 0,08 sec, average memory usage: 13 Mb, average nr of threads: 3