又在挖坑了
A
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>
using namespace std;
#define LL long long
#define pb push_back
#define mk make_pair
#define fi first
#define se second
#define lson (rt << 1)
#define rson ((rt << 1) | 1)
#define pill pair<int, int>
#define mst(a, b) memset(a, b, sizeof a)
#define REP(i, x, n) for(int i = x; i <= n; ++i)
const int MOD = 1e9 + 7;
const int qq = 1e5 + 10;
const int INF = 1e9 + 10;
int main(){
int t; scanf("%d", &t);
while (t--) {
int num[3];
for (int i = 0; i < 3; ++i) {
scanf("%d", num + i);
}
int minx = min(num[0], min(num[1], num[2]));
printf("%d\n", minx);
}
return 0;
}
B
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>
using namespace std;
#define LL long long
#define pb push_back
#define mk make_pair
#define fi first
#define se second
#define lson (rt << 1)
#define rson ((rt << 1) | 1)
#define pill pair<int, int>
#define mst(a, b) memset(a, b, sizeof a)
#define REP(i, x, n) for(int i = x; i <= n; ++i)
const int MOD = 1e9 + 7;
const int qq = 1e5 + 10;
const int INF = 1e9 + 10;
int num[5];
int main(){
int t; scanf("%d", &t);
while (t--) {
for (int i = 0; i < 4; ++i) {
scanf("%d", num + i);
}
int a = num[0];
int b = num[1] + (num[2] - num[3]);
if (a == b) puts("Walk");
else if(a > b) puts("Bus");
else puts("Walk");
}
return 0;
}
C
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>
using namespace std;
#define LL long long
#define pb push_back
#define mk make_pair
#define fi first
#define se second
#define lson (rt << 1)
#define rson ((rt << 1) | 1)
#define pill pair<int, int>
#define mst(a, b) memset(a, b, sizeof a)
#define REP(i, x, n) for(int i = x; i <= n; ++i)
const int MOD = 1e9 + 7;
const int qq = 1e5 + 10;
const int INF = 1e9 + 10;
int main(){
int t; scanf("%d", &t);
while (t--) {
int n; scanf("%d", &n);
int maxn = 0;
int num[4];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < 4; ++j) {
scanf("%d", num + j);
}
maxn = max(maxn, abs(num[0] - num[2]) + abs(num[1] - num[3]));
}
printf("%d\n", maxn);
}
return 0;
}
D