



|
|
CS1 Course Site
|
Programming Challenge Archive
Incremental Programming
CardThing -- v3
|
|
JavaApplication --
CardThing
// General Information
// ---------------------------------------------------
// File: CardThing.java
// Type: java application file
// Date: Thu Nov 9, 2000
// Name: Kara Becker
// Line: Display a * after the second card in each pair o+
f the 50 card pairs if neither the rank nor the suit are t+
he same.
// Application Description
// ---------------------------------------------------
/*
Display a * after the second card in each pair of the 50+
card pairs if neither the rank nor the suit are the same.+
*/
// Required Packages
// ---------------------------------------------------
import blue.io.*;
import blue.cards.*;
// Application Class
// ---------------------------------------------------
class CardThing
{
static public void main (String args[])
{
Card c;
Card d;
int i = 1;
while (i <= 50)
{
String cRank = IO.readString();
String cSuit = IO.readString();
c = new Card(cRank,cSuit);
String dRank = IO.readString();
String dSuit = IO.readString();
d = new Card(dRank,dSuit);
c.print();
d.print();
checkRanks(c,d);
checkSuits(c,d);
IO.println("here");
checkDiff(c,d);
IO.println();
i = i + 1;
}
}
static private void checkRanks(Card c,Card d)
{
if (c.rank() == d.rank())
{
IO.println(" R");
}
}
static private void checkSuits(Card c,Card d)
{
if (c.suit() == d.suit())
{
IO.println(" S");
}
}
static private void checkDiff(Card c,Card d)
{
IO.println(c.suit() + " " + d.suit());
if (c.suit() != d.suit())
{
IO.println("here");
if (c.rank() != d.rank())
{
IO.println(" *");
}
}
}
}
// Demo
// ---------------------------------------------------
/*
*/
|
|
|