JAVA zadachi ot predvaritelen izpit C#

 1 VARIANT ///////////////////////////////////////////////////////////////////

 1 zadacha  //////
          Scanner in = new Scanner(System.in);
          String leap = in.next();
          int addPlays = 0;
          if ("t".equals(leap)){
              addPlays =3;
          }
             int holidays = in.nextInt();
             int hometowns = in.nextInt();
             double plays = hometowns + (double)2/3*(52-hometowns)+(double)1/2 * holidays + addPlays;
             System.out.println((int)plays);

 2 zadacha ///////

              Scanner in = new Scanner(System.in);
              int n =  in.nextInt();
              int sumFirst = 0;
              int sumSecont = 0;


              /////// 1 variant
//              for(int i=0; i<n*2; i++){
//               int nums = in.nextInt();
//                if(i < n){
//                    sumFirst += nums;
//                }
//                else {
//                    sumSecont += nums;
//                       }
//              }

              //////// 2 variant

              for(int i=0; i<n; i++){
                  sumFirst += in.nextInt();
              }
              for(int i=0; i<n; i++){
                  sumSecont += in.nextInt();
              }

                  if(sumFirst == sumSecont){
                      System.out.println("Yes , sum = " + sumFirst);
                  }
                  else{
                      int diff = Math.abs(sumFirst - sumSecont);
                      System.out.println("No , diff = " + diff);
                      }

3 zadacha /////

              Scanner in = new Scanner(System.in);// trqbva da vuvedm golqmo chislo naprimer 101
              int n = in.nextInt();

              double start = System.currentTimeMillis();
              double memoryStart = Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory();

              /////
              String empty = new String(new char[n]);
              String asterix = new String(new char[2*n]).replace("\0","*");
              String dash = new String(new char [2*(n-1)]).replace("\0", "/");
              String bridge = empty.replace("\0","|");

                // FIRST line
            System.out.println(asterix+empty+asterix);
            /////
                // BEFORE the bridge
            for(int i=0; i<(n-3)/2 ;i++){
                System.out.println("*"+dash+"*"+empty+"*"+dash+"*");
            }


                // print the bridge
        System.out.println("*"+dash+"*"+bridge+"*"+dash+"*");

                // after the bridge
        for(int i=0; i<(n-3)/2 ;i++){
            System.out.println("*"+dash+"*"+empty+"*"+dash+"*");
        }

                // last line
        System.out.println(asterix+empty+asterix);
        /////
        System.out.println("working time"+(System.currentTimeMillis()-start)/1000+"seconds");
        double memoryEnd = Runtime.getRuntime().totalMemory()-Runtime.getRuntime().freeMemory();
        System.out.println("Used memory : "+(memoryEnd-memoryStart)/1024/1024+"MB");


