Companies Practice Progress Feedback

SourCaPlacement OS

Targeted Campus Assessment Prep

Loading SourCa...

Synchronizing placement benchmarks & campus recruitment roadmaps

SourCa/ Technical Preparation Platform

Companies Practice Progress College Insights Share Feedback Privacy

SourCa is an independent coding and assessment practice system designed from publicly available interview patterns. Not affiliated with or endorsed by any company.

INDEPENDENT PLATFORM

SourCaPlacement OS

Targeted Campus Assessment Prep

Setting up coding workspace...

Loading problem statement, test cases, and compiler sandbox

Accenture • Coding AssessmentSet 36/251•

Difference of Sumcoding

coding•DSA & Problem Solving•Math & Bit Manipulation

Difference of Sum

Problem Statement

You are given two integers `n` and `m`. Calculate the difference between the sum of all integers in the range `[1, m]` that are not divisible by `n` and the sum of all integers that are divisible by `n`. Return `sum(not_divisible) - sum(divisible)`. ### Constraints - `1 <= n <= 1000` - `1 <= m <= 1000` ### Input Format A single line containing two space-separated integers `n` and `m`. ### Output Format Print the integer difference.

Sample Cases

Example 1Sample Case

Input: 4 20

Output: 90

Example 2Sample Case

Input: 3 10

Output: 19

Example 3Sample Case

Input: 4 4

Output: 2

Constraints

Runtime Limit: 2000 ms per test batch
Memory Limit: 256 MB
Standard I/O stream reading

Official submissions are evaluated against hidden test cases on the server to verify time & memory complexity.

solution.pyUTF-8 • Tab: 4 spaces

Initializing SourCa IDE...

Test Cases:

Ready to Evaluate

Online Judge Sandbox // Sample Verification

Input

4 20

Expected Output

90