src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringlengths 6 50 | from stringclasses 1
value |
|---|---|---|---|
import java.io.*;
import java.util.*;
public class D999 {
public static void main(String args[])throws IOException
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int m=sc.nextInt();
int req=n/m;
int arr[]=new int[n+1];
int size[]=new int[m];
Lis... | linear | 999_D. Equalize the Remainders | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class CoveredPointsCount {
//UPSOLVE
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStre... | nlogn | 1000_C. Covered Points Count | CODEFORCES |
import java.util.*;
import javax.lang.model.util.ElementScanner6;
import java.io.*;
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader inp = new InputReader(inputStream);
Prin... | quadratic | 1197_D. Yet Another Subarray Problem | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class LightItUp {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new ... | linear | 1000_B. Light It Up | CODEFORCES |
import java.io.*;
import java.util.*;
import java.util.function.Function;
public class Main {
static int N;
static int[] U, V;
static int[] A;
public static void main(String[] args) {
FastScanner sc = new FastScanner(System.in);
N = sc.nextInt();
U = new int[N-1];
V = ... | nlogn | 1037_D. Valid BFS? | CODEFORCES |
import java.util.*;
import java.io.*;
public class Solution
{
public static void main(String [] args) throws IOException
{
PrintWriter pw=new PrintWriter(System.out);//use pw.println() not pw.write();
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
StringTokenize... | linear | 1011_A. Stages | CODEFORCES |
import java.util.*;
public class A
{
public static int palin(String str)
{
int flag=0;
int l=str.length();
for(int i=0;i<l/2;i++)
{
if(str.charAt(i)!=str.charAt(l-i-1))
{
flag=1;
break;
}
}
if(fla... | linear | 981_A. Antipalindrome | CODEFORCES |
import java.io.*;
import java.util.*;
import java.lang.*;
import java.awt.*;
import java.awt.geom.*;
import java.math.*;
import java.text.*;
import java.math.BigInteger.*;
import java.util.Arrays;
public class CF111111
{
BufferedReader in;
StringTokenizer as;
int nums[],nums2[];
int[] nums1[];
boolean co... | linear | 1197_A. DIY Wooden Ladder | CODEFORCES |
import java.io.*;
import java.util.Scanner;
public class abc{
public static int check(StringBuilder s)
{
int countRemove=0;
if(!s.toString().contains("xxx")) return countRemove;
else{
for(int i=1;i<s.length()-1;i++)
{
if(s.charAt(i-1)=='x' && s.charAt(i)=='x' && s.charA... | linear | 978_B. File Name | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Iterator;
import java.util.ListIterator;
import java.util.Collection;
import java.util.AbstractList;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.Deq... | nlogn | 961_D. Pair Of Lines | CODEFORCES |
import java.io.*;
import java.util.*;
public class GFG {
public static void main (String[] args) {
Scanner sc = new Scanner (System.in);
int n = sc.nextInt();
int a = sc.nextInt();
int b = sc.nextInt();
int c = sc.nextInt();
int ans = 0;
int t= sc.nextInt();
int arr[] = new int[... | linear | 964_B. Messages | CODEFORCES |
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;
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template ... | linear | 1191_D. Tokitsukaze, CSL and Stone Game | CODEFORCES |
import java.util.*;
import java.io.*;
public class D {
static final boolean stdin = true;
static final String filename = "";
static FastScanner br;
static PrintWriter pw;
public static void main(String[] args) throws IOException {
if (stdin) {
br = new FastScanner();
pw = new PrintWriter(new OutputStre... | nlogn | 988_D. Points and Powers of Two | 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.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Map;
import java.util.PriorityQueue;
import ja... | nlogn | 1159_C. The Party and Sweets | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main{
public static void main(String[] args){
try {
new Main().solve();
} catch (Exception e) {
e.printStackTrace();
}
}
ArrayList<Edge>[]edge;
int n,m,cnt=0;
int ord;
int[]order;int[]vis;
Edg... | nlogn | 1100_E. Andrew and Taxi | CODEFORCES |
import java.util.Scanner;
public class origami {
public static void main(String args[]){
Scanner input = new Scanner(System.in);
double n = input.nextInt();
double k = input.nextInt();
double red = 0;
double green = 0;
double blue = 0;
double ans = 0;
red = (2 * n) / k;
green = (5 * n) / k;
blue ... | constant | 1080_A. Petya and Origami | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.List;
import java.util.StringTokenizer;
public class D {
int[][] fast(int n, int m){
int[][] ans = new int[2][n * m];
int c = 0;
for (int left = 1, ri... | quadratic | 1179_B. Tolik and His Uncle | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
static InputReader in = new InputReader(System.in);
static PrintWriter out = new PrintWriter(System.out);
static long oo = 1000000000000L;
public static void main(String[] args) throws IOException {
int n = in.nextInt();
int q = in.nextInt()... | linear | 1180_C. Valeriy and Deque | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class C {
void solve(){
int n = readInt();
int q = readInt();
int max = 0;
int[] a = new int[n];
Deque<Integer> deque = new ArrayDeque<>();
for(int i ... | linear | 1180_C. Valeriy and Deque | CODEFORCES |
import java.io.*;
import java.util.*;
public class CF1082D {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
StringTokenizer st = new StringTokenizer(br.readLine());
int[] aa = new in... | linear | 1082_D. Maximum Diameter Graph | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.util.InputMismatchException;
import java.util.Stack;
public class D527A2 {
public static void main(String[] args) {
FastScanner in = new FastScanner(System.in);
int N = in.nextInt();
Stack<Integer> stack = new Stack<>();
for(int i = 0; i < N;... | linear | 1092_D1. Great Vova Wall (Version 1) | CODEFORCES |
import java.io.*;
import java.util.*;
public class tr {
static int[][] ad;
static boolean []vis;
static int []goods;
static int[][]sol;
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int n=sc.nextInt()... | linear | 1092_D1. Great Vova Wall (Version 1) | CODEFORCES |
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Equator {
public static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
public static ... | linear | 962_A. Equator | CODEFORCES |
import java.io.*;
import java.util.*;
public class LectureSleep {
static class InputReader {
BufferedReader reader;
StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = nu... | linear | 961_B. Lecture Sleep | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
/**
* Created by IntelliJ IDEA.
* User: piyushd
* Date: Dec 5, 2010
* Time: 4:09:41 PM
* To change this template use File | Settings | File Templates.
*/
public class HamstersTigers {
private BufferedReader in;
private PrintWriter out;
private Strin... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
Scanner in;
PrintWriter out;
StreamTokenizer ST;
BufferedReader br;
int nextInt() throws IOException {
ST.nextToken();
return (int) ST.nval;
}
double nextDouble() throws IOException {
ST.nextToken();
return ST.nval;
}
Str... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.FileNotFoundException;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.Scanner;
public class Main
{
static final double eps=1e-10;
public static void main(String[] args) throws FileNotFoundException
{
new Main().solve();
}
public void solve() throws Fil... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
import java.util.Stack;
import java.util.StringTokenizer;
public class Main {
InputStreamReader ... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
import java.util.* ;
import java.io.* ;
import java.math.* ;
/************************
* *
* Lord Klotski *
* *
***********************/
public class C
{
static... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.util.*;
public class C {
public static void main(String[] args)
{
Scanner in = new Scanner(System.in);
int n = in.nextInt();
char[] s = new char[n];
String line = in.next();
int ct=0,ht=0;
for(int i=0;i<n;i++) //count animals
if(line.charA... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
public class B {
private static StreamTokenizer in;
private static PrintWriter out;
private static int nextInt() throws Exception{
in.nextToken();
return (int)in... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.util.Scanner;
public class Tsk1 {
static void metod() throws Exception {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
String s = in.next();
String ss = s + s;
int t = 0;
for (int i = 0; i < n; i++) {
if (s.charAt(i) == 'T') {
... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.util.*;
import java.io.*;
public class Solution {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(new InputStreamReader(System.in));
int n = sc.nextInt();
String s = sc.next();
sc.close();
int cH = 0;
for (int i... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
/*
* Hello! You are trying to hack my solution, are you? =)
* Don't be afraid of the size, it's just a dump of useful methods like gcd, or n-th Fib number.
* And I'm just too lazy to create a new .java for every task.
* And if you were successful to hack my solution, please, send me this test as a message or to Abr... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.util.Scanner;
public class C {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int len = s.nextInt();
s.nextLine();
String l = s.nextLine();
char[] ca = l.toCharArray();
int h = 0;
for (char c : ca)
h += A(... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Homyak implements Runnable {
private void solve() throws IOException {
int n = nextInt();
String seq = nextToken();
int nh ... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.*;
import java.util.*;
public class C
{
String line;
StringTokenizer inputParser;
BufferedReader is;
FileInputStream fstream;
DataInputStream in;
void openInput(String file)
{
if(file==null)is = new BufferedReader(new InputStreamReader(System.in));//stdin
else
{
try{
fstrea... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main implements Runnable {
public void _main() throws IOException {
int n = nextInt();
int[] a = new int[n];
String s = next();
for (int i = 0; i < n; i++)
a[i] = s.charAt(i) == 'H' ? 1 : 0;
int res = 10 * n;
for (int i = 0; i < n; i++) {
int[] b =... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
public class Solution {
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) throws Exception{
StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
in.nextToken();
int ... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.*;
import java.util.*;
public class C {
MyScanner in;
PrintWriter out;
public static void main(String[] args) throws Exception {
new C().run();
}
public void run() throws Exception {
in = new MyScanner();
out = new PrintWriter(System.out);
solve();... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
import java.math.*;
public class Main {
public static StreamTokenizer in;
public static PrintStream out;
public static BufferedReader br;
public static String readString() throws IOException {
in.nextToken();
return in.sval;
... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.util.*;
import java.io.*;
import static java.util.Arrays.*;
import static java.lang.Math.*;
import java.math.*;
public class Main {
void run() throws IOException {
int n = nint();
char[] s = token().toCharArray();
int h = 0;
for (int i = 0; i < n; i++) {
... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
public class C43 {
static StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
static PrintWriter out = new Print... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.util.*;
public class Main {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner cin = new Scanner(System.in);
int n;
n = cin.nextInt();
String s = cin.next();
int ans = n;
int cntH = 0,cntT = 0;
for(int i=0;i<n;i++)
{
if(s.char... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.StringTokenizer;
public class C implements Runnable {
private static final boolean USE_FILE_IO = false;
private static final String FILE_IN = "c.in";
private static final String FILE_OUT = "c.out";
BufferedReader in;
PrintWriter out;... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
private static boolean _READ_FROM_FILE = System.getProperty("ONLINE_JUDGE") == null;
private static Scanner in;
private static void core() {
int n = in.nextInt();
ArrayList<Character> all = new ArrayList<Character>();
for (char ch : in.next().toCharArr... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.*;
import java.util.*;
public class Solution {
StreamTokenizer in;
PrintWriter out;
public static void main(String[] args) throws Exception {
new Solution().run();
}
public void run() throws Exception {
in = new StreamTokenizer(new BufferedReader(new InputStreamRea... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
/*
* Author: Nikhil Garg
* Date: 2010-12-05
*
*/
import java.io.*;
import java.util.*;
import java.math.*;
public class javatemp
{
static String map(int a)
{
if( a == 0) return "S";
else if ( a == 1 ) return "M";
else if ( a == 2 ) return "L";
else if ( a == 3 ) return "XL";
else if ( a == 4 ) return "XX... | linear | 46_C. Hamsters and Tigers | 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 {
new Thread(null, new Runnable() {
public voi... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;
public class C43 implements Runnable {
public Scanner in;
public PrintWriter out;
final static String TASK_NAME = "";
C43() throws IOException {
in = new Scanner( System.in );
// in = new StreamTokeniz... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
//package round43;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class C {
Scanner in;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni();
char[] x = in.next().toCharArray();
int t = 0;
for(int i = 0;i < n;i++){
if(x[i] == 'T'){
t++;
}
}
... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.*;
import java.util.*;
public class Solution {
static BufferedReader br=null;
static PrintWriter pw=null;
static StringTokenizer st=null;
static String FILENAME="";
void nline(){
try {
st=new StringTokenizer(br.readLine());
} catch (IOException e) {
... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.BufferedInputStream;
import java.util.Scanner;
public class HamstersAndTigers { //Round #XX - Hamsters and Tigers
public static void main(String[] args) {
Scanner sc = new Scanner(new BufferedInputStream(System.in));
int numAnimals = sc.nextInt();
String positions = sc.next();
int numTigers =... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int[] a=new int[1010];
while(in.hasNext()){
int n=in.nextInt();
String s=in.next();
int sum=0;
for(int i=0;i<n;++i){
... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.util.Scanner;
public class ProblemC {
public static void main(String[] args) {
ProblemC problem = new ProblemC();
problem.solve();
}
private void solve() {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String s = sc.next();
int ret... | linear | 46_C. Hamsters and Tigers | 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.*;
... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import com.sun.org.apache.xpath.internal.axes.SubContextList;
import java.util.Scanner;
/**
*
* @author Madi
*/
public class Round42CC {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.nextLine());
String s = sc.nextLine();
... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.PrintWriter;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
// 1 = H, 0 = T
int n = in.nextInt();
String line = in.next();
int h = 0;
for (int i = 0; i < line.lengt... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.*;
import java.util.*;
public class HamstersAndTigers
{
Scanner in;
PrintWriter out;
HamstersAndTigers()
{
in = new Scanner(System.in);
out = new PrintWriter(System.out);
}
HamstersAndTigers(String i, String o) throws FileNotFoundException
{
in = new Scanner(new File(i));
out = new P... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
int size= Integer.parseInt(r.readLine());
... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
import java.math.*;
public class Main implements Runnable {
BufferedReader in;
PrintStream out;
StringTokenizer st = new StringTokenizer("");
static boolean local = false;
public static void main(String [] args) throws Exception {
if (arg... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.util.*;
import java.io.*;
import static java.util.Arrays.*;
import static java.lang.Math.*;
import java.math.*;
public class Main {
void run() throws IOException {
int n = in.nextInt();
char[] c = in.next().toCharArray();
int[][] t = new int[n][n];
int[][] h = n... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.util.Scanner;
/**
*
* @author igor_kz
*/
public class C46 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int number = in.nextInt();
String s = in.next();
int cH = 0;
int n = s.length();
for (int i = 0 ; i < n ; i++)
... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
//package round43;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class C {
static BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
static StringTokenizer st;
static PrintWri... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class pr1073B {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.... | linear | 1073_B. Vasya and Books | CODEFORCES |
import java.util.*;
public class Test { public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
int n= sc.nextInt();
int x= (int)Math.sqrt(n) ;
int a[] = new int[n+5];
for(int i=1,o=n,j;i<=n;i+=x)
for(j=(int)Math.min(i+x-1,n);j>=i;a[j--]=o--);
for(int i=1;i<=n;i++)System.out.print(a[i]+" ");
Syste... | linear | 1017_C. The Phone Number | CODEFORCES |
import java.util.Scanner;
public class Solution {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
String s = sc.next();
StringBuilder ans = new StringBuilder();
int count = 0;
int open = 0;
for (int i = 0; i <... | linear | 1023_C. Bracket Subsequence | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String args[]) {
Scanner scan = new Scanner(System.in);
int n=scan.nextInt();
int m=scan.nextInt();
int[] game=new int[n];
int[] bill=new int[m];
for (int i = 0; i <n ; i++) {
game[i]=scan.ne... | linear | 1009_A. Game Shopping | CODEFORCES |
import java.util.*;
import java.io.*;
public class A
{
public static void main(String ar[]) throws Exception
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String s1[]=br.readLine().split(" ");
String s2[]=br.readLine().split(" ");
i... | linear | 1000_B. Light It Up | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class LightItUp {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new ... | linear | 1000_B. Light It Up | CODEFORCES |
import java.util.*;
public class A
{
public static int palin(String str)
{
int flag=0;
int l=str.length();
for(int i=0;i<l/2;i++)
{
if(str.charAt(i)!=str.charAt(l-i-1))
{
flag=1;
break;
}
}
if(fla... | linear | 981_A. Antipalindrome | CODEFORCES |
import java.util.*;
public class Main {
static int n=5;
static int[] arr=new int[5];
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n=sc.nextInt();
int arr[]=new int[n];
for (int i=0;i<n;i++)
{
arr[i]=sc.nextInt();
... | linear | 1180_B. Nick and Array | CODEFORCES |
import java.util.Scanner;
public class NickAndArray {
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int array[]=new int[n];
int max=Integer.MAX_VALUE;
int index=0;
for(int i=0;i<n;i++)
{
int k=sc.nextInt();
array[i]=k;
if(array[i]>=0)
... | linear | 1180_B. Nick and Array | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class round569d2b {
public static void main(String args[]) {
FastScanner in = new FastScanner(System.in);
int n = in.nextInt();
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = in.nextInt();
}
if (n % 2 == 0) {
for (i... | linear | 1180_B. Nick and Array | 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 MaxHeap
*/
public class Main ... | linear | 1062_C. Banh-mi | CODEFORCES |
import java.util.*;
public class B {
public B () {
int N = sc.nextInt();
int a = sc.nextInt();
int b = sc.nextInt();
int [] P = sc.nextInts();
TreeSet<Integer> S = new TreeSet<>();
Set<Integer> A = new HashSet<>();
Set<Integer> B = new HashSet<>();
for (int p : P) S.add(p);
while (!S.isEmpty()) {... | linear | 468_B. Two Sets | CODEFORCES |
/*
* Hopefully this is AC :D
*/
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.StringTokenizer;
import java.util.Arrays;
public class TwoSets {
static ArrayList<Integer> g[];
static boolean vis... | linear | 468_B. Two Sets | CODEFORCES |
import java.util.InputMismatchException;
import java.math.BigInteger;
import java.io.*;
import java.util.*;
/**
* 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);
PrintWrite... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.IOException;
import java.util.Arrays;
import java.io.FilterInputStream;
import java.util.HashMap;
import java.util.Iterator;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.TreeSet;
import java.io.BufferedInputStream;
import java.io.InputStream;
/**
* Built using CHelper plug-... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collecti... | linear | 468_B. Two Sets | CODEFORCES |
import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;
public class Main {
static int n;
static int a;
static int b;
static int g;
static int ref;
static int refg;
static HashSet<Integer> cgroup;
static HashMap<Integer,Integer> indexmap;
static HashSet<Integer> nums;
static HashSet<... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
void solve() throws IOException {
in = new InputReader("__std");
out = new OutputWriter("__std");
int n = in.readInt();
int a = in.readInt();
int b = in.readInt();
int ma = 0;
int mb = 1;
if (a ... | linear | 468_B. Two Sets | CODEFORCES |
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;
/**
* Created by hama_du on 2014/09/21.
*/
public class ProblemB {
public static void main(String[] args) {
... | linear | 468_B. Two Sets | CODEFORCES |
import java.util.Map;
import java.io.OutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.TreeMap;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static void main(... | linear | 468_B. Two Sets | CODEFORCES |
import java.util.Map;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Set;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.HashSet;
import java.io.... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.util.Set;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import java.util.HashSet;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.*;
import java.util.*;
public class CF_468B {
public static void main(String[] args) throws IOException {
new CF_468B().solve();
}
int root(int[] father, int a){
if (father[a]==a) return a;
else return father[a]=root(father, father[a]);
}
void unite(int[] ... | linear | 468_B. Two Sets | CODEFORCES |
import java.util.List;
import java.util.Map;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.ArrayList;
import java.util.HashMap;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.BufferedInputStream;
import java.io.BufferedWriter;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Map.Entry;
import java.util.Scanner;
import java.util.TreeMap;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(new Buffe... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.BufferedReader;
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.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections... | linear | 468_B. Two Sets | CODEFORCES |
import java.util.*;
import java.math.*;
import java.io.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
public class Main{
// ArrayList<Integer> lis = new ArrayList<Integer>();
// ArrayList<String> lis = new ArrayList<String>();
// PriorityQueue<P> que ... | linear | 468_B. Two Sets | 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.HashMap;
import java.util.HashSet;
import java.util.Stack;
import java.util.StringTokenizer;
public class TwoSets {
static... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.StringTokenizer;
import static java.lang.Integer.*;
public class BDiv1 {
static int n;
static int a;
static int b;
static HashMap<... | linear | 468_B. Two Sets | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main
{
static HashMap<Integer,Integer> hm;
static int[] array;
static boolean marked[];
static int a , b ;
static int[] ans ;
public static void main( String args[])
{
Scanner sc = new Scanner(System.in);
int n ;
n = sc.nextInt();
a = sc.nextInt... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.TreeSet;
public class B {
static Set<Integer> A;
static Set<Integer> B;
static TreeSet<Integer> ts;
static int a;
static int b;
static boolean noAns... | linear | 468_B. Two Sets | CODEFORCES |
import java.text.DecimalFormat;
import java.io.*;
import java.util.*;
import java.lang.reflect.Array;
/**
* @author Mukesh Singh
*
*/
public class AB {
private InputStream input;
private PrintStream output;
private Scanner inputSc;
public AB(InputStream input, PrintStream output) {
this.... | linear | 468_B. Two Sets | CODEFORCES |
import java.util.*;
import java.io.*;
public class B {
public static PrintStream out = System.out;
public static InputReader in = new InputReader(System.in);
static class Node implements Comparable<Node> {
int res;
Node(int pp) {
p = pp;
}
int p;
@Override... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class ProblemB3 {
Map<Integer, List<int[]>> dest;
private ProblemB3() throws IOException {
BufferedReader rd = new BufferedReader(new InputStreamReader(System.in));
String h ... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class B {
BufferedReader reader;
StringTokenizer tokenizer;
PrintWriter out;
public void solve() throws IOException {
int N = nextInt();
int... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
static BufferedReader reader;
static StringTokenizer tokenizer;
static PrintWriter writer;
static int nextInt() throws NumberFormatException, IOException {
return Integer.parseInt(nextToken());
}
static long nextLong() throws NumberFormatException, I... | linear | 468_B. Two Sets | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.