Advertisement
7oSkaaa

Count a's

Aug 18th, 2021
125
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.69 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #define cin(vec) for(auto& i : vec) cin >> i
  5. #define cin_2d(vec, n, m) for(int i = 0; i < n; i++) for(int j = 0; j < m && cin >> vec[i][j]; j++);
  6. #define cout(vec) for(auto& i : vec) cout << i << " "; cout << "\n";
  7. #define cout_2d(vec, n, m) for(int i = 0; i < n; i++, cout << "\n") for(int j = 0; j < m && cout << vec[i][j] << " "; j++);
  8. #define cout_map(mp) for(auto& [f, s] : mp) cout << f << "  " << s << "\n";
  9. #define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
  10. #define fixed(n) fixed << setprecision(n)
  11. #define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
  12. #define fill(vec, value) memset(vec, value, sizeof(vec));
  13. #define Num_of_Digits(n) ((int)log10(n)+1)
  14. #define mod_combine(a, b, m) (((a % m) + (b % m)) % m)
  15. #define all(vec) vec.begin(),vec.end()
  16. #define rall(vec) vec.rbegin(),vec.rend()
  17. #define sz(x) int(x.size())
  18. #define TC int t; cin >> t;   while(t--)
  19. #define fi first
  20. #define se second
  21. #define Pair pair < int, int >
  22. #define ll long long
  23. #define ull unsigned long long
  24. #define Mod  1'000'000'007
  25. #define OO 2'000'000'000
  26. #define EPS 1e-9
  27. #define PI acos(-1)
  28.  
  29. void AhMeD_HoSSaM(){
  30.   ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  31.   #ifndef ONLINE_JUDGE
  32.     freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  33.   #endif
  34. }
  35.  
  36. int main(){
  37.   AhMeD_HoSSaM();
  38.   string s;
  39.   int q;
  40.   char c;
  41.   cin >> s >> q;
  42.   vector < ll > prefix(sz(s) + 1);
  43.   for(int i = 1; i <= sz(s); i++) prefix[i] = prefix[i - 1] + (s[i - 1] == 'a');
  44.   while(q--){
  45.     int l, r;
  46.     cin >> l >> r;
  47.     cout << prefix[r] - prefix[l - 1] << "\n";
  48.   }
  49.   Time
  50.   return 0;
  51. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement