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. Mathematics
  3. Fundamentals
  4. Bus Station
  5. Discussions

Bus Station

Sort by

recency

|

63 Discussions

|

  • allahwasia806l
     + 0 comments

    This puzzle reminds me of how transport works in Our Emirates—organized, efficient, and planned with care. Just like the bus needing full capacity and order, UAE’s systems run smoothly by using space wisely and keeping things in perfect flow.

  • jaygodara1006201
     + 0 comments

    vector solve(vector a) { int n = a.size(); map mp; mp[a[0]]++; for(int i=1;i 

    vector<int> ans;
for(int i=0;i<n;i++){
    int flag=1;
    for(int j=a[i]; j<=a[n-1];j=j+a[i]){
        if(mp.find(j)==mp.end()){
            flag=0;
            break;
        }
    }
    if(flag==1 && (a[n-1]%a[i]==0||a[i]==1)) ans.push_back((a[i]));
}
return ans;

    }

  • jaygodara1006201
     + 0 comments

    vector solve(vector a) { int n = a.size(); map mp; mp[a[0]]++; for(int i=1;i 

    vector<int> ans;
for(int i=0;i<n;i++){
    int flag=1;
    for(int j=a[i]; j<=a[n-1];j=j+a[i]){
        if(mp.find(j)==mp.end()){
            flag=0;
            break;
        }
    }
    if(flag==1 && (a[n-1]%a[i]==0||a[i]==1)) ans.push_back((a[i]));
}
return ans;

    }

  • CS_2212256_T
     + 0 comments
    import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
import java.util.stream.Collectors;

public class Solution {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < a.length; i++) {
            a[i] = sc.nextInt();
        }
        System.out.println(String.join(" ", solve(a).stream().map(Object::toString).collect(Collectors.toList())));

        sc.close();
    }

    static List<Integer> solve(int[] a) {
        int sum = Arrays.stream(a).sum();

        List<Integer> sizes = new ArrayList<Integer>();
        for (int i = 1; i * i <= sum; i++) {
            if (sum % i == 0) {
                if (isValid(a, i)) {
                    sizes.add(i);
                }

                if (i * i != sum) {
                    if (isValid(a, sum / i)) {
                        sizes.add(sum / i);
                    }
                }
            }
        }
        Collections.sort(sizes);
        return sizes;
    }

    static boolean isValid(int[] a, int size) {
        int remain = size;
        for (int oneA : a) {
            if (remain == oneA) {
                remain = size;
            } else if (remain < oneA) {
                return false;
            } else {
                remain -= oneA;
            }
        }
        return remain == size;
    }
}

  • MeiSherman45
     + 0 comments

    This problem seems like an interesting puzzle! Thanks for sharing! 11xplay registration