You have been employed by a data analysis company, and have been appointed the task of finding the average character of a string of characters. However, this company has limited funding for code storage, so your code must be as small as possible.
Task
Write a program or function that takes one ...
i feel like the best way to do this would be to use one of those sites where you are given two choices and choose the one you prefer, and eventually it's compared enough of them to enough other ones to show you the ranking you made
Vitsy, 11 Bytes
This was what this was MADE for.
IVzV1-\+V/O
I Get the length of the input stack.
V Save it as the final global variable, popping it.
z Push the input stack to the program stack.
V1-\ Repeat the next item global variable size - 1.
+ ...
Your task is to give three different languages A, B, C, and write two different programs P and Q such that:
P is a quine in language A, but not a quine in B nor C;
Q is a quine in language B, but not a quine in A nor C; and
Q concatenated after P (without any new characters added in between...
Cops and robbers (haven't figured out a nice name yet)
Cops:
Create a program with at least 2 bytes that prints an output of at least 3 printable ASCII characters. You must post your code, the language name, and the output, but can remove 20% of the characters in your code. You round down, so:
...
@ThomasKwa Pretty dang close. The only thing I could maybe see would be some different way of converting between binary and integer, as those .NET calls are killer
Find pattern in pixel carpet
[insert story why this needs to be as short as possible]
Given an image the goal is finding the biggest* connected* pattern of pixels, that occurs more than once. If there is more than one distinct pattern of maximum size, find the one that occurs more.
The output...
TI-BASIC, 44
Would be the right tool for the job if TI-BASIC had halfway decent string manipulation (I had to resort to overwriting the exponent of the number, displayed in engineering notation, with the unit). As it is it rounds and outputs correctly, but it's not even close to winning entries....
Pretty much any workaround is better than converting a number to a string in TI-BASIC
@flawr XD Not any good ones. I picked up on some. But first, I must say this: learning TI-Asm is a chunk of your life that you will never get back and will regret.
I was working on an HQ9+ program (HQ9+!!!) in Batch and people were like "Whoa, you're programming? That's so cool! I've never seen anybody do that before!"
You have been employed by a data analysis company, and have been appointed the task of finding the average character of a string of characters. However, this company has limited funding for code storage, so your code must be as small as possible.
Task
Write a program or function that takes one ...
Vitsy, 11 Bytes
This was what this was MADE for.
IVzV1-\+V/O
I Get the length of the input stack.
V Save it as the final global variable, popping it.
z Push the input stack to the program stack.
V1-\ Repeat the next item global variable size - 1.
+ ...
public static void main(String[] args)
{
// TODO code application logic here
double hypotenuseLength, hypotenuseArea;
Scanner input = new Scanner(System.in);
System.out.print("Enter length of hypotenuse: ");
hypotenuseLength = input.nextDouble();
hypotenuseArea =...
TeaScript, 14 bytes
ÇU(x¿lÅ)x¡/xn©
Probably can be golfed using a reduce
Ungolfed
C(U(xs``.m(#lc())x()/xn))
C( // Char from code from...
U( // Round
xs`` // Split input
.m(# // Map over input
lc() // get char code
).x() // Sum up array
/xn // Di...
Your task is to give three different languages A, B, C, and write two different programs P and Q such that:
P is a quine in language A, but not a quine in B nor C;
Q is a quine in language B, but not a quine in A nor C; and
Q concatenated after P (without any new characters added in between...
Cops and robbers (haven't figured out a nice name yet)
Cops:
Create a program with at least 2 bytes that prints an output of at least 3 printable ASCII characters. You must post your code, the language name, and the output, but can remove 20% of the characters in your code. You round down, so:
...
Julia, 25 bytes
a->char(sum(a)/length(a))
Find pattern in pixel carpet
[insert story why this needs to be as short as possible]
Given an image the goal is finding the biggest* connected* pattern of pixels, that occurs more than once. If there is more than one distinct pattern of maximum size, find the one that occurs more.
The output...
