2824. Count Pairs Whose Sum is Less than Target

Given a 0-indexed integer array nums of length n and an integer target, return the number of pairs (i, j) where 0 <= i < j < n and nums[i] + nums[j] < target.

VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror) F. Primes in Interval

Codeforces Round 358 (Div. 2) D. Alyona and Strings

Codeforces Round 359 (Div. 1) B. Kay and Snowflake

Codeforces Round 360 (Div. 1) C. The Values You Can Make

Educational Codeforces Round 14 E. Xor-sequences

Special Subarray

Minimum Score

Alice’s Sweets

Maximum Operation Count