src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringlengths 6 50 | from stringclasses 1
value |
|---|---|---|---|
import java.awt.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.*;
import java.util.List;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt(), m = scanner.nextInt();
int[] vertical ... | nlogn | 1075_C. The Tower is Going Home | CODEFORCES |
import java.io.*;
import java.util.*;
public class A4 {
public BufferedReader input;
public PrintWriter output;
public StringTokenizer stoken = new StringTokenizer("");
public static void main(String[] args) throws IOException {
new A4();
}
A4() throws IOException {
input = n... | nlogn | 1075_C. The Tower is Going Home | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class loser
{
static class InputReader {
public BufferedReader br;
public StringTokenizer token;
public InputReader(InputStream stream)
{
br=new BufferedReader(new InputStreamReader(stream),32768);
... | nlogn | 608_A. Saitama Destroys Hotel | CODEFORCES |
import javafx.util.Pair;
import java.io.*;
import java.util.*;
public class Beacon8 {
public static void main(String[] args) throws IOException {
// int[] arr = {1, 3, 7, 18};
// int bIndex = Arrays.binarySearch(arr, 4);
// System.out.println(bIndex);
Scanner scan = new Scanner(Syst... | nlogn | 608_C. Chain Reaction | CODEFORCES |
import java.io.BufferedReader;
import java.io.Closeable;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;
import java.util.StringTokenizer;
public class ChainReaction im... | nlogn | 608_C. Chain Reaction | CODEFORCES |
import java.util.*;
import java.io.*;
import static java.lang.System.in;
public class Main {
public static void main(String[] args)throws IOException{
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[][] point = new int[n][];
for(int i=0;i<n;i++) point[i] = new int[]{s... | nlogn | 528_B. Clique Problem | 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... | nlogn | 528_B. Clique Problem | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.io.OutputStreamWriter;
import java.util.NoSuchElementException;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Iterator;
import ja... | nlogn | 528_B. Clique Problem | CODEFORCES |
import java.util.*;
public class A{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
TreeSet<Integer> v = new TreeSet<Integer>();
for(int i=0;i<n;i++) v.add(sc.nextInt());
Iterator<Integer> it = v.iterator();
it.next(... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.Scanner;
public class Seq2 {
static void metod() {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = in.nextInt();
int min = a[0];
for (int i = 1; i < a.length; i++) {
... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
public class Main {
private static Parser in;
private static PrintWriter out;
public static void main(String[] args) {
in = new Parser(System... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.*;
public class A
{
public static void main(String args[])
{
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int[] a = new int[n];
for(int i=0;i < n;i++)
a[i] = scan.nextInt();
Arrays.sor... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.TreeSet;
public class A {
public static void main(String[] args) throws IOException {
new A().run();
}
B... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main{
BufferedReader in;
StringTokenizer str = null;
PrintWriter out;
private String next() throws Exception{
if (str == null || !str.hasMoreTokens())
str = new StringTokenizer(in.readLine());
... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
TreeSet<Integer> set = new TreeSet<Integer>();
for(int i=0;i<n;i++){
set.ad... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.InputMismatchException;
/**
* @author Egor Kulikov (egor@egork.net)
* Created on 14.03.2010
*/
public class TaskA implements Runnable {
private InputReader in;
private PrintWri... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.*;
import java.util.Arrays;
import java.util.StringTokenizer;
public class VtoraiaStat implements Runnable {
boolean isLocalMode = false;
private void doJob() throws Exception {
int n = nextInt();
int[] r = new int[n];
for(int i =0;i<n;i++){
r[i]=nextInt();... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.*;
public class Main {
public static void main(String[] args) throws Exception {
// TODO code application logic here
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int iTotTerm, i, j, iSml = 0, iPos = 0;
iTotTerm = Integer.parseInt(br.readL... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main{
public static void main(String []args){
Scanner cin = new Scanner( System.in );
int n = cin.nextInt();
int [] num = new int [ n ];
for (int i=0; i<n; i++)
num[i] = cin.nextInt();
Arrays.sort( num );
int i = 0;
while ( i < n ){
if (... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
public class Blah
{
public static void main(String args[])
{
Scanner c = new Scanner(System.in);
String number = c.nextLine();
int i = Integer.parseInt(number);
if (i == 1)
{
System.out.println("NO");
return;
}
String line = c.nextLin... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.Scanner;
public class prob1 {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int n = input.nextInt();
if(n == 1)
{
// throw new RuntimeException();
int m = input.nextInt();
System.out.println("NO");
// System.out.println(input.next());
return;
... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
//package codeforces.br22;
import java.io.*;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
/**
* User: Kandy
* Date: 29.06.2010
* Time: 21:07:24
*/
public class ProblemA {
public void solve() {
boolean oj = true;
try {
Reader reader = oj ? new In... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Main2 {
public static void main(String[] args) throws Exception {
new Main2().run();
}
public void solve() throws Exception {
n = nextInt();
int a[]= new int[n], pos = 1;
for(int i=0; i<n; i++)
... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.*;
public class A {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int first = Integer.MAX_VALUE, second = Integer.MAX_VALUE;
for (int i = 0, x; i < N; ++i) {
x = sc.nextInt();
if (x < fi... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashSet;
import java.util.Scanner;
public class A {
/**
* @param args
*/
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
HashSet<Integer> set = new ... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Scanner;
public class A {
/**
* @param args
*/
public static void main(String[] args) {
Scanner s = new Scanner(new InputStreamReader(System.in));
int n = s.nextInt();
int [] ar = new int[n];
for (int i = 0; i < n ; i++) {
... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader in = new BufferedReader(new InputStreamReade... | nlogn | 22_A. Second Order Statistics | 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];
for (int i = 0; i < n; i++)
a[i] = nextInt();
Arrays.sort(a);
for (int i = 1; i < n; i++)
if (a[i] != a[0]) {
out.print(a[i]);
return... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import static java.util.Arrays.sort;
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.SortedSet;
import java.util.StringTokenizer;
import java.util.TreeSet;
public class SecondOrderStatistics ... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.Arrays;
import java.util.Date;
import java.util.Scanner;
public class Main {
/**
* @param args
*/
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
int[] a = new int[n];
for(int i=0;i<n;i++)
a[i] = s.nextInt();
A... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Solution {
BufferedReader in;
PrintWriter out;
StringTokenizer st;
void solve() throws IOException {
int n = ni();
int[] v = new int[n];
for (int i = 0; i < n; ++i)
v[i] = ni();
... | nlogn | 22_A. Second Order Statistics | 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 A22 {
static StreamTokenizer in;
static PrintWriter out;
static int nextInt() throws IOException {
in.nextToken();
ret... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
/**
*
* @author ishani
*/
import java.util.*;
public class A {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
TreeSet<Integer> set = new TreeSet<Integer>();
for(int i=0;i<N;i++){
int a = sc.nextInt();
... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
public class CF22_1 {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int num=sc.nextInt();
if(num!=1)
{
ArrayList<Integer>data=new ArrayList<Integer>();
for (in... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.*;
public class Main
{
public static void main(String[] args)
{
Scanner keyboard = new Scanner(System.in);
int size = keyboard.nextInt();
int[] arr = new int[size];
int i = 0;
while( size != 0 )
{
arr[i] = keyboard.nextInt();
size--;
i++;
}
//System.out.pr... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
void run()throws IOException{
Scanner sc = new Scanner(new InputStreamReader(System.in));
int n = sc.nextInt();
int i;
int[] ar = new int[n];
for(i=0; i<n; i++){
ar[i] = sc.nextInt();
}
Array... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.*;
public class Beta22PA {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int minimum = 200, second = 200;
for(int i=0; i<n; i++) {
int temp = scan.nextInt();
if(temp... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Collections;
import java.util.LinkedList;
import java.util.List;
import java.util.Set;
import java.util.StringTokeni... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.*;
import java.math.*;
/**
*
* @author Izhari Ishak Aksa
*/
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
Hashtable<Integer, Integer> hi = new Hashtable<Integer, Integer>();
for (int i = 0;... | nlogn | 22_A. Second Order Statistics | 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.StreamTokenizer;
import java.lang.reflect.Array;
import java.util.Arrays;
public class a {... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.*;
public class Test
{
public static void main(String[] args)
{
Scanner t = new Scanner(System.in);
int n=t.nextInt();
int a[]= new int[n];
for(int i=0; i<n; i++)
a[i]=t.nextInt();
Arrays.sort(a);
int r=a[0];
for(int i=1; i<n; i++)
if(a[i]!=r)
... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
//package a_vtoray_poriadkovay_statistika;
import java.util.Arrays;
import java.util.Scanner;
/**
*
* @author kal1sha
*/
public class Main {
/**
* @param args the command line arguments
*/
public ... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class A {
public static void main(String[] args) {
new A().run();
}
private void run() {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = sc.nextInt();
Arrays.sort(a);
int... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
//package timus;
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.io.Reader;
import java.io.StreamTokenizer;
import java.io.Writer;
import java.ut... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.*;
public class A {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int first = Integer.MAX_VALUE, second = Integer.MAX_VALUE;
for (int i = 0, x; i < N; ++i) {
x = sc.nextInt();
if (x < fi... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
public static void main (String [] args) throws IOException {
BufferedReader br = new BufferedReader (new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
int [] nums = new int[n];
args = br.readLine().s... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.*;
public class CDF22_A {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[] A = new int[N];
for (int i=0; i<N; i++)
A[i] = sc.nextInt();
Arrays.sort(A);
int i = 0;
... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.*;
import java.io.*;
public class A {
public static void main(String[] args) {
Scanner s = new Scanner(new InputStreamReader(System.in));
int n = s.nextInt();
if (n == 1) {
System.out.println("NO");
System.exit(0);
}
int[] nums = new... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws Exc... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.*;
public class Main
{
public static void main(String[] args)
{
Scanner keyboard = new Scanner(System.in);
int size = Integer.parseInt(keyboard.nextLine());
int[] arr = new int[size];
int i = 0;
while( size != 0 )
{
arr[i] = keyboard.nextInt();
... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.*;
import java.util.*;
public class A implements Runnable {
public static void main(String[] args) {
new A().run();
}
class FastScanner {
BufferedReader br;
StringTokenizer st;
boolean eof;
String buf;
public FastScanner(String fileName) throws FileNotFoundException {
br = new Buffer... | nlogn | 22_A. Second Order Statistics | 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;
/* Template for TopCoder and ACMonline. */
public class A {
private static StreamTokenizer in = null;
private static PrintWriter out ... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main implements Runnable {
public void solution() throws IOException {
int n = in.nextInt();
int[] a = new int[n];
int min = Integer.MAX_VALUE;
for (int i = 0; i < n; ++i) {
a[i] = in.nextInt();
if (a[i] < min) {
min = a[i];
}
}
int res = Int... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.ArrayDeque;
import java.util.Arrays;
public class Main {
private static StreamTokenizer in;
private static PrintWriter out;
private static int nextInt() throws Exception {... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
//package round22;
import java.io.PrintWriter;
import java.io.StringReader;
import java.util.Arrays;
import java.util.Scanner;
public class A {
private Scanner in;
private PrintWriter out;
// private String INPUT = "5 1 2 3 1 1";
private String INPUT = "";
public void solve()
{
int n = ni();
int[] a = new... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.math.*;
public class Main{
Scanner sc=new Scanner(System.in);
void run(){
int n = sc.nextInt();
int x[] = new int [n];
for (int i=0;i<n;i++)
x[i] = sc.nextInt();
java.util.Arrays.so... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
TreeSet<Integer> set = new TreeSet<Integer>();
for(int i=0;i<n;i++){
set.add(sc.nextInt());
}
if(set.size() >= 2)
System.out.println(set.toArray()[1]);
else
... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
public class One {
InputStreamReader inp = new InputStreamReader(System.in);
BufferedReader in = new BufferedRead... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
public class Main {
// static int INF=1<<28;
//int x,y;
static int sum=0;
//static ArrayList<Integer> lis = new ArrayList<Integer>();
public static void main(Strin... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class TaskA {
void Run() throws IOException {
int n=ReadInt();
int[] arr=new int[n];
for(int i=0;i<n;++i)
arr[i]=ReadInt();
Arrays.sort(arr);
boolean one=true;
for(int x : arr)
if(x!=1) {
one=false;
break;
}
if(one) {
f... | nlogn | 135_A. Replacement | CODEFORCES |
import javax.sound.sampled.Line;
import java.awt.Point;
import java.awt.geom.Line2D;
import java.awt.geom.Point2D;
import java.io.*;
import java.math.BigInteger;
import static java.math.BigInteger.*;
import java.util.*;
public class A{
void solve()throws Exception
{
int n=nextInt();
int[]a=new int... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
//created at 6:06 PM 12/9/11 by Abrackadabra
public class A {
int IOMode = 0; //0 - consoleIO, 1 - <taskName>.in/out, 2 - input.txt/output.txt, 3 - test case generator
String taskName = "";
void solve() throws IOException {
int n = nextInt... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.*;
import java.util.*;
public class c {
public static void main(String[] args)
throws IOException {
BufferedReader r =
new BufferedReader(new InputStreamReader(System.in), 1);
String s = r.readLine();
int n = Integer.parseInt(s);
String s2 = r.readLine();
StringTokenizer st = new Stri... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
public A () throws IOException {
String input = r.readLine();
int N = Integer.parseInt(input);
int [] A = new int [N];
input = r.readLine();
String [] S = input.split(" ");
for (int i = 0; i < N; ++i)
A[i] = Integer.parseInt(S[i]);
solve(N, A);
... | nlogn | 135_A. Replacement | CODEFORCES |
import static java.lang.Math.*;
import static java.lang.System.currentTimeMillis;
import static java.lang.System.exit;
import static java.lang.System.arraycopy;
import static java.util.Arrays.sort;
import static java.util.Arrays.binarySearch;
import static java.util.Arrays.fill;
import java.util.*;
import java.io.*;
p... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class A135 {
public static void main(String[] args) throws Exception {
BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(r.readLine());... | nlogn | 135_A. Replacement | CODEFORCES |
/**
* Created by IntelliJ IDEA.
* User: mac
* Date: 11-12-9
* Time: 下午10:48
* To change this template use File | Settings | File Templates.
*/
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringT... | nlogn | 135_A. Replacement | CODEFORCES |
import java.awt.Point;
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import static java.lang.Math.*;
public class A implements Runnable{
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE")!=null;
BufferedReader in;
PrintWriter out;
StringTokenizer tok = new Stri... | nlogn | 135_A. Replacement | CODEFORCES |
import static java.util.Arrays.deepToString;
import java.io.*;
import java.math.*;
import java.util.*;
public class A {
static int [] solve(int [] a) {
int n = a.length;
Arrays.sort(a);
a[n - 1] = (a[n - 1] > 1 ? 1 : 2);
int [] b = Arrays.copyOf(a, n);
Arrays.sort(b);
return b;
}
public static void m... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Arrays;
public class Main {
public static void main(String[] args) throws Exception {
int n = n... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.* ;
import java.util.*;
import static java.lang.Math.* ;
import static java.util.Arrays.* ;
public class A {
public static void main(String[] args) throws IOException {
new A().solveProblem();
out.close();
}
static Scanner in = new Scanner(new InputStreamReader(System.in));
//static Bu... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class A_135 {
/**
* @param args
*/
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
int n=in.nextInt();
int[] mas=new int[n];
... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.*;
import java.util.*;
public class CodeForce {
private void solve() throws IOException {
final int N = nextInt();
int []A = new int[N];
for(int i = 0; i < N; i++) A[i] = nextInt();
Arrays.sort(A);
if(A[N-1] == 1) A[N-1] = 2;
else A[N-... | nlogn | 135_A. Replacement | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class C {
public static void main(String... args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
sc.nextLine();
int[] x = new int[n];
int max=0, pos=-1;
for(int i=0; i<n; i++) ... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.*;
import java.util.*;
public class TaskA {
BufferedReader br;
PrintWriter out;
StringTokenizer stok;
String nextToken() throws IOException {
while (stok == null || !stok.hasMoreTokens()) {
String s = br.readLine();
if (s == null) {
return "-1";
}
stok = new StringTokenizer(s);
... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.*;
import java.util.*;
import java.util.prefs.NodeChangeEvent;
import java.math.*;
public class Main implements Runnable {
private BufferedReader in;
private PrintWriter out;
private StringTokenizer st;
private Random rnd;
private void solve() throws IOException {
int n = nextInt();
int[] ... | nlogn | 135_A. Replacement | CODEFORCES |
import java.util.*;
import java.math.*;
public class codeforces {
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int[] data=new int[n];
for(int i=0;i<n;i++)
data[i]=sc.nextInt();
Arrays.sort(data);
if(data[n-1]!=1)
data[n-1]=1;
else
data[n-1]=2... | nlogn | 135_A. Replacement | CODEFORCES |
import java.util.*;
public class A {
static int [] reverse = new int [257];
public static void main (String [] arg) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int [] A =new int [n];
for (int i = 0; i<A.length; ++i) A[i] = sc.nextInt();
Arrays.sort(A);
if (n == 1) {
System.out.println(... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class C {
public static void main(String[] args) throws IOException {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(in.r... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;
public class C implements Runnable {
private void Solution() throws IOException {
int n = nextInt(), max = 0, maxi = 0;
ArrayLis... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
public class Main
{
BufferedReader reader;
FastScanner sc;
void solve() throws Exception
{
int n = sc.nextInt();
int[] arr = new int[n];
for (int i = 0; i < n; i++)
{
arr[i] = sc.nextInt();
... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Scanner;
import java.util.StringTokenizer;
public class C {
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = null;
private void soluti... | nlogn | 135_A. Replacement | 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 A {
public A() throws Exception {
int n = in.nextInt();
int[] arr = new int[n];
for (int i=0;i<n;i++)
arr[i] = in.nextInt();
... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.AbstractList;
import java.io.Writer;
import java.util.List;
import java.io.IOException;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.math.BigInteger;
import java.io.InputStream;
/**
* Built using CHelper plug-in... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
import java.awt.geom.*;
import static java.lang.Math.*;
public class Solution implements Runnable {
public void solve() throws Exception {
int n = nextInt();
int a [] = new int [n];
for (int i = 0 ;i < n; i++) {
a[i] = nextInt();
}
Arrays.sort... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class Solution {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int n = in.nextInt();
int[] a = new int[n];
bo... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.*;
import java.util.*;
public class A implements Runnable {
private MyScanner in;
private PrintWriter out;
private void solve() {
int n = in.nextInt();
int[] a = new int[n];
int max = -1, maxp = -1;
for (int i = 0; i < n; ++i) {
a[i] = in.nextInt(... | nlogn | 135_A. Replacement | CODEFORCES |
import java.lang.*;
import java.io.*;
import java.util.*;
import java.math.*;
public class A implements Runnable{
public void run() {
int n = nextInt();
int[] arr = new int[n];
boolean allOne = true;
for (int i = 0; i < n; ++i) {
arr[i] = nextInt();
... | nlogn | 135_A. Replacement | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class AAA {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = in.nextInt();
int max = a[0];
... | nlogn | 135_A. Replacement | CODEFORCES |
import java.util.*;
public class A135 {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = s.nextInt();
}
Arrays.sort(arr);
int[] ans = ne... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.pa... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
BufferedReader in;
StringTokenizer st;
PrintWriter out;
String next() throws IOException {
while (st == null || !st.hasMoreTokens())
st = new StringTokenizer(in.readLine());
return st.nextToken();
}
int nextIn... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;
import java.util.Arrays;
import java.util.Scanner;
public class Beta97B {
static Scanner in;
static StreamTokenizer st;
static int n;
static int[] a;
static int max = 1;
public static void main(Strin... | nlogn | 135_A. Replacement | CODEFORCES |
//package round97;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class A {
static BufferedReader bf = new BufferedReader(new InputStreamReader(
System.in));
static StringT... | nlogn | 135_A. Replacement | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class A {
void run(){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] a = new int[n];
boolean dif = false;
for(int i=0;i<n;i++)a[i]=sc.nextInt();
Arrays.sort(a);
if(n==1){
... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class ProblemA {
private void solve() throws IOException {
Scanner stdin = new Scanner(new InputSt... | nlogn | 135_A. Replacement | CODEFORCES |
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
public class A{
public static void main(String[] args) throws Exception{
new A().run();
}
void run() throws Exception{
//Scanner sc = new Scanner(System.in);
BufferedReader sc = new BufferedReader(new InputStream... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
final String filename = new String("A").toLowerCase();
void solve() throws Exception {
int n = nextInt();
int[] a = new int[n];
int m = -1;
for (int i = 0; i < n; i++) {
a[i] = nextInt();
if (m == -1 || a[i] > a[m]) {
m = i;
}
}
if (a[... | nlogn | 135_A. Replacement | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.util.logging.Level;
import java.util.logging.Logger;
public class ProblemA {
private final BufferedReader in;
private... | nlogn | 135_A. Replacement | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String args[]) {
(new Main()).solve();
}
void solve() {
Scanner cin = new Scanner(System.in);
while( cin.hasNextInt() ) {
int n = cin.nextInt();
int arr[] = new int[n];
for(int i=0; i<n; ++i) {
arr[i] = cin... | nlogn | 135_A. Replacement | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.