This is not a Mint error coin. It has likely been altered by placing the nickel and dime in a vise and squeezing them together causing a reverse image of the dime to appear on the nickel. The coin has no numismatic collectible value.
If you're refering to the $1 denomination, probably not. It has remained unchanged since 1963. Most counterfeiters do not counterfeit the 1 because it is such a small note. It has no known security measures like the watermark or the imbeded strip like the other denoms.
Use a recursive function. Assume the denominations are placed in a vector of type double (highest denomination first): // returns the highest denomination not greater than value const double get_largest_denom (const double& value) { const std::vector<double> denoms {100.0, 50.0, 20.0, 10.0, 5.0, 2.0, 1.0, 0.5, 0.2, 0.1, 0.05, 0.02, 0.01}; for (auto const i : denoms) if (*i <= value) return *i; return 0.0; // rare case! } void print_amounts (double value) { if (value<=0.0) return; double denom {get_largest_denom (value); } unsigned count {(unsigned) (value / denom)}; double subtotal {(double) count * denom}; std::cout << count << " x " << denom " = " << subtotal << std::endl; print_amounts (value - subtotal); } int main (void) { double value {}; std::cout << "Enter the amount (#.##): "; std::cin >> &value; print_amounts (value); } Example output: Enter the amount (#.##): 1234.56 12 x 100.0 = 1200.0 3 x 10.0 = 30.0 4 x 1.0 = 4.0 1 x 0.5 = 0.5 1 x 0.05 = 0.05 1 x 0.01 = 0.01
The word "gamble" or "gambling" does not appear in the New International Version Nor the KJV. However, there are Biblical accounts of things like "casting lots' which some historians say was, in some instances, a form of gambling.