Unreadable, 3924 bytes
This is the first time I implemented somewhat of a call-stack-like structure in Unreadable.
(The first version of this was over 5300 bytes, just to give an idea of how much I golfed this.)
'"""""'""'""""""'""""""'"""'""'""'""'""'""'""'"""""""'"""'""""""'""'"""'"""""""...
@QPaysTaxes Sorry for not responding earlier, I had to cook dinner. Make a class hierarchy that all inherits from one base class and make a your_lang_class_definition -> C++_class_definition transpiler.
Anonymous
@NathanMerrill So like Python with if __name__ == '__main__'
@Mego I'm not going to do something like that. I'm either going to make a main method, run root level code on initial file only, or require files to either have root level code or only have classes
king-of-the-hill Tron Bot Racing
It's time to begin annual Tron Racing Tournament. Create a bot that will steer your cycle to a victory!
Glossary
Board is a 100x100 square that wraps around its edges.
Game
Bots leave impassable trail. In the beginning of the game, all the bots participating ...
@Downgoat I don't think that it's that JavaScript is bad, it's just that it's a lot easier to write bad code in, and the node debugger may not be the easiest to use
Also, cheddar Grammars are hard to debug because of the large amounts of iterations
Oh, another problem is that you've got dx / dist when it should be dx / Math.sqrt(dist), and once that's done, the constant multiplier is totally unhelpful now.
Y'know how x = r * cos(theta) and y = r * sin(theta)? What's cos(theta)? It's adjacent over hypotenuse. x / r. That's exactly what is being used here - dx / sqrt(dist).
@Downgoat Yeah, I'm working on it. You still had planet.mass in the position update functions, so I took those out, and now I'm using a multiplier of 1e-10 and that's not small enough. :P
......I fixed it. Sorta. It now goes in an elliptical orbit, but it's fastest at the outermost end and slowest when closest to the sun. That is SO weird...
var f = 0.1; // speed up factor
var dx = planet.x - Sun.x;
var dy = planet.y - Sun.y;
var dist = Math.pow(dx, 2) + Math.pow(dy, 2);
var grav = 10 * f * Sun.mass / dist;
if (f2++ < 3) console.log(planet.x, planet.y, planet.velocityX, planet.velocityY);
planet.velocityX -= grav * (dx / Math.sqrt(dist));
planet.velocityY -= grav * (dy / Math.sqrt(dist));
if (f2 < 4) console.log(f / planet.mass);
planet.x += f * planet.velocityX;
planet.y += f * planet.velocityY;
@El'endiaStarman are you sure? Regardless of the rep, I greatly appreciate your help in helping me get this to work, but it's almost 11:00 for me so I should be going to get some sleep :)
as in <slider> <input> (for number) <slider> <input> (for exponent)
Um
Can I work on it for a while?
wait
@Downgoat Am I allowed to change it a lot?
Anonymous
6:24 AM
@Maltysen This is why I'm confused about your solution being unable to result in circle or parabola - even though Sage does some magical stuff with numerics behind-the-scenes, it still ultimately uses floating-point calculations to solve the linear system, and it is capable of correctly identifying each of the test cases.
def total_angle(line_segments, r):
return 2*sum(math.asin(c/(2*r)) for c in line_segments)
def find_radius(line_segments):
line_segments = sorted(line_segments)
lo, hi = max(line_segments) / 2, sum(line_segments)
while hi - lo > 1e-9:
mid = (lo + hi) / 2
largest_angle_left = 2*math.pi - total_angle(line_segments[:-1], mid)
if 2 * mid * math.sin(largest_angle_left/2) < line_segments[-1]:
lo = mid
else:
hi = mid
return lo
basically, you add up the resulting angles from every line segment except the biggest one
then you check if the length of the chord of the remaining angle matches the biggest segment
@MarsUltor They pass it around when they store documents on their session instead of the common server and are in vacation... Even though I could totally give others said document without needing it -_-
You'de be surprised of how unaware people are about where a sysadmin can go on its own network
@MarsUltor For some of them, it might be, but in most case, they have to give their password because they forgot that somebody might need that document
Heck, even if it's a temporary password, it's a bad idea to give access to your account to someone else!
Given a dictionary of words, you should write an autocomplete program or function.
Input
Your program/function will take a single parameter of input. This parameter can either be a string or an array of characters, and will consist of lowercase characters [a-z].
Output
You should print or ret...
Python 2, 191 bytes
from math import*
C=sorted(input());l,h=C[-1]/2,sum(C)
while h-l>1e-9:m=l+h;a=[asin(c/m)for c in C[:-1]];f=pi-sum(a);l,h=[l,m/2,h][m*sin(f)<C[-1]:][:2]
print sum(l*l*sin(2*t)for t in a+[f])/2
Uses a binary search to find the radius, then calculates the area of each segment ...
Unreadable, 3924 bytes
This is the first time I implemented somewhat of a call-stack-like structure in Unreadable.
(The first version of this was over 5300 bytes, just to give an idea of how much I golfed this.)
'"""""'""'""""""'""""""'"""'""'""'""'""'""'""'"""""""'"""'""""""'""'"""'"""""""...
king-of-the-hill Tron Bot Racing
It's time to begin annual Tron Racing Tournament. Create a bot that will steer your cycle to a victory!
Glossary
Board is a 100x100 square that wraps around its edges.
Game
Bots leave impassable trail. In the beginning of the game, all the bots participating ...
Given a dictionary of words, you should write an autocomplete program or function.
Input
Your program/function will take a single parameter of input. This parameter can either be a string or an array of characters, and will consist of lowercase characters [a-z].
Output
You should print or ret...
Python 2, 191 bytes
from math import*
C=sorted(input());l,h=C[-1]/2,sum(C)
while h-l>1e-9:m=l+h;a=[asin(c/m)for c in C[:-1]];f=pi-sum(a);l,h=[l,m/2,h][m*sin(f)<C[-1]:][:2]
print sum(l*l*sin(2*t)for t in a+[f])/2
Uses a binary search to find the radius, then calculates the area of each segment ...
