oj.uz

Submission #2595

# Submission time Handle Problem Language Result Execution time Memory
2595 2013-07-27T13:28:22 Z pull601 지우개 (GA4_eraser) C
0 / 100
 8 ms 1476 KB 
#include<stdio.h>
int d[100001];
int main()
{
	long long num=0;
	int n,m,i,j,k,max=0;
	scanf("%d",&n);
	for(i=1;i<=n;i++){
		printf("%d",&m); if(max<m) max=m;
		d[m]+=1;
	}
	for(i=1;i<=max;i++){
		if(d[i]==0) continue;
		for(j=i+1;j<=max;j++){
			if(d[j]==0) continue;
			for(k=j+1;k<=max;){
				if(d[k]==0) continue;
				num=num+i*j*k*d[i]*d[j]*d[k];

			}
		}
	}printf("%d",num%1000000007);
	return 0;
}

Subtask #1
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1476 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1476 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1476 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1476 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 1476 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 1476 KB Output isn't correct
2 Halted 0 ms 0 KB -