Topcoder Single Round Match 591 Round 1 - Division II, Level One

// Topcoder Single Round Match 591 Round 1 - Division II, Level One

using System;
using System.Collections.Generic;
using System.Linq;

public class TheArithmeticProgression
{
    public double minimumChange ( int a, int b, int c )
    {
        double bb = ( a + c ) / 2.0;
        double aa = 2 * b - c;
        double cc = 2 * b - a;
        double ans = double.MaxValue;
        double r = Math.Abs ( bb - b );
        ans = Math.Min ( ans, r );
        r = Math.Abs ( aa - a );
        ans = Math.Min ( ans, r );
        r = Math.Abs ( cc - c );
        ans = Math.Min ( ans, r );
        return ans;
    }

    static void Main ( string[] args ) { }
}

Topcoder Single Round Match 590 Round 1 - Division II, Level One

// Topcoder Single Round Match 590 Round 1 - Division II, Level One

using System;
using System.Collections.Generic;
using System.Linq;

public class FoxAndGomoku
{
    public String win ( String[] board )
    {
        int cx = board[0].Length;
        int cy = board.Length;
        for ( int y = 0; y < cy; y++ )
        {
            for ( int x = 0; x < cx; x++ )
            {
                int cnt1=0;
                int cnt2=0;
                int cnt3=0;
                int cnt4=0;
                for ( int i = 0; i < 5; i++ )
                {
                    if ( ( y + i ) >= 0 && ( y + i ) < cy )
                        if ( board[y + i][x] == 'o' )
                            cnt1++;
                    if ( ( x + i ) >= 0 && ( x + i ) < cx )
                        if ( board[y][x + i] == 'o' )
                            cnt2++;
                    if ( ( ( x + i ) >= 0 && ( x + i ) < cx ) && ( ( y
+ i ) >= 0 && ( y + i ) < cy ) )
                        if ( board[y + i][x + i] == 'o' )
                            cnt3++;
                    if ( ( ( x - i ) >= 0 && ( x - i ) < cx ) && ( ( y
+ i ) >= 0 && ( y + i ) < cy ) )
                        if ( board[y + i][x - i] == 'o' )
                            cnt4++;
                }
                if ( cnt1 >= 5 || cnt2 >= 5 || cnt3 >= 5 || cnt4 >= 5 )
                    return "found";
            }
        }
        return "not found";
    }

    static void Main ( string[] args ) { }
}

Codeforces Round #209 (Div. 2) A Table

// Codeforces Round #209 (Div. 2) A Table
// Problem: http://codeforces.com/contest/359/problem/A

import java.io.*;
import java.math.*;
import java.util.*;

import org.omg.CORBA.Environment;

//Codeforces
public class MainCodeforces1 {
private static MyScanner in;
private static PrintStream out;
private static boolean LOCAL_TEST = false;

private static void solve() throws IOException
{
int n = in.nextInt();
int m = in.nextInt();
int ans = 4;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
int x = in.nextInt();
if (i == 0 && j == 0)
continue;
if (i == 0 && j == m - 1)
continue;
if (i == n - 1 && j == 0)
continue;
if (i == n - 1 && j == m - 1)
continue;
if (x == 1)
if (i == 0 || j == 0 || i == n - 1 || j == m - 1)
ans = 2;
}
}
out.println(ans);
}

public static void main(String[] args) throws IOException {
// helpers for input/output
out = System.out;
try {
String cname = System.getenv("COMPUTERNAME");
if (!cname.equals(""))
LOCAL_TEST = true;
} catch (Exception e) {
}
if (LOCAL_TEST) {
in = new MyScanner("E:\\zin.txt");
}
else {
boolean usingFileForIO = false;
if (usingFileForIO) {
// using input.txt and output.txt as I/O
in = new MyScanner("input.txt");
out = new PrintStream("output.txt");
}
else {
in = new MyScanner();
out = System.out;
}
}

solve();
}

// =====================================
static class MyScanner {
BufferedReader bufReader;
StringTokenizer strTok;

public MyScanner() throws IOException
{
bufReader = new BufferedReader(new InputStreamReader(System.in));
strTok = new StringTokenizer("");
}

public MyScanner(String inputFile) throws IOException {
bufReader = new BufferedReader(new InputStreamReader(
new FileInputStream(
inputFile)));
strTok = new StringTokenizer("");
}

String GetNextToken() throws IOException {
if (!strTok.hasMoreTokens())
strTok = new StringTokenizer(bufReader.readLine());
return strTok.nextToken();
}

public int nextInt() throws IOException {
return Integer.valueOf(GetNextToken());
}

public long nextLong() throws IOException {
return Long.valueOf(GetNextToken());
}

public double nextDouble() throws IOException {
return Double.valueOf(GetNextToken());
}

public String nextString() throws IOException {
return GetNextToken();
}

public String nextLine() throws IOException {
return bufReader.readLine();
}

public int countTokens() {
return strTok.countTokens();
}

public boolean hasMoreTokens() {
return strTok.hasMoreTokens();
}
}

}

