## Record of abuse on March 6

D - ABC Transform Meaning: Given a string containing ABC, one character will become two characters for each extension. A →BC, B →CA, C →AB. Q times of inquiry, after ti times of expansion, what is the ki character? Q ≤10^5, ti<10^18, ki<min(1e18, the length of S(t)) Idea: For a higher number of layers, each time the path is found, it ...

Posted by inversesoft123 on Sun, 06 Mar 2022 16:32:42 +0100

## Atcoder beginer contest 237 (A--D) problem solving Report

A - Not Overflow Question meaning: judge whether an input number is between the 31st power of - 2 and the 31st power of - 1 Idea: note that the input range is actually to input a long long number and find out whether an input number is in the int range. Simple questions can be judged directly #include<bits/stdc++.h> using namespace std; ...

Posted by nielsg on Wed, 02 Feb 2022 06:45:09 +0100

## Atcoder beginer contest 205 (supplementary question)

D - Kth Excluded Question meaning: give n numbers, ask q times, and ask the k-th largest number each time (after removing the N numbers on the number axis, the k-th largest number) Idea: for these n numbers, process out how many numbers in front of the current number have not been removed (how many numbers are on the number axis), and then wh ...

Posted by PyroX on Tue, 01 Feb 2022 03:31:22 +0100

## Atcoder beginer contest 232 (E, f supplement)

E - Rook Path Meaning: Given size is H × W H×W H × W matrix, you now have a car (you can walk any distance in one direction in the matrix), and now the starting point is ( ...

Posted by atravotum on Tue, 21 Dec 2021 21:18:29 +0100

## [AT3623] [ARC084D] XorShift (thinking)

Title Link Given a set of natural numbers \ (\ {a_1,a_2,\cdots a_n \} \) with an initial size of \ (n \), two operations are continuously carried out: if \ (x \) is in the set, add \ (2x \) to the set; If \ (x,y \) is in the set (allow \ (x=y \)), add \ (x\operatorname{xor}y \) to the set. Find how many numbers less than or equal to \ (m \) wi ...

Posted by vaanil on Tue, 23 Nov 2021 20:08:01 +0100