【题解】LightOJ1163 Bank Robbery 枚举+数学知识

最新推荐文章于 2018-11-07 07:50:46 发布

wwt9b15bs

最新推荐文章于 2018-11-07 07:50:46 发布

阅读量162

点赞数

分类专栏： LightOJ 数学知识枚举文章标签：枚举数学知识

本文链接：https://blog.csdn.net/qq_41958841/article/details/82726060

版权

一道关于银行安全系统的数学问题，描述了Mark如何通过找到随机数模式来尝试破解。给定(A-B)的值，需要找出可能的A值。输入包含T个测试用例，每个用例给出一个正整数。输出每个案例的A值，按升序排列。

摘要由CSDN通过智能技术生成

题目链接

Description

In one very cold morning, Mark decides to rob a bank. But while trying hacking into the security system, he found that it is locked by some random value. He also found a pattern on the random number, that is if he chops off the last digit of a number A, he gets a new number B. Then he calculates (A-B). He checked the first few numbers of the security system which exactly equals (A-B). Being very excited to have found the pattern, he learns that there are like 500 levels on the security system. He calculated all those numbers by hand but took a lot of time. As a sign of his accomplishment he left a note on the vault stating the pattern. You were the first officer on the crime scene and you’ve obtained the note. So if you can figure out A from (A-B), you can rob the bank very quick!