Codeforces Round #208 (Div. 2) B Dima and Text Messages

// Codeforces Round #208 (Div. 2) B Dima and Text Messages
// Problem: http://codeforces.com/contest/358/problem/B

import java.io.*;
import java.math.*;
import java.util.*;

import org.omg.CORBA.Environment;

//Codeforces
public class MainCodeforces1 {
private static MyScanner in;
private static PrintStream out;
private static boolean LOCAL_TEST = false;

private static void solve() throws IOException
{
int n = in.nextInt();
String[] s = new String[n];
for (int i = 0; i < s.length; i++) {
s[i] = in.nextLine();
}
String msg = in.nextLine();
int pos = -1;
boolean failed = false;
for (int i = 0; i < s.length; i++) {
pos = msg.indexOf("<", pos + 1);
if (pos == -1) {
failed = true;
break;
}
pos = msg.indexOf("3", pos + 1);
if (pos == -1) {
failed = true;
break;
}
for (int j = 0; j < s[i].length(); j++) {
pos = msg.indexOf(s[i].charAt(j), pos + 1);
if (pos == -1) {
failed = true;
break;
}
}
if (pos == -1) {
failed = true;
break;
}
}
if (!failed) {
pos = msg.indexOf("<", pos + 1);
if (pos == -1) {
failed = true;
}
if (!failed) {
pos = msg.indexOf("3", pos + 1);
if (pos == -1) {
failed = true;
}
}
}
if (failed)
out.println("no");
else
out.println("yes");
}

public static void main(String[] args) throws IOException {
// helpers for input/output
out = System.out;
try {
String cname = System.getenv("COMPUTERNAME");
if (!cname.equals(""))
LOCAL_TEST = true;
} catch (Exception e) {
}
if (LOCAL_TEST) {
in = new MyScanner("E:\\zin.txt");
}
else {
boolean usingFileForIO = false;
if (usingFileForIO) {
// using input.txt and output.txt as I/O
in = new MyScanner("input.txt");
out = new PrintStream("output.txt");
}
else {
in = new MyScanner();
out = System.out;
}
}

solve();
}

// =====================================
static class MyScanner {
BufferedReader bufReader;
StringTokenizer strTok;

public MyScanner() throws IOException
{
bufReader = new BufferedReader(new InputStreamReader(System.in));
strTok = new StringTokenizer("");
}

public MyScanner(String inputFile) throws IOException {
bufReader = new BufferedReader(new InputStreamReader(
new FileInputStream(
inputFile)));
strTok = new StringTokenizer("");
}

String GetNextToken() throws IOException {
if (!strTok.hasMoreTokens())
strTok = new StringTokenizer(bufReader.readLine());
return strTok.nextToken();
}

public int nextInt() throws IOException {
return Integer.valueOf(GetNextToken());
}

public long nextLong() throws IOException {
return Long.valueOf(GetNextToken());
}

public double nextDouble() throws IOException {
return Double.valueOf(GetNextToken());
}

public String nextString() throws IOException {
return GetNextToken();
}

public String nextLine() throws IOException {
return bufReader.readLine();
}

public int countTokens() {
return strTok.countTokens();
}

public boolean hasMoreTokens() {
return strTok.hasMoreTokens();
}
}

}

Codeforces Round #208 (Div. 2) A Dima and Continuous Line

// Codeforces Round #208 (Div. 2) A Dima and Continuous Line
// Problems: http://codeforces.com/contest/358/problem/A

import java.io.*;
import java.math.*;
import java.util.*;

import org.omg.CORBA.Environment;

//Codeforces
public class MainCodeforces1 {
private static MyScanner in;
private static PrintStream out;
private static boolean LOCAL_TEST = false;

private static void solve() throws IOException
{
int n = in.nextInt();
int[] x = new int[n];
for (int i = 0; i < x.length; i++) {
x[i] = in.nextInt();
}
boolean intersect = false;
for (int i = 0; i < n - 1; i++) {
int iL = Math.min(x[i], x[i + 1]);
int iR = Math.max(x[i], x[i + 1]);
for (int j = 0; j < n - 1; j++) {
int jL = Math.min(x[j], x[j + 1]);
int jR = Math.max(x[j], x[j + 1]);
if (i == j)
continue;
if (jL > iL && jL < iR && jR > iR)
intersect = true;
if (jL < iL && jR > iL && jR < iR)
intersect = true;
if (intersect)
break;
}
if (intersect)
break;
}
if (intersect)
out.println("yes");
else
out.println("no");
}

public static void main(String[] args) throws IOException {
// helpers for input/output
out = System.out;
try {
String cname = System.getenv("COMPUTERNAME");
if (!cname.equals(""))
LOCAL_TEST = true;
} catch (Exception e) {
}
if (LOCAL_TEST) {
in = new MyScanner("E:\\zin.txt");
}
else {
boolean usingFileForIO = false;
if (usingFileForIO) {
// using input.txt and output.txt as I/O
in = new MyScanner("input.txt");
out = new PrintStream("output.txt");
}
else {
in = new MyScanner();
out = System.out;
}
}

solve();
}

// =====================================
static class MyScanner {
BufferedReader bufReader;
StringTokenizer strTok;

public MyScanner() throws IOException
{
bufReader = new BufferedReader(new InputStreamReader(System.in));
strTok = new StringTokenizer("");
}

public MyScanner(String inputFile) throws IOException {
bufReader = new BufferedReader(new InputStreamReader(
new FileInputStream(
inputFile)));
strTok = new StringTokenizer("");
}

String GetNextToken() throws IOException {
if (!strTok.hasMoreTokens())
strTok = new StringTokenizer(bufReader.readLine());
return strTok.nextToken();
}

public int nextInt() throws IOException {
return Integer.valueOf(GetNextToken());
}

public long nextLong() throws IOException {
return Long.valueOf(GetNextToken());
}

public double nextDouble() throws IOException {
return Double.valueOf(GetNextToken());
}

public String nextString() throws IOException {
return GetNextToken();
}

public String nextLine() throws IOException {
return bufReader.readLine();
}

public int countTokens() {
return strTok.countTokens();
}

public boolean hasMoreTokens() {
return strTok.hasMoreTokens();
}
}

}

TCO 2014 Round 1A Div 1 L2 EllysScrabble

// TCO 2014 Round 1A Div 1 L2 EllysScrabble

import java.util.*;
import java.math.*;

//rename the class name before submitting
public class EllysScrabble {
public static void main(String[] args) {
EllysScrabble obj = new EllysScrabble();
System.out.println(
obj.getMin(
"TOPCODER"
, 3
));
}

public String getMin(String letters, int maxDistance) {
char[] c = letters.toCharArray();
char[] dest = new char[c.length];
for (int i = 0; i < dest.length; i++) {
dest[i] = ' ';
}
boolean[] moved = new boolean[c.length];
for (int i = 0; i < c.length; i++) {
char minChar = c[i];
if (moved[i])
minChar = Character.MAX_VALUE;

int idxMinChar = i;
for (int j = maxDistance; j >= -maxDistance; j--) {
if (i + j < 0)
continue;
if (i + j >= c.length)
continue;
if (moved[i + j])
continue;
if (j == -maxDistance && !moved[i + j]) {
idxMinChar = i + j;
break;
}
char cj = c[i + j];
if (cj <= minChar || (cj == minChar && j < 0)) {
minChar = cj;
idxMinChar = i + j;
}
}
if (idxMinChar != i) {
dest[i] = c[idxMinChar];
moved[idxMinChar] = true;
}
else {
dest[i] = c[i];
moved[i] = true;
}
c[i] = c[i];
}

return new String(dest);
}
}

TCO 2014 Round 1A Div 1 L1 EllysSortingTrimmer

// TCO 2014 Round 1A Div 1 L1 EllysSortingTrimmer

import java.util.*;
import java.math.*;

//rename the class name before submitting
public class EllysSortingTrimmer {
public static void main(String[] args) {
EllysSortingTrimmer obj = new EllysSortingTrimmer();
System.out.println(
obj.getMin(
"TOPCODER"
, 3
));
}

public String getMin(String S, int L) {
while (true) {
String left = S.substring(0, S.length() - L);
String right = S.substring(S.length() - L);
char[] r = right.toCharArray();
Arrays.sort(r);
right = new String(r);
if (left.length() == 0)
return right;
else
S = left + right.substring(0, right.length() - 1);
}
}
}

