lieer

B. Summer sell-off time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Summer holidays! Someone is going on trips, someone is visiti

C. Tea Party time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Polycarp invited all his friends to the tea party to celebrate the

Time limit : 2sec / Memory limit : 256MB Score : 400 points Problem Statement You are given a tree with N vertices. Here, a tree is a kind of graph, and more specifically, a connected undirect

C. Two Seals time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output One very important person has a piece of paper in the for

B. Minimum number of steps time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output We have a string of letters 'a' and 'b'. We want to p