# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
17442 | atomzeno | 지우개 (GA4_eraser) | C++98 | 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<stdio.h>
#define MX 110001
#include<algorithm>
using namespace std;
int n,A[MX];
long long int MOD=6000000042;
long long int a[MX],b[MX],c[MX],m,s,ss=1,ans;
int main(){
int i,n;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&A[i]);
long long int h=A[i];
s=s+h;
s%=MOD;
}
sort(A,A+n);
for(i=0;i<n;i++){
a[i]=A(long long int)[i];
}
m=1;
b[1]=a[0],c[1]=1;
for(i=1;i<n;i++){
if(b[m]==a[i]){c[m]++;}
else{b[++m]=a[i],c[m]++;}
}
ss=s;
ss*=s;
ss=ss%MOD;
ss*=s;