哈尔滨理工大学软件学院ACM程序设计全国邀请赛(网络同步赛) D. Pairs FFT
Pairs
Description
Given N integers,count the number of pairs of integers whose sum is less than K. And we have Mqueries.
Input
The first behavioris an integer T (1 < = T < = 10), on behalf
原创
2016-12-04 16:36:18 ·
647 阅读 ·
0 评论