Covfefify a string

Question 1

In this challenge, you must take a string matching the regex ^[a-zA-Z]+$ or whatever is reasonable (you don't have to consider uppercase or lowercase letters if you want) (you may assume the string is long enough, and has the right structure for all the operations), and output another string, produced similarly to word at the end of a recent dadaist tweet by the POTUS ("Despite the constant negative press covfefe").

How to covfefify a string:

First, get the first sound group (made up terminology).

How do you do this? Well:

Find the first vowel (y is also a vowel)
```
 v
creation
```
Find the first consonant after that
```
 v
creation
```
Remove the rest of the string
```
creat
```

That is your first sound group.

Next step:

Get the last consonant of the sound group

and replace it with the voiced or voiceless version. To do this, find the letter in this table. Replace with the letter given (which may be the same letter)

b: p
c: g
d: t
f: v
g: k
h: h
j: j
k: g
l: l
m: m
n: n
p: b
q: q
r: r
s: z
t: d
v: f
w: w
x: x
z: s

so, we get

Then, take the next vowel after that consonant. You can assume that this consonant is not at the end of the string. Join these two together, then repeat it twice:

didi

Concatenate this to the first sound group:

creatdidi

You're done: the string is covfefified, and you can now output it.

Test cases:

coverage: covfefe
example: exxaxa
programming: progkaka (the a is the first vowel after the g, even though it is not immediately after)
code: codtete
president: preszizi

This is code-golf, so please make your program as short as possible!

Question 2

"x" should technically map onto "gz". "qu" should map onto "gw".

Question 3

Answers over 140 characters should be disqualified

Question 4

Unfortunately it is impossible to do this in TrumpScript :(

Question 5

@ThePlasmaRailgun dude...

Question 6

@ThePlasmaRailgun It was a joke, since tweets have to be 140 characters or less.

Question 7

Jelly, (削除) 58 (削除ここまで) 57 bytes

<TḢị
e€Øyμ¬TĖEÐḟḢṪ;ç\T
ḣÇḢ8ÇịμḢØYiị"ßȷ%Hẹrȧq’œ?ØY¤)cgy;ẋ2

A full program that accepts a list of lowercase characters and prints the result.

Try it online!

How?

<TḢị - Link 1, extract first value from y not less than x: number, x; list of numbers, y
 - e.g. 5, [3,4,7]
< - x less than vectorised across y [0,0,1]
 T - truthy indices [ 3]
 Ḣ - head 3
 ị - index into y 7
e€Øyμ¬TĖEÐḟḢṪ;ç\T - Link 2, indices of the letters to manipulate: list of characters, w
 Øy - vowel+ yield = "AEIOUYaeiouy" e.g. "smouching" 
e€ - exists in for €ach letter in w 001100100
 μ - monadic chain separation, call that v
 ¬ - not vectorised across v 110011011
 T - truthy indices 12 56 89
 Ė - enumerate [[1,1],[2,2],[3,5],[4,6],[5,8],[6,9]]
 Ðḟ - filter discard if:
 E - elements are equal [[3,5],[4,6],[5,8],[6,9]]
 Ḣ - head [3,5]
 Ṫ - tail 5
 T - truthy indices of v 34 7
 \ - last 2 links as a dyad
 ç - call last link (1) as a dyad 7
 ; - concatenate 5,7
 - ...i.e the indexes of 'c' and 'i'
ḣÇḢ8ÇịμḢØYiị"ßȷ%Hẹrȧq’œ?ØY¤)cgy;ẋ2 - Main link: list of characters, w
 - e.g. "smouching"
 Ç - call the last link (2) as a monad [5,7]
ḣ - head to index (vectorises) ["smouc","smouchi"]
 Ḣ - head "smouc"
 - implicit print due to below leading constant chain
 8 - link's left argument, w
 Ç - call the last link (2) as a monad [5,7]
 ị - index into w "ci"
 μ - monadic chain separation, call that p
 Ḣ - head p 'c'
 ØY - consonant- yield = "BCDFGHJKLMNPQRSTVWXZbcdfghjklmnpqrstvwxz"
 i - first index 22
 ¤ - nilad followed by link(s) as a nilad:
 "ßȷ%Hẹrȧq’ - base 250 number = 1349402632272870364
 ØY - consonant- yield = "BCDFGHJKLMNPQRSTVWXZbcdfghjklmnpqrstvwxz"
 œ? - nth permutation = "BCDFGHJKLMNPQRSTVWXZpctvkhjglmnbqrzdfwxs"
 ị - index into (special case ->) 'c'
 )cg - literal ['c','g']
 y - translate (change 'c's to 'g's) 'g'
 ; - concatenate with the headed p "gi"
 ẋ2 - repeat list twice "gigi"
 - implicit print ...along with earlier = smoucgigi

Question 8

This is amazing...

Question 9

Incredible work.

Question 10

I'm jelly. Upvoted.

Question 11

This is the weirdest programming language I've ever seen.

Question 12

@Ryan it's intended for golfing.

Question 13

JavaScript (ES6), (削除) 107 (削除ここまで) 103 bytes

Saved 4 bytes thanks to GOTO 0

s=>([,a,b,c]=s.match`(.*?[aeiouy]+(.)).*?([aeiouy])`,a+(b=(a="bcdfgszkvtgp")[11-a.search(b)]||b)+c+b+c)

Test cases

let f =
s=>([,a,b,c]=s.match`(.*?[aeiouy]+(.)).*?([aeiouy])`,a+(b=(a="bcdfgszkvtgp")[11-a.search(b)]||b)+c+b+c)
console.log(f("creation"))
console.log(f("coverage"))
console.log(f("example"))
console.log(f("programming"))
console.log(f("president"))

Question 14

You can save a few bytes like this: s=>([,a,b,c]=s.match`(.*?[aeiouy]+(.)).*?([aeiouy])`,a+(b=(a="bcdfgszkvtgp")[11-a.search(b)]||b)+c+b+c)

Question 15

@GOTO0 Thanks, updated.

Question 16

Jelly, (削除) 45 (削除ここまで) 39 bytes

Øa"œṣ$b|0Ḃ’ṃ,Ṛ$yṫμfØyḢṭḢẋ2
e€ØyIi-‘ɓḣ;ç

Try it online!

How it works

e€ØyIi-‘ɓḣ;ç Main link. Argument: s (string)
 Øy Vowels with y; yield "AEIOUYaeiouy".
e€ Test each character in s for membership.
 I Increments; compute the forward differences of the
 resulting array of Booleans.
 i- Find the first index of -1.
 ‘ Increment this index to find the index of the first
 consonant that follows a vowel.
 Let's call this index j.
 ɓ Begin a new chain. Left argument: s. Right argument: j
 ḣ Head; yield the first j characters of s.
 ç Call the helper link with arguments s and j.
 ; Concatenate the results to both sides.

Øa"œṣ$b|0Ḃ’ṃ,Ṛ$yṫμfØyḢṭḢẋ2 Helper link. Left argument: s. Right argument: j
Øa Alphabet; set the return value to "abc...xyz".
 "œṣ$b|0Ḃ’ Yield 7787255460949942. This is a numeric literal in
 bijective base 250. The value of each digit matches its
 1-based index in Jelly's code page.
 ṃ Convert 7787255460949942 to base 26, using the digts
 a = 1, b = 2, ..., y = 25, z = 0.
 This yields "bcdfkszgvtgp".
 ,Ṛ$ Pair the result with its reverse, yielding
 ["bcdfkszgvtgp", "pgtvgzskfdcb"].
 ṫ Call tail with arguments s and j, yielding the j-th and
 all following characters of s.
 y Translate the result to the right according to the
 mapping to the left, i.e., replace 'b' with 'p', 'c'
 with 'g', etc. 'g' appears twice in the first string
 of the mapping; only the first occurrence counts.
 Let's call the resulting string r.
 μ Begin a new chain. Argument: r
 fØy Filter; remove non-vowels from r.
 Ḣ Head; take the first vowel.
 Ḣ Head; take the first character/consonant of r.
 ṭ Tack; append vowel to the consonant.
 ẋ2 Repeat the resulting string twice.

Question 17

sorry, buddy, looks like you missed out on the mega jelly rep

Question 18

tfw an answer looks overly simplistic but is in fact really wonderful...simple is beautiful

Question 19

CJam, (削除) 59 (削除ここまで) (削除) 58 (削除ここまで) (削除) 57 (削除ここまで) 56 bytes

q_{"aeiouy":V&,_T|:T^}#)/(_W>"cbdfkszgvtpg"_W%er@sV&0=+_

Try it online!

Explanation

q_ e# Read the input and copy it.
{ e# Find the index of the first char for which the following is true:
 "aeiouy":V e# Push "aeiouy" and store it in V.
 &, e# Check if the current char is in the vowel string (0 or 1).
 _T|:T e# Copy the result and OR with T (T is initially 0), storing back in T.
 ^ e# XOR with the original result. This will be 1 for the first 
 e# consonant appearing after a vowel.
}# e# (end find)
)/ e# Increment the index and split the string into chunks of that size.
( e# Pull out the first chunk.
_W> e# Copy it and get the last character (the consonant).
"cbdfkszgvtpg"_W%er e# Transliterate the consonant to voiced/voiceless alternative.
@s e# Bring all the other split chunks to the top and join them together.
V&0= e# First char of the set intersection of that and the vowels.
 e# (i.e. the first vowel in the second half)
+ e# Concatenate the new consonant and the vowel.
_ e# Duplicate the result of that.
 e# Implicit output of stack contents.

Question 20

CJam beats Jelly? :O (At least, it beats the Jelly answer everybody seems to be upvoting.)

Question 21

C, (削除) 219 (削除ここまで) (削除) 213 (削除ここまで) (削除) 206 (削除ここまで) (削除) 179 (削除ここまで) 175 bytes

#define p putchar
#define q(a)for(;a strchr("aeiouy",*s);p(*s++));
f(s,c,h)char*s;{q(!)q()p(*s);p(c="pgt vkh jglmn bqrzd fwx s"[*s-98]);p(h=s[strcspn(s,"aeiouy")]);p(c);p(h);}

Try it online!

Question 22

Does *p=putchar work as the first line?

Question 23

Sorry disqualified. Can't fit in a tweet.

Question 24

171 bytes

Question 25

12 or so bytes can be shaved off by replacing #defines and the function with preprocessor flags (-D...).

Question 26

Actually tweetable now because twitter allows 280 chars.

Question 27

Perl 5, (削除) 81 (削除ここまで) (削除) 72 (削除ここまで) 71 bytes

-1 byte thanks to Xcali!

s![aeiouy]+(.)\K.*!(1ドル=~y/bdfgpstvzck/ptvkbzdfsg/r.$&x/[aeiouy]/g)x2!ge

Try it online!

Question 28

You and I had the same idea with \K, but you did it 9 bytes better than I did. Good answer!

Question 29

This can save a byte by reordering the translation: Try it online!

Question 30

PHP, 121 Bytes

$v=aeiouy;preg_match("#(.*?[$v]+([^$v])).*?([$v])#",$argn,$t);echo$t[1],$z=strtr($t[2].$t[3],bcdfgkpstvz,pgtvkgbzdfs),$z;

Try it online!

Question 31

-2 bytes: echo$t[1],$z=strtr($t[2].$t[3],bcdfgkpstvz,pgtvkgbzdfs),$z;

Question 32

@Titus I have not think about that. Thank You

Question 33

why not rename $argn to something shorter? $a, for example - that's -3 bytes

Question 34

@TylerSebastian I must have an input variable that exists. Yes I can create a function but if I do it it raise the byte count more as use the three bytes

Question 35

ah ok sorry I forgot how PHP does command line args - I just saw that you had defined it in the header section but failed to realize it was a reserved variable.

Question 36

Pyth, 54 bytes

L+hb?>F}RJ"aeiouy"<b2+hKtb*2+XhK"cgdsfbpvztkg")h@JKytb