Codeforces Round #207 (Div. 2) B Flag Day

// Codeforces Round #207 (Div. 2) B Flag Day
// Problem: http://codeforces.com/contest/357/problem/B

import java.io.*;
import java.math.*;
import java.util.*;

import org.omg.CORBA.Environment;

//Codeforces
public class MainCodeforces1 {
private static MyScanner in;
private static PrintStream out;
private static boolean LOCAL_TEST = false;

private static void solve() throws IOException
{
int n = in.nextInt();
int m = in.nextInt();
int[][] dance = new int[m][3];
for (int i = 0; i < m; i++) {
dance[i][0] = in.nextInt();
dance[i][1] = in.nextInt();
dance[i][2] = in.nextInt();
}
int[] color = new int[n + 1];
for (int i = 0; i < m; i++) {
int d1 = dance[i][0];
int d2 = dance[i][1];
int d3 = dance[i][2];
boolean[] colorused = new boolean[3];
for (int j = 0; j < 3; j++) {
colorused[j] = (color[d1] == j + 1 || color[d2] == j + 1 || color[d3] == j + 1);
}
for (int j = 0; j < 3; j++) {
if (color[dance[i][j]] == 0) {
for (int k = 0; k < 3; k++) {
if (!colorused[k]) {
color[dance[i][j]] = k + 1;
colorused[k] = true;
break;
}
}
}
}
}
StringBuilder sb = new StringBuilder();
for (int i = 1; i <= n; i++) {
if (i > 1)
sb.append(" ");
sb.append(color[i]);
}

out.println(sb);
}

public static void main(String[] args) throws IOException {
// helpers for input/output
out = System.out;
try {
String cname = System.getenv("COMPUTERNAME");
if (!cname.equals(""))
LOCAL_TEST = true;
} catch (Exception e) {
}
if (LOCAL_TEST) {
in = new MyScanner("E:\\zin.txt");
}
else {
boolean usingFileForIO = false;
if (usingFileForIO) {
// using input.txt and output.txt as I/O
in = new MyScanner("input.txt");
out = new PrintStream("output.txt");
}
else {
in = new MyScanner();
out = System.out;
}
}

solve();
}

// =====================================
static class MyScanner {
BufferedReader bufReader;
StringTokenizer strTok;

public MyScanner() throws IOException
{
bufReader = new BufferedReader(new InputStreamReader(System.in));
strTok = new StringTokenizer("");
}

public MyScanner(String inputFile) throws IOException {
bufReader = new BufferedReader(new InputStreamReader(
new FileInputStream(
inputFile)));
strTok = new StringTokenizer("");
}

String GetNextToken() throws IOException {
if (!strTok.hasMoreTokens())
strTok = new StringTokenizer(bufReader.readLine());
return strTok.nextToken();
}

public int nextInt() throws IOException {
return Integer.valueOf(GetNextToken());
}

public long nextLong() throws IOException {
return Long.valueOf(GetNextToken());
}

public double nextDouble() throws IOException {
return Double.valueOf(GetNextToken());
}

public String nextString() throws IOException {
return GetNextToken();
}

public String nextLine() throws IOException {
return bufReader.readLine();
}

public int countTokens() {
return strTok.countTokens();
}

public boolean hasMoreTokens() {
return strTok.hasMoreTokens();
}
}

}

Codeforces Round #207 (Div. 2) A Group of Students

// Codeforces Round #207 (Div. 2) A Group of Students
// Problem: http://codeforces.com/contest/357/problem/A

import java.io.*;
import java.math.*;
import java.util.*;

import org.omg.CORBA.Environment;

//Codeforces
public class MainCodeforces1 {
 private static MyScanner in;
 private static PrintStream out;
 private static boolean LOCAL_TEST = false;

 private static void solve() throws IOException
 {
  int m = in.nextInt();
  int[] c = new int[m + 1];
  int[] cum = new int[m + 1];
  int total = 0;
  for (int i = 1; i <= m; i++) {
   c[i] = in.nextInt();
   total += c[i];
   cum[i] = total;
  }
  int x = in.nextInt();
  int y = in.nextInt();
  for (int k = 2; k <= m; k++) {
   int lessThanK = cum[k - 1];
   int kOrHigher = total - lessThanK;
   if (lessThanK >= x && lessThanK <= y &&
     kOrHigher >= x && kOrHigher <= y) {
    out.println(k);
    return;
   }
  }
  out.println(0);
 }

