“科林明伦杯”哈尔滨理工大学第十届程序设计竞赛 H 直线
直线
https://ac.nowcoder.com/acm/contest/5758/H
H 直线
题目地址:
基本思路:
容易推得结论条直线在平面上最多的交点数为
,由于数据比较大,所以我们开
就行了。
参考代码:
#pragma GCC optimize(2) #pragma GCC optimize(3) #include <bits/stdc++.h> using namespace std; #define IO std::ios::sync_with_stdio(false) #define int __int128 #define rep(i, l, r) for (int i = l; i <= r; i++) #define per(i, l, r) for (int i = l; i >= r; i--) #define mset(s, _) memset(s, _, sizeof(s)) #define pb push_back #define pii pair <int, int> #define mp(a, b) make_pair(a, b) #define INF (int)1e18 inline int read() { int x = 0, neg = 1; char op = getchar(); while (!isdigit(op)) { if (op == '-') neg = -1; op = getchar(); } while (isdigit(op)) { x = 10 * x + op - '0'; op = getchar(); } return neg * x; } inline void print(int x) { if (x < 0) { putchar('-'); x = -x; } if (x >= 10) print(x / 10); putchar(x % 10 + '0'); } int n; signed main() { IO; int t; t = read(); while (t--){ n = read(); int ans = n * (n-1) / 2; print(ans); puts(""); } return 0; }