Advice on checking code which presents different output locally and on website.

• The elements of the first array are all factors of the integer being considered (integer being considered % first array == 0)
  
• The integer being considered is a factor of all elements of the second array (second array % integer being considered == 0)
  

2 3
2 4
16 32 96

3

2 2
3 4
24 48

#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>

using namespace std;

vector<int> first_array;
vector<int> second_array;
vector<int> list_factors;
vector<int> results;

void input(){
	int a = 0;
	int b = 0;
	
	cin >> a >> b;

	cin.ignore(256, '\n'); 
	if ((a > 0) && (a < 11) && (b > 0) && (b < 11)){
		string input;
		int data = 0;
		getline(cin, input);
		istringstream iss(input);
		while (iss >> data){
			if ((data > 0) && (data < 101))
				first_array.push_back(data);		
		}
 
		input.clear(); 
		iss.clear();
		getline(cin, input);
		iss.str(input);
		while (iss >> data){
			if ((data > 0) && (data < 101))
				second_array.push_back(data);		
		}
	}
	else cout << "A and B is out of range" << endl;
}

void computation(vector<int> &first_array, vector<int> &second_array){
	int factor = 0;
	int count = 0; 
	
	for (int i = 0; i < second_array.size(); i++){
		for (int j = 0; j < first_array.size(); j++){
			if (second_array[i] > 0){
					if (second_array[i] % first_array[j] == 0){
						list_factors.push_back(second_array[i] / 
                                               first_array[j]);
					}
			}
		}
	}
	
	sort(list_factors.begin(), list_factors.end());
	list_factors.erase(unique(list_factors.begin(), 
                       list_factors.end()), list_factors.end());
	
	for (int k = 0; k < list_factors.size(); k++){
	bool first_condition_met = true;
	bool second_condition_met = true;
		for (int l = 0; l < first_array.size(); l++){
			if (list_factors[k] % first_array[l] != 0){
				first_condition_met = false; 
				break;
			}
		}
		
		if (first_condition_met){
			for (int m = 0; m < second_array.size(); m++){
				if (second_array[m] % list_factors[k] != 0){
					second_condition_met = false;
					break;
				}
			}
		}
          
		if (first_condition_met && second_condition_met) {
			results.push_back(list_factors[k]);	
            }				
	}
	
	cout << results.size() << endl;;	
}

int main(){
	input();
	computation(first_array, second_array);
	
	return 0;
}