L-75的专栏

Parencodings Time Limit: 1000MS   Memory Limit: 10000KB   64bit IO Format: %lld & %llu Submit Status Description Let S = s1 s2...s2n be a well-formed string of parenthe

Crashing Robots Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 10286   Accepted: 4362 Description In a modernized warehouse, robots are used to fetch the

Robot Motion Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 13100   Accepted: 6349 Description A robot has been programmed to follow the instructions

Counterfeit Dollar Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 45332   Accepted: 14324 Description Sally Jones has a dozen Voyageur silver dollars. How

Self Numbers Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 23405   Accepted: 13142 Description In 1949 the Indian mathematician D.R. Kaprekar discovered

Maya Calendar Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 76933   Accepted: 23686 Description During his last sabbatical, professor M. A. Ya made a sur

标题：史丰收速算史丰收速算法的革命性贡献是：从高位算起，预测进位。不需要九九表，彻底颠覆了传统手算!速算的核心基础是：1位数乘以多位数的乘法。其中，乘以7是最复杂的，就以它为例。因为，1/7 是个循环小数：0.142857...，如果多位数超过 142857...，就要进1同理，2/7, 3/7, ... 6/7 也都是类似的循环小数，多位数超过 n/7，就要进n下面的程序模拟了史丰收速算法中乘以7