fork download 
  1.  
  2. #include <bits/stdc++.h>
  3.  
  4. using namespace std;
  5.  
  6. int main()
  7. {
  8.     long long n;
  9.     cin>>n;
  10.  
  11.     string word;
  12.     cin>>word;
  13.  
  14.     long long g=0, b=0;
  15.     long long prefix_z[1000001] = {0};
  16.     long long prefix_n[1000001] = {0};
  17.     prefix_z[0] = 0;
  18.     prefix_n[0] = 0;
  19.  
  20.     for(long long i=1; i<=word.length(); i++)
  21.     {
  22.     	prefix_z[i] = prefix_z[i-1];
  23.     	prefix_n[i] = prefix_n[i-1];
  24.  
  25.         if(word[i-1] == 'z')
  26.             prefix_z[i]++;
  27.         else
  28.             prefix_n[i]++;
  29.     }
  30.  
  31.     long long pl_p, pl_k;
  32.  
  33.     for(long long i=0; i<n; i++)
  34.     {
  35.         cin>>pl_p>>pl_k;
  36.         long long z = prefix_z[pl_k]-prefix_z[pl_p-1];
  37.         long long n = prefix_n[pl_k]-prefix_n[pl_p-1];
  38.  
  39.         if(z>n)
  40.             cout<<"z "<<z-n<<'\n'; 
  41.  
  42.         else if(z<n)
  43.             cout<<"n "<<n-z<<'\n';
  44.  
  45.         else
  46.             cout<<"labor omnia vincit"<<'\n';
  47.  
  48.     }
  49.  
  50.     return 0;
  51. }
Success #stdin #stdout 0.01s 19220KB
comments (?)
stdin 
3
nzznnznz
1 3
5 8
4 5
stdout 
z 1
labor omnia vincit
n 2
https://ideone.com/G5v0NQ
language:
C++ (gcc 8.3)
created:
2 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!