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

题意：给你一个字符串s和两个数字a,b，然你判断能否把s分成两段，分别被a和b整除。

做法：这相当于高精度除低精度。首先从头到尾判断到第i位的数字能否被a整除，如果能整除就标记为1，然后从最后一个数字到头判断到j位能否被b整除，如果j位能整除并且j-1也已经标记为1,则分别输出该字符串的前j-1位和后n-j-1位。

#include <iostream>
#include <cstdio>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <stack>
#include <set>
#include <algorithm>
#include<ctime>
#define esp 1e-6
#define LL long long
#define inf 0x0f0f0f0f
using namespace std;
char s[1000005];
int vis[1000005];
int main()
{
   
   int i,j,a,b,len,flag;
   scanf("%s",s);
       flag=0;
       memset(vis,0,sizeof(vis));
       scanf("%d%d",&a,&b);
       int mod=0;
       len=strlen(s);
       for(i=0; i<len; i++)
       {
        mod=mod*10+s[i]-'0';
        mod=mod%a;  //利用除法性质，其实质是每次都是一个最多比n多一位的mod对n进行求余
        if(mod==0)
             vis[i]=1;
       }
       long long ten;
       ten=1;
       mod=0;
       for(i=len-1;i>0;i--)
       {
           mod=mod+(s[i]-'0')*ten;
           mod=mod%b;
           ten=ten*10;
           ten=ten%b;
           if(mod==0&&s[i]!='0'&&vis[i-1]==1)
           {
               flag=1;
               break;
           }
       }
        if(flag==0)
        printf("NO\n");
        else
        {
               printf("YES\n");
               cout<<string(s,s+i)<<'\n'<<string(s+i, s+len)<<endl;
        }
        return 0;
}