/*fdupp - two dimensional array duplicate search algorithm*/
#include <iostream>
using namespace std;

int user[5] [5];

void fdupp() {

	bool flag;
	int count=0;

	for(int r=0; r<5; r++) {

		for(int c=0; c<5; c++) {

			for(int outer=0; outer<5; outer++) {

				for(int inner=0; inner<5; inner++) {

					if((inner==c) && (outer==r)) continue;

					else if(user[r] [c]==user[outer] [inner]) {

						count++;

						cout <<"\n      " << user[r] [c] <<" located at row " << r <<" column " << c;

						goto full_break;
					}
				}
			}
full_break:;

		}
	}

	if(!(count)) cout <<"\n    No duplicates found!";
}


int main() {

	for(int loadr=0; loadr<5; loadr++) {

		for(int loadc=0; loadc<5; loadc++) {

			cout <<"\nValue for element " << loadr <<" " << loadc <<": ";
			cin >> user[loadr] [loadc];

		}
	}

	fdupp();

	return 0;
}