< Summary

Information
Class: LeetCode.Algorithms.SumMultiples.SumMultiplesMath
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\SumMultiples\SumMultiplesMath.cs
Line coverage
100%
Covered lines: 15
Uncovered lines: 0
Coverable lines: 15
Total lines: 46
Line coverage: 100%
Branch coverage
N/A
Covered branches: 0
Total branches: 0
Branch coverage: N/A
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
SumOfMultiples(...)100%11100%
SumDivisibleBy(...)100%11100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\SumMultiples\SumMultiplesMath.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv).
 3// All Rights Reserved.
 4// --------------------------------------------------------------------------------
 5// This software is the confidential and proprietary information of Eugene Eremeev
 6// (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not
 7// disclose such Confidential Information and shall use it only in accordance with
 8// the terms of the license agreement you entered into with Eugene Eremeev (also
 9// known as Yevhenii Yeriemeieiv).
 10// --------------------------------------------------------------------------------
 11
 12namespace LeetCode.Algorithms.SumMultiples;
 13
 14/// <inheritdoc />
 15public class SumMultiplesMath : ISumMultiples
 16{
 17    /// <summary>
 18    ///     Time complexity - O(1)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="n"></param>
 22    /// <returns></returns>
 23    public int SumOfMultiples(int n)
 324    {
 325        var sum = 0;
 26
 327        sum += SumDivisibleBy(n, 3);
 328        sum += SumDivisibleBy(n, 5);
 329        sum += SumDivisibleBy(n, 7);
 30
 331        sum -= SumDivisibleBy(n, 3 * 5);
 332        sum -= SumDivisibleBy(n, 3 * 7);
 333        sum -= SumDivisibleBy(n, 5 * 7);
 34
 335        sum += SumDivisibleBy(n, 3 * 5 * 7);
 36
 337        return sum;
 338    }
 39
 40    private static int SumDivisibleBy(int n, int d)
 2141    {
 2142        var p = n / d;
 43
 2144        return d * p * (p + 1) / 2;
 2145    }
 46}