# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
140132 | rdd6584 | Unifying Values (KRIII5_UV) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
ll vec[10000];
int dp[10001];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", &vec[i]);
if (i) vec[i] += vec[i - 1];
}
// i를 시작점으로 하는 배열 체크.
ll ans = 0;
for (int i = 0; i < n - 1; i++) {
if (!vec[i] || vec[n - 1] % vec[i]) continue;
if (vec[i] > 0 && vec[n - 1] < 0 || vec[i] < 0 && vec[n - 1] > 0) continue;
memset(dp, 0, sizeof(dp));
dp[1] = 1;
printf("%lld //\n", vec[i]);
for (int j = i + 1; j < n - 1; j++) {
if (!vec[j] || vec[j] % vec[i]) continue;