题目1465：最简真分数

#include<iostream>
#include<algorithm>
using namespace std;
int gcd(int a,int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int main(){
    int s[605];
    int n,i,j,count;
    while(cin>>n){
        if(n==0) break;
        for(i=0;i<n;i++){
            cin>>s[i];
        }
        sort(s,s+n);
        count=0;
        for(i=0;i<n;i++){
            for(j=i+1;j<n;j++){
                if(gcd(s[j],s[i])==1) count++;
            }
        }
        cout<<count<<endl;
    }
}
/**************************************************************
    Problem: 1465
    User: cust123
    Language: C++
    Result: Accepted
    Time:80 ms
    Memory:1520 kb
****************************************************************/