Compilare: user.cpp: In function ‘void citire()’: user.cpp:5:136: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] int a[10][10], s[100], v[100], sum, maxSum = -32767;unsigned int t, n, m, l = 1;void citire(){int x, y;f >> n >> m;for(int j = 1; j <= n; j++)f >> v[j];for(int k = 1; k <= m; k++){f >> x >> y;a[x][y] = 1; }}void init(int k){s[k]=0;}int succesor(int k){if(s[k]<n){s[k]++;return 1;}else return 0;}int valid(int k){if(k>1 && a[s[k]][s[k-1]]!=1) return 0;return 1;}int solutie(int k){sum = 0;for(int i = 1; i <= k; i++) sum+= v[s[i]];if(sum > maxSum) maxSum = sum;return k==l;}void back(int k){init(k);while(succesor(k)) if(valid(k)) if(solutie(k))return; else back(k+1);}int main(){f >> t; for(int i =1; i <= t; i++){citire();for(int j = 1;j <= m;j++) {back(1);l++;}g << maxSum <<"\n";}return 0;} ^ user.cpp:5:173: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] int a[10][10], s[100], v[100], sum, maxSum = -32767;unsigned int t, n, m, l = 1;void citire(){int x, y;f >> n >> m;for(int j = 1; j <= n; j++)f >> v[j];for(int k = 1; k <= m; k++){f >> x >> y;a[x][y] = 1; }}void init(int k){s[k]=0;}int succesor(int k){if(s[k]<n){s[k]++;return 1;}else return 0;}int valid(int k){if(k>1 && a[s[k]][s[k-1]]!=1) return 0;return 1;}int solutie(int k){sum = 0;for(int i = 1; i <= k; i++) sum+= v[s[i]];if(sum > maxSum) maxSum = sum;return k==l;}void back(int k){init(k);while(succesor(k)) if(valid(k)) if(solutie(k))return; else back(k+1);}int main(){f >> t; for(int i =1; i <= t; i++){citire();for(int j = 1;j <= m;j++) {back(1);l++;}g << maxSum <<"\n";}return 0;} ^ user.cpp: In function ‘int succesor(int)’: user.cpp:5:261: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] int a[10][10], s[100], v[100], sum, maxSum = -32767;unsigned int t, n, m, l = 1;void citire(){int x, y;f >> n >> m;for(int j = 1; j <= n; j++)f >> v[j];for(int k = 1; k <= m; k++){f >> x >> y;a[x][y] = 1; }}void init(int k){s[k]=0;}int succesor(int k){if(s[k]<n){s[k]++;return 1;}else return 0;}int valid(int k){if(k>1 && a[s[k]][s[k-1]]!=1) return 0;return 1;}int solutie(int k){sum = 0;for(int i = 1; i <= k; i++) sum+= v[s[i]];if(sum > maxSum) maxSum = sum;return k==l;}void back(int k){init(k);while(succesor(k)) if(valid(k)) if(solutie(k))return; else back(k+1);}int main(){f >> t; for(int i =1; i <= t; i++){citire();for(int j = 1;j <= m;j++) {back(1);l++;}g << maxSum <<"\n";}return 0;} ^ user.cpp: In function ‘int solutie(int)’: user.cpp:5:471: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] int a[10][10], s[100], v[100], sum, maxSum = -32767;unsigned int t, n, m, l = 1;void citire(){int x, y;f >> n >> m;for(int j = 1; j <= n; j++)f >> v[j];for(int k = 1; k <= m; k++){f >> x >> y;a[x][y] = 1; }}void init(int k){s[k]=0;}int succesor(int k){if(s[k]<n){s[k]++;return 1;}else return 0;}int valid(int k){if(k>1 && a[s[k]][s[k-1]]!=1) return 0;return 1;}int solutie(int k){sum = 0;for(int i = 1; i <= k; i++) sum+= v[s[i]];if(sum > maxSum) maxSum = sum;return k==l;}void back(int k){init(k);while(succesor(k)) if(valid(k)) if(solutie(k))return; else back(k+1);}int main(){f >> t; for(int i =1; i <= t; i++){citire();for(int j = 1;j <= m;j++) {back(1);l++;}g << maxSum <<"\n";}return 0;} ^ user.cpp: In function ‘void back(int)’: user.cpp:5:520: warning: suggest explicit braces to avoid ambiguous ‘else’ [-Wparentheses] int a[10][10], s[100], v[100], sum, maxSum = -32767;unsigned int t, n, m, l = 1;void citire(){int x, y;f >> n >> m;for(int j = 1; j <= n; j++)f >> v[j];for(int k = 1; k <= m; k++){f >> x >> y;a[x][y] = 1; }}void init(int k){s[k]=0;}int succesor(int k){if(s[k]<n){s[k]++;return 1;}else return 0;}int valid(int k){if(k>1 && a[s[k]][s[k-1]]!=1) return 0;return 1;}int solutie(int k){sum = 0;for(int i = 1; i <= k; i++) sum+= v[s[i]];if(sum > maxSum) maxSum = sum;return k==l;}void back(int k){init(k);while(succesor(k)) if(valid(k)) if(solutie(k))return; else back(k+1);}int main(){f >> t; for(int i =1; i <= t; i++){citire();for(int j = 1;j <= m;j++) {back(1);l++;}g << maxSum <<"\n";}return 0;} ^ user.cpp: In function ‘int main()’: user.cpp:5:607: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] int a[10][10], s[100], v[100], sum, maxSum = -32767;unsigned int t, n, m, l = 1;void citire(){int x, y;f >> n >> m;for(int j = 1; j <= n; j++)f >> v[j];for(int k = 1; k <= m; k++){f >> x >> y;a[x][y] = 1; }}void init(int k){s[k]=0;}int succesor(int k){if(s[k]<n){s[k]++;return 1;}else return 0;}int valid(int k){if(k>1 && a[s[k]][s[k-1]]!=1) return 0;return 1;}int solutie(int k){sum = 0;for(int i = 1; i <= k; i++) sum+= v[s[i]];if(sum > maxSum) maxSum = sum;return k==l;}void back(int k){init(k);while(succesor(k)) if(valid(k)) if(solutie(k))return; else back(k+1);}int main(){f >> t; for(int i =1; i <= t; i++){citire();for(int j = 1;j <= m;j++) {back(1);l++;}g << maxSum <<"\n";}return 0;} ^ user.cpp:5:643: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] int a[10][10], s[100], v[100], sum, maxSum = -32767;unsigned int t, n, m, l = 1;void citire(){int x, y;f >> n >> m;for(int j = 1; j <= n; j++)f >> v[j];for(int k = 1; k <= m; k++){f >> x >> y;a[x][y] = 1; }}void init(int k){s[k]=0;}int succesor(int k){if(s[k]<n){s[k]++;return 1;}else return 0;}int valid(int k){if(k>1 && a[s[k]][s[k-1]]!=1) return 0;return 1;}int solutie(int k){sum = 0;for(int i = 1; i <= k; i++) sum+= v[s[i]];if(sum > maxSum) maxSum = sum;return k==l;}void back(int k){init(k);while(succesor(k)) if(valid(k)) if(solutie(k))return; else back(k+1);}int main(){f >> t; for(int i =1; i <= t; i++){citire();for(int j = 1;j <= m;j++) {back(1);l++;}g << maxSum <<"\n";}return 0;} ^