fork(5) download
copy 
  1. #include <iostream>
  2. #include <string>
  3. using namespace std;
  4. string s,t;
  5. int i,j,tlen,slen,pos,tt;
  6. bool used[105],used2[105];
  7. long long h1=1,h2=1;
  8. int main() {
  9. 	cin >> s >> t;
  10. 	tlen = t.length();
  11. 	slen = s.length();
  12. 		int z = 0;
  13. 	for(i=0;i<tlen;i++){
  14. 		for(j=0;j<slen;j++)
  15. 			if(t[i] == s[j] && !used[j] ){
  16. 				z++;
  17. 				used[j]=1;
  18. 			}
  19. 	}
  20. 	j=0;
  21. 	for(i=0;i<tlen;i++)
  22. 		for(;j<slen;j++)
  23. 	if (t[i] == s[j]){pos++;break;}
  24. 	if(pos == tlen){
  25. 		cout <<"automaton\n";
  26. 		return 0;
  27. 	}
  28. 	else 
  29. 	if(slen == tlen){
  30. 		for(i=0;i<tlen;i++){
  31. 			for(j=0;j<slen;j++)
  32. 			if(used2[j] == 0&&t[i]==s[j]) {used2[j]=1;tt++;}
  33. 		}
  34. 		cout<<"tt="<<tt<<endl;
  35. 		if(tt == slen){
  36. 			cout <<"array\n";
  37. 			return 0;
  38. 		}	
  39. 	}
  40. 	else
  41.  
  42. 	if( z == tlen)
  43. 	{	cout << "both\n";return 0;}
  44.  
  45. 		cout << "need tree\n";
  46. 	return 0;
  47. }
Success #stdin #stdout 0s 3476KB
comments (?)
stdin
copy 
kabann 
banka
stdout
copy 
need tree
https://ideone.com/wwqcMy
language:
C++ (gcc 8.3)
created:
10 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!