# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7104 | baneling100 | 지우개 (GA4_eraser) | C++98 | 12 ms | 3040 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 <stdio.h>
int N, M, A[100001];
long long B[100001], C[100001], Ans;
void input(void)
{
int i, temp;
scanf("%d",&N);
for(i=1 ; i<=N ; i++)
{
scanf("%d",&temp);
A[temp]++;
if(M<temp)
M=temp;
}
}
void process(void)
{
int i;
long long sum=0;
for(i=M ; i>=2 ; i--)
{
sum+=(long long)A[i]*i;
B[i-1]=sum*A[i-1]*(i-1);
}
sum=0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |