hdu 4722 Good Numbers ( 找规律 )

Good NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 549 Accepted Submission(s): 204

Problem DescriptionInputOutputSample InputSample OutputSource#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>#include <string>#include <map>#include <stack>#include <vector>#include <set>#include <queue>#define maxn 1000005using namespace std;typedef long long ll;ll n,m,ans,le,ri;bool isok(ll u){ ll v,t=0; while(u) { v=u%10; t+=v; u/=10; } if(t%10==0) return true ; return false ;}ll solve(ll u){ int i,j; if(u==-1) return -1; while(!isok(u)) u--; return u/10;}int main(){ int i,j,t,test=0; scanf("%d",&t); while(t--) { scanf("%I64d%I64d",&le,&ri); ans=solve(ri)-solve(le-1); printf("Case #%d: %I64d\n",++test,ans); } return 0;}