Advertisement
Guest User

Untitled

a guest
Mar 25th, 2019
81
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.39 KB | None | 0 0
  1. #include <iostream>
  2. #include <string>
  3. using namespace std;
  4. int n;
  5. int ind;
  6. string pattern;
  7. string prevs;
  8. string nexts;
  9. int main() {
  10. cin>>n;
  11. cin>>pattern;
  12. for(int i=0; i<pattern.size(); i++){
  13. if(pattern[i]=='*') {
  14. ind=i;
  15. break;
  16. }
  17. else
  18. prevs+=pattern[i];
  19. }
  20. for(int i=ind+1; i<pattern.size(); i++){
  21. nexts+=pattern[i];
  22. }
  23. for(int i=0; i<n; i++) {
  24. string temp;
  25. cin>>temp;
  26. if(temp.size()<prevs.size()+nexts.size()) {
  27. cout<<"NE"<<endl;
  28. } else if(prevs.size()==0 || nexts.size()==0) {
  29. cout<<"NE"<<endl;
  30. }
  31. else {
  32. bool checks=true;
  33. for(int j=0; j<prevs.size(); j++) {
  34. if(prevs[j]!=temp[j]) {
  35. checks=false;
  36. break;
  37. }
  38. } if(checks==false) {
  39. cout<<"NE"<<endl;
  40. } else {
  41. int id=temp.size()-1;
  42. for(int j=nexts.size()-1; j>=0; j--) {
  43. if(nexts[j]!=temp[id]) {
  44. checks=false;
  45. break;
  46. }
  47. id--;
  48. }
  49. if(checks==false) {
  50. cout<<"NE"<<endl;
  51. } else {
  52. cout<<"DA"<<endl;
  53. }
  54. }
  55. }
  56. }
  57. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement