태그 : 1000p 요약보기전체보기목록닫기
- BridgeCrossing(0)2020.03.19
- HillHike(0)2020.03.10
- SetComparison(0)2019.11.17
- ShuffleMethod(0)2019.10.04
- UndergroundVault(0)2019.08.04
- Planets(0)2019.06.20
- GasStations(0)2019.03.10
- PickTeam(0)2019.02.28
- PossibleOrders(0)2018.06.21
1
- Topcoder
- 2020/03/19 14:25
Codeimport java.util.Arrays;public class BridgeCrossing{ int n, min; boolean[] a; int[] times; void go(int...
Codepublic class HillHike{ public long numPaths(int distance, int maxHeight, int[] _landmarks) { long[][][] cache1 = new long[2]...
- Topcoder
- 2019/11/17 20:29
Codeimport java.util.HashSet;import java.util.TreeSet;import java.util.StringTokenizer;public class SetComparison{ HashSet getSet(StringTokenizer st) { ...
- Topcoder
- 2019/10/04 18:35
Codepublic class ShuffleMethod{ int n; int[] ts; boolean[] flag; int[] sn; &nbs...
- Topcoder
- 2019/08/04 03:39
Code1import java.util.ArrayList;public class UndergroundVault{ int n; boolean canBeSealed(int[][] adj, boolean[] sealed, int room) { &n...
Codeimport java.text.DecimalFormat;public class Planets{ public String[] locations(String[] planets, int time) { double G = 6.67...
- Topcoder
- 2019/03/10 00:42
Codepublic class GasStations{ public double tripCost(int[] dist, int[] price, int _mpg, int tankSize, int tripLength) { if(_mpg*...
Codeimport java.util.Arrays;public class PickTeam{ int n, bestSum; int[] team; int[][] nums; String[] name...
- Topcoder
- 2018/06/21 16:44
Codepublic class PossibleOrders{ int N; long sum; long comb(long n, long r) { long denom=1, numer=1; whil...
1
최근 덧글