请到「后台-用户-个人资料」中填写个人说明。
原题下载 USACO2017-FEB-P2 答案: import java.io.*; import java.util.*; public class nocross { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new F...
原题下载 USACO2017-FEB-P1 答案: #include <iostream> #include <iomanip> #include <stdio.h> #include <set> #include <vector> #include <map> #include <cmath> ...
原题下载 USACO2017-OPEN-B3 答案: #include <iostream> #include <fstream> #include <cmath> using namespace std; #define MAX_N 10 int N, B[MAX_N][MAX_N]; bool color_appears(int c) { ...
原题下载 USACO2017-OPEN-B2 答案: #include <iostream> #include <fstream> #include <cmath> using namespace std; int N, M; string spotty[100], plain[100]; bool test_location(int j) {...
原题下载 USACO2017-OPEN-B1 答案: #include <iostream> #include <cstdlib> using namespace std; typedef long long ll; int main() { ll x, y; cin >> x >> y; ll ans = 0; ll by = 1...
原题下载 USACO2017-OPEN-S3 答案: #include <iostream> #include <fstream> #include <cmath> #include <vector> using namespace std; int N; string img[20]; struct PCL { int i1,j1...
原题下载 USACO2017-OPEN-S2 答案: #include <iostream> #include <fstream> #include <cmath> using namespace std; int N, M; string spotty[500], plain[500]; int S[500][50], P[500][50],...
原题下载 USACO2017-OPEN-S1 答案: #include <iostream> #include <fstream> #include <cmath> #include <algorithm> #include <vector> using namespace std; typedef pair<in...
原题下载 USACO2017-OPEN-G2 答案: #include <iostream> #include <iomanip> #include <stdio.h> #include <set> #include <vector> #include <map> #include <cmath>...
原题下载 USACO2017-OPEN-G1 答案： #include <iostream> #include <fstream> #include <cmath> #include <set> #include <cstdlib> using namespace std; int N, M; string spott...
原题下载 USACO2017-OPEN-P3 答案: #include <iostream> #include <vector> #include <map> #include <string> #include <cassert> #include <deque> #include <memory&g...
原题下载： USACO2017-OPEN-P-2 答案： by Nathan Pinsker First, consider any path between two vertices of different colors. There must exist an edge on this path whose endpoints are different colors ...
