# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
3502 | pl0892029 | Inherited disease (kriii1_I) | C++98 | 0 ms | 1088 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>
#define mod 1000000007
int main() {
int n;
scanf("%d",&n);
long long factorial[101] = {1};
long long rightNodeValue[101] = {0};
for(int i=1;i<=n;i++)
factorial[i] = factorial[i-1]*i%mod;
for(int i=1;i<=n;i++)
rightNodeValue[i] = (rightNodeValue[i-1] + factorial[i])%mod;
long long leftNum = 0;
for(int i=1;i<=n;i++) {
leftNum = (leftNum*i)%mod;
long long choice;
scanf("%lld",&choice);
printf("%lld\n",(rightNodeValue[i-1] + leftNum + choice)%mod);
leftNum = leftNum + choice - 1;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |