Physical Address

304 North Cardinal St.
Dorchester Center, MA 02124

A puzzle game CodeChef Solution

Problem -A puzzle game CodeChef Solution

This website is dedicated for CodeChef solution where we will publish right solution of all your favourite CodeChef problems along with detailed explanatory of different competitive programming concepts and languages.

A puzzle game CodeChef Solution in C++14

#include <bits/stdc++.h>

#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")//Comment optimisations for interactive problems (use endl)
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")

using namespace std;

struct PairHash {inline std::size_t operator()(const std::pair<int, int> &v) const { return v.first * 31 + v.second; }};

// speed
#define Code ios_base::sync_with_stdio(false);
#define By ios::sync_with_stdio(0);
#define Sumfi cout.tie(NULL);

// alias
using ll = long long;
using ld = long double;
using ull = unsigned long long;

// constants
const ld PI = 3.14159265358979323846;  /* pi */
const ll INF = 1e18;
const ld EPS = 1e-9;
const ll MAX_N = 202020;
const ll mod = 1e9 + 7;

// typedef
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef array<ll,3> all3;
typedef array<ll,5> all5;
typedef vector<all3> vall3;
typedef vector<all5> vall5;
typedef vector<ld> vld;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<int> vi;
typedef deque<ll> dqll;
typedef deque<pll> dqpll;
typedef pair<string, string> pss;
typedef vector<pss> vpss;
typedef vector<string> vs;
typedef vector<vs> vvs;
typedef unordered_set<ll> usll;
typedef unordered_set<pll, PairHash> uspll;
typedef unordered_map<ll, ll> umll;
typedef unordered_map<pll, ll, PairHash> umpll;

// macros
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,m,n) for(ll i=n;i>=m;i--)
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define INF(a) memset(a,0x3f3f3f3f3f3f3f3fLL,sizeof(a))
#define ASCEND(a) iota(all(a),0)
#define sz(x) ll((x).size())
#define BIT(a,i) (a & (1ll<<i))
#define BITSHIFT(a,i,n) (((a<<i) & ((1ll<<n) - 1)) | (a>>(n-i)))
#define pyes cout<<"Yes\n";
#define pno cout<<"No\n";
#define endl "\n"
#define pneg1 cout<<"-1\n";
#define ppossible cout<<"Possible\n";
#define pimpossible cout<<"Impossible\n";
#define TC(x) cout<<"Case #"<<x<<": ";
#define X first
#define Y second

// utility functions
template <typename T>
void print(T &&t)  { cout << t << "\n"; }
template<typename T>
void printv(vector<T>v){ll n=v.size();rep(i,0,n){cout<<v[i];if(i+1!=n)cout<<' ';}cout<<endl;}
template<typename T>
void printvln(vector<T>v){ll n=v.size();rep(i,0,n)cout<<v[i]<<endl;}
void fileIO(string in = "input.txt", string out = "output.txt") {freopen(in.c_str(),"r",stdin); freopen(out.c_str(),"w",stdout);}
void readf() {freopen("", "rt", stdin);}
template<typename T>
void readv(vector<T>& v){rep(i,0,sz(v)) cin>>v[i];}
template<typename T, typename U>
void readp(pair<T,U>& A) {cin>>A.first>>A.second;}
template<typename T, typename U>
void readvp(vector<pair<T,U>>& A) {rep(i,0,sz(A)) readp(A[i]); }
void readvall3(vall3& A) {rep(i,0,sz(A)) cin>>A[i][0]>>A[i][1]>>A[i][2];}
void readvall5(vall5& A) {rep(i,0,sz(A)) cin>>A[i][0]>>A[i][1]>>A[i][2]>>A[i][3]>>A[i][4];}
void readvvll(vvll& A) {rep(i,0,sz(A)) readv(A[i]);}

struct Combination {
    vll fac, inv;
    ll n, MOD;

    ll modpow(ll n, ll x, ll MOD = mod) { if(!x) return 1; ll res = modpow(n,x>>1,MOD); res = (res * res) % MOD; if(x&1) res = (res * n) % MOD; return res; }