This defines a function y, that expects a string. Try it online: Test Suite

Question 37

Python 3, (削除) 155 (削除ここまで) 139 bytes

import re
def f(x,k='aeiouy])'):b,c,v=re.findall(f'(.*?[{k}([^{k}.*?([{k}',x)[0];return b+c+(('bcdfgkpstvz'+c)['pgtvkgbzdfs'.find(c)]+v)*2

removed 16 bytes thanks to @ovs

removed 1 byte thanks to Gábor Fekete

Question 38

You could create a variable which has the value 'aeiouy]', maybe that will save some bytes. Also you can remove some characters from the replacement strings as there are the same.

Question 39

I can't remove the identical characters from the replacement string, because that would be an IndexError, and saving aeiouy]) doesn't save any bytes.

Question 40

if you pull out something like s='aeiouy])', you could use b,c,v=re.findall('(.*?[%s([^%s.*?([%s'%(s,s,s). It's not shorter, but might lead towards a way to shorten it overall.

Question 41

Shortened to 139 bytes

Question 42

Using f-strings will save 1 byte: k='aeiouy])' and f'(.*?[{k}([^{k}.*?([{k}'

Question 43

Java 8, (削除) 243 (削除ここまで) (削除) 236 (削除ここまで) 222 bytes

s->{String q="[a-z&&[^aeiouy]]",a=s.replaceAll("(^"+q+"*[aeiouy]+"+q+").*","1ドル"),b="pgtvkhjglmnbqrzdfwxs".charAt("bcdfghjklmnpqrstvwxz".indexOf(a.charAt(a.length()-1)))+s.replaceAll(a+q+"*([aeiouy]).*","1ドル");return a+b+b;}

Uses .replaceAll regexes with capture groups to filter out the parts we don't want.

Explanation:

Try it here.

s->{ // Method with String parameter and String return-type
 // Temp String we use multiple times:
 String q="[a-z&&[^aeiouy]]",
 // Regex to get the first part (i.e. `creation` -> `creat` / `example` -> `ex`)
 a=s.replaceAll("(^"+q+"*[aeiouy]+"+q+").*","1ドル"), 
 // Get the trailing consonant and convert it
 b="pgtvkhjglmnbqrzdfwxs".charAt("bcdfghjklmnpqrstvwxz".indexOf(a.charAt(a.length()-1)))
 // Get the next vowel after the previous consonant from the input-String
 +s.replaceAll(a+q+"*([aeiouy]).*","1ドル");
 // Return the result:
 return a+b+b;
} // End of method

Question 44

Haskell, (削除) 143 (削除ここまで) (削除) 141 (削除ここまで) (削除) 138 (削除ここまで) (削除) 137 (削除ここまで) 136 bytes

z h=elem h"aeiouy"
f i|(s,(m,c:x))<-span z<$>break z i,j:_<-filter z x,d<-"pgt.vkh.jglmn.bqrzd.fwx.s"!!(fromEnum c-98)=s++m++[c,d,j,d,j]

Try it online!

Question 45

Awesome! Replacing nx with something one-lettered will save 2 bytes.

Question 46

declaring z outside of f and switching to guards instead of a let saves another two bytes: Try it online!

Question 47

And two more by combining (s,v)<-break z i,(m,c:x)<-span z v into (s,(m,c:x))<-span z<$>break z i.

Question 48

Could shave one more by putting the opening parenthesis next to the let, thanks!

Question 49

@Laikoni I don't understand the part about moving z out of f ?

Question 50

Python, (削除) 261 (削除ここまで) 260 bytes

def c(s,t='bpcgdtfvgksz'):
 q,r,t='aeiouy',range(len(s)),t+t[::-1]
 c=[i for i in r if i>[j for j in r if s[j]in q][0]and s[i]not in q][0]
 C=([t[2*i+1]for i in range(12)if s[c]==t[i*2]]or s[c])[0]
 return s[:c+1]+(C+s[[i for i in r if i>c and s[i]in q][0]])*2

A Non regex, Not esoteric solution. Took about 20 minutes to make, and an hour more to golf.

It probably has more list comprehension than the entire python standard library, mostly because I don't know regex...

Try it online! (With testcases)

Question 51

Python 2, (削除) 251 (削除ここまで) (削除) 246 (削除ここまで) (削除) 245 (削除ここまで) (削除) 239 (削除ここまで) (削除) 237 (削除ここまで) (削除) 234 (削除ここまで) (削除) 229 (削除ここまで) 211 bytes

First submission here.

def f(s):
 r=c='';n=0;w='aeiouy';a='bcdfghjklmnpqrstvwxz'
 for i in s:
 if n<2:r+=i
 if n<1and i in w:n=1
 if n==1and i in a:c='pgtvkhjglmnbqrzdfwxs'[a.index(i)];n=2
 if n==2and i in w:r+=c+i+c+i;break
 return r

Try it online!

Fellow golfers that helped me:

 Destructible Lemon / Wheat Wizard - 5 bytes
 Hubert Grzeskowiak - 1 byte
 musicman523 - 16 bytes

Question 52

Welcome to the site! I see you tried using tabs for indentation. If you replace each tab with a single space, it is functionally identical and actually shows up properly instead of as extra bytes

Question 53

While what Destructible Lemon said is correct, you can save even more bytes in you source by indenting the first level of your code with a single space and the second level with a single tab, this will make it a bit hard to display, but will save you 5 bytes.

Question 54

Is the semicolon at the end of line 4 necessary?

Question 55

@WaitndSee I think you can shorten some of your conditionals. First: you can change not n to n<1 for 2 bytes, since you know n will never be negative. Also you can change n==3 to n>2 since you know n will never be greater than 3. You can also use the Python tricks for conditionals to shorten the first and second-last even further: n=[n,1][i in w and n<1]; r+=[0,r][n<2]

Question 56

You can change r,v,c=('',)*3 to r=v=c='', since strings are immutable. I've tried a bunch of other clever tricks but frustratingly they are exactly as long. Also it may be worth adding a Try it online! link to your post

Question 57

Ruby, 90 bytes

->x{x[/(.*?#{$v='[aeiouy]'}+.).*?(#$v)/];1ドル+(1ドル[-1].tr('bcdfgkpstvz','pgtvkgbzdfs')+2ドル)*2}

Try it online!

Ungolfing it a bit, we have something equivalent to:

def covfefefify(x)
 v = '[aeiouy]'
 # Match x to a regular expression capturing:
 # Group 1:
 # some characters (non-greedy)
 # followed by some (greedy) non-zero number of vowels
 # followed by exactly one character
 # Ungrouped:
 # Some more (non-greedy) characters
 # Group 2
 # Exactly one other vowel
 # By switching between greedy and non-greedy matches, we can capture longest and shortest vowel/consonant sequences without writing out all the consonants
 x[/(.*?#{v}+.).*?(#{v})/]
 # Glue it back together, replace the necessary consonants, duplicate where needed
 1ドル+(1ドル[-1].tr('bcdfgkpstvz','pgtvkgbzdfs')+2ドル)*2
end

Question 58

Ruby, (削除) 175 (削除ここまで) (削除) 141 (削除ここまで) 110 bytes

->s{s=~/(.*?#{v='[aeiouy]'}+(#{c='[^aeiouy]'}))#{c}*(#{v})/;"#1ドル#{(2ドル.tr('bcdfgkpstvz','pgtvkgbzdfs')+3ドル)*2}"}

Try it online!

Saved 34 bytes thanks to Eric Duminil
Saved 31 bytes thanks to Value Ink + optimized suggested tr arguments

Ungolfed

covfefify = -> (s) {
 from = 'bcdfgkpstvz'
 to = 'pgtvkgbzdfs'
 vowels = "[aeiouy]"
 consonants = "[^aeiouy]"
 s.match(/(.*?#{vowels}+(#{consonants}))#{consonants}*(#{vowels})/)
 d = (2ドル.tr(from, to) + 3ドル) * 2
 "#1ドル#{d}"
}

Question 59

-34 bytes with Hash[*"bpcgdtfvgkkgpbsztdvfzs".chars]

Question 60

Since input seems guaranteed to be all alphabetical characters, c=[^aeiou] is shorter. Have the first interpolation for each variable assign it simultaneously for -2 bytes: /^(.*?${v='[aeiou]'}+(#{c='[^aeiou]})).../. Finally, 2ドル.tr("b-z","pgtevkhijgl-obqrzdufwxys") instead of the Hash solution.

Question 61

You can save 14 bytes by using subexpressions (\g<n>) instead of interpolation, plus another 14 using @ValueInk's [^aeiou] suggestion: s=~/^(.*?([aeiouy])+([^aeiou]))\g<3>*(\g<2>)/.

Question 62

Actually, that has a bug with programming -> progkaka, which I can't quite figure out.

Question 63

@Jordan unfortunately the subexpression call \g<3> updates the value of 3,ドル so we can't use this shortcut.

Question 64

Lexurgy, (削除) 288 (削除ここまで) (削除) 286 (削除ここまで) 281 bytes

Docs here.

Lexurgy is an online tool meant for conlangers (people who make constructed languages) to apply sound changes to their conlangs via a series of programmable rules. As such, this tool involves many string operations.

-2: remove the u and w classes and replace them with one-time substitutions.
-5: fix a bug with the example case, combine some rules into a single step

Class v {a,e,i,o,u}
Class c {p,t,k,f,s,c,b,d,g,v,z,g,h,j,l,m,n,q,r,w,x}
a:
@c *=>@c ;/$ @c* @v* _//{$ _,$ @c _}
b:
@c=>* /; _
c:
{@v,@c}=>* /; @v {@v,@c}* _
* {{p,t,k,f,s,c,x},{b,d,g,v,z,g,x}}1ドル=>1ドル {{b,d,g,v,z,g,x},{p,t,k,f,s,c,x}}/_ ;
e:
@c1ドル ;=>; 1ドル
f:
(@c @v)1ドル=>1ドル 1ドル/; _
;=>*

Ungolfed:

Class vowel {a,e,i,o,u}
Class unvoiced {p,t,k,f,s,c}
Class voiced {b,d,g,v,z,g}
Class consonant {@unvoiced,@voiced,h,j,l,m,n,q,r,w,x}
# find first consonant after first vowel
part-1:
 @consonant * => @consonant ; / $ @consonant* @vowel* _ // {$ _, $ @consonant _}
romanizer-a:
 unchanged
# delete the consonant after the seperator
part-2:
 @consonant => * / ; _
romanizer-b:
 unchanged
# remove everything except the second vowel
part-3:
 {@vowel, @consonant} => * / ; @vowel {@vowel, @consonant}* _
romanizer-c:
 unchanged
# voicings
part-4:
 * @voiced1ドル => 1ドル @unvoiced / _ ;
 * @unvoiced1ドル => 1ドル @voiced / _ ;
romanizer-d:
 unchanged
# swap mapped consonant and seperator
part-5:
 @consonant1ドル ; => ; 1ドル
romanizer-e:
 unchanged
# duplicate the `fe`
part-6:
 (@consonant @vowel)1ドル => 1ドル 1ドル / ; _
romanizer-f:
 unchanged
# remove the seperator
part-7:
 ; => *

score 94 · Accepted Answer · 2017-05-31 11:35:10Z

Jelly, (削除) 58 (削除ここまで) 57 bytes

<TḢị
e€Øyμ¬TĖEÐḟḢṪ;ç\T
ḣÇḢ8ÇịμḢØYiị"ßȷ%Hẹrȧq’œ?ØY¤)cgy;ẋ2

A full program that accepts a list of lowercase characters and prints the result.

Try it online!

How?

<TḢị - Link 1, extract first value from y not less than x: number, x; list of numbers, y
 - e.g. 5, [3,4,7]
< - x less than vectorised across y [0,0,1]
 T - truthy indices [ 3]
 Ḣ - head 3
 ị - index into y 7
e€Øyμ¬TĖEÐḟḢṪ;ç\T - Link 2, indices of the letters to manipulate: list of characters, w
 Øy - vowel+ yield = "AEIOUYaeiouy" e.g. "smouching" 
e€ - exists in for €ach letter in w 001100100
 μ - monadic chain separation, call that v
 ¬ - not vectorised across v 110011011
 T - truthy indices 12 56 89
 Ė - enumerate [[1,1],[2,2],[3,5],[4,6],[5,8],[6,9]]
 Ðḟ - filter discard if:
 E - elements are equal [[3,5],[4,6],[5,8],[6,9]]
 Ḣ - head [3,5]
 Ṫ - tail 5
 T - truthy indices of v 34 7
 \ - last 2 links as a dyad
 ç - call last link (1) as a dyad 7
 ; - concatenate 5,7
 - ...i.e the indexes of 'c' and 'i'
ḣÇḢ8ÇịμḢØYiị"ßȷ%Hẹrȧq’œ?ØY¤)cgy;ẋ2 - Main link: list of characters, w
 - e.g. "smouching"
 Ç - call the last link (2) as a monad [5,7]
ḣ - head to index (vectorises) ["smouc","smouchi"]
 Ḣ - head "smouc"
 - implicit print due to below leading constant chain
 8 - link's left argument, w
 Ç - call the last link (2) as a monad [5,7]
 ị - index into w "ci"
 μ - monadic chain separation, call that p
 Ḣ - head p 'c'
 ØY - consonant- yield = "BCDFGHJKLMNPQRSTVWXZbcdfghjklmnpqrstvwxz"
 i - first index 22
 ¤ - nilad followed by link(s) as a nilad:
 "ßȷ%Hẹrȧq’ - base 250 number = 1349402632272870364
 ØY - consonant- yield = "BCDFGHJKLMNPQRSTVWXZbcdfghjklmnpqrstvwxz"
 œ? - nth permutation = "BCDFGHJKLMNPQRSTVWXZpctvkhjglmnbqrzdfwxs"
 ị - index into (special case ->) 'c'
 )cg - literal ['c','g']
 y - translate (change 'c's to 'g's) 'g'
 ; - concatenate with the headed p "gi"
 ẋ2 - repeat list twice "gigi"
 - implicit print ...along with earlier = smoucgigi

14

\$\begingroup\$ This is amazing... \$\endgroup\$

Klangen
– Klangen

2017年05月31日 14:23:44 +00:00
Commented May 31, 2017 at 14:23
\$\begingroup\$ Incredible work. \$\endgroup\$

JF it
– JF it

2017年06月02日 13:22:49 +00:00
Commented Jun 2, 2017 at 13:22
11

\$\begingroup\$ I'm jelly. Upvoted. \$\endgroup\$

DeepS1X
– DeepS1X

2017年06月05日 05:01:29 +00:00
Commented Jun 5, 2017 at 5:01
7

\$\begingroup\$ This is the weirdest programming language I've ever seen. \$\endgroup\$

Ryan
– Ryan

2017年06月07日 16:57:28 +00:00
Commented Jun 7, 2017 at 16:57
\$\begingroup\$ @Ryan it's intended for golfing. \$\endgroup\$

Esolanging Fruit
– Esolanging Fruit

2017年07月17日 22:39:31 +00:00
Commented Jul 17, 2017 at 22:39

Covfefify a string

How to covfefify a string:

First, get the first sound group (made up terminology).

Next step:

50 Answers 50

Jelly, (削除) 58 (削除ここまで) 57 bytes

How?

JavaScript (ES6), (削除) 107 (削除ここまで) 103 bytes

Test cases

Jelly, (削除) 45 (削除ここまで) 39 bytes

How it works

CJam, (削除) 59 (削除ここまで) (削除) 58 (削除ここまで) (削除) 57 (削除ここまで) 56 bytes

Explanation

C, (削除) 219 (削除ここまで) (削除) 213 (削除ここまで) (削除) 206 (削除ここまで) (削除) 179 (削除ここまで) 175 bytes

Perl 5, (削除) 81 (削除ここまで) (削除) 72 (削除ここまで) 71 bytes

PHP, 121 Bytes

Pyth, 54 bytes

Python 3, (削除) 155 (削除ここまで) 139 bytes

Java 8, (削除) 243 (削除ここまで) (削除) 236 (削除ここまで) 222 bytes

Haskell, (削除) 143 (削除ここまで) (削除) 141 (削除ここまで) (削除) 138 (削除ここまで) (削除) 137 (削除ここまで) 136 bytes

Python, (削除) 261 (削除ここまで) 260 bytes

Python 2, (削除) 251 (削除ここまで) (削除) 246 (削除ここまで) (削除) 245 (削除ここまで) (削除) 239 (削除ここまで) (削除) 237 (削除ここまで) (削除) 234 (削除ここまで) (削除) 229 (削除ここまで) 211 bytes

Ruby, 90 bytes

Ruby, (削除) 175 (削除ここまで) (削除) 141 (削除ここまで) 110 bytes

Lexurgy, (削除) 288 (削除ここまで) (削除) 286 (削除ここまで) 281 bytes

Crystal, (削除) 203 (削除ここまで) (削除) 194 (削除ここまで) (削除) 187 (削除ここまで) (削除) 186 (削除ここまで) (削除) 184 (削除ここまで) 163 bytes

Retina, 68 bytes

!@#$%^&*()_+, (削除) 102 (削除ここまで) (削除) 101 (削除ここまで) (削除) 100 (削除ここまで) (削除) 99 (削除ここまで) 80 bytes

MATLAB / Octave - (削除) 159 (削除ここまで) 158 bytes

Explanation

Example Runs

Try it online!

Clojure, (削除) 182 (削除ここまで) 156 chars

How It Works

BlitzMax, 190 bytes

R, 341 characters

Python 3.8 (pre-release), 142 bytes

Perl, 71 bytes

05AB1E, (削除) 101 (削除ここまで) (削除) 104 (削除ここまで) 88 bytes

Explanation

Vim, 107 keystrokes

Explanation

05AB1E, (削除) 55 (削除ここまで) 42 bytes

Crystal, 130 Bytes

How it works

sed, 106 (105+1) bytes

Your Answer

Sign up or log in

Post as a guest

Post as a guest

Linked

Related

Hot Network Questions