Einführung

Vor langer Zeit, als ich Kartenspiele mit gewöhnlichen Spielkarten codierte, gab ich für jede Karte eine Nummer an und rief eine Funktion mit einer Nummer auf, um eine Karte zu erhalten. Dies hat mich ein wenig dazu inspiriert, diese Herausforderung anzunehmen.

Für die Leute, die die Spielkarten nicht kennen, besteht ein Kartenspiel aus 52 Karten (13 in jeder der vier Farben, dh Herzen, Diamanten, Pik, Keulen). In jeder Farbe gibt es 13 Karten - zuerst die von 2-10 nummerierten Karten, dann den Buben (J), die Dame (Q), den König (K) und das Ass (A). Das ist die Reihenfolge

Herausforderung

Die Herausforderung besteht darin, eine ganze Zahl zwischen 1 und 52 als Eingabe zu verwenden und die Karte an dieser Position anzuzeigen. Ihre Ausgabe muss jedoch in Worten erfolgen. Außerdem muss die Reihenfolge eingehalten werden, dh, zuerst werden 13 Karten aus Herzen, dann aus Diamanten, dann aus Pik und schließlich aus Schlägern.

Zum Beispiel, wenn jemand die Nummer wählt. 30Die Karte würde dann zu der dritten Farbe gehören, dh den Pik. Es wäre auch die vierte Karte in der Farbe, was die Zahl 5 bedeutet. Daher muss Ihre Ausgabe in Worten sein: five of spadesund es sollte immer diesem Format folgen , dh zuerst die Karte, gefolgt von einem ofund dem Namen der Farbe bei das Ende mit erforderlichen Abständen dazwischen.

Eingabe und Ausgabe

Die Eingabe wird eine ganze Zahl zwischen 1-52 (jeweils einschließlich). Beachten Sie, dass hier die Zählung bei 1 beginnt. Sie können bei 0 beginnen . Allerdings müssen Sie die Reihenfolge halten die Karten , die oben erwähnt wird. Ihre Ausgabe sollte die in Worten geschriebene Karte an dieser Position sein. Sie müssen keine ungültigen Eingaben verarbeiten. Die Ausgabe kann auch in Klein- oder Großbuchstaben erfolgen.

Da unten ist die Liste aller möglichen Eingänge und ihre Ausgänge:

1 -> two of hearts
2 -> three of hearts
3 -> four of hearts
4 -> five of hearts
5 -> six of hearts
6 -> seven of hearts
7 -> eight of hearts
8 -> nine of hearts
9 -> ten of hearts
10 -> jack of hearts
11 -> queen of hearts
12 -> king of hearts
13 -> ace of hearts
14 -> two of diamonds
15 -> three of diamonds
16 -> four of diamonds
17 -> five of diamonds
18 -> six of diamonds
19 -> seven of diamonds
20 -> eight of diamonds
21 -> nine of diamonds
22 -> ten of diamonds
23 -> jack of diamonds
24 -> queen of diamonds
25 -> king of diamonds
26 -> ace of diamonds
27 -> two of spades
28 -> three of spades
29 -> four of spades
30 -> five of spades
31 -> six of spades
32 -> seven of spades
33 -> eight of spades
34 -> nine of spades
35 -> ten of spades
36 -> jack of spades
37 -> queen of spades
38 -> king of spades
39 -> ace of spades
40 -> two of clubs
41 -> three of clubs
42 -> four of clubs
43 -> five of clubs
44 -> six of clubs
45 -> seven of clubs
46 -> eight of clubs
47 -> nine of clubs
48 -> ten of clubs
49 -> jack of clubs
50 -> queen of clubs
51 -> king of clubs
52 -> ace of clubs

Wertung

Das ist Code-Golf , also gewinnt der kürzeste Code.

Python 3 ,  115-90  Bytes

