src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringlengths 6 50 | from stringclasses 1
value |
|---|---|---|---|
import java.io.*;
import java.util.*;
public class CF1185G2 {
static final int MD = 1000000007;
static int[][] solve1(int[] aa, int t, int n) {
int[][] da = new int[t + 1][n + 1];
da[0][0] = 1;
for (int i = 0; i < n; i++) {
int a = aa[i];
for (int s = t - 1; s >= 0; s--)
for (int m = 0; m < n; m++) {... | cubic | 1185_G2. Playlist for Polycarp (hard version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
static int n, t[], g[], MOD = (int) 1e9 + 7;
static int[][][] memo1, memo2[], memo3[];
static int dp1(int idx, int remCnt, int remSum) {
if (idx == n)
return remSum == 0 && remCnt==0 ? 1 : 0;
if (memo1[idx][remCnt][remSum] != -1)
return memo1[idx][r... | cubic | 1185_G2. Playlist for Polycarp (hard version) | CODEFORCES |
import java.io.*;
import java.text.*;
import java.util.*;
import java.math.*;
public class template {
public static void main(String[] args) throws Exception {
new template().run();
}
long MOD = 1_000_000_007;
public void run() throws Exception {
FastScanner f = new FastScanner();
PrintWriter out = new PrintW... | cubic | 1185_G2. Playlist for Polycarp (hard version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
static int n,t[],g[],MOD=(int)1e9+7;
static int [][][]memo1,memo2[],memo3[];
static int dp1(int idx,int remCnt,int remSum) {
if(remCnt==0)
return remSum==0?1:0;
if(remSum==0 || idx==n)
return 0;
if(memo1[idx][remCnt][remSum]!=-1)
return memo1[id... | cubic | 1185_G2. Playlist for Polycarp (hard version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
static int n, t[], g[], MOD = (int) 1e9 + 7;
static int[][][] memo1, memo2[], memo3[];
static int dp1(int idx, int remCnt, int remSum) {
if (idx == n)
return remSum == 0 && remCnt == 0 ? 1 : 0;
if (remCnt < 0 || remSum < 0)
return 0;
if (memo1[idx... | cubic | 1185_G2. Playlist for Polycarp (hard version) | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.Arr... | cubic | 1185_G2. Playlist for Polycarp (hard version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
static int n, t[], g[], MOD = (int) 1e9 + 7;
static int[][][] memo1, memo2[], memo3[];
static int dp1(int idx, int remCnt, int remSum) {
if (idx == n)
return remSum == 0 && remCnt == 0 ? 1 : 0;
if (remCnt < 0 || remSum < 0)
return 0;
if (memo1[idx... | cubic | 1185_G2. Playlist for Polycarp (hard version) | CODEFORCES |
// Don't place your source in a package
import javax.swing.*;
import java.lang.reflect.Array;
import java.text.DecimalFormat;
import java.util.*;
import java.lang.*;
import java.io.*;
import java.math.*;
import java.util.stream.Stream;
// Please name your class Main
public class Main {
static FastScanner fs=new F... | cubic | 1185_G2. Playlist for Polycarp (hard version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
static int n, t[], g[], MOD = (int) 1e9 + 7;
static int[][][] memo1, memo2[], memo3[];
static int dp1(int idx, int remCnt, int remSum) {
if (idx == n)
return remSum == 0 && remCnt==0 ? 1 : 0;
if(remCnt<0 || remSum<0)
return 0;
if (memo1[idx][remCn... | cubic | 1185_G2. Playlist for Polycarp (hard version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
static int n, t[], g[], MOD = (int) 1e9 + 7;
static int[][][] memo1, memo2[], memo3[];
static int dp1(int idx, int remCnt, int remSum) {
if (idx == n)
return remSum == 0 && remCnt == 0 ? 1 : 0;
if (remCnt < 0 || remSum < 0)
return 0;
if (memo1[idx... | cubic | 1185_G2. Playlist for Polycarp (hard version) | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.Arr... | cubic | 1185_G2. Playlist for Polycarp (hard version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class CF1185G2 {
static final int MD = 1000000007;
static int[][] solve1(int[] aa, int t, int n) {
int[][] da = new int[t + 1][n + 1];
da[0][0] = 1;
for (int i = 0; i < n; i++) {
int a = aa[i];
for (int s = t - 1; s >= 0; s--)
for (int m = 0; m < n; m++) {... | cubic | 1185_G2. Playlist for Polycarp (hard version) | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.Arr... | cubic | 1185_G2. Playlist for Polycarp (hard version) | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.IOException;
import java.io.UncheckedIOException;
import java.io.Closeable;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.InputStream;
/**
* Built using CHelper p... | cubic | 1185_G2. Playlist for Polycarp (hard version) | CODEFORCES |
//package prac;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class Round568G {
InputStream is;
PrintWriter out;
String INPUT = "";
//
void solve()
{
int n = ... | cubic | 1185_G2. Playlist for Polycarp (hard version) | CODEFORCES |
// https://codeforces.com/contest/1185/submission/55800229 (rainboy)
import java.io.*;
import java.util.*;
public class CF1185G2 {
static final int MD = 1000000007;
static int[][] solve1(int[] aa, int t, int n) {
int[][] da = new int[t + 1][n + 1];
da[0][0] = 1;
for (int i = 0; i < n; i++) {
int a = aa[i];
... | cubic | 1185_G2. Playlist for Polycarp (hard version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
static int n, t[], g[], MOD = (int) 1e9 + 7;
static int[][][] memo1, memo2[], memo3[];
static int dp1(int idx, int remCnt, int remSum) {
if (idx == n)
return remSum == 0 && remCnt == 0 ? 1 : 0;
if (remCnt < 0 || remSum < 0)
return 0;
if (memo1[idx... | cubic | 1185_G2. Playlist for Polycarp (hard version) | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
import java.awt.Point;
public class CFTemplate {
static final long MOD = 1000000007L;
//static final long MOD2 = 1000000009L;
//static final long MOD = 998244353L;
//static final long INF = 500000000000L;
static final int INF = 1100000000... | cubic | 1497E2 | CODEFORCES |
import java.util.*;
import java.io.*;
public class Solve{
public static void main(String[] args) throws Exception{
Scanner sc=new Scanner(System.in);
PrintWriter out =new PrintWriter(System.out);
int size=(int)1e7+1;
int[] pr=new int[size];
for(int i=0;i<size;i++){
... | cubic | 1497E2 | CODEFORCES |
import java.io.*;
import java.util.*;
public class E2 {
static ArrayList<Integer> primes;
static int[] mind;
final static int MAXA = (int) 1e7;
public static void main(String[] args) throws IOException {
BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
StringTok... | cubic | 1497E2 | CODEFORCES |
// https://codeforces.com/contest/1497/submission/110250082
import java.io.*;
import java.util.*;
public class CF1497E2 extends PrintWriter {
CF1497E2() { super(System.out); }
static class Scanner {
Scanner(InputStream in) { this.in = in; } InputStream in;
byte[] bb = new byte[1 << 15]; int i, n;
byte getc() {... | cubic | 1497E2 | CODEFORCES |
import java.io.*;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;
public class E3 {
InputStream is;
FastWriter out;
String INPUT = "";
void solve()
{
for(int T = ni();T > 0;T--)go();
}
int[] lpf = enumLowestPrimeFactors(10000000);
voi... | cubic | 1497E2 | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
InputStreamReader in = new InputStreamReader(System.in);
BufferedReader br = new BufferedReader(in);
int t = Integer.parseInt(br.readLine());
// get primes up to 10000
/*
bo... | cubic | 1497E2 | CODEFORCES |
/**
* author: derrick20
* created: 3/20/21 7:13 PM
*/
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class E2_SquareFreeFast {
static FastScanner sc = new FastScanner();
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) {
// ... | cubic | 1497E2 | CODEFORCES |
import java.util.*;
import java.io.*;
public class SolutionC{
public static void main(String[] args) throws Exception{
Scanner sc=new Scanner(System.in);
PrintWriter out=new PrintWriter(System.out);
int t=sc.nextInt();
int[] arr=new int[10000002];
for(int i=0;i<arr... | cubic | 1497E2 | CODEFORCES |
import java.util.*;
import java.io.*;
public class EdE {
static long[] mods = {1000000007, 998244353, 1000000009};
static long mod = mods[0];
public static MyScanner sc;
public static PrintWriter out;
static ArrayList<Integer> primes;
public static void main(String[] omkar) throws Exception{
// TODO Auto-... | cubic | 1497E2 | CODEFORCES |
import java.io.*;
import java.util.*;
public class CF1497E2 extends PrintWriter {
CF1497E2() { super(System.out); }
static class Scanner {
Scanner(InputStream in) { this.in = in; } InputStream in;
byte[] bb = new byte[1 << 15]; int i, n;
byte getc() {
if (i == n) {
i = n = 0;
try { n = in.read(bb); ... | cubic | 1497E2 | CODEFORCES |
import java.util.*;
import java.io.*;
public class cf1497_Div2_E2 {
static int[] spf;
public static int factor(int n) {
int val = 1;
while (n > 1) {
int cnt = 0;
int p = spf[n];
while (n % p == 0) {
cnt++;
n /= p;
}
if (cnt % 2 == 1)
val *= p;
}
return val;
}
public static vo... | cubic | 1497E2 | CODEFORCES |
//stan hu tao
//join nct ridin by first year culture reps
import static java.lang.Math.max;
import static java.lang.Math.min;
import static java.lang.Math.abs;
import static java.lang.System.out;
import java.util.*;
import java.io.*;
import java.math.*;
public class x1497E
{
static final int MAX = 10000000;
pu... | cubic | 1497E2 | CODEFORCES |
import java.util.*;
import java.io.*;
public class Solve{
public static void main(String[] args) throws Exception{
Scanner sc=new Scanner(System.in);
PrintWriter out =new PrintWriter(System.out);
int size=(int)1e7+1;
int[] pr=new int[size];
for(int i=0;i<size;i++){
... | cubic | 1497E2 | CODEFORCES |
/**
* author: derrick20
* created: 3/19/21 11:57 PM
*/
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class E2_SquareFreeDivision2 {
static FastScanner sc = new FastScanner();
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) {
//... | cubic | 1497E2 | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
static final int primeCount = 452;
static final int[] prime = new int[primeCount];
static void build_prime() {
boolean[] notPrime = new boolean[3200];
for (int i = 2; i < 3200; i++) {
if (notPrime[i]) continue;
... | cubic | 1497E2 | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
static final int primeCount = 452;
static final int[] prime = new int[primeCount];
static void build_prime() {
boolean[] notPrime = new boolean[3200];
for (int i = 2; i < 3200; i++) {
if (notPrime[i]) continue;
... | cubic | 1497E2 | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.stream.IntStream;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.T... | cubic | 1497E2 | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class SolutionE extends Thread {
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new B... | cubic | 1497E2 | CODEFORCES |
// Don't place your source in a package
import java.lang.reflect.Array;
import java.text.DecimalFormat;
import java.util.*;
import java.lang.*;
import java.io.*;
import java.math.*;
// Please name your class Main
public class Main {
static FastScanner fs=new FastScanner();
static class FastScanner {//sc... | cubic | 1497E2 | CODEFORCES |
/**
* author: derrick20
* created: 3/19/21 11:57 PM
*/
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class E2_SquareFreeDivision2 {
static FastScanner sc = new FastScanner();
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) {
//... | cubic | 1497E2 | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
import java.text.*;
public class Main {
static PrintWriter out;
static Reader in;
public static void main(String[] args) throws IOException {
input_output();
Main solver = new Main();
solver.solve();
out.close();
... | cubic | 1497E2 | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.util.*;
import java.math.*;
/*
50
873 838 288 87 889 364 720 410 565 651 577 356 740 99 549 592 994 385 777 435 486 118 887 440 749 533 356 790 413 681 267 496 475 317 88 660 374 186 61 437 729 860 880 538 277 301 667 180 60 393
6
2 2 3 3 5 5
4... | cubic | 840_C. On the Bench | CODEFORCES |
//package round429;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
// 203530
public class C {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = n... | cubic | 840_C. On the Bench | CODEFORCES |
import java.io.*;
import java.util.*;
public class C {
int removeSq(int x) {
for (int i = 2; i * i <= x; i++) {
while (x % (i * i) == 0) {
x /= i * i;
}
}
return x;
}
void submit() {
int n = nextInt();
HashMap<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < n; i++) {
int x =... | cubic | 840_C. On the Bench | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.List;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
impo... | cubic | 840_C. On the Bench | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Div1_429C {
static final long MOD = 1_000_000_007;
static long[] fact = new long[3... | cubic | 840_C. On the Bench | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOExcept... | cubic | 840_C. On the Bench | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintStream;
import java.util.Arrays;
import java.io.IOException;
import java.io.UncheckedIOException;
import java.io.Closeable;
import java.io.Writer;
import java.io.OutputStreamWriter;
impo... | cubic | 840_C. On the Bench | CODEFORCES |
/**
* author: derrick20
* created: 11/11/20 1:03 PM
*/
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class OnTheBench {
public static void main(String[] args) {
setupCombo(301);
FastScanner sc = new FastScanner();
PrintWriter out = new PrintWriter(System.ou... | cubic | 840_C. On the Bench | CODEFORCES |
/**
* author: derrick20
* created: 11/11/20 1:45 PM
*/
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class OnTheBenchAlt {
public static void main(String[] args) {
setupCombo(301);
FastScanner sc = new FastScanner();
PrintWriter out = new PrintWriter(System... | cubic | 840_C. On the Bench | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.HashMap;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.io.InputStream... | cubic | 840_C. On the Bench | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Iterator;
import java.io.IOException;
import java.util.Comparator;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
... | cubic | 840_C. On the Bench | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.List;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
impo... | cubic | 840_C. On the Bench | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper... | cubic | 840_C. On the Bench | CODEFORCES |
//package round429;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class C2 {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni();
in... | cubic | 840_C. On the Bench | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
import java.util.concurrent.*;
public final class on_the_bench
{
static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
static FastScanner sc=new FastScanner(br);
static PrintWriter out=new PrintWriter(System.out);
static Rando... | cubic | 840_C. On the Bench | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.HashMap;
import java.util.StringTokenizer;
/*
2
3 5
2
6 5
1 11
-10 12
3
3 6 2
1 8 5 3
-7 9 5 3
-7 4 14 3
1 8 5 3
1 3 13 3
-2... | cubic | 840_C. On the Bench | CODEFORCES |
//package round429;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class C2 {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni();
in... | cubic | 840_C. On the Bench | CODEFORCES |
//package round429;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class C2 {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni();
in... | cubic | 840_C. On the Bench | CODEFORCES |
import java.io.*;
import java.util.*;
public class MainD {
static final StdIn in = new StdIn();
static final PrintWriter out = new PrintWriter(System.out);
static final long M=(long)1e9+7;
static long[] fac, faci;
public static void main(String[] args) {
int n=in.nextInt();
fac = new long[n+1];
faci = new... | cubic | 840_C. On the Bench | CODEFORCES |
// Author : RegalBeast
import java.io.*;
import java.util.*;
public class Main {
static final FastReader FR = new FastReader();
static final PrintWriter PW = new PrintWriter(new OutputStreamWriter(System.out));
public static void main(String[] args) {
StringBuilder solution = new StringBuilder();
int r... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
import static java.lang.Double.parseDouble;
import static java.lang.Integer.parseInt;
import static java.lang.Long.parseLong;
import static java.lang.System.in;
import static jav... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class D {
static byte[] buf = new byte[1<<26];
static int bp = -1;
public static void main(String[] args) throws IOException {
/**/
DataInputStream in = new DataInputStream(System.in);
/*/
DataInputStream in = new DataInputStream(new Fi... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
import java.io.*;
public class D
{
static FastIO f;
static long ve[][], he[][];
public static void main(String args[]) throws IOException
{
f = new FastIO();
int n = f.ni(), m = f.ni(), k = f.ni(), i, j;
ve = new long[n-1][];
he = new long[n][];
long[][] ans = new long[n][m], pans... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
import java.io.*;
public class D {
public static int dir[][]={{-1,0},{1,0},{0,-1},{0,1}};
public static void main(String[] args) {
// Scanner sc=new Scanner(System.in);
FastScanner sc = new FastScanner();
FastOutput out = new FastOutput(System.out);
int n=sc.nextInt();
int m=sc.nextInt()... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.*;
import java.util.*;
public final class Solution {
static PrintWriter out = new PrintWriter(System.out);
static FastReader in = new FastReader();
static long mod = (long) 1e9 + 7;
static Pair[] moves = new Pair[]{new Pair(-1, 0), new Pair(1, 0), new Pair(0, -1), new Pair(0, 1)};
... | cubic | 1517_D. Explorer Space | CODEFORCES |
//package round718;
import java.io.*;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;
public class D2 {
InputStream is;
FastWriter out;
String INPUT = "";//2 5 9 9 9 9 9 8 8 8 8 5 6 7 8 9";
void solve()
{
int n = ni(), m = ni(), K = ni();
... | cubic | 1517_D. Explorer Space | CODEFORCES |
// Don't place your source in a package
import javax.swing.*;
import java.lang.reflect.Array;
import java.text.DecimalFormat;
import java.util.*;
import java.lang.*;
import java.io.*;
import java.math.*;
import java.util.stream.Stream;
// Please name your class Main
public class Main {
static FastScanner fs=new F... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
import java.awt.Point;
public class Main {
static final long MOD = 1000000007L;
//static final long MOD2 = 1000000009L;
//static final long MOD = 998244353L;
//static final long INF = 500000000000L;
static final int INF = 1000000005;
... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.*;
import java.util.Arrays;
import java.util.List;
import java.util.StringTokenizer;
public class Main {
static PrintWriter pw;
static _Scanner sc;
public static void main(String[] args) throws Exception {
sc = new _Scanner(System.in);
pw = new PrintWriter(System.out);
... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOExcept... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.Input... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.PrintWriter;
import java.util.*;
public class D {
static Scanner sc;
static PrintWriter out;
public static void main(String[] args) throws Exception {
sc = new Scanner(System.in);
out = new PrintWriter(System.out);
//int t = sc.nextInt();
for(int i=0; i<1; ... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
import java.io.*;
public class EdE {
static long[] mods = {1000000007, 998244353, 1000000009};
static long mod = mods[0];
public static MyScanner sc;
public static PrintWriter out;
static long[][][] paths;
static long[] powers501;
public static void main(String[] havish) throws Excep... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.Scanner;
public class D {
static long[][][] dp;
static int[][] hor, ver;
static int n, m;
static int[][] dir = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
public static boolean isValid (int row, int col) {
return row >= 0 && col >= 0 && row < n && col < m;
}
public static... | cubic | 1517_D. Explorer Space | CODEFORCES |
//Utilities
import java.io.*;
import java.util.*;
public class Main {
static int n, m, k;
static int[][] horW, verW;
static int[][][] dp = new int[505][505][15];
public static void main(String[] args) throws IOException {
for (int i = 0; i < 505; i++) {
for (int j = 0; j < 505; j++) {
for (int k = 0; k ... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;
public class Main {
public static void deal(int n,int m,int k,int[][] d1,int[][] d2) {
if(k % 2 == 1) {
for(int i=0;i<n;i++) {
for(int j=0;j<m;j++) {
System.out.print("-1 ");
... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
import java.io.*;
public class D {
static class Scan {
private byte[] buf=new byte[1024];
private int index;
private InputStream in;
private int total;
public Scan()
{
in=System.in;
}
public int scan()throws IOException
... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.*;
import java.util.*;
public class CF1517D extends PrintWriter {
CF1517D() { super(System.out); }
Scanner sc = new Scanner(System.in);
public static void main(String[] $) {
CF1517D o = new CF1517D(); o.main(); o.flush();
}
static final int INF = 0x3f3f3f3f;
void main() {
int n = sc.nextInt()... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.util.*;
public class Main{
static class FastScanner {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringT... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
import java.io.*;
public class D1517 {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
PrintWriter pw = new PrintWriter(System.out);
int n = sc.nextInt();
int m = sc.nextInt();
int k = sc.nextInt();
int[][] costRight = new int[n][m - 1]... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
public class Main {
public static Scanner scan = new Scanner(System.in);
int n, m;
int[][] x;
int[][] y;
int k, k2;
int[][] sol0;
int[][] sol1;
public Main(int[][] x, int[][] y, int k) {
this.x = x;
this.y = y;
this.k = k;
this.n = x.length;
this.m = x[0]... | cubic | 1517_D. Explorer Space | CODEFORCES |
// Main Code at the Bottom
import java.util.*;
import java.io.*;
public class Main{
//Fast IO class
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
boolean env=System.getProperty("ONLINE_JUDGE") != null;
//env=true;
if(!en... | cubic | 1517_D. Explorer Space | CODEFORCES |
//created by Whiplash99
import java.io.*;
import java.util.*;
public class D
{
private static ArrayDeque<Integer>[][] edge;
private static long[][] dp[],w1,w2;
private static int N,M,K;
private static void answer()
{
StringBuilder sb=new StringBuilder();
for(int i=0;i<N;i++)
... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class Main
{
static FastReader sc=new FastReader();
static long dp[][][];
static int mod=1000000007;
public static void main(String[] args) throws IOException
{
//CHECK FOR N=1
//CHECK FOR N=1
//CHECK FOR N=1
... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
import java.io.*;
public class B{
static int[][] hor;
static int[][] ver;
static int n;
static int m;
static int k;
static long[][][] dp;
static long dist(int row, int col)
{
if(k%2==1)return Integer.MAX_VALUE;
return 2*make(row,col,k/2);
}
static long make(int row, int col, int mo... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
/**
*
* @Har_Har_Mahadev
*/
public class D {
private static long INF = 2000000000000000000L, M = 1000000007, MM = 998244353;
private static int N = 0;
private static long[][][] dp;
private static long[][] ff;
private static long[][] ss;
public stati... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
import java.io.*;
public class D {
static int mod = (int) (1e9+7);
static InputReader in;
static PrintWriter out;
static void solve()
{
in = new InputReader(System.in);
out = new PrintWriter(System.out);
int t = 1;
... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String args[])
{
FastReader input=new FastReader();
PrintWriter out=new PrintWriter(System.out);
int T=1;
while(T-->0)
{
int n=input.nextInt();
int m=input.nextInt();... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
// Created by @thesupremeone on 23/04/21
public class ExplorerSpace {
int[][] horizontal, vertical;
int n, m;
long[][][] dp;
int large = Integer.MAX_VALUE;
boolean isValid(int i, int j){
return i>=0 && j>=0 && i<n && j<m;
}
... | cubic | 1517_D. Explorer Space | CODEFORCES |
// package com.company.codeforces;
import java.util.*;
public class Solution {
static int n,m,h[][],v[][];
public static void main(String[] args) {
Scanner input=new Scanner(System.in);
n=input.nextInt();
m=input.nextInt();
int k=input.nextInt();
h=new... | cubic | 1517_D. Explorer Space | CODEFORCES |
//package Codeforces.Round718Div1_2;
import java.io.*;
import java.util.*;
public class D {
static boolean isValid(int n, int m, int i, int j){
return 0<=i && i<n && 0<=j && j<m;
}
public static void main(String[] args) throws IOException {
Soumit sc = new Soumit();
int n = sc.nex... | cubic | 1517_D. Explorer Space | CODEFORCES |
//Template with FastScanner
// jzzhao
import java.util.*;
import java.io.*;
public class Solution {
public static void main(String[] args) {
FastScanner sc = new FastScanner();
PrintWriter pw = new PrintWriter(System.out);
//int tc = sc.ni();
int tc = 1;
for (int r... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main{
static int[][][]memo;
static int inf=(int)1e9;
static int n,m,down[][],right[][];
static int dp(int i,int j,int k) {
if(k<=0)return 0;
if(memo[i][j][k]!=-1)return memo[i][j][k];
int ans=inf;
if(i+1<n) {
ans=Math.min(ans, down[i][j]+dp(i+1, j, k-1)... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.*;
import java.math.*;
import java.text.*;
import java.util.*;
public class Main {
static PrintWriter out;
static Reader in;
public static void main(String[] args) throws IOException {
input_output();
Main solver = new Main();
solver.solve();
out.close();
out.flush();
}
static int INF = ... | cubic | 1517_D. Explorer Space | CODEFORCES |
// Author : RegalBeast
import java.io.*;
import java.util.*;
public class Main {
static final FastReader FR = new FastReader();
static final PrintWriter PW = new PrintWriter(new OutputStreamWriter(System.out));
public static void main(String[] args) {
StringBuilder solution = new StringBuilder();
int r... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashSet;
import java.util.List;
import java.util.NoSuchElementException;
import java.util.PriorityQueue;
imp... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual soluti... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
import java.lang.*;
public class Main implements Runnable {
static class InputReader {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private SpaceCharFilte... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;import java.io.*;import java.math.*;
public class Main
{
static int[][] l,r,u,d;
static int[][][]dist;
static int inf=Integer.MAX_VALUE;
static class Node{
int x,y,len,dis;
Node(int x,int y,int len,int dis){
this.x=x;this.y=y;this.len=len;this.dis=dis;
... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
import java.io.*;
public class D {
public static void main(String[] args) {
FastScanner sc = new FastScanner();
int n = sc.nextInt();
int m = sc.nextInt();
int k = sc.nextInt();
int[][] lr = new int[n][m-1];
for(int i = 0; i < n; i++){
for(int j = 0; j < m-1; j++){
lr[i][j] = sc... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
import java.awt.image.BandedSampleModel;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.lang.reflect.Array;
import java.util.Scanner;
public class D{
static void sort(int[] A){
int n = A.length;
Random rnd = new Random()... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.lang.*;
import java.util.function.Predicate;
public class Main{
public static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
static long MOD = (long) (1e9 + 7);
// static long MOD = 998244353;
... | cubic | 1517_D. Explorer Space | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.