func_code_string: #include <bits/stdc++.h>   using namespace std;   template <typename TP>   inline bool rd(TP& r) {     r = 0;     char tmp = getchar();     while (tmp <  0  || tmp >  9 ) {       if (tmp == EOF) return 0;       tmp = getchar();     }     while ( 0  <= tmp && tmp <=  9 ) {       r = (r << 3) + (r << 1) + tmp -  0 ;       tmp = getchar();     }     return 1;   }   long long a[110], b[110], n;   long long dt[110 * 110];   bool vis[1000100];   long long ab(long long num) {     if (num >= 0) return num;     return -num;   }   int main() {     int t;     rd(t);     int tot;     int nb;     while (t--) {       rd(n);       for (int i = 1; i <= n; i++) rd(a[i]);       tot = 0;       for (int i = 1; i <= n; i++)         for (int j = 1; j < i; j++) dt[++tot] = ab(a[i] - a[j]);       sort(dt + 1, dt + tot + 1);       tot = unique(dt + 1, dt + tot + 1) - (dt + 1);       memset(vis, 0, sizeof(vis));       nb = 0;       for (int i = 1; i <= 1000000 && nb != n; i++)         if (!vis[i]) {           b[++nb] = i;           for (int j = 1; j <= tot && i + dt[j] < 1000100; j++)             vis[i + dt[j]] = 1;         }       if (nb != n)         printf( NO n );       else {         printf( YES n );         for (int i = 1; i <= n; i++) printf( %I64d  , b[i]);         printf(  n );       }     }     return 0;   }   