Xylon_

分类

C++(1) Codeforce(32) Codefroce(2) CPU(1) HDU(21) Java(1) NOI(1) POJ(6) PTA(9) Python(4) 二分(1) 傅里叶变换(1) 头文件(1) 技术日常(1) 数塔(1) 数论(1) 未归档(115) 着色(1) 算法笔记(3) 蓝桥(1) 计蒜客(1) 资源分享(1) 题解(5)

/ 注册

全部文章（共32篇）

【CF 1025B】Weakened Common Divisor

B. Weakened Common Divisor During the research on properties of the greatest common divisor (GCD) of a set of numbers, I...

Codeforce

2018-08-20

0 772

【CF 1029B】Creating the Contest

B. Creating the Contest You are given a problemset consisting of nn problems. The difficulty of the ii-th problem is...

Codeforce 尺取法

2018-08-25

0 397

【CF 1084A】The Fair Nut and Elevator

A. The Fair Nut and Elevator The Fair Nut lives in nn story house. aiai people live on the ii-th floor of the house. E...

Codeforce

2018-12-12

0 679

【CF 1028A】Find Square

A. Find Square Consider a table of size n×mn×m, initially fully white. Rows are numbered 11 through nn from t...

Codeforce

2018-08-28

0 547

【CF 1036A】Function Height

A. Function Height You are given a set of 2n+12n+1 integer points on a Cartesian plane. Points are numbered from...

Codeforce

2018-09-08

0 424

【CF 1082A】Vasya and Book

A. Vasya and Book Vasya is reading a e-book. The file of the book consists of nn pages, numbered from 11 to nn. The s...

Codeforce

2018-11-30

0 510

【CF 1097A】Gennady and a Card Game

A. Gennady and a Card Game Gennady owns a small hotel in the countryside where he lives a peaceful life. He loves to take ...

Codeforce

2019-01-05

0 739

【CF 1080A】Petya and Origami

Petya is having a party soon, and he has decided to invite his nn friends. He wants to make invitations in the form of origami. For each invitation, ...

Codeforce

2018-11-27

0 393

【CF 1090A】Company Merging

A. Company Merging A conglomerate consists of nn companies. To make managing easier, their owners have decided to me...

Codeforce

2018-12-10

0 779

【CF 1090M】The Pleasant Walk

M. The Pleasant Walk There are nn houses along the road where Anya lives, each one is painted in one of kk possible ...

Codeforce

2018-12-10

0 671