ACM多校
无
西伯利亚松鼠
退役ACMer,退役MOer
展开
-
2020 Multi-University Training Contest 6 —— Little Rabbit‘s Equation
题目 输入 输出 Sample Input 1+1=10 18-9=9 AA*AA=70E4 7/2=3 Sample Output 2 10 16 -1 //Siberian Squirrel #pragma GCC optimize(2) #include<bits/stdc++.h> using namespace std; #define print(x) printf("%d\n", x) typedef long long ll; const double PI = acos(原创 2020-08-14 13:52:56 · 635 阅读 · 0 评论 -
2020 Multi-University Training Contest 6 —— Road To The 3rd Building
Problem Description Input Output Sample Input 3 3 1 3 2 6 1 1 4 5 1 4 9 7325 516 56940 120670 16272 15007 337527 333184 742294 Sample Output 83333336 188888893 303405448 Hint The answer to the first testcase is 25/12. num[1] num[2] num[3] num[4] num[5]原创 2020-08-06 19:12:18 · 632 阅读 · 0 评论 -
2020 Multi-University Training Contest 5 —— Tetrahedron
题目描述: Generate three integers a, b, and c in [1,n] with equal probability independently, and use them as the three right-angle side length of a right-angled tetrahedron. Find the expectation of the reciprocal square of the distance from the right-angle ape原创 2020-08-04 22:40:54 · 699 阅读 · 0 评论 -
2020 Multi-University Training Contest 2 ---- 1006 The Oculus
问题描述: Let’s define the Fibonacci sequence F1,F2,… as F1=1,F2=2,Fi=Fi−1+Fi−2 (i≥3). It’s well known that every positive integer x has its unique Fibonacci representation (b1,b2,…,bn) such that: · b1×F1+b2×F2+⋯+bn×Fn=x. · bn=1, and for each i (1≤i<n), bi∈原创 2020-07-23 20:20:28 · 598 阅读 · 0 评论 -
2020牛客暑期多校第一场J题
牛客多校暑期第一场J题: 题目: AC代码: using namespace std; typedef long long ll; const int MOD = 998244353; ll inv[2000001]; void pre(int MOD){ inv[0] = inv[1]=1; for(int i = 2; i < 2000001; i++) inv[i] = ((MOD - MOD / i) * inv[MOD % i]) % MOD; }原创 2020-07-16 00:20:06 · 691 阅读 · 0 评论