I don’t know Java, but since you included no Java code, I’ll just give pseudocode to how to do this: a = 70 / (70 + 100) b = 100 / (70 + 100) This normalizes the two values, and then you can just multiply a and b with $15 to get the proper ratio. … Read more
No Here’s the thing. If you bet Red or Black, winning double, your odds of winning are 7/15, or 46%. This means that on average, you will lose 8% of your bet with every spin of the wheel. Betting Green will break even. Betting on any other number, assuming the same 15x payout as betting … Read more
C++ How to distinguish Multimap with duplicate keys with value and and Unique keys with values in different map containers with O(n) traversal solved C++ How to distinguish Multimap with duplicate keys with value and and Unique keys with values in different map containers with O(n) traversal
If finding a count of how many times a specific digit appears in a number is what you mean, than the complexity will be O(n) where n is the length of the string (number): char x = ‘7’; std::string number(“9876541231654810654984431”); int count = 0; for (size_t i = 0; i < number.size(); ++i) if (number[i] … Read more
Try this: with open(‘file.out’, ‘w’) as output: for n in xrange(100000000): s = “{0:08d}”.format(n) output.write(s[:2] + ‘-‘ + s[2:] + ‘\n’) … But be aware that that’s a lot of combinations, it’s possible that you’ll run out of memory, and if not anyway the resulting file will be huge and the program will take a … Read more
int sign(int v) { return (v == 0) ? 0 : ((v > 0) ? 1 : -1); } int check(int v[], int n) // return 1 for true, 0 for false { int sign = 1; int count = 1; int sc = 0; for (int i = 0; i < n; i++) { … Read more
(multiply(cy, z/c) + y · (z mod c)) When c is the base of your representation (like decimal), then this is how multiplication can be done “manually”. It’s the “shift and add” method. In c-base cy is a single shift of y to the left (i.e. adding a zero at the right); and z/c is … Read more
when unpacking an iterable, the number of variables must match the values input being assigned. it depends on the values you are trying to unpack from the input. for instance, a,b= input() #12 print(a). #1 print(b). #2 You can easily unpack. However if you pass in more values than variable you will get an error. … Read more
In big-O notation only the most significant term counts, and constant coefficients are ignored: O[n(n-1)/2] = O[n²/2 + n/2] = O[n²/2] = O(n²) 2 solved Why efficiency of selection sort or Bubble or Insertion sort is said to be n^2 and not as n(n-1)/2
Try this? def numberToList(number): # base case if number == 0: return [] # recurse return numberToList(number / 10) + [ number % 10 ] Run it like this: >>> numberToList(1234) [4, 3, 2, 1] 1 solved append all Integers of an integer in a list in python using recursive function [closed]
A simple solution is by trying all possible substrings from left to right (i.e. starting from indices i=0 to n-k), and comparing each to the next substrings (i.e. starting from indices j=i+1 to n-k). For every i-substring, you count the number of occurrences, and keep a trace of the most frequentso far. As a string … Read more
I just had a quick check of the site you linked to. Their algorithm appears to boil down to “longer comment == higher quality”. Not exactly a sophisticated algorithm. For example, this asklfklasf kajslkjf akjs flkajsfklajs fkjaskfj aklsjf kajsfk ajskfj alksjf aklsjfkl asfjaklsjf was given their top quality rating… Some ideas to make this better: … Read more
Your problem is that you never eliminate the last number in numbers. If range_number is 21, then len(numbers) is 20 and len(numbers)-1 is 19. So this line here: for n in range(i + numbers[i], len(numbers)-1, numbers[i]): Never actually removes the number 20 from the list. You could have seen this if you’d printed out the … Read more
You can try k >= 2 and limit N with sqrt(w), start i with 2 in the loop. If solution is not found then k = 1, n = w. Also you do not need pow, you could multiply intermediate product by N on each iteration. solved Given an integer, w, find n and k … Read more
Change vector<int> result; to vector<int> result = numbers;. Replace all vector<string> to vector<int> and remove quote marks around numbers when you push_back them 2 solved Sorting numbers using vector in c++ [closed]