Cacher is the code snippet organizer for pro developers

/*
http://ideone.com/sqO5WQ
http://www.geeksforgeeks.org/searching-for-patterns-set-1-naive-pattern-searching/
http://www.practice.geeksforgeeks.org/problem-page.php?pid=135
*/

#include <iostream>
#include <string>
#include <vector>
using namespace std; 

int searchPattern(string str, string patt){
	int n = str.size();
	int m = patt.size();
	
	int i, j;
	for(i=0; i<= n-m; i++){
		for(j=0; j<m; j++){
			if(str[i+j] != patt[j])
				break;
		}
		if(j == m)
			return 1;
	}
	return 0;
}
int main() {
	int t;
	cin >> t;
	while(t--){
		string a, b;
		cin >> a >> b;
		if(searchPattern(a, b))
			cout << "found" << endl;
		else
			cout << "not found" << endl;
	}
	return 0;
}