Codeforces round#158 Div.2 A

Source: Internet
Author: User

Test instructions

Give a number, add n digits to the end of it, and guarantee its% K = = 0 Each time it is added

Output final number


Just make sure the first number is valid, then add n-1 0 to the back.


#include<stdio.h>#include<string.h>intMain(){    inta,b,N;    CharS1[200010];     while(scanf(" %d%d%d", &a, &b, &N) !=EOF)    {memset(S1, ' + ', sizeof(S1));sprintf(S1, "%d",a);        intLen=strlen(S1);        intC=a%b,Flag= 0,D;C*= Ten;C%=b;D= (b-C) %b;        if(D>= Ten)    {Flag= 1;}        Else        {S1[Len++] = (D+ ' 0 ');            for(intI= 2;I<=N;I++)           {S1[Len++] = ' 0 ';           }        }        if(Flag)printf(" -1\n");        Elseprintf("%s\n",S1);    }}

Codeforces round#158 Div.2 A

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.