题解：
这道题大概就是中学数学题，一开始把样例带进去，也不难得出
上述答案，但自己写代码时有几个坑点自己没注意到。
1.x>sqrt(n);
2.找因子时反复调用sqrt(n) 导致大概多了1000ms…
3.无数解条件未思考清楚
#include<bits/stdc++.h>
#define fi first
#define se second
#define log2(a) log(n)/log(2)
#define show(a) cout<<a<<endl;
#define show2(a,b) cout<<a<<" "<<b<<endl;
#define show3(a,b,c) cout<<a<<" "<<b<<" "<<c<<endl;
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<P, int> LP;
const ll inf = 1e17 + 10;
const int N = 1e5 + 10;
const ll mod = 1e9+7;
const int base=131;
const double pi=acos(-1);
vector<int> pri,en;
int n,m,k,num[N],x,vis[N],y,t;
ll ans=0,l,r;
map<int,int> mp;
string s,ss;
P a[N],b[N];
set<string> se;
int main()
{
scanf("%d",&t);
while(t--)
{
int ans=0,sum=0;
scanf("%d",&n);
int w=sqrt(n);
if(w*w==n) printf("infty\n");
else if(n%4!=0) printf("0 0\n");
else
{
n=n/4;
for(int i=1;i<=w/2;i++)
{
if(n%i==0&&(i+n/i)>w)
{
ans++;
sum=(sum+1ll*n*(i+n/i)%mod)%mod;
}
}
printf("%d %d\n",ans,sum);
}
}
return 0;
}