显示原始代码
#include <stdio.h>
#include <math.h>
int main() {
int n;
scanf("%d", &n);
long long int sum[n];
for (int i = 0; i < n; i++) {
scanf("%lld", &sum[i]);
}
long long int Aresult[n];
long long int Bresult[n];
long long int AddConsump = 0;
long long int ReduceConsump = 0;
long long int divisonRes;
for (int i = 1; i <= n; i++) {
for (int e = 0; e < i - 1; e++) {
AddConsump = AddConsump + sum[e];
}
for (int f = i; f <= n - 1; f++) {
ReduceConsump = ReduceConsump + sum[f];
}
Aresult[i - 1] = AddConsump - ReduceConsump;
AddConsump = 0;
ReduceConsump = 0;
}
long long ChengRes = 1LL;
for (int i = 1; i <= n; i++) {
ChengRes = ChengRes * sum[i - 1];
}
for (int i = 1; i <= n; i++) {
divisonRes = ChengRes / sum[i - 1];
Bresult[i - 1] = fmod(divisonRes, 1000000007);
}
for (int i = 0; i < n; i++) {
printf("%lld %lld\n", Aresult[i], Bresult[i]);
}
return 0;
}