    Combination(ll _n, ll MOD = mod): n(_n + 1), MOD(MOD) {
        inv = fac = vll(n,1);
        rep(i,1,n) fac[i] = fac[i-1] * i % MOD;
        inv[n - 1] = modpow(fac[n - 1], MOD - 2, MOD);
        rrep(i,1,n - 2) inv[i] = inv[i + 1] * (i + 1) % MOD;
    }

    ll fact(ll n) {return fac[n];}
    ll nCr(ll n, ll r) {
        if(n < r or n < 0 or r < 0) return 0;
        return fac[n] * inv[r] % MOD * inv[n-r] % MOD;
    }
};

struct Matrix {
    ll r,c;
    vvll matrix;
    Matrix(ll r, ll c, ll v = 0): r(r), c(c), matrix(vvll(r,vll(c,v))) {}

    Matrix operator*(const Matrix& B) const {
        Matrix res(r, B.c);
        rep(i,0,r) rep(j,0,B.c) rep(k,0,B.r) {
                    res.matrix[i][j] = (res.matrix[i][j] + matrix[i][k] * B.matrix[k][j] % mod) % mod;
                }
        return res;
    }

    Matrix copy() {
        Matrix copy(r,c);
        copy.matrix = matrix;
        return copy;
    }

    Matrix pow(ll n) {
        assert(r == c);
        Matrix res(r,r);
        Matrix now = copy();
        rep(i,0,r) res.matrix[i][i] = 1;
        while(n) {
            if(n & 1) res = res * now;
            now = now * now;
            n /= 2;
        }
        return res;
    }
};

// geometry data structures
template <typename T>
struct Point {
    T y,x;
    Point(T y, T x) : y(y), x(x) {}
    Point(pair<T,T> p) : y(p.first), x(p.second) {}
    Point() {}
    void input() {cin>>y>>x;}
    friend ostream& operator<<(ostream& os, const Point<T>& p) { os<<p.y<<' '<<p.x<<'\n'; return os;}
    Point<T> operator+(Point<T>& p) {return Point<T>(y + p.y, x + p.x);}
    Point<T> operator-(Point<T>& p) {return Point<T>(y - p.y, x - p.x);}
    Point<T> operator*(ll n) {return Point<T>(y*n,x*n); }
    Point<T> operator/(ll n) {return Point<T>(y/n,x/n); }
    bool operator<(const Point &other) const {if (x == other.x) return y < other.y;return x < other.x;}
    Point<T> rotate(Point<T> center, ld angle) {
        ld si = sin(angle * PI / 180.), co = cos(angle * PI / 180.);
        ld y = this->y - center.y;
        ld x = this->x - center.x;

        return Point<T>(y * co - x * si + center.y, y * si + x * co + center.x);
    }
    ld distance(Point<T> other) {
        T dy = abs(this->y - other.y);
        T dx = abs(this->x - other.x);
        return sqrt(dy * dy + dx * dx);
    }

    T norm() { return x * x + y * y; }
};

template<typename T>
struct Line {
    Point<T> A, B;
    Line(Point<T> A, Point<T> B) : A(A), B(B) {}
    Line() {}

    void input() {
        A = Point<T>();
        B = Point<T>();
        A.input();
        B.input();
    }

    T ccw(Point<T> &a, Point<T> &b, Point<T> &c) {
        T res = a.x * b.y + b.x * c.y + c.x * a.y;
        res -= (a.x * c.y + b.x * a.y + c.x * b.y);
        return res;
    }

    bool isIntersect(Line<T> o) {
        T p1p2 = ccw(A,B,o.A) * ccw(A,B,o.B);
        T p3p4 = ccw(o.A,o.B,A) * ccw(o.A,o.B,B);
        if (p1p2 == 0 && p3p4 == 0) {
            pair<T,T> p1(A.y, A.x), p2(B.y,B.x), p3(o.A.y, o.A.x), p4(o.B.y, o.B.x);
            if (p1 > p2) swap(p2, p1);
            if (p3 > p4) swap(p3, p4);
            return p3 <= p2 && p1 <= p4;
        }
        return p1p2 <= 0 && p3p4 <= 0;
    }

    pair<bool,Point<ld>> intersection(Line<T> o) {
        if(!this->intersection(o)) return {false, {}};
        ld det = 1. * (o.B.y-o.A.y)*(B.x-A.x) - 1.*(o.B.x-o.A.x)*(B.y-A.y);
        ld t = ((o.B.x-o.A.x)*(A.y-o.A.y) - (o.B.y-o.A.y)*(A.x-o.A.x)) / det;
        return {true, {A.y + 1. * t * (B.y - A.y), B.x + 1. * t * (B.x - A.x)}};
    }

    //@formula for : y = ax + b
    //@return {a,b};
    pair<ld, ld> formula() {
        T y1 = A.y, y2 = B.y;
        T x1 = A.x, x2 = B.x;
        if(y1 == y2) return {1e9, 0};
        if(x1 == x2) return {0, 1e9};
        ld a = 1. * (y2 - y1) / (x2 - x1);
        ld b = -x1 * a + y1;
        return {a, b};
    }
};

template<typename T>
struct Circle {
    Point<T> center;
    T radius;
    Circle(T y, T x, T radius) : center(Point<T>(y,x)), radius(radius) {}
    Circle(Point<T> center, T radius) : center(center), radius(radius) {}
    Circle() {}

    void input() {
        center = Point<T>();
        center.input();
        cin>>radius;
    }

    bool circumference(Point<T> p) {
        return (center.x - p.x) * (center.x - p.x) + (center.y - p.y) * (center.y - p.y) == radius * radius;
    }

    bool intersect(Circle<T> c) {
        T d = (center.x - c.center.x) * (center.x - c.center.x) + (center.y - c.center.y) * (center.y - c.center.y);
        return (radius - c.radius) * (radius - c.radius) <= d and d <= (radius + c.radius) * (radius + c.radius);
    }

    bool include(Circle<T> c) {
        T d = (center.x - c.center.x) * (center.x - c.center.x) + (center.y - c.center.y) * (center.y - c.center.y);
        return d <= radius * radius;
    }
};

ll __gcd(ll x, ll y) { return !y ? x : __gcd(y, x % y); }
all3 __exgcd(ll x, ll y) { if(!y) return {x,1,0}; auto [g,x1,y1] = __exgcd(y, x % y); return {g, y1, x1 - (x/y) * y1}; }
ll __lcm(ll x, ll y) { return x / __gcd(x,y) * y; }
ll modpow(ll n, ll x, ll MOD = mod) { n%=MOD; if(!x) return 1; ll res = modpow(n,x>>1,MOD); res = (res * res) % MOD; if(x&1) res = (res * n) % MOD; return res; }

unordered_map<string, ll> dp;

usll prime{2,3,5,7,11,13,17,19};

ll dy[2]{1,0}, dx[2]{0,1};

ll helper(string now) {
    if(dp.count(now)) return dp[now];
    ll& res = dp[now] = INF;
    rep(i,0,3) rep(j,0,3) {
        rep(k,0,2) {
            ll ny = i + dy[k], nx = j + dx[k];
            if(0 <= ny and ny < 3 and 0 <= nx and nx < 3 and prime.count(now[i * 3 + j] - '0' + now[ny * 3 + nx] - '0')) {
                swap(now[i * 3 + j], now[ny * 3 + nx]);
                res = min(res, 1 + helper(now));
                swap(now[i * 3 + j], now[ny * 3 + nx]);
            }
        }
    }
    return res;
}

