Submission #2227

# Submission time Handle Problem Language Result Execution time Memory
2227 2013-07-20T10:22:33 Z ksmin1114 지우개 (GA4_eraser) C++
0 / 100
1000 ms 1592 KB
#include<stdio.h>
#include<algorithm>
using namespace std;
int main(){
	long long int n,a[100000],v=0;
	scanf("%lld",&n);
	int i,j,k;
	for(i=0;i<n;i++) scanf("%d",&a[i]);
	sort(a,a+n);
	for(i=0;i<n-2;i++){
		for(j=i+1;j<n-1;j++){
			if(i==j)continue;
			for(k=j+1;k<n;k++){
				if(a[i]!=a[j] && a[j]!=a[k] && a[i]!=a[k]){
					v+=a[i]*a[j]*a[k];
				}
			}
		}
	}
	printf("%d",v);
}
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1592 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1588 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 53 ms 1588 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 49 ms 1592 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1000 ms 0 KB Program timed out
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1000 ms 0 KB Program timed out
2 Halted 0 ms 0 KB -