7-108 3112 纸牌

#include <algorithm>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using pii = std::pair<i32, i32>;
using pll = std::pair<i64, i64>;
using vi = std::vector<i32>;
using vll = std::vector<i64>;
using vpii = std::vector<pii>;
using vpll = std::vector<pll>;

void solve();

int main()
{
    std::cin.tie(nullptr)->sync_with_stdio(false);
    solve();
}

double get_length(i32 n)
{
    double sum{0};
    for (i32 i = 1; i <= n; ++i)
    {
        sum += 1.0 / (2 * i);
    }
    return sum;
}

void solve()
{
    std::cout << "Cards  Overhang\n";
    i32 n;
    bool endl = false;
    while (std::cin >> n)
    {
        if (endl)
        {
            std::cout << '\n';
        }
        std::cout << std::setw(5) << std::right << n;
        std::cout << std::setw(10) << std::right << std::fixed << std::setprecision(3) << get_length(n);
        endl = true;
    }
}