C-Programs/codevitgrid.cpp at master · IamRiddhi/C-Programs · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
void displaypathtoprincess(char **a,int n)
{
	int i,j,pi,pj,mi,mj,cj=-1,ci=-1;
	for(i=0;i<n;i++)
	{
		for(j=0;j<n;j++)
		{
			if(a[i][j]=='m')
			{
					mi=i;
					mj=j;
			}
			if(a[i][j]=='p')
			{
				pi=i;
				pj=j;
			}
		}
	}
	//	printf("%d,%d    %d,%d",mi,mj,pi,pj);
	while(1)
	{
		if(mi<pi)
			ci=1;
		else if(mi>pi)
			ci=2;
		switch(ci)
		{
		case 1:
				mi++;
				printf("DOWN\n");
				break;
		case 2:   mi--;
				printf("UP\n");
				break;
		}
		ci=-1;
		if(mj<pj)
			cj=3;
		else if(mj>pj)
			cj=4;
		switch(cj)
		{
			case 3:   mj++;
					printf("RIGHT\n");
					break;
			case 4:   mj--;
					printf("LEFT\n");
					break;
		}
		cj=-1;
		if(mi==pi && mj==pj)
			break;
	}
}
int main()
{
	int j,i,n;
	char **g;
	printf("enter size:");
	scanf("%d",&n);
	g=(char**)malloc(n*sizeof(char*));
	for(i=0;i<n;i++)
		g[i]=(char*)malloc((n+1)*sizeof(char));
	for(i=0;i<n;i++)
	{

			fflush(stdin);
			gets(g[i]);
			puts("");
	}
	displaypathtoprincess(g,n);
	/*for(i=0;i<n;i++)
	{
		for(j=0;j<n;j++)
		{
			printf("%c\t",g[i][j]);
		}
	printf("\n");
	}*/
}