4 zadacha ///
                       // 125 171 217
                public static int sumOfDigits(int number){// metoda mi zima vsqko tricifreno chislo 125 i go razbiva na 1 2 5 i gi subira 1+2+5=8 i taka razbiva i 171 = 9 , 217 = 10 sum= 8+9+10=27
                    int first = number/100;
                    int second = number%100/10;
                    int third = number%10;
                    return first+second+third;
            }

            public static boolean isCorrect(int number){// metoda mi razbiva chisloto na 1 2 5 i proverqva za vsqko edno dali e v diapazona ot 1 do 7  first>0 && first<8
                    int first = number/100;
                    int second = number%100/10;
                    int third = number%10;
                    return first>0 && first<8 && second>0 && second<8 && third>0 && third<8;
            }
            public static String isStr(int number){// zimame 4isloto 125 convertirame go v String "125" i go subirame s dr kato gi konkatenirame v stringa k=9 i rpoverqvame dali k e s duljina 9

                String num = String.valueOf(number);
                return num;
        }


                    public static void main(String[] args) {


                            int sum = 27;
                            int diff = 46;
                            boolean foundAny = false;
                            //int count = 0;
                            for (int n1=111; n1 <= 777; n1++){

                                    int n2 = n1 + diff;
                                    int n3 = n1 + 2*diff;
                                    String k = isStr(n1)+isStr(n2)+isStr(n3);
                                    if(sumOfDigits(n1)+sumOfDigits(n2)+sumOfDigits(n3)==sum &&
                                                    isCorrect(n1) && isCorrect(n2)&& isCorrect(n3)&&
                                                    k.length()==9)
                                            {
                                            //count++;
                                            foundAny = true;
                                            System.out.println(k);
                                    }
                            }
                            if (!foundAny){/// moje i if statmanta if(foundAny == false)
                                System.out.println("NO");
                            }
                           //               if (count ==0){
                           //               System.out.println("NO");
                           //               }



   ////////////////////// 4zadacha 2 reshnie s 3 vlojeni FOR LOOPS  i count++ ////////////////////////////////

                public static int sumOfDigits(int number){
        int first = number/100;
        int second = number%100/10;
        int third = number%10;
        return first+second+third;
            }

            public static boolean isCorrect(int number){
        int first = number/100;
        int second = number%100/10;
        int third = number%10;
        return first>0 && first<8 && second>0 && second<8 && third>0 && third<8;
            }



        public static void main(String[] args) {


            int sum = 12;
            int diff = 15;
            //boolean foundAny = false;
            int count = 0;
                         //for (int n1=111; n1 <= 777; ){   moje i s 3 vlojeni for cikula
                        //for (int n2=n1 + diff; n1 <= 777;){
                              //for (int n3= n2 + diff; n1 <= 777; n1++ , n2++ , n3++){
                    for (int n1 = 111, n2= n1 + diff, n3= n2 + diff; n1 <= 777; n1++ , n2++ , n3++){

                  //            int n2 = n1 + diff;
                  //            int n3 = n1 + 2*diff;

                if(sumOfDigits(n1)+sumOfDigits(n2)+sumOfDigits(n3)==sum &&
                        isCorrect(n1) && isCorrect(n2)&& isCorrect(n3)){
                    count++;
                    //foundAny = true;
                    System.out.println(n1+""+n2+""+n3);
                }
            }
            //if (!foundAny){/// moje i if statmanta if(foundAny == false)
            //    System.out.println("NO");
            //}
            if (count ==0){
                    System.out.println("NO");
            }

//////////////// 4 zadacha C# reshenie /////////////////////

 int sum = int.Parse(Console.ReadLine());
            int diff = int.Parse(Console.ReadLine());
            bool OK = false;

            string num;
            for (int i = 111; i < 778; i++)
            {

                int tempSum = 0;
                int a = i;
                int b = a + diff;
                int c = b + diff;
                //string num = "";


                num = a.ToString() + b.ToString() + c.ToString();
                Regex r = new Regex("0|8|9");
                if (!r.IsMatch(num))  // (!num.Contains("0") && !num.Contains("8") && !num.Contains("9"))
                {
                    for (int j = 0; j < num.Length; j++)
                    {
                        tempSum += int.Parse(num[j].ToString());
                    }
                    if (tempSum == sum && num.Length == 9)
                    {
                        Console.WriteLine(num);
                        OK = true;
                    }
                }
            }
            if(!OK)
         {
            Console.WriteLine("NO");
         }

/////////////////////// 4 zadacha moe reshenie ///////////////////////////////////

            int sum = 24;
            int diff = 103;
            boolean OK = false;

            String[] num ;
            num = null;
            num = new String[3];
  for (int i = 111; i < 778; i++){

    int tempSum = 0;
    int a = i;
    int b = a + diff;
    int c = b + diff;
    //string num = "";
    String strI = Integer.toString(a);
    num[0] = strI;
    String strJ = Integer.toString(b);
    num[1] = strJ;
    String strK = Integer.toString(c);
    num[2] = strK;
   String hui = strI+strJ+strK;
  //  Regex r = new Regex("0|8|9");
    String phoneRegEx = "[089]+";
    Pattern phonePattern = Pattern.compile(phoneRegEx);
    Matcher matcher = phonePattern.matcher(hui);
    if (!matcher.find())
    //if(!hui.contains("0") && !hui.contains("8") && !hui.contains("9")) // moje i taka bez REGex
    {
        char arr[]=hui.toCharArray();
        for(int k=0;k<arr.length;k++){
            tempSum += Integer.parseInt(String.valueOf(arr[k]));
        }
        if (tempSum == sum && arr.length == 9)
        {
            System.out.println(arr);
            OK = true;
        }
    }
}
if(!OK)
{
    System.out.println("NO");
}


variant 2 2222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222

zadacha 3 /////////////

public static void PrintLine1(char aside,char middle, int number){

        System.out.print(aside);
        for (int i = 0; i < 2* number -2; i++){
            System.out.print(middle);
        }
        System.out.print(aside);
    }

    public static void PrintMiddle1(char ch , int number){
        for(int i= 0; i < number; i++){
            System.out.print(ch);
        }
    }

 public static void main(String[] args) {

               int n = 5;
               // print top
               PrintLine1(' ','*',n);
               PrintMiddle1(' ', n);
               PrintLine1(' ','*',n);
               System.out.println();

               for(int i = 0; i < n-2; i++){
                   if(i== n/2 - 1){
                       PrintLine1('*','/',n);
                       PrintMiddle1('-', n);
                       PrintLine1('*','/',n);
                       System.out.println();
                   }
                   else{
                       PrintLine1('*','/',n);
                       PrintMiddle1(' ', n);
                       PrintLine1('*','/',n);
                       System.out.println();
                   }
               }
               // print bottom
               PrintLine1(' ','*',n);
               PrintMiddle1(' ', n);
               PrintLine1(' ','*',n);
               System.out.println();



/// 2 zadacha //

                Scanner input = new Scanner(System.in);
        int n = input.nextInt();
            int oddSum = 0;
        int evenSum = 0;

        for(int i = 0; i< n *2; i++){
            int number = input.nextInt();

            if(i % 2== 0){
                evenSum += number;
            }
            else{
                oddSum += number;
            }
        }
        if(oddSum == evenSum){
            System.out.println("Yes, sum=" + oddSum);
        }
        else{
            System.out.println("No, diff=" + Math.abs(oddSum-evenSum));
        }

4 zadacha///////////  sushtta kato  4 zadacha ot variant 1 samo 4e paterna/ shablona e ne ot 1 do 7 a ot 5 do 9 ->
-> return first>4 && first<10 && second>4 && second<10 && third>4 && third<10;
-> return first>0 && first<8 && second>0 && second<8 && third>0 && third<8;
String phoneRegEx = "[01234]+";
        Pattern phonePattern = Pattern.compile(phoneRegEx);
        Matcher matcher = phonePattern.matcher(hui);
        if (!matcher.find())  {

variant 3 ///////////////////// 33333333333333333333333333333333333333333333333333333333333333333
33333333333333333333333333333333333333333333333
3333333333333333333333333333333333333333333333333333333333333333333333333333



zadacha 2  //////////

Scanner input = new Scanner(System.in);
                String[] numString = input.nextLine().split(" ");

                int max = Integer.MIN_VALUE;
                long sum = 0;

                for(int i = 0; i< numString.length; i++){
                    int number = Integer.parseInt(numString[i]);
                    sum += number;

                    if(number > max){
                        max = number;
                    }
                }
                if (sum- max == max){
                    System.out.println("Yes, sum=" + max);
                }
                else {
                    long diff = Math.abs((sum-max) - max);
                    System.out.println("Yes, sum=" + diff);
                }


zadacha 4 ////////

                Scanner input = new Scanner(System.in);
                int diff = Integer.parseInt(input.nextLine());
                String[] letter = {"k","n","p","s"};
                int[] letterValue = {1, 4, 5, 3};
                boolean foundResult = false;
                ArrayList<String> resultList = new ArrayList<String>();

                if(diff <= 16){// zashtoto ne moje da ima diff po-golqmo ot 16 max e 20 - 4 = 16
                    for(int i1 =0; i1 < letter.length; i1++){
                        for(int i2 =0; i2 < letter.length; i2++){
                            for(int i3 =0; i3 < letter.length; i3++){
                                for(int i4 =0; i4 < letter.length; i4++){
                                    for(int i5 =0; i5 < letter.length; i5++){
                                        for(int i6 =0; i6 < letter.length; i6++){
                                            for(int i7 =0; i7 < letter.length; i7++){
                                                for(int i8 =0; i8 < letter.length; i8++){

            String wholeSequence =letter[i1]+
                    letter[i2]+
                    letter[i3]+
                    letter[i4]+
                    letter[i5]+
                    letter[i6]+
                    letter[i7]+
                    letter[i8];

            int firstFourLetters = letterValue[i8]+
                    letterValue[i7]+
                    letterValue[i6]+
                    letterValue[i5];

            int secondFourLetters = letterValue[i4]+
                    letterValue[i3]+
                    letterValue[i2]+
                    letterValue[i1];

            if(firstFourLetters - secondFourLetters == diff || secondFourLetters - firstFourLetters == diff){
                foundResult = true;
                //System.out.println(wholeSequence);/// 1 variant
                resultList.add(wholeSequence);// 2 variant sus sortirane na ArrayList
            }

                                                }
                                            }
                                        }
                                    }
                                }
                            }
                        }
                    }
                }
                Collections.sort(resultList);
                for (String s : resultList){
                    System.out.println(s);
                }

                if(!foundResult){
                    System.out.println("NO");
                }