Codeforces Round 183 (Div. 2)

Solutions for Codeforces Round 183 (Div. 2) (contest 304). 2/2 problems verified against sample I/O. Difficulty range: 1200-1300.

2 items

Codeforces Round 183 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1200-1300 | Time: 5m 19s

Problem Name Rating Tags Solve Time Verified
A Pythagorean Theorem II 1200 brute-force, math 2m ✓
B Calendar 1300 brute-force, implementation 3m 19s ✓
Practice › Codeforces Solutions › Codeforces Round 183 (Div. 2) ›

CF 304A - Pythagorean Theorem II

We need to count how many integer-sided right triangles exist such that all three sides are at most n. A right triangle with sides (a, b, c) satisfies the Pythagorean equation: $a^2+b^2=c^2$$a$$b$$c = sqrt{a^2 + b^2} approx 21.21$$a^2 + b^2 = c^2 approx 225.00 + 225.00 = 450.
codeforces competitive-programming brute-force math May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 183 (Div. 2) ›

CF 304B - Calendar

We are given two valid Gregorian calendar dates in the format yyyy:mm:dd. The task is to compute how many days lie between them.
codeforces competitive-programming brute-force implementation May 29, 2026