原题链接:https://codeforces.com/problemset/problem/1342/A 题意:给定x和y和两种操作的价格,问x和y变成0和0所需要的最低价格。 解题思路:使劲贪就行,为了让花费最少我们就比较哪种更划算即可,水题。 AC代码: /* *邮箱:2825841950@qq.com *blog:https://blog.csdn.net/hzf070
I will get to LGM in 2025, i will work very hard. 2025 will be my year. If i don't i will quit cp forever. Thanks!!
I am currently stuck around 1500-1600 and it's time for me to start the grind to reach CM. Here's how I'm planning to do it strategically and consistently. Please have a look, maybe it can motivate someone else to reach their next rank. Any support would mean so much to me. and ...
每日一记20190615——codeforces题目之1175 A. From Hero to Zero(答题于20190606) #荒废了一段时间,总是懒得打开电脑(代码都用手机…)答题于20190606 题目 A. From Hero to Zero time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output You are given an ...
Codeforces 721E Road to Home 题意输入第一行有4个数,分别为L,n,p,tL,n,p,t,分别表示总长度为LL的路,中间有nn个互不相交的区间,现在要用长度为pp的小木棒从左往右铺路(木棒不能被折断,也不能有重叠,且所有的木棒必须在区间内),你可以连续铺路,但是一旦你主动或被迫中断铺路(比如区间内剩下的长度不...
shishyando → Codeforces Round #708 Editorial hello_its_me → what is Mint shivam_360 → Road to Candidate Master !! Detailed → shivam_360 Blog Teams Submissions Groups Contests shivam_360's blog Road to Candidate Master !!By shivam_360, history, 8 hours ago, I am currently stuck aro...
E. Road to 1600 题意: 车可以走直线,皇后可以走直线和对角线 玩家的起点在1号点,每次移动选择一个可以直接到达的没被访问的点,如果没有这样的点,可以花费一个代价传送到最小的没访问的点 直到所有点被访问 构造一种方案,使得车的花费严格小于皇后的花费 分析: 这题是看杜老师讲题写的 杜老师首先用暴力...
aa — the time, which Vasiliy spends to drive 1 kilometer on his car; bb — the time, which Vasiliy spends to walk 1 kilometer on foot; tt — the time, which Vasiliy spends to repair his car. 输出格式: Print the minimal time after which Vasiliy will be able to reach the post offic...
tminutes. There is a straight road of lengthsfrom the service to the cinema. Let's introduce a coordinate system so that the car rental service is at the point 0, and the cinema is at the points. kncars in the rental service,i-th of them is characterized with two integersciandvi— ...
Start Small: Begin practicing coding problems casually. Platforms like LeetCode, HackerRank, and Codeforces offer beginner-friendly options. Gradually increase the difficulty as you gain confidence. System Design Mastery: For senior roles, system design interviews are crucial. Study resources likeGrokking...