D - Game with Pearls

#include <cstdio>#include <cmath>#include <cstring>#include <string>#include <algorithm>#include <iostream>#include <queue>#include <map>#include <set>#include <vector>using namespace std;int tm[505]; int tmp[505]; int vis[505];int main(){int t,n,k,i;cin>>t;while(t--){int cun=0;memset(vis,0,sizeof(vis)); cin>>n;cin>>k;int flag=0;for (i=1;i<=n;i++){scanf("%d",&tm[i]);if (tm[i]==0) continue;if (vis[tm[i]]==0){vis[tm[i]]=1;tm[i]=-1;}}int ok=0;for (i=1;i<=n;i++){if (tm[i]>=0){tmp[++ok]=tm[i];}}sort(tmp+1,tmp+ok+1);int j;for (j=1;j<=n;j++){if (vis[j]==0){int tt;int ff=0;int mark=0;for (i=1;i<=ok;i++){if (tmp[i]<=j&&tmp[i]!=-1){tt=j-tmp[i];if (tt%k==0){mark=1;tmp[i]=-1;vis[j]=1;    break;}}}if (mark==0){cun=1;break;}}}if (cun==1){cout<<"Tom\n";continue;}else{cout<<"Jerry\n";continue;}}return 0;}