3014. Minimum Number of Pushes to Type Word I

class Solution {
    public int minimumPushes(String word) {
        int n = word.length();
        int totalCost = 0;
        for (int i = 0; i < n; i++) {
            totalCost += (i / 8) + 1;
        }
        return totalCost;
    }
}

class Solution:
    def minimumPushes(self, word: str) -> int:
        n = len(word)
        ans = 0

        for i in range(n):
            ans += i // 8 + 1

        return ans

class Solution {
public:
    int minimumPushes(string word) {
        int n = word.size();
        int ans = 0;

        for (int i = 0; i < n; i++) {
            ans += (i / 8) + 1;
        }

        return ans;
    }
};

var minimumPushes = function(word) {
    const n = word.length;
    let ans = 0;

    for (let i = 0; i < n; i++) {
        ans += Math.floor(i / 8) + 1;
    }

    return ans;
};