码迷,mamicode.com
首页 > 其他好文 > 详细

UVA2037

时间:2016-07-20 22:59:10      阅读:131      评论:0      收藏:0      [点我收藏+]

标签:

技术分享

#include<cstdio>
int Sum(int n)
{
    int sum=0;
    while(n!=0)
    {
        sum+=n%10;
        n/=10;

    }
    return sum;
}
void Cal(int a,int b)
{

    while(a!=b)
    {
        if(a<b)
        {

            a+=Sum(a);
        }
        else
        {
            b+=Sum(b);
        }

    }
    printf("%d\n",a);
}
int main()
{
    int n;
    int count=1;
    while(~scanf("%d",&n)&&n)
    {    if(count>1)
        printf("\n");
        printf("Case #%d\n",count++);
        int nn=Sum(n);
        if(nn%9==0)
        {


            printf("first meets river 9 at ");
            Cal(9,n);
        }
       else  if(nn%3==0)
        {

             printf("first meets river 3 at ");
            Cal(3,n);
        }
        else
        {

             printf("first meets river 1 at ");
            Cal(1,n);
        }

    }

}

  

UVA2037

标签:

原文地址:http://www.cnblogs.com/sxy-798013203/p/5689918.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!