We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Apple and Orange
  5. Discussions

Apple and Orange

  • rcgonzalezf
     + 1 comment

    You don't even have to store the array, you can do the counting inline while reading the input:

    int apples = 0;

for(int i=0; i < m; ++i){
    long d = in.nextLong();
    long p = d+a;
    if ( p >= s && p <= t ) ++apples;
}