编程介的小学生 2017-10-27 15:59 采纳率: 20.5%
浏览 829
已采纳

All Kill

Problem Description
Give nonnegative integers x1…n which are less than 32677, calculate yi,j=xi×xjmod32677. HazelFan wants to know how many sextuples (a,b,c,d,e,f) are there, satisfies gcd(ya,b,yc,d)=gcd(yc,d,ye,f)=gcd(ye,f,ya,b)=1, module 230.

Input
The first line contains a positive integer T(1≤T≤5), denoting the number of test cases.
For each test case:
The first line contains a positive integer n(1≤n≤2×105).
The second line contains n nonnegative integers x1...n(0≤xi<32677).

Output
For each test case:
A single line contains a nonnegative integer, denoting the answer.

Sample Input
2
1
1
5
1 2 3 4 5

Sample Output
1
1087

  • 写回答

1条回答 默认 最新

  • threenewbee 2017-11-14 10:43
    关注
    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论

报告相同问题?

悬赏问题

  • ¥16 mybatis的代理对象无法通过@Autowired装填
  • ¥15 可见光定位matlab仿真
  • ¥15 arduino 四自由度机械臂
  • ¥15 wordpress 产品图片 GIF 没法显示
  • ¥15 求三国群英传pl国战时间的修改方法
  • ¥15 matlab代码代写,需写出详细代码,代价私
  • ¥15 ROS系统搭建请教(跨境电商用途)
  • ¥15 AIC3204的示例代码有吗,想用AIC3204测量血氧,找不到相关的代码。
  • ¥20 CST怎么把天线放在座椅环境中并仿真
  • ¥15 任务A:大数据平台搭建(容器环境)怎么做呢?