| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 81687 | 吴思睿 | circle | C++ | Wrong Answer | 0 | 0 MS | 272 KB | 578 | 2023-08-09 20:47:18 |
#include<bits/stdc++.h> using namespace std; int t, n; int main() { cin >> t >> n; if (t == 1)//弦的数量 { cout<<n*(n-1); return 0; } if (t == 2)//交点的数量 { int a[100010]; a[1] = 0; a[2] = 0; a[3] = 0; a[4] = 1; a[5] = 5; a[6] = 15;//+10 a[7] = 35;//+20 a[8] = 70;//+35 a[9] = 122;//+52 a[10] = 210;//+78 a[11] = 316;//+106 a[12] = 455;//+139 a[13] = 735;//+280 cout << a[n]; return 0; } if (t == 3)//区域的数量 { cout<<pow(2,n-1); return 0; } return 0; }