from unicodedata import*
lambda n:name(chr(n%13+n%13//11+[6,0,4,2][-n//13]*8+127137))[13:]

Eine unbenannte Funktion, die die Zeichenfolge in Großbuchstaben zurückgibt.

Probieren Sie es online!

Wie?

Unicode-Zeichen haben Namen. Die Namen einiger dieser Zeichen sind wie "ZWEI SPATEN SPIELEN", daher können wir die Zeichen des Unicode-Zeichens abrufen, das die erforderliche Karte darstellt, und die ersten 13 Zeichen entfernen, um unsere Ausgabe zu erhalten.

Die interessierenden Unicode-Zeichen befinden sich in einem Block wie folgt:

            0   1   2   3   4   5   6   7   8   9   A   B   C   D   E   F
U+1F0Ax     x   As  2s  3s  4s  5s  6s  7s  8s  9s  Ts  Js  x   Qs  Ks  x
U+1F0Bx     x   Ah  2h  3h  4h  5h  6h  7h  8h  9h  Th  Jh  x   Qh  Kh  x
U+1F0Cx     x   Ad  2d  3d  4d  5d  6d  7d  8d  9d  Td  Jd  x   Qd  Kd  x
U+1F0Dx     x   Ac  2c  3c  4c  5c  6c  7c  8c  9c  Tc  Jc  x   Qc  Kc  x                           

Wo xwir keine Charaktere suchen (die vier in der CSpalte sind "Ritter"; drei in Fsind "Joker"; einer in 0ist generisch; der Rest sind reservierte Charaktere).

Als solches können wir 0x1F0A1 = 127137 (As) mit einem Wert versehen, um die gewünschte Karte zu finden.

Der hinzuzufügende Wert wird nur durch drei Dinge erschwert:

1. Wir müssen die Anzüge neu anordnen (von s, h, d, c h, d, s, c)
2. Wir müssen die Reihen von (A, 2, ..., K bis 2, ..., K, A) neu ordnen
3. Wir müssen die Spalten ohne Karten von Interesse vermeiden.

Wenn Sie die Option "Ein-Index" verwenden, können Sie mithilfe der negativen Ganzzahldivision [6,0,4,2][-n//13]*8+(effektiv [48,0,32,16][-n//13]) eine Reihe von zeilenweisen Offsets für die Nachbestellung der Farbe indizieren. Sie können dann auch die Asse an den richtigen Stellen mit platzieren n%13+und dann die vermeiden Ritter in der Spalte Cmit n%13//11+(effektiv (n%13>10)+).

Perl6 / Rakudo 70 Bytes

Index 0

Verwenden perl6 -peund ohne Wörterbuchkomprimierung:

chr('🂱🃁🂡🃑'.ords[$_/13]+($_+1)%13*1.091).uniname.substr(13)

Es sucht einfach die Karte in Unicode (beginnend mit dem Ass), fragt nach dem Namen und verwendet diesen. Dies ist eine ähnliche Route (obwohl ich es damals noch nicht wusste!) Zu Jonathan Aitkens Python-Antwort - nur ich indexiere aus allen 4 Assen anstatt aus 4 Offsets aus dem Pik-As und multipliziere mit 1,091, um den Index zu erhalten runden Sie den Knight-Eintrag in Unicode ab.

Alle Ausgaben anzeigen (für Eingabewerte von 0 bis 51) https://glot.io/snippets/ez5v2gkx83

Bearbeitet, um mit Knights im Unicode-Deck fertig zu werden, da Unicode.

Perl6 ♥ Unicode

05AB1E , 54 Bytes

0-indiziert

“»€Å‹¡Šdesž…“#“‚•„í†ìˆÈŒšï¿Ÿ¯¥Š—¿—ÉŸÄ‹ŒÁà“#âí" of "ýsè

Probieren Sie es online!

Erläuterung

“»€Å‹¡Šdesž…“#                                          # push list of suits
              “‚•„í†ìˆÈŒšï¿Ÿ¯¥Š—¿—ÉŸÄ‹ŒÁà“#             # push list of ranks
                                           â            # cartesian product
                                            í           # reverse each
                                             " of "ý    # join on " of "
                                                    sè  # index into cardlist with input

Python 2 , 167 148 Bytes

n=input();print 'two three four five six seven eight nine ten jack queen king ace'.split()[n%13]+' of '+['hearts','diamonds','spades','clubs'][n/13]

Nullindexiert.

Probieren Sie es online!

BEARBEITEN: Bubbler hat mit der Aufteilungsmethode (und einer kürzeren Antwort) einen großartigen Punkt gemacht. Im zweiten Block liefert split () die gleiche Byteanzahl.

R , 154 Bytes

paste(el(strsplit("Two,Three,Four,Five,Six,Seven,Eight,Nine,Ten,Jack,Queen,King,Ace",",")),"of",rep(c("Hearts","Diamonds","Spades","Clubs"),e=13))[scan()]

Probieren Sie es online!

Nimmt die Eingabe (1-indiziert) von STDIN und source(...,echo=T)gibt das Ergebnis mit an die Konsole aus.

It's not pretty, BUT it comes in 2 bytes shorter than the best solution I could using outer (presented below), so let this be a reminder to examine another approach!

paste(                          # concatenate together, separating by spaces,
                                # and recycling each arg to match the length of the longest
el(strsplit("Two,...",",")),    # split on commas and take the first element
"of",                           # 
 rep(c("Hearts",...),           # replicate the suits (shorter as a vector than using strsplit
               e=13)            # each 13 times
                    )[scan()]   # and take the input'th index.

R, 156 bytes

outer(el(strsplit("Two,Three,Four,Five,Six,Seven,Eight,Nine,Ten,Jack,Queen,King,Ace",",")),c("Hearts","Diamonds","Spades","Clubs"),paste,sep=" of ")[scan()]

Try it online!

Essentially the same as above; however, outer will do the recycling properly, but having to set sep=" of " for the paste made this just a hair longer.

Emojicode, 202 bytes

🍇i🚂😀🍪🍺🐽🔫🔤two.three.four.five.six.seven.eight.nine.ten.jack.queen.king.ace🔤🔤.🔤🚮i 13🔤 of 🔤🍺🐽🔫🔤hearts.diamonds.spades.clubs🔤🔤.🔤➗i 13🍪🍉

0 indexed. Try it online!

Explanation:

🍇		start of the closure block
  i🚂		 closure takes an integer argument i
  😀		 print:
    🍪		  concatenate these strings:
      🍺🐽🔫🔤...🔤🔤.🔤🚮i 13  [a]
      🔤 of 🔤
      🍺🐽🔫🔤...🔤🔤.🔤➗i 13  [b]
    🍪
🍉

[a]:
🍺		tell Emojicode to dereference without checking
🐽		 get the nth element of the following array
  🔫		  create an array using the following string and separator
    🔤...🔤
    🔤.🔤
  🚮 i 13	n, i mod 13

[b]
🍺🐽🔫🔤...🔤🔤.🔤➗i 13
same but with ⌊i÷13⌋

Excel, 156 bytes

=TRIM(MID("two  threefour five six  seveneightnine ten  jack queenking ace",1+MOD(A1,13)*5,5))&" of "&CHOOSE(1+(A1/13),"hearts","diamonds","spades","clubs")

Cards from 0-51. Unfortunately, Excel does not feature a function to convert 1 to "one"...

Using TRIM and MID is shorter than using CHOOSE for the face values, but longer than using CHOOSE for the Suit.

Java 8, 141 bytes

n->"two;three;four;five;six;seven;eight;nine;ten;jack;queen;king;ace".split(";")[n%13]+" of "+"hearts;diamonds;spades;clubs".split(";")[n/13]

Input is 0-indexed.

Explanation:

Try it online.

n->         // Method with integer parameter and String return-type
  "two;three;four;five;six;seven;eight;nine;ten;jack;queen;king;ace".split(";")[n%13]
            //  Take `n` modulo-13 as 0-indexed card value
   +" of "  //  append " of "
   +"hearts;diamonds;spades;clubs".split(";")[n/13]
            //  append `n` integer-divided by 13 as 0-indexed suit

Kotlin, 154 152 140 bytes

i->"two,three,four,five,six,seven,eight,nine,ten,jack,queen,king,ace".split(',')[i%13]+" of ${"heart,diamond,spade,club".split(',')[i/13]}s"

Try it online!

Updated to use just lambda expression.

JavaScript ES6, 124 118 Bytes, 0-index

F= x=>(h=btoa`O
?NÞ{ñhº¿Å÷¿J,IëÞñ"6)Þý7§üô.yéÿ*)àüÿÿÿæ«·÷bjj'wû)i׿r[`.split`/`)[x%13]+` of ${h[x/13|16]}s`

console.log (F(51))

Base64 version

eD0+KGg9YnRvYWBPCj9OGt578Wi6v8WK979KLH9J696f8SKCG382Kd79N6f8lpyT9C556f8qKeD8Bx7///+F5qu392Jqaid3+ylp179yW5tgLnNwbGl0YC9gKVt4JTEzXStgIG9mICR7aFt4LzEzfDE2XX1zYA==

Stax, 58 57 56 bytes

î↑à■?R╢8«E▄¡╔ÿ•L╫<<⌠ï∞∟⌡♪Ös1"TàLα╥▀¢¡◄└%≈δñM;;}'░o=⌡»╬í√

Run and debug it

Here's the commented ungolfed representation of the same program. It uses stax's compressed literals heavily. The input is 0-indexed. It's Emigna's 05AB1E algorithm.

`SsUI'S~pTU5T@T^Ez+`j   suits
`fV:l7eTkQtL*L2!CZb6u[&YNO4>cNHn;9(`j   ranks
|*  cross-product
@   index with input
r   reverse pair
`%+(`*  join with " of "

Run this one

Bash, 133 bytes

V=(two three four five six seven eight nine ten jack queen king ace hearts diamonds spades clubs)
echo ${V[$1%13]} of ${V[$1/13+13]}

Choosing to use 0 based as per the option given, supporting 0 (two of hearts) through 51 (ace of clubs)

Husk, 52 bytes

;↔!Πmw¶¨×‼sÿẋδẎ₆ṡ⁷Ḃ6‰fωθ»&⌈θƒV₆x⁵▼Ëġ`nıEṅ'jĊk⁸"eïkÄc

Try it online!

I'm always happy to show off Husk's string compression system :D

Explanation

The majority of the program (from ¨ onwards) is obviously a compressed string. When uncompressed it turns into:

hearts diamonds spades clubs
of
two three four five six seven eight nine ten jack queen king ace

The program then is:

;↔!Πmw¶¨…
       ¨…    The previous string
      ¶      Split on lines
    mw       Split each line into words
             - we now have a list of lists of words
   Π         Cartesian product of the three lists
             - with this we obtain all possible combinations of suits and values
               with "of" between the two (e.g. ["spades","of","king"])
  !          Pick the combination at the index corresponding to the input
 ↔           Reverse it, so words are in the correct order
;            Wrap it in a list. Result: [["king","of","spades"]]

There are a couple of things left to explain:

• We build the cards with suits before values because of how the cartesian product Π works: if we did it the other way around, the list of cards would be ordered by value (i.e. two of hearts, two of diamonds, two of spades, two of clubs, three of hearts...). As a consequence, we have to reverse our result.

• The result of the program is a two-dimensional matrix of strings. This is automatically printed by Husk as a single string built by joining rows of the matrix with newlines and cells with spaces. The reason we build this matrix instead of using the more straightforward w (join a list of words with spaces) is that if using w the type inferencer guesses another interpretation for the program, producing a different result.

mIRCScript, 157 bytes

c echo $token(ace two three four five six seven eight nine ten jack queen king,$calc(1+$1% 13),32) of $token(clubs spades diamonds hearts,$calc(-$1// 13),32)

Load as an alias, then use: /c N. mIRC is 1-indexed, so floor division (//) on the negative value of the input produces -1 to -4 as required.

C (gcc), 148 bytes

f(n){printf("%.5s of %.7ss","two\0 threefour\0five\0six\0 seveneightnine\0ten\0 jack\0queenking\0ace"+n%13*5,"heart\0 diamondspade\0 club"+n/13*7);}

Try it online!

0-based.

Haskell, 132 bytes

(!!)[v++" of "++s|s<-words"hearts diamonds spades clubs",v<-words"two three four five six seven eight nine ten jack queen king ace"]

Try it online!

An anonymous function, using list comprehension to build all the combinations of suit and value, and indexing into the resulting list with the input.

F#, 174 168 bytes

Removed some extra whitespace as noted by Manish Kundu. Thanks!

let c x=["two";"three";"four";"five";"six";"seven";"eight";"nine";"ten";"jack";"queen";"king";"ace"].[(x-1)%13]+" of "+["hearts";"diamonds";"spades";"clubs"].[(x-1)/13]

Try it online!

I'll be honest - I'm new at code golf, so I don't know if it's more appropriate to answer with a pure function like this (with parameters, but no I/O) or with a working code block with user I/O.

Octave, 155 153 151 150 bytes

@(x)[strsplit(' of ,s,heart,diamond,spade,club,ace,two,three,four,five,six,seven,eight,nine,ten,jack,queen,king',','){[mod(x,13)+7,1,ceil(2+x/13),2]}]

Try it online!

This creates a string starting with ' of ' and 's', then all the suits followed by all the ranks. This string is split at commas into separate strings. The suits are before the ranks, because since that saves a byte when creating the indices. After this, we index it using square brackets with the following indices:

{[mod(x,13)+7,1,ceil(2+x/13),2]}

which is the rank, followed by the first element ' of ', followed by the suit, followed by 's'.

Having the 's' as part of the suits (hearts,diamonds,spades,clubs) instead of a separate string is the exact same length but less fun.

Splitting on the default separator would save 4 bytes in the strsplit-call, but the spaces around ' of ' would be removed and would have to be added manually, costing more bytes.

V, 154 147 144 142 Bytes

-7 Bytes thanks to DJMcMayhem

13i1heart
2diamond
3spade
4club
ÚGxCtwo
three
four
five
six
seven
eight
nine
ten
jack
queen
king
aceH$A of 012j$d4ñ13jPñÍ «/ 
{ÀjYHVGpAs

Try it online!

Hexdump:

00000000: 3133 6931 6865 6172 740a 3264 6961 6d6f  13i1heart.2diamo
00000010: 6e64 0a33 7370 6164 650a 3463 6c75 620a  nd.3spade.4club.
00000020: 1bda 1647 7843 7477 6f0a 7468 7265 650a  ...GxCtwo.three.
00000030: 666f 7572 0a66 6976 650a 7369 780a 7365  four.five.six.se
00000040: 7665 6e0a 6569 6768 740a 6e69 6e65 0a74  ven.eight.nine.t
00000050: 656e 0a6a 6163 6b0a 7175 6565 6e0a 6b69  en.jack.queen.ki
00000060: 6e67 0a61 6365 1b16 4824 4120 6f66 201b  ng.ace..H$A of .
00000070: 3016 3132 6a24 6434 f131 336a 50f1 cd20  0.12j$d4.13jP.. 
00000080: ab2f 200a 7bc0 6a59 4856 4770 4173       ./ .{.jYHVGpAs

C#, 219 207 202 197 bytes (0 indexed)

static string O(int i){string[]s={"two","three","four","five","six","seven","eight","nine","ten","jack","queen","king","ace","hearts","diamonds","spades","clubs"};return s[i%13]+" of "+s[i/14+13];}

thanks to input from @Ciaran_McCarthy and @raznagul

Takes an input of int I, subtracts 1 to match 0 indexing of the string array and outputs the number based on I mod 13 and the suit based on i/14+13.

works pretty well for my second code golf, just wondering if i could get it shorter using LINQ or something else.

PowerShell, 207 192 182 174 165 163 161 157 bytes

0-Indexed

$args|%{(-split'two three four five six seven eight nine ten jack queen king ace')[$_%13]+' of '+('hearts','diamonds','spades','clubs')[$_/13-replace'\..*']}

Try it online!

4 bytes saved thanks to AdmBorkBork in the comments

CJam, 114 bytes

riDmd"two three four five six seven eight nine ten jack queen king ace"S/=" of "@"hearts diamonds spades clubs"S/=

Try it online!

Zero-indexed. Will probably be beaten by languages with dictionary compression, but oh well...

Jelly, 61 bytes

d13Uị"“¢¶/CŻ)Gụ+Ḷ}ċ<ʂḤaỴ£k7Ỵ€^ḥæ]¿9Ụ“¡¢|hḂṗƬßĖ,$ðĿȧ»Ḳ€¤j“ of 

0-indexing. Try it online!

Julia 0.6, 156 bytes

f(n)=print(split(" of ,hearts,diamonds,spades,clubs,two,three,four,five,six,seven,eight,nine,ten,jack,queen,king,ace",',')[[(n-1)%13+6,1,div(n-1,13)+2]]...)

Try it online!

-2 bytes thanks to @Stewie Griffin

Haskell, 144 bytes

f n=words"two three four five six seven eight nine ten jack queen king ace"!!(n`mod`13)++" of "++words"hearts diamonds spades clubs"!!(n`div`13)

Try it online!

This hits all kinds of Haskell's pain points.

SOGL V0.12, 53 bytes

ķζ≡◄Τū┌p9P7šH□≡⅝'╗ΦqΖ▒ƨM.‘θ.wo"C█}y1+►ΚqΚ‘θJ¼ o.'⁰/wp

Try it Here!

Javascript 149 143 140 bytes

a=_=>"two three four five six seven eight nine ten jack queen king ace".split` `[_%13]+' of '+["hearts","diamonds","spades","clubs"][_/13|0]

-3 bits thanks to @rick hitchcock

a=_=>"two three four five six seven eight nine ten jack queen king ace".split` `[_%13]+' of '+["hearts","diamonds","spades","clubs"][_/13|0]
console.log(a(14))
console.log(a(34))
console.log(a(51))
console.log(a(8))
console.log(a(24))

Perl 5 -p, 119 bytes

0-based

$_=(TWO,THREE,FOUR,FIVE,SIX,SEVEN,EIGHT,NINE,TEN,JACK,QUEEN,KING,ACE)[$_%13].' OF '.(HEART,DIAMOND,SPADE,CLUB)[$_/13].S

Try it online!

Japt, 91 86 bytes

0-indexed.

I used a tool written by @Shaggy to generate the compressed lists.

`{`twodÈ(‚fÆfivÀ£xç P ightdÍÂdȈjackdquÁÈkˆg»­`qd gU}  {`Ê#tsk¹aÚˆäi£kclubs`qk gUzD

Try it online!

Explanation:

The first compressed string contains the card values delimited by d. The second compressed string contains the card ranks delimited by k.

These chars were picked using Shaggy's tool, which generates a string delimited by a char that is optimally compressed using shoco (the compression that Japt uses). This allows us to create a list of card values and ranks.

We use backticks ` to decompress these strings, then we split the string using q, followed by the char to split on.

Once we have the lists, we map through the card values, then we get the index of the input. It is important to note that Japt wraps its indexes, so we don't have to modulo by 13.

At each item, we loop through the card ranks. We get the index by dividing the input by 13.

Once we have both items, we concatenate them with " of ", which produces the final string.

Jelly, 58 55 bytes

“ıĿ⁽⁷lg3e/“ẏ“£Ṣ¢÷yḊ⁾⁶ƭ⁼ẎẇḄṡ¿Onṃ⁶ḂḂfṠȮ⁻ẉÑ%»Ḳ€p/⁸ịṚj“ of 

Try it online!