Here's my code for a C++ Hill Climbing exercise trying to optimize the Egg Holding function. It works in >1 dimensions, here 2 is used.
#include <iostream>
#include <cmath>
#include <signal.h>
#include <unistd.h>
#include <pthread.h>
#include <array>
#include <float.h>
#include <sstream>
// glo...
I quickly wrote this program to transform quadratic expressions in general form into vertex form.
\$ax^2 + bx + c \;=\; a(x-h)^2 + k,\quad\text{where}\quad h = -\frac{b}{2a} \quad\text{and}\quad k = c - ah^2 = c - \frac{b^2}{4a}.\$
The actual conversion is easy, but with writing a lexer/parser ...
Current State:
I have two CSV files, their sample attached below:
FileOutputWithoutBuffer-Metrics.csv
File Length , Non-Buffered Time Taken (ns)
1000 , 5499114
2000 , 10971957
3000 , 15736008
4000 , 18970057
5000 , 22173215
6000 , 24612263
7000 , 26118520
8000 , 29934220
9000 , 31919477
10000...
Problem Definition
Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
$$\begin{array}{c|ccccccc|}
Symbol & Value \\
\hline
I & 1 \\
V & 5 \\
X & 10 \\
L & 50 \\
C & 100 \\
D & 500 \\
M & 1000 \\
\end{array}$$
For example, ...
Below is a python script that generates the sequence ['a', 'b' .. 'z', 'aa', 'ab' .. 'az', 'ba', 'bb' .. 'zz', 'aaa', 'aab', ..]
This is essentially counting in base 27, replacing every digit with the n-th letter of the alphabet, but skipping any number that would have a '0'.
import string
de...I was doing following question on leetcode: String to Integer (atoi)
Question:
Implement atoi which converts a string to an integer.
The function first discards as many whitespace characters as necessary
until the first non-whitespace character is found. Then, starting from
this ch...
I've written a stack implementation in R using S4 Classes. I would like feedback concerning anything with the application because it's my very first program in R. A main point of concern is how long it takes to create each method. The code is basically the same except for the body. It seems like ...
I've got some working code to compute the Hough transform for circles:
int *** allocate3DArray(int y, int x, int r) {
int ***array = (int***)malloc(sizeof(int**)*y);
for (int i = 0; i < y; i++) {
array[i] = (int**)malloc(sizeof(int*)*x);
for (int j = 0; j < x; j++) {
...
I'm trying to solve P1243E in an efficient manner. The problem in simple words is:
Given \$k\$ boxes, \$i\$-th box with \$n_i\$ numbers. All numbers are distinct. We need to select one number from each box and after permuting them in such a way that after putting them back into the boxes will...
So, this actually works nicely (we have > 2k repos) but I would really like it to start producing results right away as soon as it has any. Mostly so it seems faster than it is (by being more responsive)
bbrepos(){
local url=https://api.bitbucket.org/2.0/repositories/twengg
lo...
Today I found myself in need of programmatically getting a recursive list of the files on a remote FTP server to look for some data archives. Much to my surprise, I could not find this functionality implemented in some kind of Python library. So I decided to write a simple recursive version of ft...
I have the following function to save points cloud in PLOT3D format:
def write(filename, mesh):
"""
Write the mesh to filename in PLOT3D format.
filename: is the name of the output file.
mesh: is a numpy array of size (N,2) or (N, 3) where N is the number of points. mesh[i] is a ...
I reviewed the code in Resizable split DIVs Vue.js, suggesting that the OP use computed properties and bound styles. Below are two variants I devised. They are very similar, the main difference is that the second uses -1 for the initial values and ternary operators to check if the data values are...
This is the first time I get my hands on Rust and I'd like to have some feedback on this. Thank you for your help.
pub type Coordinate = (usize, usize);
pub type Dimension = (usize, usize);
pub type GridAction<T> = fn(target: &mut T);
pub struct Grid<T> {
column_count: usize,
row_count...
The libretro-backend crate provides a Rust-friendly way to implement the libretro C API. The latter requires one to implement methods
bool retro_load_game(const struct retro_game_info *game);
void retro_run(void);
void retro_unload_game(void);
which will be called in that order (on a single th...
Previous question:
Implementing simplified Jaipur board game
I've implemented the other features of the board game, and made a simple learning method that stores state values and makes optimal moves based on that.
I've used some oops concepts, but I'm not sure if that's the standardised way t...
I am trying to automate this portion of code in python (code shown for two polygons, I am trying to do the same for 10000 polygons). Any ideas on how to implement this using for loop or whichever fastest way you recommend..
### Polygon 1
def checkPolygon1(row):
point = Point((row['X']), (ro...
The 'friendly form' of a number is written as a sum of reciprocals of distinct positive integers. eg. $$\frac{4}{5} = \frac{1}{2} + \frac{1}{4} +\frac{1}{20}$$
I have written a python program that calculates the friendly form of an inputted fraction.
import math
from fractions import Fraction
...
