数学/找规律/暴力 Codeforces Round #306 (Div. 2) C. Divisibility by Eight

题目传送门

 /*
     数学/暴力：只要一个数的最后三位能被8整除，那么它就是答案；用到sprintf把数字转移成字符读入
 */
 #include <cstdio>
 #include <algorithm>
 #include <cstring>
 #include <iostream>
 #include <cmath>
 #include <vector>
 using namespace std;

 const int MAXN = 1e2 + ;
 const int INF = 0x3f3f3f3f;
 char s[MAXN];
 char t[MAXN];

 int main(void)        //Codeforces Round #306 (Div. 2) C. Divisibility by Eight
 {
     while (scanf ("%s", s) == )
     {
         bool ok = false;
         for (int i=; i<; ++i)
         {
             if (i %  == )    sprintf (t, "%d", i);
             int p = ;
             for (int i=; s[i] && t[p]; ++i)
             {
                 if (s[i] == t[p])    p++;
             }
             if (!t[p])    {puts ("YES");    printf ("%s\n", t);    ok = true;    break;}
         }
         if (!ok) puts ("NO");
     }

     return ;
 }

 /*
 3454
 10
 111111
 */