void init() {
    dp["123456789"] = 0;
    queue<string> q;
    q.push("123456789");
    while(sz(q)) {
        string now = q.front(); q.pop();
        ll v = dp[now];
        rep(i,0,3) rep(j,0,3) {
                rep(k,0,2) {
                    ll ny = i + dy[k], nx = j + dx[k];
                    if(0 <= ny and ny < 3 and 0 <= nx and nx < 3 and prime.count(now[i * 3 + j] - '0' + now[ny * 3 + nx] - '0')) {
                        swap(now[i * 3 + j], now[ny * 3 + nx]);
                        if(!dp.count(now)) {
                            dp[now] = v + 1;
                            q.push(now);
                        }
                        swap(now[i * 3 + j], now[ny * 3 + nx]);
                    }
                }
            }
    }
}

ll solve(vvll A) {
    dp["123456789"] = 0;
    string now = "";
    rep(i,0,3) rep(j,0,3) now.push_back(A[i][j] + '0');
    return dp.count(now) ? dp[now] : -1;
}

int main() {
    Code By Sumfi
    cout.precision(12);
    ll tc = 1;
    init();
    cin>>tc;
    rep(i,1,tc+1) {
        vvll A(3,vll(3));
        readvvll(A);
        print(solve(A));
    }
    return 0;
}

A puzzle game CodeChef Solution in PYTH 3

# cook your dish here
# cook your dish here
prime = [2,3,5,7,11,13,17]
edges = [(0,3), (0,1), (1,2), (1,4), (2,5), (3,4), (3,6), (4,5), (4,7), (5,8), (6,7), (7,8)]

x = (1, 2, 3, 4, 5, 6, 7, 8, 9)

avail = {x: 0}
queue = [x]
while queue:
    current = queue.pop(0)
    for e in edges:
        if current[e[0]] + current[e[1]] in prime:
            nxt = list(current)
            nxt[e[0]], nxt[e[1]] = nxt[e[1]], nxt[e[0]]
            nxt = tuple(nxt)
            if nxt not in avail:
                avail[nxt] = avail[current] + 1 
                queue.append(nxt)

for _ in range(int(input())):
    input()
    grid = ()
    for i in range(3):
        grid += tuple(map(int, input().split()))
    print(avail[grid] if grid in avail else -1)

A puzzle game CodeChef Solution in C

#include<stdio.h>
int front, rear;
int q[362880/2];
char dis[98765432];
int curr_s;
int board[3*3];
int isprime(int x)
{
    if(x==2||x==3||x==5||x==7||x==11||x==13||x==17)
    return 1;
    return 0;
}
int pow(int n)
{
    int ans=1;
    for(int i=0;i<n;i++)
    {
        ans*=10;
    }
    return ans;
}
void swap(int i, int j)
{ int d = board[j]-board[i];
    int ns = curr_s + d*pow(8-i) -d*pow(8-j);
    if(dis[ns/10]==0)
    {
        dis[ns/10] = dis[curr_s/10]+1;
        q[rear++] = ns;
    }
}
void create_all_states()
{
    int i;
    int s;
    front = 0;
    while(front<rear)
      while(front<rear)
    {
        s = curr_s = q[front];
        for(int i=8;i>=0;i--)
        {
            board[i]=s%10;
            s = s/10;
        }
        if(isprime(board[0]+board[1])) swap(0,1);
        if(isprime(board[0]+board[3])) swap(0,3);
        if(isprime(board[1]+board[2])) swap(1,2);
        if(isprime(board[1]+board[4])) swap(1,4);
        if(isprime(board[2]+board[5])) swap(2,5);
        if(isprime(board[3]+board[4])) swap(3,4);
        if(isprime(board[3]+board[6])) swap(3,6);
        if(isprime(board[4]+board[5])) swap(4,5);
        if(isprime(board[4]+board[7])) swap(4,7);
        if(isprime(board[5]+board[8])) swap(5,8);
        if(isprime(board[6]+board[7])) swap(6,7);
        if(isprime(board[7]+board[8])) swap(7,8);
        front++;
    }
}
int main() 
{
    rear=0;
    q[rear] = 123456789;
    rear++;
    dis[12345678]=1;
    create_all_states();
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int state = 0;
        for(int i=0;i<9;i++)
        {
            int temp;
                        scanf("%d",&temp);
            state = state*10 + temp;
        }
        printf("%d\n", dis[state/10]-1);
    }
}

