第1741页-国际竞赛-翰林国际教育

ALL

USACO 2017 January Contest, Silver Problem 1. Cow Dance Show

2017-11-10

原题下载 USACO2017-JAN-S1 答案: import java.io.*; import java.util.*; public class cowdance { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new ...

USACO 2017 January Contest, Silver Problem 2. Hoof, Paper, Scissors

2017-11-10

原题下载 USACO2017-JAN-S2 答案: import java.io.*; import java.util.*; public class hps { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new FileR...

USACO 2017 January Contest, Silver Problem 3. Secret Cow Code

2017-11-10

原题下载 USACO2017-JAN-S3 答案: import java.io.*; import java.util.*; public class cowcode { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new F...

USACO 2017 January Contest, Gold Problem 1. Balanced Photo

2017-11-10

原题下载 USACO2017-JAN-G1 答案: import java.io.*; import java.util.*; public class bphoto { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new Fi...

USACO 2017 January Contest, Gold Problem 2. Hoof, Paper, Scissors

2017-11-10

原题下载 USACO2017-JAN-G2 答案: #include <cstdio> #include <cassert> #include <algorithm> using namespace std; #define NMAX 100000 #define KMAX 20 int moves[NMAX]; int dp[NMAX + 1...

USACO 2017 January Contest, Gold Problem 3. Cow Navigation

2017-11-10

原题下载 USACO2017-JAN-G3 答案: import java.io.*; import java.util.*; public class cownav { static int[] dx = new int[]{-1,0,1,0}; static int[] dy = new int[]{0,1,0,-1}; static int n; static char[]...

USACO 2017 January Contest, Platinum Problem 1. Promotion Counting

2017-11-10

原题下载 USACO2017-JAN-P1 答案: import java.io.*; import java.util.*; public class promote { static LinkedList<Integer>[] children; static int[] size; static int[] start; public static void m...

USACO 2017 January Contest, Platinum Problem 2. Building a Tall Barn

2017-11-10

原题下载 USACO2017-JAN-P2 答案: #include <bits/stdc++.h> using namespace std; typedef long long ll; const int MAXN = 1e5+5; ll n, k, a[MAXN]; ll ct(double x) { ll tot = 0; for (int i = 0; i &...

USACO 2017 January Contest, Platinum Problem 3. Subsequence Reversal

2017-11-10

原题下载 USACO2017-JAN-P3 答案: import java.util.Arrays; import java.util.Scanner; public class subrev { public static void main (String[] args) { Scanner in = new Scanner(System.in); int n = in.ne...