package pary_Slow_18wrzesnia2014;

import java.io.*;
import java.util.*;

public class Pary_Slow {
	public static boolean canAdd(String strA, String strB){
		String strX=strB,strY;
		if(strB.compareTo(strA.substring(0,strB.length()))==0)return false;
		else if(strB.compareTo(strA.substring(strA.length()-strB.length(),strA.length()-1))==0)return false;
		else {
			for(int i=0;i<strB.length();++i){//poczatek

				strX=strX.substring(0,strX.length()-1);
				if(strX.length()==0)continue;
				strY=strA.substring(strA.length()-strX.length(),strA.length());
				if(strX.compareTo(strY)==0)return false;
//				if(strX.compareTo(strA.substring(0,strX.length()))==0)return false;
			}
			strX=strB;
			for(int i=0;i<strB.length();++i){//od konca
				strX=strX.substring(i,strX.length());
				if(strX.length()==0)continue;
				strY=strA.substring(strA.length()-strX.length(),strA.length());
//				if(strX.compareTo(strA.substring(strA.length()-strX.length(),strA.length()-1))==0)return false;
				if(strX.compareTo(strY)==0)return false;
			}
		}
		return true;
	}
	public static boolean isBinA(String strA, String strB){
		if(strA.contains(strB))return true;
		return false;
	}
	public static boolean isPalindrome(String str){
		String str1= new StringBuilder(str).reverse().toString();
		for(int i=0;i<str.length();++i){
			if(str1.charAt(i)!=str.charAt(i))return false;
		}
		return true;
	}
	public static void main(String[] args) throws FileNotFoundException {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(new File("H:\\java\\workspace\\klasa3\\src\\pary_Slow_18wrzesnia2014\\dane.txt"));
		int palindromy = 0,BwA=0,canAdd=0;
		while(sc.hasNext()){
			String strA = sc.next(),strB=sc.next();
			if(isPalindrome(strA))++palindromy;
			if(isPalindrome(strB))++palindromy;
			if(isBinA(strA,strB))++BwA;
			if(canAdd(strA,strB))++canAdd;
//			System.out.println(str+" - "+(isPalindrome(str)?"TAK":"Nie"));
		}
		System.out.println("Palindromów: "+palindromy+"\nB w A:"+BwA+"\nmoge skleic:"+canAdd);
		sc.close();
	}

}