https://codeforces.com/contest/1543
A. Exciting Bets
若 a b 不同,那么gcd最大就是他们的差,若相同,那就是多大都行了。
#include <bits/stdc++.h>
using namespace std;
void solve()
{
long long a,b;
scanf("%lld%lld",&a,&b);
if (a==b) {
puts("0 0");
}
else {
long long ans1=abs(a-b);
long long ans2=min(a%ans1,ans1-a%ans1);
printf("%lld %lld\n",ans1,ans2);
}
}
int main()
{
int ttt;
scanf("%d",&ttt);
while (ttt--) {
solve();
}
return 0;
}
B. Customising the Track
…
#include <bits/stdc++.h>
using namespace std;
long long n;
long long a[200005];
long long sum;
long long A,tmp;
long long ans;
void solve()
{
sum=0;
scanf("%lld",&n);
for (int i=1; i<=n; i++) {
scanf("%lld",&a[i]);
sum+=a[i];
}
A=sum/n;
tmp=sum%n;
ans=tmp*(n-tmp);
printf("%lld\n",ans);
}
int main()
{
int ttt;
scanf("%d",&ttt);
while (ttt--) {
solve();
}
return 0;
}
C. Need for Pink Slips
看懂题意,然后暴力
#include <bits/stdc++.h>
using namespace std;
double ans;
#define eps (0.0000001)
void dfs(double c, double m, double p, double v, int x, double val, int dep)
{
double tmp;
//P
ans+=val*p*dep;
//C
if (abs(c)>eps) {
if (c-v<=eps) {
tmp=c/(x-1);
dfs(0, abs(m)<eps ? 0 : m+tmp, p+tmp, v, x-1, val*c, dep+1);
}
else {
tmp=v/(x-1);
dfs(c-v, abs(m)<eps ? 0 : m+tmp, p+tmp, v, x, val*c, dep+1);
}
}
//M
if (abs(m)>eps) {
if (m-v<=eps) {
tmp=m/(x-1);
dfs(abs(c)<eps ? 0 : c+tmp, 0, p+tmp, v, x-1, val*m, dep+1);
}
else {
tmp=v/(x-1);
dfs(abs(c)<eps ? 0 : c+tmp, m-v, p+tmp, v, x, val*m, dep+1);
}
}
}
void solve()
{
double cc,mm,pp,vv;
ans=0;
scanf("%lf%lf%lf%lf",&cc,&mm,&pp,&vv);
dfs(cc,mm,pp,vv,3,1,1);
printf("%lf\n",ans);
}
int main()
{
int ttt;
scanf("%d",&ttt);
while (ttt--) {
solve();
}
return 0;
}
D1. RPD and Rap Sheet (Easy Version)
试 n 次,第 i 次试(初始密码是 i)的情况 。通过记录前面的异或和来实现。
#include <bits/stdc++.h>
using namespace std;
int n,k;
void solve()
{
scanf("%d%d",&n,&k);
long long x=0;
int tmp,s=0,a;
for (int i=0; i<n; i++) {
a=s^i;
printf("%d\n",a);
fflush(stdout);
scanf("%d",&tmp);
if (tmp==1) {
break;
}
else {
s^=a;
}
}
}
int main()
{
int ttt;
scanf("%d",&ttt);
while (ttt--) {
solve();
}
return 0;
}
D2. RPD and Rap Sheet (Hard Version)
和 D1 类似。
E. The Final Pursuit
…