CodeForces
summeriver13
评论无法及时回复,着急请写邮件
mail:summeriver13@163.com
让题解尽可能的简洁
展开
-
CodeForces 目录
Codeforces 个人题解目录 C Line Empire Codeforces Round #783 (Div. 2) A Direction Change B Social Distance原创 2022-04-20 21:34:47 · 180 阅读 · 0 评论 -
Line Empire
题目 Codeforces Round #782 (Div. 2) 题解 #include<iostream> #include<cstdio> #include<vector> using namespace std; int main(void) { #define int long long int int t; scanf("%lld",&t); while(t--){ int n,a,b; scanf("%lld %lld %lld"原创 2022-04-20 21:33:14 · 358 阅读 · 0 评论 -
Social Distance
题目 Codeforces Round #783 (Div. 2) 题解 #include<iostream> #include<vector> #include<algorithm> using namespace std; int cmp(int a,int b){ return a>b; } bool solve(int n,int m){ int a[100005]; for(int i=0;i<n;i++) cin >>原创 2022-04-20 21:31:25 · 281 阅读 · 0 评论 -
Direction Change
题目 Codeforces Round #783 (Div. 2) 题解 #include<iostream> #include<algorithm> using namespace std; long long solve(long long n,long long m){ long long ans = min(m,n),dx = abs(m-n); ans = 2*(ans-1); if(dx%2) ans += (dx/2)*4+1;原创 2022-04-20 21:24:47 · 323 阅读 · 0 评论