Trigonometrijsko pitanjeCode:
Once an ACM programmer was driving along a highway.
The road was very smooth and straight, no pits,
no bumps,
no turns miles and miles forward.
In short, boring! So the programmer decided to view billboards along the highway.
One billboard was so interesting that the programmer wanted to examine it properly.
But without a computer he found it difficult to determine the point with the maximal viewing angle.
Once an ACM programmer was driving along a highway.
The road was very smooth and straight, no pits,
no bumps,
no turns miles and miles forward.
In short, boring! So the programmer decided to view billboards along the highway.
One billboard was so interesting that the programmer wanted to examine it properly.
But without a computer he found it difficult to determine the point with the maximal viewing angle.
Treba znaci da se izracuna najveci ugao
Poznate su kordinate x1 x2 y1 y2
treba mi matematicko resenje kako izracunati taj ugao
Evo nekih test primera koji se dobiu uz zadatak
Code:
x1=100
x2=300
y1=200
y2=400
ugao se dobije 0.785398
x1=-800
x2=800
y1=1
y2=1
ugao se dobije 3.139093
x1=100
x2=300
y1=200
y2=400
ugao se dobije 0.785398
x1=-800
x2=800
y1=1
y2=1
ugao se dobije 3.139093
