src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 258
values | from stringclasses 1
value |
|---|---|---|---|
import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
public class P111C{
Scanner sc=new Scanner(System.in);
int INF=1<<28;
double EPS=1e-9;
int h, w;
void run(){
h=sc.nextInt();
... | np | 111_C. Petya and Spiders | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
public class P111C{
Scanner sc=new Scanner(System.in);
int INF=1<<28;
double EPS=1e-9;
int h, w;
void run(){
h=sc.nextInt();
... | np | 111_C. Petya and Spiders | CODEFORCES |
/**
* @author derrick20
*/
import java.io.*;
import java.util.*;
public class PetyaSpiders implements Runnable {
public static void main(String[] args) throws Exception {
new Thread(null, new PetyaSpiders(), ": )", 1 << 28).start();
}
public void run() {
FastScanner sc = new FastScanner(... | np | 111_C. Petya and Spiders | CODEFORCES |
/*
If you want to aim high, aim high
Don't let that studying and grades consume you
Just live life young
******************************
If I'm the sun, you're the moon
Because when I go up, you go down
*******************************
I'm working for the day I will surpass you
https://www.a2oj.com/Ladder16.html
*/
impor... | np | 111_C. Petya and Spiders | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
public class P111C{
Scanner sc=new Scanner(System.in);
int INF=1<<28;
double EPS=1e-9;
int h, w;
void run(){
h=sc.nextInt();
... | np | 111_C. Petya and Spiders | CODEFORCES |
import java.io.*;
import java.awt.geom.Point2D;
import java.text.*;
import java.math.*;
import java.util.*;
public class Main implements Runnable {
final String filename = "";
public void solve() throws Exception {
int n = iread(), m = iread();
int INF = -1;
if (m > n) {
int t = m;
m = n;
n = t;
... | np | 111_C. Petya and Spiders | CODEFORCES |
import java.util.*;
import java.io.*;
public class EdC {
static long[] mods = {1000000007, 998244353, 1000000009};
static long mod = mods[0];
public static MyScanner sc;
public static PrintWriter out;
static char[][] grid;
static int n;
static int t;
static int[][] dp;
static int[] times;
... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
/**
* BaZ :D
*/
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
public class ACMIND
{
static FastReader scan;
static PrintWriter pw;
static long MOD = 1_000_000_007;
static long INF = 1_000_000_000_000_000_000L;
static long inf = 2_000_000_000;
public static void main(Str... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class G1 {
static int n, T, duration[], type[];
static long dp[][][], mod = (long) 1e9 + 7;
public static void main(String[] args) throws Exception {
new Thread(null, new Runnable() {
public void run() {
... | np | 1185_G1. Playlist for Polycarp (easy 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++) {... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
imp... | np | 1185_G1. Playlist for Polycarp (easy 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... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;
public class q5 {
static NoD[] arr;
static int index,count,zc;
static ArrayList<NoD> pos,neg;
static long[][][][] dp;
static long solve(int a,int b, int c,int d, long mod) {
long[][][][] a2=dp;
int p=-1;
if... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.util.*;
public class G {
static int n,t;
static int[]a;
static int[]g;
static long[][][]dp;
static final long MOD=1000000007;
public static void main(String[]args){
Scanner sc=new Scanner(System.in);
n=sc.nextInt();
t=sc.nextInt();
a=new int[n];
... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
/**
*
* @author Dstoical
*/
public class G {
private static int M = 1000000007, MM = 998244353;
private static int N = 15,n,T;
private static int[] time,gi;
private static int[][][] dp;
public static void process() throws IOException {
n = sc.next... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
public class Main
{
static final int MOD = (int)1e9 + 7;
static int n;
static int[] t;
static int[] g;
static int[][] memo;
static int dp(int mask, int rem, int last)
{
if(rem == 0)
return 1;
if(memo[last][mask] != -1)
return memo[last][mask... | np | 1185_G1. Playlist for Polycarp (easy 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];
... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Jeel Vaishnav
*/
public cl... | np | 1185_G1. Playlist for Polycarp (easy 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... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.BigInteger;
import java.util.Map.Entry;
import static java.lang.Math.*;
public class G extends PrintWriter {
void run() {
long mod = 1_000_000_000 + 7;
int n = nextInt();
int m = nextInt();
int[] t = new int[n];
int[]... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;
public class Main {
private static FastScanner sc = new FastScanner();
private static long mod = 1000000007;
public static void main(String[] args) {
int n = sc.nextInt();
int T = sc.nextInt();
... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import sun.reflect.generics.tree.Tree;
import java.io.*;
import java.math.BigInteger;
import java.net.Inet4Address;
import java.util.*;
public class l {
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
////////////////////////////////... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class Main {
static int MOD = 1000000007;
// After writing solution, quick scan for:
// array out of bounds
// special cases e.g. n=1?
// npe, particularly in maps
//
// Big numbers arithmetic bugs:
// in... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.util.Arrays;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.TreeSet;
public class r568p8{
private static InputReader sc;
private static PrintWriter pw;
private static long m... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author khokharnikunj8
*/
public ... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
public class cf1185g1_3 {
public static void main(String[] args) throws IOException {
int n = rni(), t = ni(), song[][] = new int[n][2];
for (int i = 0; i < n; ++i) {
song[i][0] = r... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
static int n,t[],g[],MOD=(int)1e9+7;
static int [][]memo;
static int dp(int msk,int rem,int lastG) {
if(rem==0)
return 1;
if(memo[lastG][msk]!=-1)
return memo[lastG][msk];
int ans=0;
for(int i=0;i<n;i++) {
if((msk & (1<<i))==0 && rem>=t[i] && ... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
import java.text.*;
import java.lang.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.regex.*;
public class Main{
static long dp[][][][]=new long [16][16][16][4];
static void ini() {
for(int i=0;i<16;i++) {
for(int j=0;j<16;j++) {
fo... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.util.*;
import java.io.*;
public class Songs {
static class Reader
{
final private int BUFFER_SIZE = 1 << 16;
private DataInputStream din;
private byte[] buffer;
private int bufferPointer, bytesRead;
public Reader()
{
din = new D... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class G1_PlaylistForPolycarp {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader inp = new InputReader(inputStream);
PrintWriter out = new PrintWriter(outputS... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
// Problem : G1. Playlist for Polycarp (easy version)
// Contest : Codeforces - Codeforces Round #568 (Div. 2)
// URL : https://codeforces.com/contest/1185/problem/G1
// Memory Limit : 256 MB
// Time Limit : 5000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
import java.io.*;
import java.util.*;
i... | np | 1185_G1. Playlist for Polycarp (easy 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... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.math.BigInteger;
import java.nio.charset.Charset;
import java.util.*;
public class CFContest {
public static void main(String[] args) throws Exception {
boolean local = System.... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class G1 {
static int n, T, duration[], type[];
static long dp[][][], mod = (long) 1e9 + 7;
public static void main(String[] args) throws Exception {
new Thread(null, new Runnable() {
public void run() {
... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
/*
Roses are red
Memes are neat
All my test cases time out
Lmao yeet
*/
import java.util.*;
import java.io.*;
public class x1185G1b
{
static long MOD = 1000000007L;
public static void main(String args[]) throws Exception
{
BufferedReader infile = new BufferedReader(new InputStreamReade... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author be... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
import java.util.Map.Entry;
public class cf2{
static int x0;
static int y0;
static int x1;
static int y1;
static HashMap<Integer,HashSet<Inte... | np | 1185_G1. Playlist for Polycarp (easy version) | 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... | np | 1185_G1. Playlist for Polycarp (easy version) | 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... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Random;
import java.util.StringTokenizer;
import java.util.concurrent.ThreadLocalRandom;
public class Main2 {
static int mod = 1000000007;
static FastScanner scanner;
pu... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.*;
import java.text.*;
import java.util.*;
import java.math.*;
public class G1 {
public static void main(String[] args) throws Exception {
new G1().run();
}
int MOD = 1_000_000_007;
public void run() throws Exception {
FastScanner f = new FastScanner();
PrintWriter out = new PrintWr... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.util.*;
import java.io.*;
import java.text.*;
public class Main{
//SOLUTION BEGIN
//Into the Hardware Mode
void pre() throws Exception{}
int n, t;
void solve(int TC) throws Exception{
n = ni();t = ni();
int[][] song = new int[n][];
for(int i = 0; i< n; i++)song[i]... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.*;
import java.util.Arrays;
import java.util.StringTokenizer;
public class G1 {
static final int mod = (int) (1e9 + 7);
static final int UNCALC = -1;
static int[][][] memo;
static int n, t[], genre[];
public static void main(String[] args) throws IOException {
Scanner sc = ... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.util.*;
import java.io.*;
public class EdC {
static long[] mods = {1000000007, 998244353, 1000000009};
static long mod = mods[0];
public static MyScanner sc;
public static PrintWriter out;
static char[][] grid;
static int n;
static int t;
static int[][] dp;
static int[] times;
... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
//package cf568d2;
import java.util.*;
public class G {
static int n,t;
static int[]a;
static int[]g;
static long[][][]dp;
static final long MOD=1000000007;
public static void main(String[]args){
Scanner sc=new Scanner(System.in);
n=sc.nextInt();
t=sc.nextInt();
a... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class Solution{
public static long mod = 1000000007;
public static void main(String[] args)throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(System.out);... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
public class Main {
static PrintWriter out;
static InputReader ir;
static void solve() {
int n = ir.nextInt();
int t = ... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.StringTokenizer;
public class realfast implements Runnable {
private static final int INF = (int) 1e9;
int time[]= new int[15];
int g[]= new int [15];
public void solve() throws IOExceptio... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class codeforces {
public static long cnt = 0;
public static void f(int g1, int g2, int g3, int last) {
if (g1 == 0 && g2 == 0 && g3 == 0) cnt++;
if (g1 > 0 && last != 1) f(g1 - 1, g2, g3, 1);
if (g2 > 0 && ... | np | 1185_G1. Playlist for Polycarp (easy version) | 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... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Aman Kumar Singh
*/
public class Main {
... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Sparsh Sanchorawala
*/
pub... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class codeforces {
public static long cnt = 0;
public static void f(int g1, int g2, int g3, int last) {
if (g1 == 0 && g2 == 0 && g3 == 0) cnt++;
if (g1 > 0 && last != 1) f(g1 - 1, g2, g3, 1);
if (g2 > 0 && ... | np | 1185_G1. Playlist for Polycarp (easy 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++) {... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
public class G_PlaylistForPolycarp {
static final int mod = 1000000007;
static int dp[][];
public static void main(String[] args) throws IOException {
... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
/*Author: Satyajeet Singh, Delhi Technological University*/
import java.io.*;
import java.util.*;
import java.text.*;
import java.lang.*;
import java.math.*;
public class Main{
/*********************************************Constants******************************************/
static PrintWrite... | np | 1185_G1. Playlist for Polycarp (easy version) | 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.FileReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.io.InputStrea... | np | 1185_G1. Playlist for Polycarp (easy 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++) {... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Solution {
BufferedReader in;
PrintWriter out;
StringTokenizer st;
int[] x;
int[] y;
int n;
int X, Y;
int[] d;
int[][] dist;
int sqr(int a) {
return a * a;
}
int dist(int X, i... | np | 8_C. Looking for Order | CODEFORCES |
import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.Scanner;
/**
* Created by 11815 on 2017/7/1.
*/
public class Main {
private static int[] x = new int[26], y = new int[26], dp = new int[1<<24], pre = new int[1<<24];
private static int dis(int i, int j) {
return (x[i]-x[j])*(x... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
/** Created by huhansan on 2017/10/9. */
public class CF_8C implements Runnable {
int[] step = new int[1 << 24]... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Main implements Runnable {
//public static final String FileName = "test";
StreamTokenizer ST;
PrintWriter out;
BufferedReader br;
Scanner in;
static final int inf = 1000000000+10;
int nextInt() throws ... | np | 8_C. Looking for Order | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main{
BufferedReader in;
StringTokenizer str = null;
PrintWriter out;
private String next() throws Exception{
if (str == null || !str.hasMoreElements())
str = new StringTokenizer(in.readLine());
return str.nextToken();
}
... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
// Jonathan
// cpt_fwiffo
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
String[] line = in.readL... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.*;
import java.util.*;
public class CF8C {
FastScanner in;
PrintWriter out;
int[] x, y;
int[] av;
int[][] d = new int[25][25];
int dist(int v, int u) {
if (u == v)
return 0;
return (d[v][u] == 0 ? d[v][u] = d[u][v] = (x[v] - x[u])
* (x[v] - x[u]) + (y[v] - y[u]) * (y[v] - y[u]) : d[v]... | np | 8_C. Looking for Order | CODEFORCES |
import java.awt.Point;
import java.util.Arrays;
import java.util.Scanner;
public class C {
static int[] DP;
static Point[] Next;
static int[][] pair;
static int[] single;
static int n;
public static int get(int mask) {
if (mask + 1 == (1 << n))
return 0;
if (DP[mas... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
public class ProblemC {
public static void main(String[] args) throws IOException {
BufferedReader s = new BufferedReader(... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
/**
* @author Egor Kulikov (kulikov@devexperts.com)
*/
public class Order implements Runnable {
private Scanner in = new Scanner(System.in);
private PrintWriter out = new PrintWriter(System.out);
private int xs, ys, n;
private int[] x... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
/**
* 111118315581
*
* @author pttrung
*/
public class C {
static Point hand;
static int n;
static Point[] data;
static int[] next;
static in... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Deque;
import static java.lang.Integer.MAX_VALUE;
import static java.lang.Integer.parseInt;
/**
* 8C
*
* @author artyom
*/
public class LookingForOrde... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class LookingForOrder {
static final int INF = (int)1e9;
static Point a[];
... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
BufferedReader in = null;
PrintWriter out = null;
int dist(int x1, int y1, int x2, int y2) {
int dx = Math.abs(x1 - x2);
int dy = Math.abs(y1 - y2);
return dx * dx + dy * dy;
}
boolean testBit(int use, int p) {
... | np | 8_C. Looking for Order | CODEFORCES |
import java.util.*;
import static java.lang.System.*;
import static java.lang.Math.*;
public class C {
static int[] dp;
static int[] f;
static void solve(){
dp = new int[1<<n];
f = new int[1<<n];
Arrays.fill(dp, 1<<29);
dp[0] = 0;
for(int i=0;i<(1<<n);i++){
// ... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Collection;
import java.util.LinkedList;
import java.util.Locale;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] ar... | np | 8_C. Looking for Order | CODEFORCES |
import java.util.Scanner;
import java.io.PrintWriter;
import java.util.*;
public class Order8C implements Runnable {
private Scanner in = new Scanner(System.in);
private PrintWriter out = new PrintWriter(System.out);
int mintime;
String path;
int xs;
int ys;
int n;
int[] obx;
int... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Bag implements Runnable {
private void solve() throws IOException {
int xs = nextInt();
int ys = nextInt();
int n = nextInt... | np | 8_C. Looking for Order | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
/**
* @author vstepanov on 3/29/2017.
*/
public class Main {
public static void main(String[] args) {
try(Scanner in = new Scanner(System.in)) {
int bx = in.nextInt();
int by = in.nextInt();
int n = in.nextInt();
... | np | 8_C. Looking for Order | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class C
{
public static void main(String[] args)
{
new C();
}
final int oo = (int)1e9;
int Hx,Hy;
int N;
int[][] P;
int[] memo;
int[][] soln;
int[] dist1;
int[][] dist2;
C()... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main implements Runnable {
// /////////////////////... | np | 8_C. Looking for Order | CODEFORCES |
import java.util.*;
public class c8 {
static int n;
static int[] ds;
static int[][] g;
public static void main(String[] args)
{
Scanner input = new Scanner(System.in);
int x = input.nextInt(), y = input.nextInt();
int n = input.nextInt();
int[] xs = new int[n], ys = new int[n];
for(int i... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.*;
import java.util.*;
public class A558 {
static BufferedReader in = null;
static PrintWriter out = null;
static StringTokenizer st = new StringTokenizer("");
public static void main(String[] args) {
try {
in = new BufferedReader(new InputStreamReader(System.in));
out = new Pri... | np | 8_C. Looking for Order | CODEFORCES |
import java.awt.Point;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
static int n, memo[], dS[], dd[][];
static int dp(int idx, int m... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main implements Runnable {
// ////////////////////////////////////////////////////
// Solution
private int n;
... | np | 8_C. Looking for Order | CODEFORCES |
import java.util.*;
public class C
{
public static void main(String[] args)
{
new C(new Scanner(System.in));
}
vect[] vs;
int N;
int oo = 987654321;
ArrayList<choice> cs;
choice[][] cg;
int MF;
int[] memo;
int[] next;
int go(int m)
{
if (m == MF)
retur... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
/**
* Created by Brandt Henslee on 2/24/2015.
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader in = new BufferedReader(new InputStreamReader(S... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
public class Handbag
{
// http://codeforces.com/problemset/problem/8/C
// Source of most code : http://codeforces.com/contest/8/submission/3492661
// Keep track of eac... | np | 8_C. Looking for Order | CODEFORCES |
//package round8;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
public class C {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int x = ni(), y = ni();
int n = ni();
int[][] co = new int... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
public class C {
public static void main(String[] args) {
new C().run();
}
class FastScanner {
BufferedReader br;
StringTokenizer st;
boolean eof;
String buf;
public FastScanner(String fileName) throws FileNotFoundException {
br = new Buffer... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.*;
import static java.lang.Math.*;
import java.util.*;
import java.util.function.*;
import java.lang.*;
public class Main {
final static boolean debug = false;
final static String fileName = "";
final static boolean useFiles = false;
public static void main(String[] args) throws FileNot... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.*;
public class CF8C {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String s = br.readLine();
int si = s.indexOf(' ', 0);
int x = Integer.parseInt(s.substring(0, si));
int y = Integer.parseInt(s.substring... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Bag implements Runnable {
private void solve() throws IOException {
int xs = nextInt();
int ys = nextInt();
int n = nextInt... | np | 8_C. Looking for Order | CODEFORCES |
import java.util.Scanner;
public class Problem_8C {
private static int dis(int x1, int y1, int x2, int y2) {
return (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int ox = sc.nextInt();
int oy = sc.nextInt();
int... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Bag implements Runnable {
private void solve() throws IOException {
int xs = nextInt();
int ys = nextInt();
int n = nextInt... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class LookingForOrder {
static int[] dp = new int[(int) (1 << 24)];
static int[][] points;
static int[] sol = new int[1<<24];
static int sx = 0, sy = 0;
... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class CodeD
{
static class Scanner
{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer("");
public String next... | np | 8_C. Looking for Order | CODEFORCES |
import java.util.Scanner;
public class C {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int xs = sc.nextInt();
int ys = sc.nextInt();
int n = sc.nextInt();
int[]x = new int[n], y = new int[n];
for (int i = 0; i < n; i++) {
x[i] = sc.nextInt();
y[i] = sc.nextInt();
... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Bag implements Runnable {
private void solve() throws IOException {
int xs = nextInt();
int ys = nextInt();
int n = nextInt... | np | 8_C. Looking for Order | CODEFORCES |
import java.util.*;
import static java.lang.Math.*;
public class Main {
static int hx, hy;
static int[] X, Y;
static int N;
static int[] DP;
static int pw(int a) {
return a * a;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
hx = sc.nextInt();
hy = sc.nextInt();
... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class cf8c {
static int n;
stati... | np | 8_C. Looking for Order | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.