Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|---|
55001 | wssdr | 数对 | C++ | Time Limit Exceeded | 0 | 1000 MS | 9564 KB | 394 | 2022-08-08 11:56:43 |
#include<bits/stdc++.h> using namespace std; int T,n,ans; int mp[2385609]; int main(){ // freopen("pair.in","r",stdin); // freopen("pair.out","w",stdout); scanf("%d",&T); while(T--){ memset(mp,0,sizeof(mp));ans=0; scanf("%d",&n); for(int a(1);a<=n;++a) for(int b(a);b<=n-a;++b) if((a*b)%(a+b)==0&&!mp[a+b]){++ans;mp[a+b]=1;} printf("%d\n",ans); } return 0; }