## Easy Problems

Simple Count
Description
For two \(1\)~\(n\), define \(a,b\), orz(a,b)=max(a_1, b_1)+\)... (+max(a_n, b_n)\).
You need to find out how many pairs \((a,b)\) satisfy \(orz(a,b)\; \geq\ m\).
Input
Two positive integers in a row\(n,m\).
Output
One integer per line represents the answer. Modeling (9944353).
Sample Input
3 8
Sample Output
18
HINT
\ ...

Posted on *Wed, 24 Nov 2021 13:44:55 -0500* by **pwes24**

## Noip simulation 90 2021.11.5 (longest problem solution)

T1 palindrome
This classic \ (dp \) just can't do it, just can't.....
Except for the \ (dp \) array, everything else is similar to the problem solution, but it's useless....
Let \ (dp[len][x1][x2] \) mean that half the length of the palindrome string is \ (len \), the abscissa of the end point of the string starting from \ ((1,1) \) is \ (x1 \) ...

Posted on *Fri, 05 Nov 2021 22:34:25 -0400* by **aouriques**

## CF506E Mr. Kitayuta's Gift

1, Title
Click here to see the question
2, Solution
A question that deeply baptized me is a rare good question with both thinking difficulty and code difficulty!
Consider my palindrome string first! First, consider how to count. The questions tell you that you only care about the final state. We count the final state directly. Considering the e ...

Posted on *Wed, 03 Nov 2021 20:41:51 -0400* by **maxedison**

## Simulation 88 test summary

Avalanche meteorite
Pass the exam
Nothing. T1 almost fell asleep after thinking for a long time, and then he was violent
Finally, T1dp is false. The T3 modulus is 993244853, which cannot be evaluated at all
At the bottom, I was autistic for a day and didn't do anything. The people next to me cut off \ (10 ^ 9 + 7 \) questions. I can't do anythi ...

Posted on *Wed, 03 Nov 2021 02:26:16 -0400* by **az_wraith**

## [LGR-096] solution to the problem of I Div.2 of Luogu November race

preface
It's troublesome to write four articles after thinking about it (in fact, it's too fierce to read the water blog).
Then it was integrated.
T1: Addition
General idea of the topic
Give you a sequence. You can select two adjacent numbers at a time and combine them by one.
The form of consolidation is the first plus or minus and the last on ...

Posted on *Sun, 31 Oct 2021 07:00:31 -0400* by **kdreg**

## Selected miscellaneous questions (Fate Trilogy)

How difficult it is to find three questions about \ (fat \) in a world full of cadoli
Today's meal at Emiya's house
A very good inclusion exclusion + \ (dp \) problem
Considering the third limitation, it is found that at most one column is illegal, so we can enumerate which column is illegal
Then the next task is to find the total number of sch ...

Posted on *Thu, 28 Oct 2021 18:47:03 -0400* by **newbiehacker**