I'm sure you know about the $9.99 price scheme, instead of using $10. Well, in your new job as a sys admin at a large retail store, they want prices to adhere to a similar scheme: All prices are in whole dollars, no cents. All prices should end with 5 or 9, rounding to the closest one but up if...

for the problem https://www.hackerrank.com/challenges/chocolate-feast below is the code I wrote: #include <cmath> #include <cstdio> #include <vector> #include <iostream> #include <algorithm> using namespace std; int availOff(int wrap, int m){ int r=0; while(wrap>=m){ r+=wrap/m; ...

My first challenge in a long time. Feedback would be appreciated! Last Minute Shipments code-golf optimization Here's the situation: You're an engineer for Acme Rail Shipping Inc. There's a string of shipments to make for tomorrow but it turns out at the last moment that they're actually expec...

Counting groups of a given size code-golf math abstract-algebra Groups In abstract algebra, a group is a tuple (G, ∗), where G is a set and ∗ is a function G × G -> G such that the following holds: For all x, y, z in G, (x ∗ y) ∗ z = x ∗ (y ∗ z). There exists an element e in G such that x ∗ ...

I am trying to solve this problem which has exactly same language as this one but with very tight time limit and hard test cases! Now I have solved the problem on SPOJ with Dinic but I am getting TLE on Vietnam SPOJ? Now I want to know how can I approach this problem? PS: I am particularly inte...

Groups In abstract algebra, a group is a tuple (G, ∗), where G is a set and ∗ is a function G × G -> G such that the following holds: For all x, y, z in G, (x ∗ y) ∗ z = x ∗ (y ∗ z). There exists an element e in G such that for all x in G, x ∗ e = x. For each x in G, there exists an element y ...