using System;

class Program {
    static void Main() {
        int n = int.Parse(Console.ReadLine());
        string[] move = new string[n];
        for(int i = 0; i < n; i++) {
            move[i] = Console.ReadLine();
        }

        for(int i = 0; i < n; i++) {
            if(move[i][0] >= 'c' && move[i][0] <= 'f' &&
                move[i][1] >= '3' && move[i][1] <= '6') {
                Console.WriteLine(8);
            }
            else if(((move[i][0] == 'b' || move[i][0] == 'g') && move[i][1] >= '3' && move[i][1] <= '6') ||
                ((move[i][1] == '2' || move[i][1] == '7') && move[i][0] >= 'c' && move[i][0] <= 'f')) {
                Console.WriteLine(6);
            }
            else if(move[i] == "a1" || move[i] == "a8" || move[i] == "h8" || move[i] == "h1") {
                Console.WriteLine(2);
            }
            else if((move[i][0] == 'a' && (move[i][1] == '2' || move[i][1] == '7')) ||
                (move[i][0] == 'b' && (move[i][1] == '1' || move[i][1] == '8')) ||
                (move[i][0] == 'g' && (move[i][1] == '1' || move[i][1] == '8')) ||
                (move[i][0] == 'h' && (move[i][1] == '2' || move[i][1] == '7'))) {
                Console.WriteLine(3);
            }
            else
                Console.WriteLine(4);
        }
    }
}

Autors! you are wrong. fix please.

Hello guys,

I've just started learning algorithms and I've read a piece from R. Sedgewick's book on Algorithms about Union Find.

I'd love to practice it. Could anyone recommend any problems here? Thanks.

Can anybody give me test 8?
Code on python2:
a, b = map(int, raw_input().split(' '))
k = 0
c = map(int, raw_input().split(' '))
for x in xrange(1,10):
    k = k+c[x]*20
if b-k>a:
    print('No chance.')
elif b-k<a:
    print('Dirty debug :(')
elif b-k==a:
    print('No chance.')

next_permutation() generates distinct permutations of a given iterable object (vector, string, etc). Just make 6 permutations, and save each of them in a set<vector<int> >. Finally, check if the size of the set is 6, because the set only saves different elements. Pretty easy solution.

I’ve made a Google Chrome extension that allows you to follow anyone on Timus. To add a user to your friend ranklist, click on the star icon next to their name. Friending is not mutual.

Chrome Web Store:
http://chrome.google.com/webstore/detail/timus-friends/fnldfcnfdacapllemlcdmmlijnpbcoal

Codeforces announcement:
http://codeforces.com/blog/entry/22699

Source code:
http://github.com/slava-sh/timus-friends

Edited by author 15.01.2016 02:14

Here is my code. What is wrong? Help, please!

var m,n:int64;
k,i:0..20;
a:array[1..20] of int64;

begin
  read(n,k);
  for i:=1 to k do
  read(a[i]);
  for i:=2 to k do
  if a[i]<a[i-1] then
  begin
      m:=a[i];
      a[i]:=a[i-1];
      a[i-1]:=m
  end;
  m:=n-(n-a[1])-(n-a[2]);
  if m<=0 then write(0) else write(m);
end.

Edited by author 02.11.2013 04:21

#include <iostream>
using namespace std;
int main()
{
int a[3],b[3];
for (int i = 0;i<3;i++)
{cin>>a[i]>>b[i];
}
cout<<a[0]-a[2]<<b[0]-b[1];
return 0;
}

i can not submit my solution by java

What is wrong?
import java.util.*;

public class Main {
    public static void main(String[] args){
        int a,b = 0;

        Scanner in = new Scanner(System.in);

        System.out.println("First num");
        a = in.nextInt();
        if(a==1){
        System.out.println("Second num");
        b = in.nextInt();}
        if(b==5){
        System.out.println(a+b);
        }
    }
}

good problem!

Isn't Test#5 the n=500 one?

n = 2

Try this:

0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 6 0 0 0 0 0
0 0 0 0 0 0 0 0
-3 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
1
White
c6-d7

Incorrect

0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 6 0 0 0 0 0
0 0 0 0 0 0 0 0
-3 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0

here my code ...

http://pastebin.com/XamajYub

 use cin.eof() to judge the end of input and get WA 3;
 scanf get AC
 and while(cin >> a) may case Time Out

#include<iostream>
#include<math.h>

int main()
{
 using namespace std;
 int i;
 float r,a[128*64];
 unsigned long long n,j,k;
 for(i=0;i<n;i++)
  cin>>a[i];
 j=n-1;
 for(k=j;k>=0;k--)
 {
  r=sqrt(a[k]);
  cout<<r<<"\n";
 }
 return 0;
}

Time Limit so small. Solution with O(n * m) complexity passed tests with time 3.244s.

http://acm.timus.ru/status.aspx?space=1&num=1369&author=124588

Edited by author 10.01.2016 23:58

input:
7
1 1000
2 500
501 999
3 499
502 800
4 400
503 700
output:
4
6 4 2 1
or
4
7 5 3 1