第一次ACM比賽

在慌忙之中被通知第一次參加ACM比賽，雖然只是校內練習賽，但着實小緊張了一把，因此就卡殼在了第一題上，提交了好屢次發現老是不對，剛開始編譯錯誤，到測試數據不過，到最後也都沒有寫完。回來後思考了一下，算法的確錯了，又試了幾回，終於寫完了。下附第一題

A. Giga Tower

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Giga Tower is the tallest and deepest building in Cyberland. There are 17 777 777 777 floors, numbered from  - 8 888 888 888 to 8 888 888 888. In particular, there is floor 0 between floor  - 1 and floor 1. Every day, thousands of tourists come to this place to enjoy the wonderful view.

In Cyberland, it is believed that the number "8" is a lucky number (that's why Giga Tower has 8 888 888 888 floors above the ground), and, an integer is lucky, if and only if its decimal notation contains at least one digit "8". For example, 8,  - 180, 808 are all lucky while 42,  - 10 are not. In the Giga Tower, if you write code at a floor with lucky floor number, good luck will always be with you (Well, this round is #278, also lucky, huh?).

Tourist Henry goes to the tower to seek good luck. Now he is at the floor numbered a. He wants to find the minimum positive integer b, such that, if he walks b floors higher, he will arrive at a floor with a lucky number.

Input

The only line of input contains an integer a ( - 10⁹ ≤ a ≤ 10⁹).

Output

Print the minimum b in a line.

#include<stdio.h>
int mabs(int h) { if(h<0) h=-h; return (h); } int main() { int i,m,n,j,a,b,c,t,s=1,h=0,o=0,k=0; scanf("%d",&a); for(i=0;i<16;i++) { a++; t=mabs(a); //printf("%d\n",t); for(s=1,k=0,o=0;k<10;k++) { s=s*10; h=t%s; //printf("%d\n",h); if(h==0.8*s) {o++; break; } t=t-h; //printf("%d\n",t);  } if(o!=0) {printf("%d\n",i+1); break;} //printf("%d\n",o);  } return 0; }