helloworld, C# - rextester

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
    {
         static int ks = 5;
        static int d = 4;
        static int carpan =2;
        static int[,] denklem = new int[d, ks];
        static int count =0;
        static int[] sayilar = new int[ks];
        static int[] sayilar2 = new int[ks];
        static int fail = 0;
        static int [] sm = new int [d];
        static int[] sm2 = new int[d];
        static int smtop = 0;
        static int cx = 0;
        static int[] ortaklar = new int [100];

static bool No0Column() // eliminates matrices where there is no value in a column.
        {
        
            int[] count2 = new int[ks];
            for (int i = 0; i < d; i++) // checks every row.
                for (int j = 0; j < ks; j++) //check every value in a row.
                    if (denklem[i, j]==1)  
                        count2[j] = 1; //assign 1 to the count2 for each value if there is a value in a row.
          
            for (int j = 0; j < ks; j++)
              if (count2[j] !=1)
                    return false; //if any value in every row is 0, do not accept this matrix!

return true;

}

static bool PerfectMatrix(int p)
        {
            int count1,count2;
            int[] count3 = new int[d]; 
            count2 = 0;

// If there has to be at least two values in a row, otherwise pass it.
            for (int i = 0; i < ks; i++) 
                if (denklem[p / ks, i] == 1)
                    count2++;
            if ((count2 < 3)||(count2== ks))
                return false;

// If there exists the very same row, pass it.
            for (int i = 0; i < p/ks; i++)
            {   count1 = 0;
                  for (int j = 0; j < ks; j++)
                    if (denklem[i, j] == denklem[p / ks, j])
                        count1++;

if (count1 == ks)
                  return false;
                
            }
       
            //Not to have the same matrix, do not have more values than previous row.
           count1 = 0;
            count2 = 0;
            if (p / ks > 0)
            {
                for (int j = 0; j < ks; j++)
                {
                    if (denklem[p / ks - 1, j] == 1)
                        count1++;
                    if (denklem[p / ks, j] == 1)
                        count2++;
                }

if (count2 > count1)
                    return false;
            }

return true;

}
 
        static bool TwoValuesAtMost(int p)
        {
            
                for (int i = 0; i < p;i++)
            {
                if (sayilar2[i] != sayilar2[p])//if there are more than 1 value for chosen a,b,c,d... (which means we dont have 3 values.)
                {
                    
                        if (Math.Abs(sayilar2[i] - sayilar2[p]) > 9) //if the difference between two chosen values is greater than 4, pass it.
                            return false;

for (int j = i + 1; j < p; j++) //if there is more than 2 values, pass it.
                            if ((sayilar2[j] != sayilar2[p]) && (sayilar2[j] != sayilar2[i]))
                                return false;
                        
                }
            }

return true;
        }

static void SameS2(int p)
        {
            if (p == ks)
            {
                int count1 = 0;

//if all chosen values are 2 or 4, pass it, because we have already checked them.
                for (int i = 0; i < ks; i++)
                    if ((sayilar2[i]==1*carpan)|| (sayilar2[i] == 2*carpan))
                        count1++;
                if (count1 == ks) 
                    return;

//Find S values for values chosen and compare it with our original S values.
                count1 = 0;
                for (int j = 0; j < d; j++)
                {
                    for (int i = 0; i < ks; i++)
                        sm2[j] += denklem[j, i] * sayilar2[i];

if (sm2[j] == sm[j])
                        count1++;
                }

for (int i = 0; i < d; i++) //reset found S values.
                    sm2[i] = 0;

if (count1 == d)
                    fail = 1;

return;

}

for (int i =0;i< carpan*carpan*2; i++) //assign values between 1 to a+b+c+d.../2, this is not optimized either.
            {
                sayilar2[p] = i+1;
                if (TwoValuesAtMost(p) == true)
                     SameS2(p + 1);
                
                if (fail == 1)
                    return;

}

static void SameS1(int p)
        {

if (p == ks)
            {
                int count2 = 0;
                for (int i = 0; i < ks; i++)
                    if (sayilar[i] == sayilar2[i])
                        count2++;

if (count2 == ks)
                    return;

for (int j = 0; j < d; j++)
                    for (int i = 0; i < ks; i++)
                        sm2[j] += denklem[j, i] * sayilar2[i]; // toplayalım her bir matrix için...

count2 = 0;

for (int j = 0; j < d; j++)
                    if (sm[j] == sm2[j])
                        count2++;

if (count2==d)
                {
                    fail = 1;
                    return;
                }
                
                    return;
            }

for (int i = 0; i < 2; i++) //2 veya 4 değerleri giriliyor.
            {
                sayilar2[p] = (i + 1)*carpan;
                SameS1(p + 1);
                if (fail == 1)
                    return;
            }

}
        static void IsMatrixOkay(int p)
        {
            if (p==ks) //if we assigned all a,b,c,d... go into here.
            {
                for (int j=0;j<d;j++)
                for (int i=0;i<ks;i++)
                sm[j] += denklem[j, i] * sayilar[i]; // find our S values for given a,b,c,d...
                
                for (int i = 0; i < ks; i++) //find the sum of a,b,c,d for further part.
                    smtop += sayilar[i];

SameS1(0); //If the same values, 2 and 4 are going to be assigned to a,b,c,d... different than a,b,c,d. If I get the same S values, it fails.
                if (fail == 0)
                  SameS2(0);//If other 2 and 4 values than original a,b,c,d values does not have same S value, try it with different values to get same S value.
                
                smtop = 0;
                for (int i = 0; i < d; i++) 
                    sm[i] = 0;
                return;

}

for (int i=0;i<2;i++) //Assign 2 or 4 to our a,b,c,d... I have chosen 2 and 4 for the further part.
            {
                sayilar[p] = (i+1)*carpan;
                IsMatrixOkay(p + 1);
                if (fail == 1) //this goes for every single possible value for a,b,c,d, which is 2^7.
                    return;
            }

}
        static void FindMatrices(int p) // Part 1 - Find suitable Matrices for our possible S values (it is not optimized)
        {
            if (p==ks*d) //if we assigned every single value in the matrix with 0 or 1...
            {
                if (No0Column()==true) //To be sure every value is used in the matrix.
                    {
                      IsMatrixOkay(0); // To be sure that the matrix we have chosen is suitable.
                    if (fail==0) // If there is no problem, write that matrix on the screen.
                    {
                        for (int i = 0; i < d; i++)
                        { for (int j = 0; j < ks; j++)
                                Console.Write(denklem[i, j]+" ");
                            Console.WriteLine();
                        }
                        Console.WriteLine();
                    }

fail = 0; //if it fails, before checking again, assume it will not fail again...
                    count++; //just for checking how many matrices are being checked.
                        
                    }
                
                return;

}

for (int i=1;i>=0;i--) //Assign 0 or 1 values for our matrix inputs, simply, it tries every single possible! it is not optimized either, but easily optimizable.
            {
                denklem[p / ks, p % ks] = i;
                if (p % ks != ks-1)
                    FindMatrices(p+1);
                else  if (PerfectMatrix(p)==true)
                    FindMatrices(p+1);

}
        }
        public static void Main(string[] args)
        {
            FindMatrices(0); //find possible matrices
        }
    }
}

Show compiler warnings [ + ] Show input
Compilation time: 0,16 sec, absolute running time: 5,03 sec, cpu time: 5,02 sec, average memory usage: 23 Mb, average nr of threads: 5