当前位置:网站首页>C # input how many cards are there in each of the four colors.
C # input how many cards are there in each of the four colors.
2022-07-05 23:46:00 【laocooon】
namespace ConsoleCards
{
public enum Suit
{
Clubs,
Diamonds,
Hearts,
Spades
}
}
using System;
namespace ConsoleCards
{
public class Card
{
private Rank rank;
private Suit suit;
private bool faceUp;
public Rank Rank => rank;
public Suit Suit => suit;
public bool FaceUp => faceUp;
public Card(Rank rank, Suit suit)
{
this.rank = rank;
this.suit = suit;
faceUp = false;
}
public void FlipOver()
{
faceUp = !faceUp;
}
public void Print()
{
if (faceUp)
{
Console.WriteLine(string.Concat(rank, " of ", suit));
}
else
{
Console.WriteLine("Card is face down");
}
}
}
}
using System;
using System.Collections.Generic;
using ConsoleCards;
namespace ProgrammingAssignment3
{
/// <summary>
/// Programming Assignment 3
/// </summary>
class Program
{
// autograder support
static int testCaseNumber = 0;
static int nextCard = 0;
static Card[] testCaseCards = new Card[9];
static int numCards = 0;
/// <summary>
/// Programming Assignment 3
/// </summary>
/// <param name="args">command-line args</param>
static void Main(string[] args)
{
// IMPORTANT: Only add code in the section
// indicated below. The code I've provided
// makes your solution work with the
// automated grader on Coursera
string input = Console.ReadLine();
while (input[0] != 'q')
{
testCaseNumber = int.Parse(input);
numCards = GetNumCards();
InitializeTestCaseCards();
Card [] cards= testCaseCards;
nextCard = 0;
// Add your code between this comment
// and the comment below. You can of
// course add more space between the
// comments as needed
int[] arr = { 0, 0, 0, 0 };
while(nextCard < numCards)
arr[(int)GetCard().Suit]++;
Console.WriteLine("C"+arr[0]+ " D"+arr[1] + " H"+arr[2]+ " S"+arr[3]);
// Don't add or modify any code below
// this comment
input = Console.ReadLine();
}
}
/// <summary>
/// Gets a card
/// <return>a card</return>
/// </summary>
static Card GetCard()
{
nextCard++;
return testCaseCards[nextCard - 1];
}
/// <summary>
/// Gets how many cards will be in the hand for the
/// current test case number
/// <return>number of cards to add to hand</return>
/// </summary>
static int GetNumCards()
{
switch (testCaseNumber)
{
case 1:
case 2:
case 6:
return 5;
case 3:
return 2;
case 4:
return 7;
case 5:
return 0;
case 7:
return 1;
case 8:
case 10:
return 4;
case 9:
return 9;
default:
return 0;
}
}
/// <summary>
/// Initializes the set of cards returned by GetCard based
/// on the test case number
/// </summary>
static void InitializeTestCaseCards()
{
switch (testCaseNumber)
{
case 1:
testCaseCards[0] = new Card(Rank.Two, Suit.Clubs);
testCaseCards[1] = new Card(Rank.Three, Suit.Diamonds);
testCaseCards[2] = new Card(Rank.Four, Suit.Spades);
testCaseCards[3] = new Card(Rank.Ten, Suit.Spades);
testCaseCards[4] = new Card(Rank.Ace, Suit.Spades);
break;
case 2:
testCaseCards[0] = new Card(Rank.Two, Suit.Clubs);
testCaseCards[1] = new Card(Rank.Three, Suit.Clubs);
testCaseCards[2] = new Card(Rank.Four, Suit.Clubs);
testCaseCards[3] = new Card(Rank.Ten, Suit.Clubs);
testCaseCards[4] = new Card(Rank.Ace, Suit.Clubs);
break;
case 3:
testCaseCards[0] = new Card(Rank.Ten, Suit.Diamonds);
testCaseCards[1] = new Card(Rank.Ace, Suit.Diamonds);
break;
case 4:
testCaseCards[0] = new Card(Rank.Two, Suit.Hearts);
testCaseCards[1] = new Card(Rank.Three, Suit.Hearts);
testCaseCards[2] = new Card(Rank.Four, Suit.Hearts);
testCaseCards[3] = new Card(Rank.Five, Suit.Hearts);
testCaseCards[4] = new Card(Rank.Six, Suit.Hearts);
testCaseCards[5] = new Card(Rank.Seven, Suit.Hearts);
testCaseCards[6] = new Card(Rank.Eight, Suit.Hearts);
break;
case 6:
testCaseCards[0] = new Card(Rank.Ten, Suit.Clubs);
testCaseCards[1] = new Card(Rank.Jack, Suit.Clubs);
testCaseCards[2] = new Card(Rank.Queen, Suit.Clubs);
testCaseCards[3] = new Card(Rank.King, Suit.Clubs);
testCaseCards[4] = new Card(Rank.Ace, Suit.Clubs);
break;
case 7:
testCaseCards[0] = new Card(Rank.Queen, Suit.Hearts);
break;
case 8:
testCaseCards[0] = new Card(Rank.Jack, Suit.Clubs);
testCaseCards[1] = new Card(Rank.Jack, Suit.Diamonds);
testCaseCards[2] = new Card(Rank.Jack, Suit.Hearts);
testCaseCards[3] = new Card(Rank.Jack, Suit.Spades);
break;
case 9:
testCaseCards[0] = new Card(Rank.Two, Suit.Spades);
testCaseCards[1] = new Card(Rank.Three, Suit.Spades);
testCaseCards[2] = new Card(Rank.Four, Suit.Spades);
testCaseCards[3] = new Card(Rank.Five, Suit.Spades);
testCaseCards[4] = new Card(Rank.Six, Suit.Spades);
testCaseCards[5] = new Card(Rank.Seven, Suit.Spades);
testCaseCards[6] = new Card(Rank.Eight, Suit.Spades);
testCaseCards[7] = new Card(Rank.Nine, Suit.Spades);
testCaseCards[8] = new Card(Rank.Ten, Suit.Spades);
break;
case 10:
testCaseCards[0] = new Card(Rank.Two, Suit.Clubs);
testCaseCards[1] = new Card(Rank.Three, Suit.Diamonds);
testCaseCards[2] = new Card(Rank.Four, Suit.Hearts);
testCaseCards[3] = new Card(Rank.Five, Suit.Spades);
break;
default:
break;
}
}
}
}
边栏推荐
- 698. 划分为k个相等的子集 ●●
- Xinyuan & Lichuang EDA training camp - brushless motor drive
- How to insert data into MySQL database- How can I insert data into a MySQL database?
- Dynamic planning: robbing families and houses
- orgchart. JS organization chart, presenting structural data in an elegant way
- Différence entre hors bande et en bande
- yate. conf
- UVA11294-Wedding(2-SAT)
- Breadth first search open turntable lock
- 20.移植Freetype字体库
猜你喜欢
无刷驱动设计——浅谈MOS驱动电路
总结了 800多个 Kubectl 别名,再也不怕记不住命令了!
PV静态创建和动态创建
PADS ROUTER 使用技巧小记
激光slam学习记录
进击的技术er——自动化
Neural structured learning - Part 2: training with natural graphs
Neural structured learning 4 antagonistic learning for image classification
98. Verify the binary search tree ●●
GFS distributed file system
随机推荐
Huawei simulator ENSP - hcip - MPLS experiment
哪些偏门项目可以做到?自媒体做到月赚一万以上很难吗?
UVA – 11637 Garbage Remembering Exam (组合+可能性)
Rasa 3.x 学习系列-Rasa X 社区版(免费版) 更改
《牛客刷verilog》Part III Verilog企业真题
Zero rhino technology joined hands with the intelligence Club: the "causal faction" forum was successfully held, and the "causal revolution" brought the next generation of trusted AI
PADS ROUTER 使用技巧小记
【EF Core】EF Core与C# 数据类型映射关系
White hat talks about web security after reading 2
Opencvsharp (C openCV) shape detection and recognition (with source code)
It is proved that POJ 1014 module is optimized and pruned, and some recursion is wrong
poj 2762 Going from u to v or from v to u? (infer whether it is a weak link diagram)
CIS基准测试工具kube-bench使用
How to design API return code (error code)?
用列表初始化你的vector&&initializer_list简介
同事悄悄告诉我,飞书通知还能这样玩
Idea connects to MySQL, and it is convenient to paste the URL of the configuration file directly
CIS benchmark tool Kube bench
98. Verify the binary search tree ●●
Spire. PDF for NET 8.7.2