I'm trying to use this code, with the input 072101108108111044032087111114108100033010: int s[100] = {0}; scanf("%[^D]",&s); This works fine at first: puts(s); // displays 072101108108111044032087111114108100033010 But this gets really borked: printf("%d",s[0]); // prints 825374512 Wh...

In this challenge, you must take a string matching the regex ^[a-z]+$ or ^[A-Z]+$, or ^[A-Z][a-z]+$ or whatever is reasonable, (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 rece...

Based on this challenge, you must determine if a string is covfefey, that is, could it have been produced as output from a covfefifier? The string will be composed of only alphabet chars (^[a-z]\*$, ^[A-Z]\*$ are possible schemes for input. change the regexs appropriately if using caps) To do t...