1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20

Comment: Pseudocode

define gcd(a, b)
    if b > 0
        return gcd(b, a mod b)
    else
        return a

print "test"

constant N = 1000
A = []
for i from 0 to N - 1
    A[i] = i

ans = 0
for i in A
    for j in A
        ans = gcd(i, j) + ans
print ans