Algorithm
Problem link- https://www.spoj.com/problems/PIR/
PIR - Pyramids
Recently in Farland, a country in Asia, the famous scientist Mr. Log Archeo discovered ancient pyramids. But unlike those in Egypt and Central America, they have a triangular (not rectangular) foundation. That is, they are tetrahedrons in the mathematical sense. In order to find out some important facts about the early society of the country (it is widely believed that the pyramid sizes are closely connected with Farland's ancient calendar), Mr. Archeo needs to know the volume of the pyramids. Unluckily, he has reliable data about their edge lengths only. Please, help him!
Input
t [number of tests to follow] In each of the next t lines six positive integer numbers not exceeding 1000 separated by spaces (each number is one of the edge lengths of the pyramid ABCD). The order of the edges is the following: AB, AC, AD, BC, BD, CD.
Output
For each test output a real number - the volume, printed accurate to four digits after decimal point.
Example
Input: 2 1 1 1 1 1 1 1000 1000 1000 3 4 5 Output: 0.1179 1999.9937
Code Examples
#1 Code Example with C++ Programming
Code -
C++ Programming
#include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <map>
using namespace std;
int main(){
int t=0;
scanf("%d",&t);
double U,V,W,u,v,w;
while(t--){
scanf("%lf%lf%lf%lf%lf%lf",&u,&W,&V,&v,&w,&U);
double uu = (v*v) + (w*w) - (U*U);
double vv = (w*w) + (u*u) - (V*V);
double ww = (u*u) + (v*v) - (W*W);
double vol = (4*u*u*v*v*w*w)-(u*u*uu*uu)-(v*v*vv*vv)-(w*w*ww*ww)+(uu*vv*ww);
double volume = (sqrt(vol)) / 12;
printf("%.4lf\n", volume);
}
return 0;
}Input
1 1 1 1 1 1
1000 1000 1000 3 4 5
Output
1999.9937
Demonstration
SPOJ Solutin-Pyramids-Solution in C, C++, Java, Python