codeforces Round #441 C Classroom Watch【枚举/注意起点】

【codeforces Round #441 C Classroom Watch【枚举/注意起点】】的更多相关文章

codeforces Round #441 C Classroom Watch【枚举/注意起点】

C. time limit per test 1 second memory limit per test 512 megabytes input standard input output standard output Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n.…

「Codeforces Round #441」 Classroom Watch

Discription Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this number and the teacher of mathematics Inna Petrovna answered Vova that n is th…

Codeforces Round #441 (Div. 2)【A、B、C、D】

Codeforces Round #441 (Div. 2) codeforces 876 A. Trip For Meal(水题) 题意:R.O.E三点互连,给出任意两点间距离,你在R点,每次只能去相邻点,要走过n个点,求走过的最短距离. #include<cstdio> #include<cstring> #include<algorithm> using namespace std; int main() { int n, a, b, c; scanf("…

Codeforces Round #441 (Div. 2)

Codeforces Round #441 (Div. 2) A. Trip For Meal 题目描述:给出$3$个点,以及任意两个点之间的距离,求从$1$个点出发,再走$n-1$个点的最短路径. solution 当$n=1$时,答案为$0$,当$n=2$时,答案等于与开始点相连的两条边的最小值,当$n>2$时,答案等于与开始点相连的两条边的最小值+三条边最小值*$(n-2)$ 时间复杂度:$O(1)$ B. Divisiblity of Differen…

[日常] Codeforces Round #441 Div.2 实况

上次打了一发 Round #440 Div.2 结果被垃圾交互器卡掉 $200$ Rating后心情复杂... 然后立了个 Round #441 要翻上蓝的flag QAQ 晚饭回来就开始搞事情, 大力安利了一发 Codeforces 然后成功拉到隔壁机房 $N$ 个 dalao 一起开黑 (垃圾 Codeforces 的 CAPTCHA 居然还要架梯子才能用...) 顺便备好 TIM 准备连线 UOJ 群 233 (算了不扯赛前了直接说赛中...) 开场开 $A$ 题, 一脸懵逼? (论 CF…

Codeforces Round #441 (Div. 2, by Moscow Team Olympiad) C. Classroom Watch

http://codeforces.com/contest/876/problem/C 题意: 现在有一个数n,它是由一个数x加上x每一位的数字得到的,现在给出n,要求找出符合条件的每一个x. 思路: n最大1e9,那么9个9最多才加81,所以最多枚举100次,就可以找到所有符合条件的数. 代码: #include <stdio.h> #include <string.h> #include <vector> using namespace std; vector<…

Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)

A. Trip For Meal 题目链接:http://codeforces.com/contest/876/problem/A 题目意思:现在三个点1,2,3,1-2的路程是a,1-3的路程是b,2-3的路程是c,从1点开始,小熊维尼在1点吃过一次蜂蜜了,但是他要吃n次蜂蜜,每次他离开一个地方以后这个地方的蜂蜜就会自动补充,问最少需要走多少距离. 题目思路:如果n=1,那么就是0,如果n等于2,那么答案说就是min(a,b),如果n>2,答案就是min(a,b)+(n-2)*min(a,b,…