removed unnecessary macros from c++ sol

solutions/silver/usaco-990.mdx

@@ -36,16 +36,7 @@ This process can be repeated for each possible value of $b$ from $1$ to $max(B_i
 #include <bits/stdc++.h>
 using namespace std;
 
-typedef long long ll;
-typedef long double ld;
-
-#define mpa make_pair
-#define pb push_back
-#define ins insert
-#define f first
-#define s second
 #define all(x) x.begin(), x.end()
-#define nl "\n"
 
 void fileIO(string filename) {
 	freopen((filename + ".in").c_str(), "r", stdin);
@@ -89,7 +80,7 @@ void solve() {
 		for (int j = 0; j < N && j + amount < K; j++) { cur += A[j] % i; }
 		mx = max(mx, cur);
 	}
-	cout << mx << nl;
+	cout << mx << "\n";
 }
 
 int main() {