"HDU 5832" A water problem (large number modulo)

10 million the number of lengths to 73 and 137 modulo. (two numbers a bit like, don't write wrong)

If the efficiency is high, the modulus is taken every 15 bits, because there may be 3 bits after the modulus, so it will take up to 15 bits at a time with LL.

A model can also be used, but slower, the modulo operation is a time-consuming operation.

#include <cstdio> #define LL long LONGLL n,m;int P,cas;char s[10000005];int main () {while (gets (s)) {N=m=p=0;while (s [P]) {for (int i=0;i<15&&s[p];i++,p++) {n=n*10+s[p]-' 0 '; m=m*10+s[p]-' 0 ';} n%=73;m%=137;} printf ("Case #%d:", ++cas); if (n| | m) puts ("NO"); else puts ("YES");}}

　　

"HDU 5832" A water problem (large number modulo)