CodeForces Round #279 (Div.2)

#include <cstdio>
#include <string>
#include <iostream>
using namespace std;

const int maxn = 1000000 + 10;
int mas[maxn];

int main()
{
//freopen("Cin.txt", "r", stdin);
ios::sync_with_stdio(false);
string s;
int a, b;
cin >> s >> a >> b;
int tmp = 1;
mas[s.size()] = 0;
for(int i = (int)s.size()-1; i >= 0; --i)
{
mas[i] = mas[i+1] + tmp * (s[i] - '0');
mas[i] = mas[i] % b;
tmp *= 10;
tmp = tmp % b;
}

tmp = 0;
for(int i = 0; i < (int)s.size()-1; ++i)
{
tmp = tmp * 10 + (s[i] - '0');
tmp %= a;
if(tmp == 0 && s[i+1] != '0') //²»ÄÜÓÐÇ°µ¼0
{
if(mas[i+1] == 0)
{
cout << "YES\n";
cout << s.substr(0, i+1) << "\n";
cout << s.substr(i+1, s.size()-i-1) << "\n";
return 0;
}
}
}
cout << "NO\n";

return 0;
}