高精度除法

noip到了，赶紧打个板子
之前打的高精度全家桶不见了。。。以后再补
先贴个高精度除以高精度
时间复杂度应该是$O(n^2)$*巨大常数，似乎还有更优秀的做法，然而我太菜并不会

//#pragma GCC optimize(3)
#include<iostream>
#include<iomanip>
#include<stack>
#include<queue>
#include<list>
#include<vector>
#include<set>
#include<map>
#include<string>
#include<bitset>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<ctime>
#define ll long long
#define db double
#define inf 1005
#define infm 200001
#define INF 1e9
#define pi acos(-1)
//char buf[10000001],*Hd,*Tl;
//#define getchar(ch) {if (Hd==Tl){int len=fread(buf,1,10000000,stdin);Hd=buf,Tl=Hd+len;}ch=(*Hd++);}
#define getchar(ch) ch=getchar()
#define rd(n) {n=0;char ch;int f=0;do{getchar(ch);if(ch=='-'){f=1;}}while(ch<'0'||ch>'9');while('0'<=ch&&ch<='9'){n=(n<<1)+(n<<3)+ch-48;getchar(ch);}if(f)n=-n;}
using namespace std;

struct bignum{
   
	int len;
	int a[inf];
	bignum(){
   
		len=0;
		memset(a,0,sizeof(a));
	}
}a,b,tmp,ans;

bignum num_init(char str[]){
   
	bignum t;