Tekijät

input/code.cpp: In function 'std::vector<int> primes(int)':
input/code.cpp:43:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
     if (n > 2)
     ^~
input/code.cpp:45:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
     return ans;
     ^~~~~~
input/code.cpp: In function 'std::vector<int> uprimes(int)':
input/code.cpp:66:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
     if (n > 2)
     ^~
input/code.cpp:68:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
     return ans;
     ^~~~~~

#include <stdio.h> // include before iostream for faster scanf
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <set>
#include <unordered_set>
#include <cmath>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string.h>
#include <sstream>
#include <tuple>
#include <utility>
#include <iomanip>
#include <iterator>

using namespace std;
typedef long long LL;

#define printv(printVec) for (auto printVecIter : (printVec)) cout << printVecIter << " "; cout << endl;

// g++ -Wall -Wshadow -std=c++11 a.cpp && ./a.out


vector<int> primes(int n) {
	vector<int> ans;
    while (n % 2 == 0) {
        ans.push_back(2);
        n = n/2;  
    }
    for (int i = 3; i <= sqrt(n); i = i + 2) {
        while (n % i == 0)  
        {
        	ans.push_back(i);
            n = n/i;  
        }  
    }
    if (n > 2)
    	ans.push_back(n);
   	return ans;
}



vector<int> uprimes(int n) {
	vector<int> ans;
    while (n % 2 == 0) {
    	if ((ans.size() && ans.back() != 2) || ans.size() == 0)
        	ans.push_back(2);
        n = n/2;  
    }
    for (int i = 3; i <= sqrt(n); i = i + 2) {
        while (n % i == 0)  
        {
        	if ((ans.size() && ans.back() != i) || ans.size() == 0)
        		ans.push_back(i);
        	// ans.push_back(i);
            n = n/i;  
        }  
    }
    if (n > 2)
    	ans.push_back(n);
   	return ans;
}


bool isprime(int n) {
	vector<int> ans;
    while (n % 2 == 0) {
    	return false;
    }
    for (int i = 3; i <= sqrt(n); i = i + 2) {
        if (n % i == 0)  
        {
        	return false;
        }  
    }
    return true;
}

int gcd(int a , int b)
{
   if(b==0) return a;
   a%=b;
   return gcd(b,a);
}

int main() {
	std::ios::sync_with_stdio(false);cin.tie(0);
	int n; cin>>n;
	vector<int> nums(101);

	for (int i =0;i<n; i++) {
		int tmp; cin >>tmp;
		nums[tmp]++;
	}

	LL ans = 0;
	for (int i = 0; i < 101; i++) {
		for (int j = i+1; j < 101; j++) {
			if (gcd(i,j) == 1) {
				ans += nums[i] * (LL) nums[j];
			}
		}
	}
	cout << ans << endl;

}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 2, 3

Verdict: WRONG ANSWER

Test 4

Group: 3

Verdict: RUNTIME ERROR

Test 5

Group: 3

Verdict: RUNTIME ERROR

Test 6

Group: 3

Verdict: RUNTIME ERROR

Test 7

Group: 3

Verdict: RUNTIME ERROR