问题描述:
acm题,希望给出代码或思路.(效率高的)这个题是卡时间的
Description
Staginner ,the boss of A0A(Avoid 0 AC) Company,gives you a simple task,that is to calculate how many different points are there in the group of N points.
Input
There are several test cases.
The first line of each case contains a integer N(1
Description
Staginner ,the boss of A0A(Avoid 0 AC) Company,gives you a simple task,that is to calculate how many different points are there in the group of N points.
Input
There are several test cases.
The first line of each case contains a integer N(1
问题解答:
我来补答展开全文阅读