Codeforces Round #279 (Div. 2) C. Hacking Cypher （大数取余）

题目链接

C. Hacking Cypher
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Polycarpus participates in a competition for hacking into a new secure messenger. He's almost won.

Having carefully studied the interaction protocol, Polycarpus came to the conclusion that the secret key can be obtained if he properly cuts the public key of the application into two parts. The public key is a long integer which may consist of even a million digits!

Polycarpus needs to find such a way to cut the public key into two nonempty parts, that the first (left) part is divisible by a as a separate number, and the second (right) part is divisible by b as a separate number. Both parts should be positive integers that have no leading zeros. Polycarpus knows values a and b.

Help Polycarpus and find any suitable method to cut the public key.

Input
The first line of the input contains the public key of the messenger — an integer without leading zeroes, its length is in range from 1 to106 digits. The second line contains a pair of space-separated positive integers a, b (1 ≤ a, b ≤ 108).

Output
In the first line print "YES" (without the quotes), if the method satisfying conditions above exists. In this case, next print two lines — the left and right parts after the cut. These two parts, being concatenated, must be exactly identical to the public key. The left part must be divisible by a, and the right part must be divisible by b. The two parts must be positive integers having no leading zeros. If there are several answers, print any of them.

If there is no answer, print in a single line "NO" (without the quotes).

Sample test(s)
input
116401024
97 1024
output
YES
11640
1024
input
284254589153928171911281811000
1009 1000
output
YES
2842545891539
28171911281811000
input
120
12 1
output
NO

题意：一个很大的数，可能有10^6位，给两个数字a,b 求把给的大数分为两部分，如果这两部分
能分别整除a,b，且没有前导0，输出YES,否则输出NO.

分析：大数取余。

正着一遍a, 倒着一遍b。

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <cstdlib>
 #include <cmath>
 #include <map>
 #include <vector>
 #include <algorithm>
 #define LL __int64
 const int maxn = 1e6 + ;
 using namespace std;
 char s[maxn];
 int f1[maxn], f2[maxn];

 int main()
 {
     int a, b, i, len;
     int tmp, tmp2, x;
     int y;
     while(~scanf("%s", s))
     {
         scanf("%d%d", &a, &b);
         memset(f1, , sizeof(f1));
         memset(f2, , sizeof(f2));
         len = strlen(s);
         tmp2 = ;
         for(i = ; i < len; i++)
         {
             tmp = (s[i]-)%a;
             tmp2 = ((tmp2*)+tmp)%a;
             if(tmp2==) f1[i] = ;
         }

         tmp2 = ; x = ;
         for(i = len-; i >= ; i--)
         {
             tmp = (s[i]-)%b;
             tmp = (tmp*x)%b;
             tmp2 = (tmp2 + tmp)%b;
             if(tmp2 == ) f2[i] = ;
             x = (x*)%b;
         }

         y = -;
         for(i = ; i < len-; i++)
         {
             if(f1[i]&&f2[i+] && s[i+]!='')
             {
                 y = i;
                 break;
             }
         }
         if(y==-)
         cout<<"NO"<<endl;
         else
         {
             cout<<"YES"<<endl;
             for(i = ; i <= y; i++)
             printf("%c", s[i]);
             cout<<endl;
             for(; i < len; i++)
             printf("%c", s[i]);
             cout<<endl;
         }
     }
     return ;
 }