zoukankan      html  css  js  c++  java
  • 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 to 106 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).

    Examples
    Input
    116401024
    97 1024
    Output
    YES
    11640
    1024
    Input
    284254589153928171911281811000
    1009 1000
    Output
    YES
    2842545891539
    28171911281811000
    Input
    120
    12 1
    Output
    NO
    #include<bits/stdc++.h>
    using namespace std;
    #define ll long long
    #define pi (4*atan(1.0))
    #define eps 1e-14
    const int N=2e6+10,M=4e6+10,inf=1e9+10,mod=1e9+7;
    const ll INF=1e18+10,MOD=1e9+7;
    char a[N];
    int prex[N];
    int prey[N];
    int quick(ll x,int y,int mod)
    {
        ll ans=1;
        while(y)
        {
            if(y&1)ans*=x,ans%=mod;
            x*=x;
            y>>=1;
            x%=mod;
        }
        return ans;
    }
    int main()
    {
        int x,y;
        scanf("%s",a+1);
        int len=strlen(a+1);
        scanf("%d%d",&x,&y);
        for(int i=1;i<=len;i++)
            prex[i]=(prex[i-1]*10+(a[i]-'0'))%x;
        for(int i=len,j=0;i>=0;i--,j++)
            prey[i]=(prey[i+1]+(a[i]-'0')*quick(10,j,y))%y;
        for(int i=1;i<len;i++)
        {
            if(prex[i]==0&&prey[i+1]==0&&a[i+1]!='0')
            {
                printf("YES
    ");
                for(int j=1;j<=i;j++)
                    printf("%c",a[j]);
                printf("
    ");
                for(int j=i+1;j<=len;j++)
                    printf("%c",a[j]);
                printf("
    ");
                return 0;
            }
        }
        printf("NO
    ");
        return 0;
    }
  • 相关阅读:
    HDU 3579 Hello Kiki 中国剩余定理
    DHU 1788 Chinese remainder theorem again 中国剩余定理
    初学--求解模线性方程组(中国余数定理)。
    山东第四届省赛: Boring Counting 线段树
    山东第四届省赛C题: A^X mod P
    福州大学oj 1752 A^B mod C ===>数论的基本功。位运用。五星*****
    HDU 1576 A/B 暴力也能过。扩展欧几里得
    POJ 1061 青蛙的约会 扩展欧几里德--解不定方程
    HDU 2669 Romantic 扩展欧几里德---->解不定方程
    南阳nyoj 56 阶乘因式分解(一)
  • 原文地址:https://www.cnblogs.com/jhz033/p/6033925.html
Copyright © 2011-2022 走看看