原题下载 USACO2017-FEB-B2 答案 import java.io.*; import java.util.*; public class circlecross { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(ne...
原题下载 USACO2017-FEB-B3 答案 import java.io.*; import java.util.*; public class cowqueue { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new F...
原题下载 USACO2017-FEB-B1 答案 import java.io.*; import java.util.*; public class crossroad { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new ...
原题下载 USACO2017-FEB-S3 答案: import java.io.*; import java.util.*; public class countcross { static Set<State>[][] badFields; static int n, k, r; public static void main(String[] args) thr...
原题下载 USACO2017-FEB-G3 答案: #include <iostream> #include <vector> #include <algorithm> using namespace std; #define MAXN (1 << 17) int BT[MAXN]; /* Logically executes ar...
原题下载 USACO2017-FEB-S2 答案: #include <iostream> #include <vector> #include <algorithm> using namespace std; vector<int> A; int main() { int N, K, B; cin >> N >&...
原题下载 USACO2017-FEB-S1 答案: #include <iostream> #include <fstream> #include <vector> #include <algorithm> #include <set> using namespace std; typedef pair<int,i...
原题下载 USACO2017-FEB-G2 答案: #include <iostream> #include <fstream> #include <algorithm> using namespace std; int N; int A[1000][1000]; int S[1000], T[1000]; int main(void) { i...
原题下载 USACO2017-FEB-G1 答案: #include <iostream> #include <vector> #include <queue> using namespace std; int dr[] = {0, 1, 2, 3, 2, 1, 0, -1, -2, -3, -2, -1, -1, 1, 0, 0}; int ...
