hdu 5373 The shortest problem（杭电多校赛第七场）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5373

The shortest problem

Time Limit: 3000/1500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 995    Accepted Submission(s):
498

Problem Description

In this problem, we should solve an interesting game.
At first, we have an integer n, then we begin to make some funny change. We sum
up every digit of the n, then insert it to the tail of the number n, then let
the new number be the interesting number n. repeat it for t times. When n=123
and t=3 then we can get 123->1236->123612->12361215.

 

Input

Multiple input.
We have two integer n
(0<=n<=10⁴ ) , t(0<=t<=10⁵ ) in each row.
When n==-1 and t==-1 mean the end of input.

 

Output

For each input , if the final number are divisible by
11, output “Yes”, else output ”No”. without quote.

 

Sample Input

35 2

35 1

-1 -1

 

Sample Output

Case #1: Yes

Case #2: No

 

Source

2015
Multi-University Training Contest 7

 

 

 

题目大意：将前面的数加起来的得到的和接在后面，并判断最后得到的这个数是否可以被11整除。例如：23->一次变换后235->两次变换后23510

解题思路：想象一下，除以11是怎么除的，每次都是前面的先除存下余数加上后面的继续除。这样的话就算10⁴也不在话下。这里要注意的是后面接上的数字不一定是一位数两位数or三位数。所以要特殊判断下，第一个剩下的余数要乘以几个10。

 

详见代码。（这个需要用G++提交）

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <cmath>

 using namespace std;

 int fun(int n)
 {
     int sum=;
     while (n)
     {
         int a1=n%;
         sum+=a1;
         n/=;
     }
     return sum;
 }

 int fun1(int x)
 {
     int t=;
     while (x)
     {
         t++;
         x/=;
     }
     return t;
 }

 int fun2(int n)
 {
     int s=;
     for (int i=;i<n;i++)
     {
         s*=;
     }
     return s;
 }

 int main()
 {
     int n,t;
     int flag=;
     while (~scanf("%d%d",&n,&t))
     {
         if (n==-&&t==-)
             break;
         int ans=n%;
         //cout<<ans<<endl;
         int ss=fun(n);
         for (int i=; i<t; i++)
         {
             ans=ans*fun2(fun1(ss))+ss;//pow(10,fun1(ss))+ss;
             //cout<<ans<<endl;
             ans%=;
             //cout<<ans<<endl;
             ss+=fun(ss);
             //cout<<ss<<endl;
         }
         if (ans%==)
             printf ("Case #%d: Yes\n",flag++);
         else
             printf ("Case #%d: No\n",flag++);
     }
     return ;
 }

还有另外一种比较省时间的代码。

能被11整除的数的特征 
把一个数由右边向左边数，将奇位上的数字与偶位上的数字分别加起来，再求它们的差，如果这个差是11的倍数（包括0），那么，原来这个数就一定能被11整除。

详见代码。

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <stack>
 #include <queue>
 #include <map>
 #include <set>
 #include <vector>
 #include <cmath>
 #include <algorithm>
 using namespace std;
 #define ll long long
 const double eps = 1e-;
 const double pi = acos(-1.0);
 const int INF = 0x3f3f3f3f;
 const int MOD = ;

 int n,t;
 int x,y,k;

 int main ()
 {
     int a,b,c,d,e,ii=;
     while (scanf ("%d%d",&n,&t)==)
     {
         if (n==-&&t==-)
             break;
         a = n/;
         b = (n/)%;
         c = (n/)%;
         d = (n/)%;
         e = n%;
         //if (d!=0){k++; if(c!=0)k++; if(b!=0)k++; if(a!=0)k++;}
         y = d+b;
         x = c+a+e;

         while (t--)
         {
             k = ;
             int p=,q=,m=x+y;
             while (m)
             {
                 k++;
                 if (k%)
                     p += m%;
                 else
                     q += m%;
                 m /= ;
             }
             //cout<<p<<" "<<q<<endl;cout<<x<<" "<<y<<endl;
             if (k%)
             {
                 x += q;
                 y += p;
                 swap(x, y);
             }
             else
             {
                 x += p;
                 y += q;
             }
         }
         if ((x-y)%)
             printf ("Case #%d: No\n",ii++);
         else
             printf ("Case #%d: Yes\n",ii++);
     }
     return ;
 }