2013春季SD高校ACM周赛9(SDUT) -b

最新推荐文章于 2017-02-17 20:18:32 发布

xiaoleiacm

最新推荐文章于 2017-02-17 20:18:32 发布

阅读量812

点赞数

分类专栏：字符串

本文链接：https://blog.csdn.net/xiaoleiacmer/article/details/8683986

版权

这是一篇关于2013年春季SD高校ACM周赛中的一道编程题目的解析。题目要求处理1,000,000位数字的移位和借位操作，需要注意不要误解为小于1,000,000的整数。解决方法是使用字符串处理技术来完成数字的移位和借位操作。" 139532398,7592826,理解UG NX二次开发：确保目录存在,"['NX二次开发', 'UG二次开发', 'C++', '嵌入式硬件', 'API']

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

Hide That Number

Time Limit: 1000MS Memory limit: 65536K

题目描述

According to Wikipedia, Cryptography is “the practice and study of hiding information” and this is exactly what Alex is looking for. Ever since he was a kid, Alex was paranoid over someone laying their hands on his phone book. He decided that he must write the numbers in some secret way that only he can decipher. At first he tried quite complex algorithms, but that slowed him down when he needed to dial a number fast. He finally came up with the following algorithm: Rather than writing down the number itself, Alex would shift the number one place to the left (as if multiplying it by 10,) then adding the shifted number to the original. For example, if the phone number was 123, Alex would add 1230 to it, resulting in 1353. To make what he writes looks as a regular phone number, Alex truncates the result (from the left,) so that i

最低0.47元/天解锁文章