A puzzle game CodeChef Solution in JAVA

import java.util.HashMap;
import java.util.LinkedList;
import java.util.Map;
import java.util.Queue;
import java.util.Scanner;

public class Main {
	static final int SIZE = 3;
	static final String TARGET_STATE = "123456789";
	static final int[] R_OFFSET = { 0, 1 };
	static final int[] C_OFFSET = { 1, 0 };

	static Map<String, Integer> stateToStep = buildStateToStep();

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int t = sc.nextInt();
		for (int tc = 0; tc < t; tc++) {
			int[][] board = new int[SIZE][SIZE];
			for (int r = 0; r < SIZE; r++) {
				for (int c = 0; c < SIZE; c++) {
					board[r][c] = sc.nextInt();
				}
			}

			System.out.println(solve(board));
		}

		sc.close();
	}

	static Map<String, Integer> buildStateToStep() {
		Map<String, Integer> stateToStep = new HashMap<>();
		stateToStep.put(TARGET_STATE, 0);
		Queue<String> queue = new LinkedList<>();
		queue.offer(TARGET_STATE);

		while (!queue.isEmpty()) {
			String state = queue.poll();
			int[][] board = decode(state);

			for (int r = 0; r < SIZE; r++) {
				for (int c = 0; c < SIZE; c++) {
					for (int i = 0; i < R_OFFSET.length; i++) {
						int nextR = r + R_OFFSET[i];
						int nextC = c + C_OFFSET[i];

						if (nextR < SIZE && nextC < SIZE && isPrime(board[r][c] + board[nextR][nextC])) {
							swap(board, r, c, nextR, nextC);

							String nextState = encode(board);
							if (!stateToStep.containsKey(nextState)) {
								stateToStep.put(nextState, stateToStep.get(state) + 1);
								queue.offer(nextState);
							}

							swap(board, r, c, nextR, nextC);
						}
					}
				}
			}
		}

		return stateToStep;
	}

	static boolean isPrime(int n) {
		if (n < 2) {
			return false;
		}

		for (int i = 2; i * i <= n; i++) {
			if (n % i == 0) {
				return false;
			}
		}
		return true;
	}

	static void swap(int[][] board, int r1, int c1, int r2, int c2) {
		int temp = board[r1][c1];
		board[r1][c1] = board[r2][c2];
		board[r2][c2] = temp;
	}

	static String encode(int[][] board) {
		StringBuilder state = new StringBuilder();
		for (int r = 0; r < SIZE; r++) {
			for (int c = 0; c < SIZE; c++) {
				state.append(board[r][c]);
			}
		}
		return state.toString();
	}

	static int[][] decode(String state) {
		int[][] board = new int[SIZE][SIZE];
		for (int r = 0; r < SIZE; r++) {
			for (int c = 0; c < SIZE; c++) {
				board[r][c] = state.charAt(r * SIZE + c) - '0';
			}
		}
		return board;
	}

	static int solve(int[][] board) {
		return stateToStep.getOrDefault(encode(board), -1);
	}
}

A puzzle game CodeChef Solution in PYPY 3

from math import *
import sys
def input():
     return sys.stdin.readline().replace('\n','').strip()
sys.setrecursionlimit(10**9)
intf = 10**20
pr = [3,5,7,11,13,17,19]
ind = [(0,1),(1,2),(3,4),(4,5),(6,7),(7,8),(0,3),(3,6),(1,4),(4,7),(2,5),(5,8)]
queue = [[1,2,3,4,5,6,7,8,9]]
memo={}
memo[(1,2,3,4,5,6,7,8,9)]=0
while len(queue)>0:
    el=queue.pop(0)
    cur_l=el
    for a,b in ind:
        if cur_l[a] + cur_l[b] in pr:
            l1 = list(cur_l)
            l1[a],l1[b]=l1[b],l1[a]
            if tuple(l1) not in memo:
                queue.append(l1)
                memo[tuple(l1)]=memo[tuple(cur_l)]+1
                
