src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 258
values | from stringclasses 1
value |
|---|---|---|---|
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Arrays;
import java.util.Comparator;
public class Main {
private static StreamTokenizer in;
private static PrintWriter out;
static {
in = new StreamTokenizer(new BufferedRe... | np | 105_B. Dark Assembly | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
import static java.lang.Math.*;
public class Main{
public void go(){
int n=sc.nextInt(), k=sc.nextInt(), A=sc.nextInt();
ArrayList< ArrayList< Integer > > waysGiveCandies = doit1(n, k, new ArrayList< Integer >());
/*
System.out.... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Map;
public class ProblemB {
public static int _gnum;
public static int _cnum;
public static int _needs;
public static int _level;
public static double _maxans = 0;
public ... | np | 105_B. Dark Assembly | CODEFORCES |
import javax.print.Doc;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;
public class taskB {
public static void main(String[] args) throws IOException {
new taskB().run();
}
Bu... | np | 105_B. Dark Assembly | 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 | 105_B. Dark Assembly | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
StreamTokenizer in;
PrintWriter out;
public static void main(String[] args) throws Exception {
new Main().run();
}
public void run() throws Exception {
Locale.setDefault(Locale.US);
in = new StreamTokenizer (new Bu... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.*;
import java.util.*;
public class TemnayaAssambleya implements Runnable {
public static void main(String[] args) {
new Thread(new TemnayaAssambleya()).run();
}
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer in;
PrintWriter out = new PrintWriter(System... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;
public class B implements Runnable {
int a;
int[] b;
int[] l;
public void solve() throws IOException {
int n = in.nextInt();
int k = in.nextInt();
a = in.nextInt();
b = new int[n];
... | 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.Scanner;
public class B {
static int n;
static double A;
static int[] L;
static int[] B;
static double max = 0;
public static void rec(int index, int k) {
if (k < 0)
return;
if (index == n) {
double prob = 0;
for (int i = 0... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Locale;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.Map.Entry;
public class Solution implements ... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
BufferedReader br;
PrintWriter out;
StringTokenizer st;
boolean eof;
int[] level;
int[] loyal;
double ans;
int n, k, plLev, needVotes;
double check() {
//System.err.println(Arrays.toString(loyal));
... | np | 105_B. Dark Assembly | CODEFORCES |
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
public class B{
public static void main(String[] args) throws Exception{
new B().run();
}
double ans = 0;
int n, candy, A, half;
void run() throws Exception{
Scanner sc = new Scanner(System.in);
//Buffer... | np | 105_B. Dark Assembly | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Main implements Runnable {
int[] conf, L, B;
int n, k, A, sz;
double[] kill;
double best = 0;
double solv() {
double res = 0;
double[] a = new double[n];
for (int i=0; i<n; i++)
a[i] = Math.min(100, L[i]+10*conf[i])/100.0;
double... | np | 105_B. Dark Assembly | CODEFORCES |
//package contest10D;
import java.math.*;
import java.util.*;
import static java.math.BigInteger.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
public class Main {
static void debug(Object... os) {
System.err.println(deepToString(os));
}
public static ... | np | 11_D. A Simple Task | CODEFORCES |
import java.awt.List;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.text.DecimalFormat;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
imp... | np | 11_D. A Simple Task | 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 Darshandarji
*/
public cla... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
/**
* Created by Tejas on 18-10-2018.
*/
public class Main {
static HashSet<Integer> adjList[];
public static void main(String[]args)throws IOException{
BufferedReader bufferedReade... | np | 11_D. A Simple Task | 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... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
new Main().run();
}
boolean[][] graph;
public void run() {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
graph = new boolean[n][n];
for (int i = 0; i < m; i++) {
int a = sc.n... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int m = in.nextInt();
boolean[][] graph = new boolean[n][n];
for(int i = 0; i < m; i++) {
... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
public class Solution {
public void doMain() throws Exception {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(), m = sc.nextInt();
boolean[][] adj = new boolean[n][n];
for (int i=0; i<m; i++) {
int a = sc.nextInt()-1, b = sc.nextInt()-1;
... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int m = in.nextInt();
boolean[][] graph = new boolean[n][n];
for(int i = 0; i < m; i++) {
... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.Arrays;
/**
* Created by IntelliJ IDEA.
* User: piyushd
* Date: 12/31/10
* Time: 1:30 PM
* To change this template use File | Settings | File Templates.
*/
public class SimpleCycle {
int first(int x){
return x - (x & (x - 1));
}
void run(){
int N = nextInt(), M = nextInt();
int[] g... | np | 11_D. A Simple Task | 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 ProblemD {
static int N;
static boolean[][] graph;
public static void main(String[] args) throws IOExc... | np | 11_D. A Simple Task | CODEFORCES |
/**
* JUDGE_ID : 104262PN
* User : Денис
* Date : 09.05.11
* Time : 22:48
* ICQ : 785625
* Email : popokus@gmail.com
*/
import java.io.*;
public class s11_d {
public static void main(String[] args) throws IOException {
new s11_d().run();
}
int nextInt() throws IOExcepti... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.Scanner;
public class SimpleTask {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int m = scan.nextInt();
boolean[][] graph = new boolean[n][n];
for (int i = 0; i < m; i++) {
int u = scan.nextInt() - 1;
int v = scan.nextInt() ... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.*;
public class CF {
void realSolve() {
int n = in.nextInt();
int m = in.nextInt();
boolean[][] f = new boolean[n][n];
for (int i = 0; i < m; i++) {
int fr = in.nextInt() - 1;
int to = in.nextInt() - 1;
f[fr][to] = f[to][fr] = true;
}
long[][] dp = new long[n][... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.Scanner;
public class SimpleTask {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int m = scan.nextInt();
boolean[][] graph = new boolean[n][n];
for (int i = 0; i < m; i++) {
int u = scan.nextInt() - 1;
int v = scan.nextInt() ... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main{
public static void main(String args[]){
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int m=sc.nextInt();
int x,y;
boolean graph[][]=new boolean[n][n];
for(int i=0;i<m;i++){
x=sc.nextInt()-1... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
import java.lang.*;
public class P11D{
static long mod=1000000007;
public static void main(String[] args) throws Exception{
InputReader in = new InputReader(System.in);
PrintWr... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main implements Runnable {
private void solution() throws IOException {
int n = in.nextInt();
int m = in.nextInt();
boolean[][] adj = new boolean[n][n];
long res = 0;
for (int i = 0; i < m; ++i) {
int x = in.nextInt();
int y = in.nextInt();
adj[x -... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int m = scan.nextInt();
boolean[][] graph = new boolean[n][n];
for (int i = 0; i < m; i++) {
int u = scan.nextInt() - 1;
int v = scan.nextInt() - 1;
... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.InputMismatchException;
/**
* @author Egor Kulikov (egor@egork.net)
* Created on 14.03.2010
*/
public class TaskD implements Runnable {
private InputRea... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
public class Main {
public static BufferedReader in;
public static PrintWriter out;
public static void main(String[] args) throws IOException {
in = new BufferedReader... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.*;
public class CF11D {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
int n = Integer.parseInt(st.nextToken());
int m = Integer.pa... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
import java.math.*;
public class task
{
public static void main(String args[])
{
Scanner a = new Scanner(System.in);
while(a.hasNext())
{
int n = a.nextInt();
int m = a.nextInt();
if(n == 0 && m == 0) break;
boolean[][] adj = new boolean[n][n];
long res = 0;
... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.Scanner;
public class D {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int[][]a = new int[n][n];
for (int i = 1; i <= m; i++) {
int v1 = sc.nextInt();
int ... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Arrays;
public class D11 {
static StreamTokenizer in;
static PrintWriter out;
static int nextInt() throws IOException {
in.nextToken();
ret... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main implements Runnable {
private void solution() throws IOException {
int n = in.nextInt();
int m = in.nextInt();
boolean[][] adj = new boolean[n][n];
long res = 0;
for (int i = 0; i < m; ++i) {
int x = in.nextInt();
int y = in.nextInt();
adj[x -... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
/**
* Created by Darren on 14-10-21.
*/
public class D {
Reader in = new Reader(System.in);
PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) throws IOException {
new D().run();
}
int n, m;
bool... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
/**
* @param args
*/
static int N, M;
static long[] C;
static int[][] g;
static ... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.*;
public class D implements Runnable {
public static void main(String[] args) {
new D().run();
}
class FastScanner {
BufferedReader br;
StringTokenizer st;
boolean eof;
String buf;
public FastScanner(String fileName) throws FileNotFoundException {
br = new Buffer... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.net.Inet4Address;
import java.util.Arrays;
import java.util.StringTokenizer;
/**
* Created by shirsh.bansal on 07/08/16.
*/
public class Main {
public static void main(String[] args) throws IOException {
... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IOException {
InputStream fin = System.in;
//fin = new FileInputStream("in.txt");
Scanner cin = new Scanner... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.*;
public class Template implements Runnable {
private void solve() throws IOException {
int n = nextInt();
int m = nextInt();
boolean[][] g = new boolean[n][n];
for (int i = 0; i < m; ++i) {
int a = nextInt() - 1;
int b = n... | np | 11_D. A Simple Task | 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... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
import java.io.*;
public class ASimpleTask
{
/************************ SOLUTION STARTS HERE ***********************/
private static void solve(FastScanner s1, PrintWriter out){
int V = s1.nextInt();
int E = s1.nextInt();
int graph[] = new int[V];
long DP[][] = new long[1 << V][V];
... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
import java.io.*;
public class ASimpleTask
{
/************************ SOLUTION STARTS HERE ***********************/
static long memo[][];
static int graph[];
static long hamiltonianPath(int mask , int u) {
if(memo[mask][u] != -1)
return memo[mask][u];
else if(u == Integer.numberOfTra... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.PrintWriter;
import java.util.Scanner;
public class D {
public void run(Scanner in, PrintWriter out) {
int n = in.nextInt();
int[][] graph = new int[n][n];
int m = in.nextInt();
for (int i = 0; i < m; i++) {
int x = in.nextInt() - 1;
int y = i... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main implements Runnable {
private void solution() throws IOException {
int n = in.nextInt();
int m = in.nextInt();
boolean[][] adj = new boolean[n][n];
long res = 0;
for (int i = 0; i < m; ++i) {
int x = in.nextInt();
int y = in.nextInt();
adj[x -... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main implements Runnable {
private void solution() throws IOException {
int n = in.nextInt();
int m = in.nextInt();
boolean[][] adj = new boolean[n][n];
long res = 0;
for (int i = 0; i < m; ++i) {
int x = in.nextInt();
int y = in.nextInt();
adj[x -... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
/**
* Codeforces 11D - A Simple Task
* Created by Darren on 14-10-21.
* O(2^n * n^2) time and O(2^n * n) space.
*
* Tag: dynamic programming, bitmask, graph
*/
public class D {
Reader in = new Reader(System.in);
PrintWriter out = new PrintWriter(System... | np | 11_D. A Simple Task | 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... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.*;
public class D11 {
static boolean[][] g;
static int n, m;
public static void main(String[] args) throws IOException {
input.init(System.in);
PrintWriter out = new PrintWriter(System.out);
n = input.nextInt();
m = input.nextInt();
g = new boolean[n][n];
for(int i = 0; i<m; i... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while ( sc.hasNextInt() ) {
int n = sc.nextInt();
long m = sc.nextInt();
boolean edge[][] = new boolean[n][n];
long dp[][] = new long[1<<n][n];
for ( long i = 1 ; i<=m ; ++i ) {
... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.Scanner;
public class Hello {
public static void main(String[] args){
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int m = scan.nextInt();
boolean[][] graph = new boolean[n][n];
for(int i = 0; i < m; i++) {
int from = scan.nextInt() - 1;
int to = scan.... | np | 11_D. A Simple Task | CODEFORCES |
/**
* Codeforces Beta Round #10
*
* @author ProjectYoung
*/
import java.util.Scanner;
public class CF11D {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
boolean[][] map = new boolean[n][n];
long[][] dp = new long[1 ... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
public class D11 {
static StreamTokenizer in;
static PrintWriter out;
static int nextInt() throws IOException {
in.nextToken();
return (int)in.nval;
}
s... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main implements Runnable {
private void solution() throws IOException {
int n = in.nextInt();
int m = in.nextInt();
boolean[][] adj = new boolean[n][n];
long res = 0;
for (int i = 0; i < m; ++i) {
int x = in.nextInt();
int y = in.nextInt();
adj[x -... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class Template implements Runnable {
BufferedReader in;
PrintWriter out;
StringTokenizer tok = new StringTokenizer("");
void init() throws FileNotFoundException {
try {
in = new BufferedReader(new FileReader... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
public class Main {
private FastScanner in;
private PrintWriter out;
public void solve() throws IOException {
int N = in.nextInt();
int M = in.nextInt();
int[][] edges = new int[N][N];
for (int i = 0; i < M; i++) {
int a = in.nextInt() - 1;
int b ... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.*;
public class Template implements Runnable {
private void solve() throws IOException {
int n = nextInt();
int m = nextInt();
boolean[][] g = new boolean[n][n];
for (int i = 0; i < m; ++i) {
int a = nextInt() - 1;
int b = n... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;
/**
* 4 6
* 1 2
* 1 3
* 1 4
* 2 3
* 2 4
* 3 4
*
*
*
*
*
*
* @author pttrung
*/
public class D {
public static long [][... | np | 11_D. A Simple Task | 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 {
private int n;
priva... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Main {
private int n;
private int m;
private boolean[][] g;
private long[][] dp;
private int[] count;
private int[] first;
private void solve(... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int V = in.nextInt();
int E = in.nextInt();
boolean [][] G = new boolean [V][V];
for (int i = 0; i < E; i++) {
int u = in.nextInt()-1;
... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main implements Runnable {
private void solution() throws IOException {
int n = in.nextInt();
int m = in.nextInt();
boolean[][] adj = new boolean[n][n];
long res = 0;
for (int i = 0; i < m; ++i) {
int x = in.nextInt();
int y = in.nextInt();
adj[x -... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
import static java.util.Arrays.fill;
import static java.util.Arrays.binarySearch;
import static java.util.Arrays.sort;
public class Main {
public static void main(String[] args) throws IOException {
// try {
// if (new File("input.txt").exists()... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
public class Cycles
{
public static FastInputStream fis;
public static void main(String[] args) throws IOException
{
fis = new FastInputStream(System.in);
System.out.println(solve(fis.nextInt(), fis.nextInt()));
fis.close();
}
public static l... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Ok_Simple {
static BufferedReader reader;
static StringTokenizer tokenizer;
static boolean am[][];
static long dp[][];
static int n;
public static ... | np | 11_D. A Simple Task | 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);
String[] in... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;
public class ASimpleTask {
static StreamTokenizer st;
static int nextInt() {
try {
st.nextToken();
} catch (IOException e) {
// TODO Auto-generated catch block
e.printStackTra... | np | 11_D. A Simple Task | 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 {
private int n;
priva... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
import java.io.*;
public class ASimpleTask
{
/************************ SOLUTION STARTS HERE ***********************/
static long memo[][];
static int graph[];
static long hamiltonianPath(int mask , int u) {
if(memo[mask][u] != -1)
return memo[mask][u];
else if(u == Intege... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main implements Runnable {
private void solution() throws IOException {
int n = in.nextInt();
int m = in.nextInt();
boolean[][] adj = new boolean[n][n];
long res = 0;
for (int i = 0; i < m; ++i) {
int x = in.nextInt();
int y = in.nextInt();
adj[x -... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.InputMismatchException;
import java.io.*;
import java.util.HashMap;
/**
* Generated by Contest helper plug-in
* Actual solution is at the bottom
*/
public class Main {
public static void main(String[] args) {
InputReader in = new StreamInputReader(System.in);
PrintWriter out = n... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class SimpleTask {
public static void main(String[] args) throws Exception {
InputReader in = new InputReader(System.in... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;
public class A{
static int n,m,start;
static boolean [][] adj;
static long [][] mem;
public static void mai... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
/**
* Created by huhansan on 2017/12/19.
* http://codeforces.com/problemset/problem/11/D
* 参考 Petr http://codeforces.com/contest/11/submission/47646
* 求所有不同的环的个... | np | 11_D. A Simple Task | CODEFORCES |
import java.awt.List;
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
impo... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class C {
static boolean[][] matrix;
static long[][] dp;
static int n;
static int m;
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
n = s.nextInt();
m = s.nextInt();
matrix = new... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.IOException;
import java.io.PrintStream;
import java.util.*;
public class Template {
public static void main(String[] args) throws IOException {
final Scanner in = new Scanner(System.in);
final PrintStream out = System.out;
int n = in.nextInt(), m = in.nextInt();
boo... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
public class Main11D {
private FastScanner in;
private PrintWriter out;
public void solve() throws IOException {
int N = in.nextInt();
int M = in.nextInt();
int[][] edges = new int[N][N];
for(int i = 0; i < M; i++){
... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;
import javax.sound.midi.Synthesizer;
public class Main {
static int V;
stati... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
public class cf11d {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int m = in.nextInt();
boolean[][] g = new boolean[n][n];
boolean[] ok = new boolean[1<<n];
int[] f = new int[1<<n];
for(int i=1; i<(1<<n); i++) {
ok[i] = Intege... | np | 11_D. A Simple Task | CODEFORCES |
//package round11;
import java.io.BufferedOutputStream;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.io.StringReader;
import java.util.Arrays;
import java.util.Scanner;
public class D {
private Scanner in;
private PrintWriter out;
private boolean[][] g;
public void solve()
{
n = ni(... | np | 11_D. A Simple Task | 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.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;
public class B {
static int first(int n)
{
int ... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
static long[][] memo;
static boolean[][] adjMat;
static in... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.*;
public class D11 {
static boolean[][] g;
static int n, m;
public static void main(String[] args) throws IOException {
input.init(System.in);
PrintWriter out = new PrintWriter(System.out);
n = input.nextInt();
m = input.nextInt();
g = new boolean[n][n];
for(int i = 0; i<m; i... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.InputStream;
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.BufferedReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.InputStreamReader;
import java.io.IOException;
/**
* Built using CHelper plug-in
* Actual soluti... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;
import java.util.ArrayList;
import java.util.List;
import java.util.Locale;
import java.util.Scanner;
public class Main implements Runnable {
/**
* @param args
*/
public static void main(Stri... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeSet;... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while ( sc.hasNextInt() ) {
int n = sc.nextInt();
long m = sc.nextInt();
boolean edge[][] = new boolean[n][n];
long dp[][] = new long[1<<n][n];
for ( long i = 1 ; i<=m ; ++i ) {
... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
/**
* Created by Tejas on 18-10-2018.
*/
public class Main {
static HashSet<Integer> adjList[];
public static void main(String[]args)throws IOException{
BufferedReader bufferedReade... | np | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.text.*;
import java.math.*;
import java.util.*;
public class Main {
private StreamTokenizer in;
private BufferedWriter out;
public void solve() throws Exception {
int n = nextInt(), m = nextInt();
int[] ss = new int[n];
for (int i=0; i<m; i++)
... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.Scanner;
import static java.lang.Integer.bitCount;
import static java.lang.Integer.numberOfTrailingZeros;
import static java.lang.System.out;
/**
* 11D
*
* @author artyom
*/
public class ASimpleTask {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
... | np | 11_D. A Simple Task | 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 | 11_D. A Simple Task | CODEFORCES |
import java.io.*;
import java.util.*;
public class D11 {
static HashMap<State, Integer> map;
static long[][] ans;
static boolean[][] connect;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringToken... | np | 11_D. A Simple Task | CODEFORCES |
import javafx.util.Pair;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.HashMap;
public class ElongatedMatrix {
private static int n;
/**
* if the rows are arranged in some permutation [p_1, p_2,...i,j,...p_n],
*... | np | 1102_F. Elongated Matrix | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.