# Category: A CF a day, Konjac’s AKCF plan

## Konjac-kun’s writing diary Day3 CF1C Ancient Berland Circus

Hits: 0Article directory Topic Problem solving ideas Code Topic Given the three vertices of a polygon, find the minimum area of ​​the polygon. Problem solving ideas As we all know, this is a computational...

## Konjac-kun’s writing diary Day2 CF1B Spreadsheets

Hits: 0Article directory Topic Problem solving ideas Code Topic There are two ways to represent the position in the title: Excel notation: use capital letters A → Z A \to Z A→Zrepresent columns and...

## Konjac-kun’s writing diary Day1 CF1A Theatre Square

Hits: 0Article directory Topic Problem solving ideas Code Topic there is one n × m n \times m n×mmatrix, you need to use several a × a a \times a a×aThe square fills ta....

## Konjac-kun’s writing diary Day13 P8106 [Cnoi2021] Math exercises

Hits: 0Problem solving ideas There is no big guy to solve such a water problem… first, ∵ ∣ S ∣ ∉ S , ∣ T ∣ ∉ T ∴ ∣ S ∣ ∈ T...

## Konjac-kun’s writing diary Day11 (DP topic T2) CF53E Dead Ends

Hits: 0Problem solving ideas data scale n ≤ 10 n\le10 n≤10The dp question is obviously like pressing dp. Status Definition: d p [i] [ j ] dp[i][j] dp[i][j]for Unicom i i i, the leaf...

## Konjac-kun’s writing diary day10 (DP topic T1) CF453A Little Pony and Expected Maximum

Hits: 0Problem solving ideas A solution to the water problem. by the conclusion [ 1 , x ] [1,x] [1,x]shared x n x^n xnA variety of schemes are known: If we take n n...

## Konjac-kun’s rubric diary Day5 (Line segment tree topic T2) CF703D Mishka and Interesting sum

Hits: 0Article directory Problem solving idea: tree array Code Problem solving idea: [tree array] What is required in the question is the XOR sum that occurs an even number of times. It can be...

## Konjac-kun’s Diary of Writing Questions Day7 (Mathematics T1) CF1278F Cards

Hits: 0Problem solving ideas Because this konjac is not very good at using L A T E X L^A T_E X LATE​X, the problem-solving idea is changed to handwriting. Code Do not open long...

## Konjac-kun’s Diary of Writing Questions Day17 CF809D Solution

Hits: 0ideas Step1: Direct DP state definition f [i] [ j ] f[i][j] f[i][j]for a  → a [ i ] a \rightarrow a[i] a→a[i]Take the length as not a word jThe minimum value...

## Konjac-kun’s Diary of Writing Questions Day15 (Computational Geometry T1) P3219 [HNOI2012] Triangle Covering Problem

Hits: 0Problem solving ideas Water problems, violence can AC… First scan the possessive, we can treat all triangles (including complete triangles and overlapping with other triangles) as trapezoids. We enumerate all the whole points...