 public static void main(String[] args) throws IOException {
  // helpers for input/output
  out = System.out;
  try {
   String cname = System.getenv("COMPUTERNAME");
   if (!cname.equals(""))
    LOCAL_TEST = true;
  } catch (Exception e) {
  }
  if (LOCAL_TEST) {
   in = new MyScanner("E:\\zin.txt");
  }
  else {
   boolean usingFileForIO = false;
   if (usingFileForIO) {
    // using input.txt and output.txt as I/O
    in = new MyScanner("input.txt");
    out = new PrintStream("output.txt");
   }
   else {
    in = new MyScanner();
    out = System.out;
   }
  }

  solve();
 }

 // =====================================
 static class MyScanner {
  BufferedReader bufReader;
  StringTokenizer strTok;

  public MyScanner() throws IOException
  {
   bufReader = new BufferedReader(new InputStreamReader(System.in));
   strTok = new StringTokenizer("");
  }

  public MyScanner(String inputFile) throws IOException {
   bufReader = new BufferedReader(new InputStreamReader(
     new FileInputStream(
       inputFile)));
   strTok = new StringTokenizer("");
  }

  String GetNextToken() throws IOException {
   if (!strTok.hasMoreTokens())
    strTok = new StringTokenizer(bufReader.readLine());
   return strTok.nextToken();
  }

  public int nextInt() throws IOException {
   return Integer.valueOf(GetNextToken());
  }

  public long nextLong() throws IOException {
   return Long.valueOf(GetNextToken());
  }

  public double nextDouble() throws IOException {
   return Double.valueOf(GetNextToken());
  }

  public String nextString() throws IOException {
   return GetNextToken();
  }

  public String nextLine() throws IOException {
   return bufReader.readLine();
  }

  public int countTokens() {
   return strTok.countTokens();
  }

  public boolean hasMoreTokens() {
   return strTok.hasMoreTokens();
  }
 }

}

Codeforces Round #206 (Div. 2) A Vasya and Digital Root

// Codeforces Round #206 (Div. 2) A Vasya and Digital Root
// Problem: http://codeforces.com/contest/355/problem/A

import java.io.*;
import java.math.*;
import java.util.*;

import org.omg.CORBA.Environment;

//Codeforces
public class MainCodeforces1 {
private static MyScanner in;
private static PrintStream out;
private static boolean LOCAL_TEST = false;

private static void solve() throws IOException
{
int k = in.nextInt();
int d = in.nextInt();
if (k == 1)
out.println(d);
else {
if (d == 0)
out.println("No solution");
else {
StringBuilder sb = new StringBuilder();
sb.append("1");
for (int i = 1; i < k - 1; i++) {
sb.append("0");
}
sb.append((d - 1));
out.println(sb);
}
}
}

public static void main(String[] args) throws IOException {
// helpers for input/output
out = System.out;
try {
String cname = System.getenv("COMPUTERNAME");
if (!cname.equals(""))
LOCAL_TEST = true;
} catch (Exception e) {
}
if (LOCAL_TEST) {
in = new MyScanner("E:\\zin.txt");
}
else {
boolean usingFileForIO = false;
if (usingFileForIO) {
// using input.txt and output.txt as I/O
in = new MyScanner("input.txt");
out = new PrintStream("output.txt");
}
else {
in = new MyScanner();
out = System.out;
}
}

solve();
}

// =====================================
static class MyScanner {
BufferedReader bufReader;
StringTokenizer strTok;

public MyScanner() throws IOException
{
bufReader = new BufferedReader(new InputStreamReader(System.in));
strTok = new StringTokenizer("");
}

public MyScanner(String inputFile) throws IOException {
bufReader = new BufferedReader(new InputStreamReader(
new FileInputStream(
inputFile)));
strTok = new StringTokenizer("");
}

String GetNextToken() throws IOException {
if (!strTok.hasMoreTokens())
strTok = new StringTokenizer(bufReader.readLine());
return strTok.nextToken();
}

public int nextInt() throws IOException {
return Integer.valueOf(GetNextToken());
}

public long nextLong() throws IOException {
return Long.valueOf(GetNextToken());
}

public double nextDouble() throws IOException {
return Double.valueOf(GetNextToken());
}

public String nextString() throws IOException {
return GetNextToken();
}

public String nextLine() throws IOException {
return bufReader.readLine();
}

public int countTokens() {
return strTok.countTokens();
}

public boolean hasMoreTokens() {
return strTok.hasMoreTokens();
}
}

}