Форум программистов [Powered by Invision Power Board]

Код


            ca.sort()
             # now in sorted array all equal elements are near each other, for example [5,5, 3,3, 2] or [5, 4,4, 3,2]
             # this makes much easier conditions checking
             match = []
             for i in range(len(ca)-1) :
                 if ca[i] == ca[i+1] :
                     prize += 1
                     if not ca[i] in match :
                         match.append(ca[i])
             if len(match) == 2 :
                 prize += 3
             # prize = 1 : 1 pair (XX). 4 variants [XX---] [-XX--] [--XX-] [---XX]
             # prize = 2 : 3 cards (XXX). 3 variants [XXX--] [-XXX-] [--XXX]
             # prize = 3 : 4 cards (XXXX). 2 variants [XXXX-] [-XXXX]
             # prize = 4 : 5 cards (XXXXX). 1 variant [XXXXX]
             # prize = 5 : 2 pairs (XXYY). 3 variants [XXYY-] [XX-YY] [-XXYY]
             # prize = 6 : Fullhouse (XXXYY). 2 variants [XXXYY] [YYXXX]

Код


import java.util.Arrays;


public class ArrayTest {
    
    public static int arrayOperate(int[] ca){
        // conditions:
        // ca.length = 5
        // ca [i] = 0..14
        if (ca.length != 5){
            System.err.println("Array has wrong length");
            return -1;
        } 
        for (int i=0; i<ca.length; i++){
            if (ca[i]<0 || ca[i]>14){
                System.err.println("Array " + i + " value  = " + ca[i]);
                return -1;
            }
        }
        // ...
        Arrays.sort(ca);
        // ...

//        [XX---] [-XX--] [--XX-] [---XX] перемееая prize = 1
//        [XXX--] [-XXX-] [--XXX] перемееая prize = 2
//        [XXXX-] [-XXXX] перемееая prize = 3
//        [XXXXX] перемееая prize = 4
//        [XXYY-] [XX-YY] [-XXYY] перемееая prize = 5
//        [XXXYY] [YYXXX] перемееая prize = 6
        
        int prize = 0;
        int miss = 0;
        for (int i=0; i<ca.length-1; i++){
            if (ca[i]==ca[i+1]){
                prize++;
            } else {
                miss++;
            }
        }
        //System.out.println("miss = " + miss + " prize = " + prize);
        if (prize == 2 && miss == 2){
            prize=5;
        }else if (prize == 3 && miss == 1){
            prize=6;
        }
        return prize;
    }
    
    public static void main(String []s){
            System.out.println("1 = "+arrayOperate(new int[]{1,2,3,4,1}));
            System.out.println("1 = "+arrayOperate(new int[]{1,4,2,3,4}));
            System.out.println("2 = "+arrayOperate(new int[]{1,2,2,3,2}));
            System.out.println("3 = "+arrayOperate(new int[]{1,2,1,1,1}));
            System.out.println("4 = "+arrayOperate(new int[]{1,1,1,1,1}));
            System.out.println("5 = "+arrayOperate(new int[]{1,2,3,2,1}));
            System.out.println("6 = "+arrayOperate(new int[]{1,1,2,2,1}));
    }

}

Код


import java.util.*;

public class Test
{
 static int [] ca = new int [5];
 static int prize = 0;

 public static void main(String [] args)
 {
  for(int i = 0; i < ca.length; i++)
   ca [i] = new Random().nextInt(5);

  Arrays.sort(ca);

  for(int i = 0; i < ca.length; i++)
   System.out.print(ca [i] + " ");

  System.out.println();

  getPrize();
 }

 static void getPrize()
 {
  int x = 0, y = 0;
  int k = -999;

  for(int i = 0; i < ca.length - 1; i++)
   if(ca [i] == ca [i + 1])
   {
    x++;
    k = ca [i];
   }
   else if(x > 0)
    break;

  for(int i = 0; i < ca.length - 1; i++)
  {
   if(ca [i] != k && ca [i] == ca [i + 1])
    y++;
  }

  System.out.println("x=" + x + " y=" + y);

  prize = x;
  if(x == 1 && y == 1)
   prize = 5;
  if(x > 1 && y > 0)
   prize = 6;

  System.out.println("prize=" + prize);
 }
}

