fork download
  1. #include<bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. #define int long long
  6. #define F first
  7. #define S second
  8. #define pb push_back
  9. #define mp make_pair
  10. #define f(n) for(int i=0;i<n;i++)
  11. #define g(n) for(int j=0;j<n;j++)
  12. #define f1(n) for(int i=1;i<n;i++)
  13. #define g1(n) for(int j=1;j<n;j++)
  14. #define f2(n) for(int i=2;i<n;i++)
  15. #define p(m) cout<<"("<<m<<")"
  16. #define pp(m,n) cout<<"("<<m<<","<<n<<")"
  17. #define ppp(m,n,o) cout<<"("<<m<<","<<n<<","<<o<<")"
  18. #define tt cout<<"!"
  19. #define nl cout<<"\n"
  20. #define cy cout<<"YES\n";return
  21. #define cn cout<<"NO\n";return
  22.  
  23. typedef vector<int> vr;
  24. typedef pair<int,int> pr;
  25. typedef vector< pair<int,int> > vp;
  26. typedef set<int> st;
  27. typedef long long ll;
  28.  
  29. int max(int a,int b){if(a>=b)return a;else return b;}
  30. int min(int a,int b){if(a<=b)return a;else return b;}
  31. void swap(int &a,int &b){int tmp=a;a=b;b=tmp;}
  32. void trV(vr v){cout<<"[";for(auto i: v){cout<<" "<<i<<" ";}cout<<"]\n";}
  33. void trVP(vp v){cout<<"[";for(auto i: v){pp(i.F,i.S);}cout<<"]\n";}
  34. void trA(int a[],int n){cout<<"[";f(n){cout<<" "<<a[i]<<" ";}cout<<"]\n";}
  35.  
  36. int flag,tmp,flag2,tmp2,count1,count2;
  37. int N = 1000000007;
  38.  
  39. void solve(int tc){
  40. int a,b,c;
  41. cin>>a>>b>>c;
  42. if(a<b && b<c){
  43. cout<<"STAIR\n";
  44. }
  45. else if(b>a && b>c){
  46. cout<<"PEAK\n";
  47. }
  48. else{
  49. cout<<"NONE\n";
  50. }
  51. }
  52.  
  53. signed main() {
  54. // freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
  55.  
  56. int t;cin>>t;f(t)
  57. solve(0);
  58.  
  59. return 0;
  60. }
  61.  
Success #stdin #stdout 0s 5308KB
stdin
7
1 2 3
3 2 1
1 5 3
3 4 1
0 0 0
4 1 7
4 5 7
stdout
STAIR
NONE
PEAK
PEAK
NONE
NONE
STAIR