博客

B - ss Time limit : 2sec / Memory limit : 256MBScore : 200 pointsProblem Statement We will call a string that can be obtained by concatenating two equal strings an even string. For example, xyzxyz an

substr(字符串,截取开始位置,截取长度) //返回截取的字 substr(‘Hello World’,2,4) //返回结果为 ‘ello’ substr(‘Hello World’,-3,3)//返回结果为 ‘rld’ *负数(-i)表示截取的开始位置为字符串右端向左数第i个字符#include<string>#include<iostream>using namespace std

Problem Statement We have a board with a 2×N grid. Snuke covered the board with N dominoes without overlaps. Here, a domino can cover a 1×2 or 2×1 square.Then, Snuke decided to paint these dominoes us

Problem Statement There are N towns in the State of Atcoder, connected by M bidirectional roads.The i-th road connects Town Ai and Bi and has a length of Ci.Joisino is visiting R towns in the state, r

C - 2D Plane 2N Points Time limit : 2sec / Memory limit : 256MBScore : 400 pointsProblem Statement On a two-dimensional plane, there are N red points and N blue points. The coordinates of the i-...

Problem Statement There are N boxes arranged in a row from left to right. The i-th box from the left contains Ai candies.You will take out the candies from some consecutive boxes and distribute the...

Problem Statement In Takahashi Kingdom, there is a east-west railroad and N cities along it, numbered 1, 2, 3, …, N from west to east. A company called AtCoder Express possesses M trains, and the tra...

Problem Statement There are N candles placed on a number line. The i-th candle from the left is placed on coordinate xi. Here, x1#include &lt;bits/stdc++.h&gt;#define inf 0x3f3f3f3fusing namespa...