【BestCoder】 HDOJ 5109 Alexandra and A*B Problem

哎。。。比赛的时候想到做法了。。。细节没考虑好。。。

#include <iostream>
#include <queue> 
#include <stack> 
#include <map> 
#include <set> 
#include <bitset> 
#include <cstdio> 
#include <algorithm> 
#include <cstring> 
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 1005
#define maxm 1000005
#define eps 1e-10
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
//#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head

char s[20];
LL ten[20];
LL n;
int mpp[10005];
void work(void)
{
	for(int i = 0; i <= 9; i++) mpp[i] = 1;
	for(int i = 10; i <= 99; i++) mpp[i] = 2;
	for(int i = 100; i <= 999; i++) mpp[i] = 3;
	for(int i = 1000; i <= 9999; i++) mpp[i] = 4;
	mpp[10000] = 5;
	LL ans = 1e17;
	LL len = strlen(s), b;
	ten[0] = 1;
	sscanf(s, "%I64d", &b);
	for(int i = 1; i <= 8; i++) ten[i] = ten[i-1] * 10;
	int ok = 0;
	if(s[0] == '0') ok = 1;
	else ok = 0;
	for(int i = 0; i <= 4; i++) {
		for(int j = ok; j <= n; j++) {
			LL tt = j * ten[len];
			tt += b;
			tt *= ten[i];
			LL t = tt % n;
			t = n - t;
			if(t == n) t = 0;
			int tlen = mpp[t];
			if(tlen > i && t) continue;
			ans = min(ans, (tt + t) / n);
		}

	}
	printf("%I64d\n", ans);
}

int main(void)
{
	while(scanf("%I64d%s", &n, s)!=EOF) {
		work();

	}

	return 0;
}