Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /* http://www.hsin.hr/skolska2007/zadaci/pas_c_cpp/prva/zadaci.pdf */
- #include <iostream>
- using namespace std;
- int br (char n)
- {
- switch (n)
- {
- case 'A': return 1; break;
- case 'B': return 2; break;
- case 'C': return 3; break;
- case 'D': return 4; break;
- case 'E': return 5; break;
- case 'F': return 6; break;
- case 'G': return 7; break;
- case 'H': return 8; break;
- }
- }
- main()
- {
- int a[11][11], x=0;
- int c1, c2, c3, c4;
- char b1, b2, b3, b4;
- bool p;
- cin >> b1 >> c1 >> b2 >> c2 >> b3 >> c3 >> b4 >> c4;
- /* Popunjava matricu */
- for (int i=0; i<10; i++)
- for (int j=0; j<10; j++)
- if ((i==0)||(i==9)||(j==0)||(j==9))
- a[i][j] = 1;
- else a[i][j] = 0;
- /* Popunjava matricu za drugog topa */
- for (int i=1; i<9; i++)
- a[c3][i] = 1;
- for (int i=1; i<9; i++)
- a[i][br(b3)] = 1;
- /* Popunjava matricu za prvog topa */
- for (int i=1; i<9; i++)
- a[c2][i] = 1;
- for (int i=1; i<9; i++)
- a[i][br(b2)] = 1;
- /* Popunjava matricu za kralja */
- a[c4][br(b4)] = 1;
- a[c4+1][br(b4)] = 1;
- a[c4-1][br(b4)] = 1;
- a[c4][br(b4)+1] = 1;
- a[c4][br(b4)-1] = 1;
- a[c4+1][br(b4)+1] = 1;
- a[c4+1][br(b4)-1] = 1;
- a[c4-1][br(b4)+1] = 1;
- a[c4-1][br(b4)-1] = 1;
- if (a[c1][br(b1)] == 1)
- p = true;
- else p = false;
- a[c1][br(b1)] = 2;
- /* Racunanje x */
- if (a[c1-1][br(b1)] == 0)
- x++;
- if (a[c1+1][br(b1)] == 0)
- x++;
- if (a[c1][br(b1)+1] == 0)
- x++;
- if (a[c1][br(b1)-1] == 0)
- x++;
- if (a[c1-1][br(b1)-1] == 0)
- x++;
- if (a[c1-1][br(b1)+1] == 0)
- x++;
- if (a[c1+1][br(b1)-1] == 0)
- x++;
- if (a[c1+1][br(b1)+1] == 0)
- x++;
- /* Stampanje matrice
- for (int i=0; i<10; i++)
- {
- for (int j=0; j<10; j++)
- cout << a[i][j] << " ";
- cout << endl;
- } */
- switch (p)
- {
- case true:
- {
- if(x==0)
- cout << "mat" << endl;
- else
- cout << "sah " << x << endl;
- } break;
- case false:
- {
- if (x==0)
- cout << "pat" << endl;
- else
- cout << "trk " << x << endl;
- } break;
- }
- system ("PAUSE");
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement