Uva - 1588 - Kickdown
2015-06-09 20:08
232 查看
A research laboratory of a world-leading automobile company has received an order to create a special transmission mechanism, which allows for incredibly efficient kickdown -- an operation of switching to
lower gear. After several months of research engineers found that the most efficient solution requires special gears with teeth and cavities placed non-uniformly. They calculated the optimal flanks of the gears. Now they want to perform some experiments to
prove their findings.
The first phase of the experiment is done with planar toothed sections, not round-shaped gears. A section of length n consists of n units.
The unit is either a cavity of height h or a tooth of height 2h . Two sections are required for the experiment: one to emulate master gear (with teeth at the bottom) and one for the driven
gear (with teeth at the top).
There is a long stripe of width 3h in the laboratory and its length is enough for cutting two engaged sections together. The sections are irregular but they may still be
put together if shifted along each other.
The stripe is made of an expensive alloy, so the engineers want to use as little of it as possible. You need to ï¬nd the minimal length of the stripe which is enough for cutting both sections simultaneously.
There are two lines in the input, each contains a string to describe a section. The first line describes master section (teeth at the bottom) and the second line describes driven section (teeth at the top).
Each character in a string represents one section unit -- 1 for a cavity and 2 for a tooth. The sections can not be flipped or rotated.
Each string is non-empty and its length does not exceed 100.
AC代码:
lower gear. After several months of research engineers found that the most efficient solution requires special gears with teeth and cavities placed non-uniformly. They calculated the optimal flanks of the gears. Now they want to perform some experiments to
prove their findings.
The first phase of the experiment is done with planar toothed sections, not round-shaped gears. A section of length n consists of n units.
The unit is either a cavity of height h or a tooth of height 2h . Two sections are required for the experiment: one to emulate master gear (with teeth at the bottom) and one for the driven
gear (with teeth at the top).
There is a long stripe of width 3h in the laboratory and its length is enough for cutting two engaged sections together. The sections are irregular but they may still be
put together if shifted along each other.
The stripe is made of an expensive alloy, so the engineers want to use as little of it as possible. You need to ï¬nd the minimal length of the stripe which is enough for cutting both sections simultaneously.
Input
The input file contains several test cases, each of them as described below.There are two lines in the input, each contains a string to describe a section. The first line describes master section (teeth at the bottom) and the second line describes driven section (teeth at the top).
Each character in a string represents one section unit -- 1 for a cavity and 2 for a tooth. The sections can not be flipped or rotated.
Each string is non-empty and its length does not exceed 100.
Output
For each test case, write to the output a line containing a single integer number -- the minimal length of the stripe required to cut off given sections.Sample Input
2112112112 2212112 12121212 21212121 2211221122 21212
Sample Output
10 8 15
#include <iostream> #include <algorithm> #include <cstdio> #include <cstring> using namespace std; bool test(int k, char s1[], char s2[]){ for (int i = 0; s1[k + i] && s2[i]; i++){ if (s1[k + i] + s2[i] - 2 * '0' > 3)return false; } return true; } int fun(char s1[], char s2[]){ int k = 0; while (!test(k, s1, s2)) { k++; } return max(strlen(s1), strlen(s2) + k); } int main(){ char bottom[105], top[105]; while (scanf("%s%s", bottom, top) != EOF)//对称性 cout << min(fun(bottom, top), fun(top, bottom)) << endl; return 0; }
AC代码:
相关文章推荐
- time,gettimeofday,clock_gettime,_ftime
- imx6 android4.3 bsp开发实录之一lvds、HDMMI输出显示
- hiho第一周——最长回文子串
- VTR-to-Bitstream 2 FPGA Architecture File(.xml)
- imx6 android4.3 bsp开发实录之一系统烧录失败
- SQLite 客户端管理工具
- 二叉查找树
- so..yea should work.
- screenX clientX pageX的区别
- 第四部分 开发工具及测试工具-内容来自互联网
- mpstat 命令详解
- 黑马程序员---集合-泛型、增强for、Set集合
- UIScrollView和UIPageControl的配合使用 - iOS - UI基础知识总结11
- 两个栈实现队列的功能
- hdoj 1016 Prime Ring Problem
- Unity教程之手把手教你Animator状态机如何切换状态
- 名词从句的作用
- #298 (div.2) A. Exam
- 名词从句的作用
- Happy Number