fork download
  1. #include <iostream>
  2. #include <stdio.h>
  3. #include <string>
  4. #include <vector>
  5. #define FOR(i,a) for(int i=0;i<a;i++)
  6. #define REP(i,a,b) for(int i=a;i<b;i++)
  7.  
  8. int GCD(int a,int b)
  9. {
  10. return (b==0)?a:GCD(b,a%b);
  11. }
  12.  
  13. using namespace std;
  14.  
  15. void solve();
  16.  
  17. int main()
  18. {
  19. int t;
  20. cin>>t;
  21. FOR(i,t) solve();
  22. return 0;
  23. }
  24.  
  25. void solve()
  26. {
  27. int r,c,flag=1;
  28. string s;
  29. cin>>r>>c;
  30. vector <string> a1;
  31. FOR(i,r)
  32. {
  33. cin>>s;
  34. a1.push_back(s);
  35. }
  36. FOR(i,r) cout<<a1[i]<<"\n";
  37. s="spoon";
  38. FOR(i,r) FOR(j,c) if(a1[i][j]<97) a1[i][j]+=22;
  39. FOR(i,r) if(a1[i].find(s)!=-1) flag=0;
  40. string s11="redapple";
  41. cout<<"\n\n\n"<<s11.compare(2,5,"appld")<<"\n\n";
  42. int p;
  43. FOR(j,c)
  44. {
  45. p=0;
  46. FOR(i,r-4)
  47. FOR(k,5) if(a1[i+k][j]==s[k]) p++;
  48. if(p==5)
  49. {
  50. flag=0;
  51. goto h;
  52. }
  53. }
  54. h:
  55. (flag)?cout<<"There is indeed no spoon!\n":cout<<"There is a spoon!\n";
  56. }
  57.  
Success #stdin #stdout 0.01s 2864KB
stdin
3
3 6
abDefb
bSpoon
NIKHil
6 6
aaaaaa
ssssss
xuisdP
oooooo
ioowoo
bdylan
6 5
bdfhj
cacac
opqrs
ddddd
india
yucky
stdout
abDefb
bSpoon
NIKHil



1

There is indeed no spoon!
aaaaaa
ssssss
xuisdP
oooooo
ioowoo
bdylan



1

There is a spoon!
bdfhj
cacac
opqrs
ddddd
india
yucky



1

There is indeed no spoon!