Content 给定两个数 \(n,m\),试问是否有区间里面有 \(n\) 个奇数和 \(m\) 个偶数. 数据范围:\(0\leqslant n,m\leqslant 100\). Solution 这里我们随便选取几个区间就可以发现:\(|n-m|\leqslant 1\) 时才有可能会有题目中要求的区间,因为肯定的,一个 \([l,r]\) 的区间里面要么奇数和偶数的数量相等,要么它们的数量会差 \(1\),不可能会有相差 \(\geqslant 2\) 的情况. 但是,你以为这就做完了…

A. Dasha and Stairs 题目连接: http://codeforces.com/contest/761/problem/A Description On her way to programming school tiger Dasha faced her first test - a huge staircase! The steps were numbered from one to infinity. As we know, tigers are very fond of…

A. Dasha and Stairs time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output On her way to programming school tiger Dasha faced her first test — a huge staircase! The steps were numbered from one t…

A. Dasha and Stairs time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output On her way to programming school tiger Dasha faced her first test - a huge staircase! The steps were numbered from one t…

A. Dasha and Stairs time limit per test:2 seconds memory limit per test:256 megabytes input:standard input output:standard output On her way to programming school tiger Dasha faced her first test — a huge staircase! The steps were numbered from one t…

time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output On her way to programming school tiger Dasha faced her first test - a huge staircase! The steps were numbered from one to infinity. As we know,…

这题其实和 NIKKEI 2019-2-D Shortest Path on a Line 差不多的啦,都是一种最短路的变形,把多个点和边关联了起来. 题面 你要从一楼到 \(n\) 楼去,每层楼可以选择坐电梯和走楼梯,第 \(i\) 和 \(i+1\) 层之间的楼梯花费 \(a_i\) 时间,而电梯花费 \(b_i\) 时间,而且进出电梯有个时间成本 \(c\). 那么显然,从 \(x\) 楼到 \(y\) 楼走楼梯的花费是 \(\sum\limits_{i=min(x, y)}^{max(x…

A. Dasha and Stairs time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output On her way to programming school tiger Dasha faced her first test — a huge staircase! The steps were numbered from one t…

A. Dasha and Stairs Problems: 一个按照1,2,3……编号的楼梯,给定踩过的编号为奇数奇数和偶数的楼梯数量a和b,问是否可以有区间[l, r]符合奇数编号有a个,偶数编号有b个. Analysis: cj: 纸张的我=.= 经过Return改正,才发现没有主义a = b = 0的情况. #define PRON "a" #include <cstdio> #include <cstring> #include <vector&g…

A. Dasha and Stairs time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output On her way to programming school tiger Dasha faced her first test — a huge staircase! The steps were numbered from one t…