for i in range(int(input())):
    input()
    l=[int(i) for i  in (input()+" "+input()+" "+input()).split()]
    if tuple(l) in memo:
        print(memo[tuple(l)])
    else:
        print(-1)

A puzzle game CodeChef Solution in PYTH

from collections import defaultdict
D = defaultdict(int)
L = []
L.append([1,2,3,4,5,6,7,8,9,0])
MX = 1
S = set()
Z = 123456789
S.add(Z)
SW = [[0,1],[0,3],[1,2],[1,4],[2,5],[3,4],[3,6],[4,5],[4,7],[5,8],[6,7],[7,8]]
PR = [3,5,7,11,13,17]
p = 0
while p < MX:
	R = L[p]
	for sw in SW:
		x = sw[0]
		y = sw[1]
		if R[x]+R[y] in PR:
			NL = list(R)
			NL[x],NL[y] = NL[y],NL[x]
			v = 0
			for x in range(9):
				v = 10*v + NL[x]
			# endfor x
			if not (v in S):
				S.add(v)
				D[v] = MX
				MX += 1
				NL[9] += 1
				L.append(list(NL))
			# endif
		# endif
	# next sw
	p += 1
# endwhile
t = int(raw_input())
for i in xrange(t):
	st = raw_input()
	v = 0
	for k in range(3):
		st = raw_input()
		for z in st.strip().split(" "):
			v = 10*v + int(z)
		# endfor z
	# endfor k
	p = D[v]
	if p == 0:
		if v == Z:
			print '0'
		else:
			print '-1'
		# endif
	else:
		print L[p][9]
	# endif
# endfor i

A puzzle game CodeChef Solution in C#

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

namespace ConsoleApplication
{
    public class Program
    {
        public static int Main(string[] args)
        {
            var returnCode = 0;
            var testCasesCount = GetNextIntegerLine();
            for (var i = 0; i < testCasesCount; i++)
            {
                HandleTestCase();
                if (i < testCasesCount - 1)
                {
                    Console.Write("\n");
                }
            }
            return returnCode;
        }

        public static int[] GetArrayFromConsole()
        {
            Console.ReadLine();
            var inputs = string.Join(" ", new[] { ReadLine(), ReadLine(), ReadLine() })
                               .Split(' ')
                               .Select(int.Parse)
                               .ToArray();
            return inputs;
        }
        private static Dictionary<int, int> _results = new Dictionary<int, int>
        {
            {987654321, 0}
        };

        private static void HandleTestCase()
        {
            var queue = new Queue<int[]>();
            queue.Enqueue(new[]{1,2,3,4,5,6,7,8,9});
            while (queue.Any())
            {
                var currentInputs = queue.Dequeue();
                var possibleMovements = GetPossibleMovement(currentInputs);
                var currentSignature = GetSignature(currentInputs);
                var movementCount = _results[currentSignature];

                foreach (var possibleMovement in possibleMovements)
                {
                    var signature = GetSignature(possibleMovement);
                    var previousMovementCount = 0;
                    if (!_results.TryGetValue(signature, out previousMovementCount))
                    {
                        _results.Add(signature, movementCount + 1);
                        queue.Enqueue(possibleMovement);
                    }
                    else if (previousMovementCount > movementCount + 1)
                    {
                        _results[signature] = movementCount + 1;
                    }
                }
            }

            var inputs = GetArrayFromConsole();
            int result = 0;
            if (_results.TryGetValue(GetSignature(inputs), out result))
            {
                Console.Write(result.ToString());
            }
            else
            {
                Console.Write("-1");
            }
        }

