C. White Sheet 题目链接:https://codeforces.com/contest/1216/problem/C 题目大意:给你两个黑色矩形和一个白色矩形的左下和右上角的坐标,问你白色矩形是否能够完全被黑色矩形覆盖 解题思路:如果白色矩形能够被黑色矩形完全覆盖,则白色矩形边上的所有
Clickon this linkBeginners coding sheetthis sheet consists of curated problems to start then you can move to the contest section and start giving DIV4 contest as they are specifically for beginners and then move up on the ladder as you proceed to DSA. If you like this piece of information,...
Little Johnny painted on a sheet of paper a polygon withNvertices. Then, for every edge of the polygon, he drew the middle point of the edge. After that, he went to school. When he came back, he found out that his brother had erased the polygon (both the edges and the vertices). ...
链接: https://codeforces.com/contest/1216/problem/C 题意: There is a white sheet of paper lying on a rectangle table. The sheet is a rectangle with its sides parallel to the sides of the table. If you will take a look from above and assume that the bottom left corner of the table ...
http://codeforces.com/contest/1118/problem/D1 http://codeforces.com/contest/1118/problem/D2 题意:有n杯咖啡,m张作业,没杯咖啡有能量点a[i],一点能量能做一张作业,同一天喝多杯能量会减少:第一杯a[i],第二杯max(0,a[i]-1),第三杯max(0,a[i]-2)...;问完成m张...猜你...
Codeforces & Atcoder Solutions. Contribute to risal-shefin/ProblemSolving development by creating an account on GitHub.
题目链接:https://codeforces.com/contest/1090/problem/D Vasya had an array of n integers, each element of the array was from 1 to n. He chose m pairs of different positions and wrote them down to a sheet of paper. Then Vasya compared the elements at these positions, and...
Vika has an infinite sheet of squared paper. Initially all squares are white. She introduced a two-dimensional coordinate system on this sheet and drew n black horizontal and vertical segments parallel to the coordinate axes. All segments have width equal to 1 square, that means every segment ...
DSA (Level Up + Interview Prep) Sheet.xlsx Updated May 11, 2024 Personal (CP- Practise).xlsx Updated May 11, 2024 README.md Update README.md May 11, 2024 Repository files navigation README Problem Solving This repository contains the problems I solved on LeetCode, GeeksforGeeks, Interview...
题目链接:http://codeforces.com/contest/965/problem/E 首先建立字典树,然后问题转换为有n个人站在一棵树上,每个人可以往根的位置移动任意步,但是不能同时有两个人站在一个点上,我们可以dp来做,dp[i]表示,以i为根的子树最好的结果,对于每个每次合并子树,如果根节点没有人,则把所有子树中深度最大的那个人...