24 lines (18 loc) · 601 Bytes

Introduction

Records problems in codeforces.

Educational Codeforces Round 53 (Rated for Div. 2)

1073A. Diverse Substring
1073B. Vasya and Books
1073C. Vasya and Robot
1073D. Berland Fair
// 1073E. Segment Sum
// 1073F. Choosing Two Paths
// 1073G. Yet Another LCP Problem

Codeforces Round #527 (Div. 3)

1092A. Uniform String
1092B. Teams Forming
1092C. Prefixes and Suffixes
// 1092D1. Great Vova Wall (Version 1)
// 1092D2. Great Vova Wall (Version 2)
// 1092E. Minimal Diameter Forest
// 1092F. Tree with Maximum Cost