        public static IEnumerable<int[]> GetPossibleMovement(int[] currentInputs)
        {
            int currentIndex = 0;

            for (var i = 0; i < 3; i++)
            {
                for (var j = 0; j < 3; j++)
                {
                    currentIndex = i + j * 3;

                    if (i < 2 && IsPrime(currentInputs[currentIndex] + currentInputs[currentIndex + 1]))
                    {
                        var testedMovement = (int[])currentInputs.Clone();
                        Swap(ref testedMovement[currentIndex], ref testedMovement[currentIndex + 1]);
                        yield return testedMovement;
                    }

                    if (j < 2 && IsPrime(currentInputs[currentIndex] + currentInputs[currentIndex + 3]))
                    {
                        var testedMovement = (int[])currentInputs.Clone();
                        Swap(ref testedMovement[currentIndex], ref testedMovement[currentIndex + 3]);
                        yield return testedMovement;
                    }
                }
            }
        }

        static int[] _primes = new[] { 2, 3, 5, 7, 11, 13, 17, 19 };
        public static bool IsPrime(int number) => _primes.Contains(number);

        public static void Swap(ref int a, ref int b)
        {
            var c = a;
            a = b;
            b = c;
        }

        public static int GetSignature(int[] inputs) =>
        inputs[0] * 1 +
        inputs[1] * 10 +
        inputs[2] * 100 +
        inputs[3] * 1000 +
        inputs[4] * 10000 +
        inputs[5] * 100000 +
        inputs[6] * 1000000 +
        inputs[7] * 10000000 +
        inputs[8] * 100000000;

        private static string ReadLine()
        {
            return Console.ReadLine().Trim();
        }

        private static int GetNextIntegerLine()
        {
            return int.Parse(Console.ReadLine());
        }
    }
}

A puzzle game CodeChef Solution in GO

package main

import (
	"bufio"
	"bytes"
	"fmt"
	"os"
)

func main() {
	reader := bufio.NewReader(os.Stdin)

	tc := readNum(reader)
	var buf bytes.Buffer
	for tc > 0 {
		tc--
		reader.ReadBytes('\n')

		grid := make([][]int, 3)
		for i := 0; i < 3; i++ {
			grid[i] = readNNums(reader, 3)
		}
		res := solve(grid)
		buf.WriteString(fmt.Sprintf("%d\n", res))
	}
	fmt.Print(buf.String())
}

func readUint64(bytes []byte, from int, val *uint64) int {
	i := from

	var tmp uint64
	for i < len(bytes) && bytes[i] >= '0' && bytes[i] <= '9' {
		tmp = tmp*10 + uint64(bytes[i]-'0')
		i++
	}
	*val = tmp

	return i
}

func readInt(bytes []byte, from int, val *int) int {
	i := from
	sign := 1
	if bytes[i] == '-' {
		sign = -1
		i++
	}
	tmp := 0
	for i < len(bytes) && bytes[i] >= '0' && bytes[i] <= '9' {
		tmp = tmp*10 + int(bytes[i]-'0')
		i++
	}
	*val = tmp * sign
	return i
}

func readString(reader *bufio.Reader) string {
	s, _ := reader.ReadString('\n')
	for i := 0; i < len(s); i++ {
		if s[i] == '\n' || s[i] == '\r' {
			return s[:i]
		}
	}
	return s
}

func readNum(reader *bufio.Reader) (a int) {
	bs, _ := reader.ReadBytes('\n')
	readInt(bs, 0, &a)
	return
}

func readTwoNums(reader *bufio.Reader) (a int, b int) {
	res := readNNums(reader, 2)
	a, b = res[0], res[1]
	return
}

func readThreeNums(reader *bufio.Reader) (a int, b int, c int) {
	res := readNNums(reader, 3)
	a, b, c = res[0], res[1], res[2]
	return
}

func readNNums(reader *bufio.Reader, n int) []int {
	res := make([]int, n)
	x := 0
	bs, _ := reader.ReadBytes('\n')
	for i := 0; i < n; i++ {
		for x < len(bs) && (bs[x] < '0' || bs[x] > '9') && bs[x] != '-' {
			x++
		}
		x = readInt(bs, x, &res[i])
	}
	return res
}

const N = 362880

var dp []int

