src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 258
values | from stringclasses 1
value |
|---|---|---|---|
import java.io.*;
import java.text.DecimalFormat;
public class ProblemD {
private double survive(int round, int set) {
if (sur[round][set] >= 0)
return sur[round][set];
double res = 0.0;
int count = 0;
for(int i=0;i<n;i++) {
if ((set & (1 << i)) > 0) {
... | np | 16_E. Fish | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main{
public void run(){
Locale.setDefault(Locale.US);
Scanner in = new Scanner(System.in);
int n = in.nextInt();
double a[][] = new double[n][n];
for(int i=0;i<n;i++) for(int j=0;j<n;j++) a[i][j] = in.nextDouble();
double f[] = new double[... | np | 16_E. Fish | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
imp... | np | 16_E. Fish | CODEFORCES |
import java.util.Locale;
import java.util.Scanner;
public class E {
public static void main(String[] args) {
new E().run();
}
private void run() {
Locale.setDefault(Locale.US);
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
double[][] p = new double[n][n];
for (int i = 0; i < n; i++) {
f... | np | 16_E. Fish | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws java.lang.Exception {
BufferedReader kek = new BufferedReader(new InputStreamReader(System.in));
//Scanner skek = new Scanner(System.in);
PrintWriter outkek = new PrintWriter(System.out);
int N = Integ... | np | 16_E. Fish | 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.Locale;
import java.util.StringTokenizer;
public class Main implements Runnable {
... | np | 16_E. Fish | CODEFORCES |
import java.io.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.*;
public class Task2 {
public static void main(String[] args) throws IOException {
new Task2().solve();
}
//ArrayList<Integer>[] g;
int mod = 1000000007;
PrintWriter out;
int n;
int ... | np | 16_E. Fish | 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 | 16_E. Fish | CODEFORCES |
import java.util.Locale;
import java.util.Scanner;
public class E {
public static void main(String[] args) {
new E().solve();
}
private int c(int n) {
return n * (n - 1) / 2;
}
public void solve() {
Locale.setDefault(Locale.US);
Scanner sc = new Scanner(Sys... | np | 16_E. Fish | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.FileReader;
import java.util.StringTokenizer;
import java.io.IOException;
import java.util.Arrays;
public class Fish extends Thread {
public Fish() {
this.input = new BufferedReader(new InputStreamR... | np | 16_E. Fish | CODEFORCES |
/**
* Created by IntelliJ IDEA.
* User: Taras_Brzezinsky
* Date: 8/14/11
* Time: 9:53 PM
* To change this template use File | Settings | File Templates.
*/
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.FileReader;
import java.util.StringTokenizer;
imp... | np | 16_E. Fish | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
public class Main {
public static void main(String[] args) throws Exception {
StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
... | np | 16_E. Fish | CODEFORCES |
import java.text.DecimalFormat;
import java.util.Arrays;
import java.util.Scanner;
public class E {
static Scanner sc = new Scanner(System.in);
static int N;
static double[][] p;
static DecimalFormat format = new DecimalFormat("0.000000");
public static void main(String[] args) throws Exception {
N = sc.nextIn... | np | 16_E. Fish | CODEFORCES |
import java.text.DecimalFormat;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public Main() {
super();
}
public static void main(String... args) {
Main main = new Main();
main.start();
}
public void start() {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
do... | np | 16_E. Fish | CODEFORCES |
import java.util.Scanner;
public class Fishes {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
double[][] p = new double[n][n];
double[] dp = new double[1 << 18];
for (int i = 0; i < n; i++) {
for (int j = 0; j ... | np | 16_E. Fish | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
/**
*
* @author Trung Pham
*/
public class E {
public stat... | np | 16_E. Fish | CODEFORCES |
import java.math.BigDecimal;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;
public class Task16e {
/**
* @param args
*/
public static void main(String[] args) {
Scanner sc = new... | np | 16_E. Fish | 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.util.Iterator;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.Writer;
imp... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.util.*;
import java.io.*;
import java.lang.*;
import java.math.*;
public class E {
public static void main(String[] args) throws Exception {
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.*;
import java.util.Arrays;
import java.util.StringTokenizer;
public class mainE {
public static PrintWriter out = new PrintWriter(System.out);
public static FastScanner enter = new FastScanner(System.in);
public static void main(String[] args) throws IOException {
int t=enter.nextIn... | np | 1209_E1. Rotate Columns (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.InputStreamReader;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.util.Comparator;
import java.io.InputStream... | np | 1209_E1. Rotate Columns (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.io.FileNotFoundException;
import java.io.... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class E implements Runnable {
FastReader scn;
PrintWriter out;
String INPUT = "";
void solve() {
int t = scn.nextInt();
while(t-- > 0) {
int n = scn.nextInt(), m = scn.nextInt();
int[][] arr = scn.next2DInt(n, m);
int[][] col = new int[m][2];
for(in... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.util.*;
import java.io.*;
public class E {
public static void main(String[] args) {
FastScanner scanner = new FastScanner();
PrintWriter out = new PrintWriter(System.out, false);
int t = scanner.nextInt();
while(t-->0) {
int n = scanner.nextInt();
... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
public class cf1209e1_2 {
public static void main(String[] args) throws IOException {
int t = ri();
while (t --> 0) {
int n = rni(), m = ni(), a[][] = new int[m][n], dp[] = new int[... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
/**
* Date: 14 Sep, 2019
* Link:
*
* @author Prasad-Chaudhari
* @linkedIn: https://www.linkedin.com/in/prasad-chaudhari-841655a6/
* @git: https://github.com/Prasad-Chaudhari
*/
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import ja... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
FastScanner in;
PrintWriter out;
void solve() {
int tc = in.nextInt();
for (int t = 0; t < tc; t++) {
int n = in.nextInt();
int m = in.nextInt();
O[] a = new O[n * m];
int[][] cols = new ... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
/**
* BaZ :D
*/
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
public class Main
{
static MyScanner 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(Strin... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.util.*;
import java.math.*;
// **** E1. Rotate Columns (easy version) ****
public class E1 {
static char [] in = new char [1000000];
public static void main (String [] arg) throws Throwable {
int t = nextInt();
C : for (int ii = 0; ii<t; ++ii) {
int n = nextInt();
int m = nextInt();
Pair []... | np | 1209_E1. Rotate Columns (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.FilterInputStream;
import java.io.BufferedInputStream;
import java.util.Random;
import java.io.InputStream;
/**
* @author khokharnikunj8
*/
public class Main {
... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
import java.util.stream.IntStream;
public class Test {
static PrintWriter writer =
new PrintWriter(new BufferedWrite... | np | 1209_E1. Rotate Columns (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.Scanner;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static void main(String[] args) {
InputStrea... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.util.*;
import java.io.*;
public class E584 {
public static void main(String[] args) {
MyScanner sc = new MyScanner();
PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
int t = sc.nextInt();
while (t > 0) {
int n = sc.nextInt(); int m = ... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.util.*;
public class Main {
public static class Pair implements Comparable<Pair> {
int k, x;
public Pair(int k) {
this.k = k;
}
public void update(int x) {
this.x = Math.max(this.x, x);
}
public int compareTo(Pair other) {
... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.nio.charset.Charset;
import java.util.*;
public class CFContest {
public static void main(String[] args) throws Exception ... | np | 1209_E1. Rotate Columns (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.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.StringTokenizer;
import java.io.BufferedReader;
i... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
import java.util.stream.Collectors;
import java.math.*;
public class E1 {
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);
/*/
DataInputS... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.util.PriorityQueue;
public class Main {
static PrintWri... | np | 1209_E1. Rotate Columns (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.FilterInputStream;
import java.io.BufferedInputStream;
import java.util.Random;
import java.util.Comparator;
import java.io.InputStream;
/**
* @author khokharnikunj8... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
public class Main {
static final long MOD = 998244353;
//static final long MOD = 1000000007;
static boolean[] visited;
public static void main(String[] args) throws IOException {
FastScanner sc = new FastScanner();
int Q = sc.nextInt();... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class E {
public static void main(String[] args) throws Exception {
new Thread(null ,new Runnable(){
public void run(){
try{solveIt();} catch(Exception e){e.printStackTrace(); System.exit(1);}
... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
public static void main(String args[]) {new Main().run();}
FastReader in = new FastReader();
PrintWriter out = new PrintWriter(System.out);
void run(){
int q=in.nextInt();
for(int i=0;i<q;i++) {
out.println(work());
}
out.flush();
}
long mod=1... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class E implements Runnable {
FastReader scn;
PrintWriter out;
String INPUT = "";
void solve() {
int t = scn.nextInt();
while(t-- > 0) {
int n = scn.nextInt(), m = scn.nextInt();
int[][] arr = scn.next2DInt(n, m);
int[][] col = new int[m][2];
for(in... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class C {
static int n, m, a[][];
static int[][] memo;
static Integer[] indices;
static int[] getCol(int col, int shift) {
int[] ans = new int[n];
for (int i = 0, j = shift; i < n; i++, j = (j + 1) % n) {
ans[i] = a[j][col];
}
return ans;
}
static int d... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class TaskE {
static int[][] transpose(int[][] a, int n, int m) {
int[][] t = new int[m][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
t[j][i] = a[i][j];
}
}
return t;
}
... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.util.*;
public class Main {
public static int n, m;
public static int[][] arr;
public static class Item implements Comparable<Item> {
int i, x;
public Item(int i, int x) {
this.i = i;
this.x = x;
}
public int compareTo(Item other) {
... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
//package round584;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.util.Map;
public class E1 {
InputStream is;
PrintWriter out;
String INP... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class r584p5 {
private static BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
private static PrintWriter pw = new PrintWriter(System.out);
private static int n, m, arr[][];
private static ArrayList<HashSet<Integer>> chls;
privat... | np | 1209_E1. Rotate Columns (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
*/
public class... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class E
{
PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer tok;
public void go() throws IOException
{
StringToken... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
import java.util.stream.IntStream;
public class Test {
static PrintWriter writer =
new PrintWriter(new BufferedWrite... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.nio.file.Files;
import java.nio.file.Path;
import java.nio.file.Paths... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
import java.util.stream.IntStream;
public class Test {
static PrintWriter writer =
new PrintWriter(new BufferedWrite... | np | 1209_E1. Rotate Columns (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.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at ... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class C {
static int n, m, a[][];
static int[][] memo;
static int[] getCol(int col, int shift) {
int[] ans = new int[n];
for (int i = 0, j = shift; i < n; i++, j = (j + 1) % n) {
ans[i] = a[j][col];
}
return ans;
}
static int dp(int col, int msk) {
if ... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
static int inf = (int) 1e9 + 7;
static int n, m, a[][];
static ArrayList<Integer> used;
static int num[];
static int ans;
static void rec(int id) {
if (id == used.size()) {
check();
return;
}
... | np | 1209_E1. Rotate Columns (easy 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.io.Input... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
//package cf584d12;
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class E {
public static void main(String[] args) {
MyScanner sc = new MyScanner();
int t = sc.nextInt();
for(int w = 0; w < t; w++) {
int n = sc.nextInt(), m = sc.nextInt();
TreeSet<X> set = new TreeSet<X>();
... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.text.DecimalFormat;
import java.util.*;
import java.util.concurrent.ThreadLocalRandom;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
import java.util.stream.Stre... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.util.stream.IntStream;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.UncheckedIOException;
import java.util.stream.Stream;
import ja... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.util.*;
import java.io.*;
/*
*/
public class e1 {
static int n;
static int m;
static int[][] mat;
public static void main(String[] args){
JS scan = new JS();
PrintWriter out = new PrintWriter(System.out);
int t = scan.nextInt();
for(int q = 1; q <= t; q++){
ans = 0;
n = scan.nextInt()... | np | 1209_E1. Rotate Columns (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 | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main{
static int[][]memo;
static int n,m,in[][];
static int dp(int col,int maxRowMask) {
if(col>=m)return 0;
if(memo[col][maxRowMask]!=-1)return memo[col][maxRowMask];
int ans=0;
for(int colMask=0;colMask<(1<<n);colMask++) {
int sum=0;
for(... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import static java.lang.Integer.parseInt;
import static java.lang.Long.parseLong;
import static java.lang.Math.max;
import static java.lang.Math.min;
import static java.lang.System.exit;
import static java.util.Arrays.fill;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
im... | np | 1209_E1. Rotate Columns (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 | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.StringTokenizer;
public class Main {
static ArrayList<Integer> cols;
static int ans, n, a[][];
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner... | np | 1209_E1. Rotate Columns (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{}
void solve(int TC)throws Exception{
int n = ni(), m = ni();
long[][] a = new long[n][m];
long[] col = new long[m];
for(int ... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.io.InputStream;
import java.io.OutputStream;
import java.io.IOException;
import java.util.ArrayList;
import java.io.InputStream;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.IOException;
import java.util.InputMismatchException;
import java.io.PrintW... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
int n, k;
double A;
int[] b, l;
double ans;
double curAns;
void check(boolean[] used) {
int cnt = 0;
for (boolean t : used)
if (t)
cnt++;
double prob = 1;
for (int i = 0; i < n; i++) {
if (used[i])
prob *= ((double) l[i]) / ((double)... | np | 105_B. Dark Assembly | CODEFORCES |
import java.util.*;
public class B {
static int[] loyality;
static int[] level;
static int mid;
static int a, n;
static double sol;
public static void getMax(int idx, int rem) {
if (idx == loyality.length) {
double pos = 0;
for (int i = 0; i < (1 << n); i++)
... | np | 105_B. Dark Assembly | CODEFORCES |
/**
* Created by IntelliJ IDEA.
* User: Taras_Brzezinsky
* Date: 8/13/11
* Time: 6:10 PM
* To change this template use File | Settings | File Templates.
*/
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
import java.io.IOException;
public class Da... | np | 105_B. Dark Assembly | 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(), k = iread(), A = iread();
int[] b = new int[n], l = new int[n];
for (int i =... | np | 105_B. Dark Assembly | CODEFORCES |
import static java.lang.Math.*;
import java.io.*;
import java.util.*;
public class flags1225 implements Runnable {
static int n, k, a, b[], loy[];
static boolean decision[];
static double ans, max;
static void check(int i) {
if (i == n) {
checkAgain();
return;
}
decision[i] = true;
check(i + 1);
... | np | 105_B. Dark Assembly | CODEFORCES |
//package round81;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class B {
Scanner in;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni();
int k = ni();
int a = ni();
int[] lv = new int[n];
int[] lo = new int[n];
for(int i = 0;i < n;i++){
lv[i]... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.*;
import java.util.*;
import java.lang.reflect.Array;
import java.math.*;
public class Solution {
private BufferedReader in;
private PrintWriter out;
private StringTokenizer st;
private Random rnd;
int[] levels;
int[] loyal;
int n, k;
double A;
int[] choices;
int[] new_loyal;
double[] ko... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.StringTokenizer;
public class D {
static int n, KA, A;
static int[] b;
static int[] l;
static double ans = 0;
... | np | 105_B. Dark Assembly | CODEFORCES |
/**
* Created by IntelliJ IDEA.
* User: piyushd
* Date: 3/26/11
* Time: 10:53 PM
* To change this template use File | Settings | File Templates.
*/
public class TaskB {
int[] levels;
int[] loyalty;
int n, k, A;
double ans = Double.NEGATIVE_INFINITY;
void rec(int ix, int sweets, int[] loya... | np | 105_B. Dark Assembly | CODEFORCES |
/**
* Created by IntelliJ IDEA.
* User: Taras_Brzezinsky
* Date: 8/13/11
* Time: 6:10 PM
* To change this template use File | Settings | File Templates.
*/
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
import java.io.IOException;
public class Da... | np | 105_B. Dark Assembly | CODEFORCES |
import java.util.*;
public class B
{
public static void main(String[] args)
{
new B(new FastScanner());
}
int hash(int i, int[] cc)
{
int res = i;
for (int ii : cc)
{
res *= 8;
res += ii;
}
return res;
}
int N, K, A;
int[] lvl;
int[]... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
static double max;
static int n, A, b[], l[];
static int sw[];
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
n = sc.nextInt();
int k = sc.nextInt();
A = sc.nextInt();
b = new int[n];
l = new int[n];
sw = new int[n]... | np | 105_B. Dark Assembly | CODEFORCES |
import java.awt.geom.*;
import java.io.*;
import java.math.*;
import java.util.*;
import java.util.regex.*;
import static java.lang.Math.*;
public class B {
public static void swap(int[] array, int a, int b) { // {{{
int t = array[a];
array[a] = array[b];
array[b] = t;
} // }}}
int... | np | 105_B. Dark Assembly | CODEFORCES |
import static java.lang.Math.max;
import static java.lang.Math.min;
import java.io.*;
import java.util.*;
public class B {
private void solve() throws IOException {
int senators = nextInt();
int candies = nextInt();
scoreA = nextInt();
lvl = new int[senators];
unloyal = new int[senators];
for (int i = 0... | np | 105_B. Dark Assembly | CODEFORCES |
import java.util.*;
public class b {
static int n,k,A;
static int[] l,p;
static double [][][] memo;
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
n = in.nextInt();
k = in.nextInt();
A = in.nextInt();
memo = new double[n+1][n+1][1<<n];
l = new int[n];
p = new int[n];
... | np | 105_B. Dark Assembly | CODEFORCES |
import java.awt.*;
import java.io.*;
import java.math.*;
import java.util.*;
import static java.lang.Math.*;
public class BetaRound81_B implements Runnable {
BufferedReader in;
PrintWriter out;
StringTokenizer tok = new StringTokenizer("");
public static void main(String[] args) {
new Thread(... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.InputMismatchException;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Reader;
import java.io.Writer;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution ... | np | 105_B. Dark Assembly | CODEFORCES |
/**
*
* @author Saransh
*/
import java.io.*;
import java.util.*;
import java.math.*;
import java.lang.*;
public class Main
{
static int senator_attr[][];
static int senators;
static double A;
public static void main(String[] args)
{
try
{
Parserdoubt pd=new Parserdou... | np | 105_B. Dark Assembly | CODEFORCES |
import static java.util.Arrays.*;
import static java.lang.Math.*;
import static java.math.BigInteger.*;
import java.util.*;
import java.math.*;
import java.io.*;
public class B implements Runnable
{
String file = "input";
boolean TEST = false;
double EPS = 1e-8;
void solve() throws IOException
... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.*;
import java.util.*;
public class B2 {
String s = null;
String[] ss = null;
int[][] sn = null;
int n = 0;
double ans = 1;
int A = 0;
public void run() throws Exception{
BufferedReader br = null;
File file = new File("input.txt");
if(file.exists()){
br = new BufferedReader(new F... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.text.DecimalFormat;
import java.util.StringTokenizer;
public class Main {
static int N;
static int K;
static int A;
static double dl[];
static int base[];
static int needed;
static int b[] = new int[N];
s... | np | 105_B. Dark Assembly | CODEFORCES |
import java.awt.Point;
import java.util.Scanner;
public class p105b {
static int[] b, l;
static int n;
static int A;
static boolean[] masks;
static double max;
public static double work(int index, int k, int mask) {
if (index == n) {
if (Integer.bitCount(mask) * 2 <= n) {
... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
/**
*
* @author pttrung
*/
public class B {
static Senator[] data;
public static void main(S... | np | 105_B. Dark Assembly | CODEFORCES |
/**
* Created by IntelliJ IDEA.
* User: Taras_Brzezinsky
* Date: 8/13/11
* Time: 6:10 PM
* To change this template use File | Settings | File Templates.
*/
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
import java.io.IOException;
public class Da... | np | 105_B. Dark Assembly | 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 int nextPerm(int[] a, int k) {
if (a[0] == k)
return -1;
int last = 0;
for (int i = a.length - 1; i >= 0; i--)
if (a[i]... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.BufferedReader;
import java.util.Comparator;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Collection;
import java.util.List;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.ArrayList;
import java.util.StringTokenizer;
im... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.InputStream;
import java.io.OutputStream;
import java.io.IOException;
import java.util.ArrayList;
import java.io.InputStream;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.IOException;
import java.util.InputMismatchException;
import java.io.PrintW... | np | 105_B. Dark Assembly | CODEFORCES |
import java.util.*;
import java.math.*;
import static java.lang.Character.isDigit;
import static java.lang.Character.isLowerCase;
import static java.lang.Character.isUpperCase;
import static java.lang.Math.*;
import static java.math.BigInteger.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;... | np | 105_B. Dark Assembly | CODEFORCES |
import java.awt.*;
import java.awt.geom.*;
import java.io.*;
import java.math.*;
import java.text.*;
import java.util.*;
public class B {
static int ourLevel;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = ... | np | 105_B. Dark Assembly | CODEFORCES |
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.Scanner;
public class Main {
static double max = 0.0;
public static void main(String[] args) {
Scanner r = new Scanner(System.in);
int n = r.nextInt();
int k = r.nextInt();
int A = r.nextInt();
... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class BNew {
double gAns = 0;
public static void main(String[] args) throws IOException {
new BNew().solve();
}
private void solve() throws IOEx... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
int n, k, a;
int[] b, l;
double best;
double calc(int i, int r, int c, double p) {
if (i == n) {
if (c <= n / 2) {
p *= 1.0 * a / (a + r);
}
return p;
} else {
retur... | np | 105_B. Dark Assembly | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.