Код


            if(card1 > 0 && card2 > 0 && card3 > 0 && card4 > 0 && card5 > 0) // Game ends
            {
                //make array of card indexes and sort it
                prize = 0;
                int ca[];
                ca = new int [5];
                ca[1]= name[1];
                ca[2]= name[2];
                ca[3]= name[3];
                ca[4]= name[4];
                ca[0]= name[0];
                Arrays.sort(ca);
                // prize = 4 : 5 cards (XXXXX). 1 variant [XXXXX]
                if(ca[0] == ca[1] && ca[1] == ca[2] && ca[2] == ca[3] && ca[3] == ca[4])
                {
                    prize = 4;
                }
                //  prize = 3 : 4 cards (XXXX). 2 variants [XXXX-] [-XXXX]
                else if((ca[0] == ca[1] && ca[1] == ca[2] && ca[2] == ca[3] && ca[4] != ca[0]) || (ca[1] == ca[2] && ca[2] == ca[3] && ca[3] == ca[4] && ca[4] != ca[0]))
                {
                    prize = 3;
                }
                // prize = 2 : 3 cards (XXX). 3 variants [XXX--] [-XXX-] [--XXX]
                else if((ca[0] == ca[1] && ca[1] == ca[2] && ca[3] != ca[0] && ca[4] != ca[0] && ca[4] != ca[3]) || (ca[1] == ca[2] && ca[2] == ca[3] && ca[4] != ca[1] && ca[0] != ca[4] && ca[4] != ca[0]) || (ca[2] == ca[3] && ca[3] == ca[4] && ca[0] != ca[2] && ca[1] != ca[2] && ca[0] != ca[1]))
                {
                    prize = 2;
                }
                // prize = 6 : Fullhouse (XXXYY). 2 variants [XXXYY] [YYXXX]
                else if((ca[0] == ca[1] && ca[1] == ca[2] && ca[3] == ca[4] && ca[4] != ca[0]) || (ca[2] == ca[3] && ca[3] == ca[4] && ca[0] == ca[1] && ca[4] != ca[0]))
                {
                    prize = 6;
                }
                // prize = 5 : 2 pairs (XXYY). 3 variants [XXYY-] [XX-YY] [-XXYY]
                else if((ca[0] == ca[1] && ca[2] == ca[3] && ca[3] != ca[0] && ca[4] != ca[0] && ca[4] != ca[3]) || (ca[0] == ca[1] && ca[3] == ca[4] && ca[4] != ca[0] && ca[2] != ca[5] && ca[2] != ca[0]) || (ca[1] == ca[2] && ca[3] == ca[4] && ca[1] != ca[4] && ca[0] != ca[1] && ca[0] != ca[4]))
                {
                    prize = 5;
                }
                // prize = 1 : 1 pair (XX). 4 variants [XX---] [-XX--] [--XX-] [---XX]
                else if((ca[0] == ca[1] && ca[2] != ca[3] && ca[3] != ca[4] && ca[4] != ca[2] && ca[0] != ca[2] && ca[0] != ca[3] && ca[0] != ca[4]) || (ca[1] == ca[2] && ca[3] != ca[4] && ca[4] != ca[0] && ca[0] != ca[3] && ca[1] != ca[0] && ca[1] != ca[3] && ca[1] != ca[4]) || (ca[2] == ca[3] && ca[4] != ca[0] && ca[0] != ca[1] && ca[4] != ca[1] && ca[2] != ca[4] && ca[2] != ca[0] && ca[2] != ca[1]) || (ca[3] == ca[4] && ca[0] != ca[1] && ca[1] != ca[2] && ca[2] != ca[0] && ca[3] != ca[0] && ca[3] != ca[1] && ca[3] != ca[2]))
                {
                    prize = 1;
                }
                link1 = "<a action=\"bypass -h Quest _662_AGameOfCards Klump_QuestInProgress.htm\">Play again.</a><br>";
                prizestr = REWARDS_TEXT[prize];

Код


int[] ca = new int [5];
// .. заполнение ca значениями ..
         
Arrays.sort(ca);
         
int prize = 0;
HashSet<Integer> match = new HashSet<Integer>();
         
for (int i = 0; i < ca.length - 1; i++) {                
    if (ca[i] == ca[i+1]) {
        prize += 1;
        if (!match.contains(new Integer(ca[i]))) {
            match.add(new Integer(ca[i]));
        }
    }
}
if (match.size() == 2) {
    prize += 3;
}