B. Segment Occurrences time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You are given two strings s and t , both consisting only of lowercase Latin letters. The substring s[l..r] is the str…
Description You are given two strings s and t, both consisting only of lowercase Latin letters.The substring s[l..r] is the string which is obtained by taking characters sl,sl+1,…,sr without changing the order.Each of the occurrences of string a in a…
A. Death Note 简单模拟,可用\(\%\)和 \(/\)来减少代码量 #include <iostream> #include <cstdio> using namespace std; const int N = 200010; int n, m, a[N], cnt = 0, tot = 0; int main(){ scanf("%d%d", &n, &m); for(int i = 1; i <= n; i++){ sc…
HGOI自测 初测:150=80+20+50 rank1~rank3(并列3个rank1,所以我是rank3 qwq) 今日分突然想简约 CF359A Table https://www.luogu.org/problemnew/show/CF359A 题目描述 Simon has a rectangular table consisting of nn rows and mm columns. Simon numbered the rows of the table from top to b…
A. Watching a movie time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output You have decided to watch the best moments of some movie. There are two buttons on your player: Watch the current minute…
