# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22772 | 최숭실 (#40) | Unifying Values (KRIII5_UV) | C++14 | 0 ms | 2176 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<iostream>
#include<algorithm>
#include<math.h>
#define MOD 1000000007
using namespace std;
long long int Data[10010];
long long int Sum[10010];
long long int ans;
long long int m_pow(long long int a, long long int b)
{
long long int s = 1;
for (int i = 0; i < b; i++)
s *= a;
return s;
}
int main()
{
long long int n;
scanf("%lld", &n);
for (int i = 0; i < n; i++)
{
scanf("%lld", &Data[i]);
if (i == 0)Sum[i] = Data[i];
else
Sum[i] = Sum[i - 1] + Data[i];
}
long long int target = 0;
for (int i = 0; i < n-1; i++)
{
target += Data[i];
if ((Sum[n - 1] - Sum[i]) % target != 0)continue;
long long int zero = 0;
long long int tmp_sum = 0;
for (int j = i + 1; j < n; j++)
{
tmp_sum += Data[j];
if (tmp_sum == target)
tmp_sum = 0;
if (Data[j] == 0)zero++;
}
if (tmp_sum != 0)continue;
ans += m_pow(2, zero);
ans %= MOD;
}
cout << ans;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |