URI Solution 227 - Puzzle - Solution in C++ | Volume 2 - Online Judge Solution

Latest

It is a free Online judges problems solution list. Here you can find UVA online Judge Solution, URI Online Judge Solution, Code Marshal Online Judge Solution, Spoz Online Judge Problems Solution

Sunday, April 30, 2017

URI Solution 227 - Puzzle - Solution in C++ | Volume 2

URI Solution 227 - Puzzle - Solution in C++ | Volume 2


UVA Online Judge Solution 227 - Puzzle | Volume 2
UVA Problem Link - https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=4&page=show_problem&problem=163

Problem Name: Puzzle
Problem Number : UVA - 120 Puzzle
Online Judge : UVA Online Judge Solution
Volume: 2
Solution Language : C plus plus

UVA Solution 120 Code in CPP:

#include <stdio.h>
#include <string.h>
int main() {
    char map[5][6], cmd;
    int cases = 0;
    while(gets(map[0])) {
        if(!strcmp(map[0], "Z"))
            break;
        if(cases)
            puts("");
        printf("Puzzle #%d:\n", ++cases);
        gets(map[1]), gets(map[2]), gets(map[3]), gets(map[4]);
        int i, j, x, y;
        for(i = 0; i < 5; i++) {
            for(j = 0; j < 5; j++) {
                if(map[i][j] == ' ' || map[i][j] == '\0')
                    x = i, y = j;
            }
        }
        int error = 0;
        while(1) {
            cmd = getchar();
            if(cmd == 'A') {
                if(x == 0) {
                    error = 1;
                    break;
                }
                map[x][y] = map[x-1][y];
                x--;
            } else if(cmd == 'B') {
                if(x == 4) {
                    error = 1;
                    break;
                }
                map[x][y] = map[x+1][y];
                x++;
            } else if(cmd == 'L') {
                if(y == 0) {
                    error = 1;
                    break;
                }
                map[x][y] = map[x][y-1];
                y--;
            } else if(cmd == 'R') {
                if(y == 4) {
                    error = 1;
                    break;
                }
                map[x][y] = map[x][y+1];
                y++;
            } else if(cmd == '0')
                break;
        }
        if(cmd != '0') {
            while((cmd = getchar()) != '0');
        }
        while((cmd = getchar()) != '\n');
        if(error)
            puts("This puzzle has no final configuration.");
        else {
            map[x][y] = ' ';
            for(i = 0; i < 5; i++) {
                for(j = 0; j < 5; j++) {
                    if(j)
                        putchar(' ');
                    putchar(map[i][j]);
                }
                puts("");
            }
        }
        memset(map, 0, sizeof(map));
    }
    return 0;
}

No comments:

Post a Comment