xfgngfngfgfgf

include <iostream>

include <vector>

using namespace std;

int main() {
int n;
cin >> n;

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

vector<vector\<int>> f(n + 1, vector<int>(max(a) + 1));

for (int i = 0; i <= n; i++) {
for (int j = 0; j <= max(a); j++) {
if (i == 0) {
f[i][j] = 0;
} else {
f[i][j] = min(
f[i - 1][j],
f[i - 1][j - 1] + (j - a[i - 1]),
f[i - 1][j + 1] + (a[i - 1] - j)
);
}
}
}

cout << f[n][a[n - 1]] << endl;

return 0;
}

Not good at code, But i will try my best.

include <iostream>

using namespace std;
const int nm = 1e6 + 1;
int n, a[nm], i, dem, j;
int main () {
freopen("TONGBANGKHONG.INP","r",stdin);
freopen("TONGBANGKHONG.OUT","w",stdout);
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
dem = 0;
for(i=0; i<n-1; i++)
for (j=i+1;j<n;j++)
if(a[i] + a[j] == 0)
dem++;
if (dem == 0)
cout << 0;
else
cout << dem << endl;
return 0;
}

ủa alo bạn ơi

for i in range(int(input())):
n,k = [int(i) for i in input().split()]
dem = 0
for i in range(1,n*k):
if i % n != 0:
dem += 1
if dem == k :
print(i)
break