Advertisement
Ahmed_Negm

Untitled

Mar 21st, 2023
521
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.76 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. #include <ext/pb_ds/assoc_container.hpp>
  3. #include <ext/pb_ds/tree_policy.hpp>
  4. using namespace std;
  5. using namespace __gnu_pbds;
  6. #define ll long long
  7. #define OO 2'000'000'000
  8. #define ull unsigned long long
  9. #define nl '\n'
  10. #define sz(x) (ll)(x.size())
  11. #define all(x) x.begin(),x.end()
  12. #define rall(s)  s.rbegin(), s.rend()
  13. #define getline(s) getline(cin>>ws,s)
  14. #define ceill(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
  15. #define pi  3.141592653589793
  16. #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
  17. #define multi_ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
  18.  
  19.  
  20. void Fast_IO(){
  21. ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  22. // freopen("filename.in", "r", stdin);
  23. // freopen("filename.txt", "w", stdout);
  24. #ifndef ONLINE_JUDGE
  25. freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  26. #endif
  27. }
  28.  
  29.  
  30.  
  31.  
  32. int dx[] = { 2, 1, -1, -2, -2, -1, 1, 2 };
  33. int dy[] = { 1, 2, 2, 1, -1, -2, -2, -1 };
  34.  
  35.  
  36.  
  37.  
  38. void solve(){
  39.   ll n; cin>>n;
  40.   ll l=1,r=n,ansl;
  41.   while(l<=r){
  42.     ll mid = (l+r)/2;
  43.     cout<<"? "<<mid<<endl;
  44.     cout.flush();
  45.     char x; cin>>x;
  46.     if(x=='<'){
  47.         l=mid+1;
  48.     }else if(x=='>'){
  49.         r=mid-1;
  50.     }else{
  51.         r=mid-1;
  52.         ansl=mid;
  53.     }
  54.   }
  55.   l = 1,r=n;
  56.   ll ansr;
  57.   while(l<=r){
  58.     ll mid = (l+r)/2;
  59.     cout<<"? "<<mid<<endl;
  60.     cout.flush();
  61.     char x; cin>>x;
  62.     if(x=='<'){
  63.         l=mid+1;
  64.     }else if(x=='>'){
  65.         r=mid-1;
  66.     }else{
  67.         l=mid+1;
  68.         ansr=mid;
  69.     }
  70.   }
  71.     cout<<"! "<<ansr-ansl+1<<endl;
  72.     cout.flush();
  73.  
  74.  
  75.  
  76.  
  77. }
  78.  
  79. int main(){
  80.     Fast_IO();
  81. int t =1;
  82. //cin>>t;
  83. while(t--){
  84. solve();
  85. }
  86. return 0;
  87. }  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement