BZOJ 3733 [Pa2013] Iloczyn【搜索剪枝】

#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define ll long long
#define rep(i,x,y) for(ll i=(x);i<=(y);i++)
#define repl(i,x,y) for(ll i=(x);i<(y);i++)
#define repd(i,x,y) for(ll i=(x);i>=(y);i--)
using namespace std;

const ll N=2e3+5;

ll t,n,m,w[N],f[N][N];

inline ll read() {
	ll x=0;char ch=getchar();bool f=0;
	while(ch>'9'||ch<'0'){if(ch=='-')f=1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
	return f?-x:x;
}

void split(ll x) {
	w[0]=0;
	rep(i,1,sqrt(x)) if(x%i==0) {
		w[++w[0]]=i;
		if(i*i!=x) w[++w[0]]=x/i;
	}
	
	sort(w+1,w+1+w[0]);
}

bool dfs(ll x,ll y,ll z) {
	if(!y) return z==n;
	
	y--;
	
	for(;x+y<=w[0];x++) {
		if(f[x][y]<0) return 0;
		
		if(f[x][y]*z>n) return 0;
		
		if(dfs(x+1,y,z*w[x])) return 1;
	}
	
	return 0;
}

int main() {
	t=read();
	
	while(t--) {
		n=read(),m=read();
		
		split(n);
		
		rep(i,1,w[0]) {
			ll ret=1;
			for(ll j=0;j<m&&i+j<=w[0];j++) {
				if(ret>0) {
					ret*=w[i+j];
					if(ret>n) ret=-1;
				}
				f[i][j]=ret;
			}
		}
		
		if(dfs(1,m,1)) puts("TAK");
		else puts("NIE");
	}

	return 0;
}