var primes map[int]bool
var pos map[int64]int

func init() {
	primes = make(map[int]bool)
	set := make([]bool, 20)
	for i := 2; i < 20; i++ {
		if !set[i] {
			primes[i] = true
			for j := i + i; j < 20; j += i {
				set[j] = true
			}
		}
	}

	arr := make([]int64, 9)

	next := func(num int64) int64 {
		for i := 8; i >= 0; i-- {
			arr[i] = num % 10
			num /= 10
		}
		i := len(arr) - 2
		for i >= 0 && arr[i] > arr[i+1] {
			i--
		}
		if i < 0 {
			return -1
		}
		// arr[i] < arr[i+1]
		j := len(arr) - 1
		for arr[i] > arr[j] {
			j--
		}
		// j will at least be i+1
		arr[i], arr[j] = arr[j], arr[i]

		for a, b := i+1, len(arr)-1; a < b; a, b = a+1, b-1 {
			arr[a], arr[b] = arr[b], arr[a]
		}

		var ans int64

		for i := 0; i < len(arr); i++ {
			ans = ans*10 + arr[i]
		}
		return ans
	}

	nums := make([]int64, N)
	var cur int64 = 123456789
	dp = make([]int, N)
	pos = make(map[int64]int)
	for i := 0; i < N; i++ {
		nums[i] = cur
		pos[cur] = i
		cur = next(cur)
		dp[i] = -1
	}

	dp[0] = 0

	que := make([]int, N)
	var front, end int
	que[end] = 0
	end++

	for front < end {
		cur := que[front]
		front++
		num := nums[cur]
		neighors := move(num, arr)

		for _, x := range neighors {
			i := pos[x]
			if dp[i] < 0 {
				dp[i] = dp[cur] + 1
				que[end] = i
				end++
			}
		}
	}

}

func move(num int64, buf []int64) []int64 {
	// len(buf) = 9
	for i := 8; i >= 0; i-- {
		buf[i] = num % 10
		num /= 10
	}

	var res []int64

	for i := 0; i < 3; i++ {
		for j := 0; j < 3; j++ {
			x := buf[i*3+j]
			if j+1 < 3 && primes[int(buf[i*3+j+1]+x)] {
				buf[i*3+j], buf[i*3+j+1] = buf[i*3+j+1], buf[i*3+j]
				res = append(res, toNum(buf))
				buf[i*3+j], buf[i*3+j+1] = buf[i*3+j+1], buf[i*3+j]
			}
			if i+1 < 3 && primes[int(buf[(i+1)*3+j]+x)] {
				buf[i*3+j], buf[i*3+j+3] = buf[i*3+j+3], buf[i*3+j]
				res = append(res, toNum(buf))
				buf[i*3+j], buf[i*3+j+3] = buf[i*3+j+3], buf[i*3+j]
			}
		}
	}

	return res
}

func toNum(arr []int64) int64 {
	var res int64
	for i := 0; i < len(arr); i++ {
		res = res*10 + arr[i]
	}
	return res
}

func solve(grid [][]int) int {
	buf := make([]int64, 9)
	for i := 0; i < 3; i++ {
		for j := 0; j < 3; j++ {
			buf[i*3+j] = int64(grid[i][j])
		}
	}
	num := toNum(buf)

	i := pos[num]

	return dp[i]
}
A puzzle game CodeChef Solution Review:

In our experience, we suggest you solve this A puzzle game CodeChef Solution and gain some new skills from Professionals completely free and we assure you will be worth it.

If you are stuck anywhere between any coding problem, just visit Queslers to get the A puzzle game CodeChef Solution.

Find on CodeChef

Conclusion:

I hope this A puzzle game CodeChef Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Coding Solutions.

This Problem is intended for audiences of all experiences who are interested in learning about Programming Language in a business context; there are no prerequisites.

Keep Learning!

More Coding Solutions >>

Cognitive Class Answer

CodeChef Solution

Microsoft Learn

Leave a Reply

Your email address will not be published. Required fields are marked *