刷題證明
A | CodeForces 1537A | Arithmetic Arra |
#include<iostream>
using namespace std;
int main()
{
int a[10001], t, n;
int sum=0;
cin >> t;
while (t--)
{
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
sum += a[i];
}
if (sum < n)
{
printf("1\n");
}
else if (sum == n)
{
printf("0\n");
}
else
{
printf("%d\n",sum-n);
}
sum = 0;
}
}
B | CodeForces 1547A | Shortest Path with Obstacle |
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int t = 0;
int xa, ya, xb, yb, xf, yf;
cin >> t;
while (t--)
{
cin >> xa >> ya;
cin >> xb >> yb;
cin >> xf >> yf;
if (xa == xb && xa == xf && yf >= min(ya, yb) && yf <= max(ya, yb))
{
cout << abs(ya - yb) + 2 << endl;
}
else if (ya == yb && ya == yf && xf >= min(xa, xb) && xf <= max(xa, xb))
{
cout << abs(xa - xb) + 2 << endl;
}
else
{
cout << abs(ya - yb) + abs(xa - xb) << endl;
}
}
return 0;
}