Azarath Metrion Zinthos

---------- #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #inclu

Description Stan has n sticks of various length. He throws them one at a time on the floor in a random way. After finishing throwing, Stan tries to find the top sticks, that is these sticks such th

Wall Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 25770   Accepted: 8575 Description Once upon a time there was a greedy King who ordered his chief Archit

Scrambled Polygon Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 5868   Accepted: 2777 Description A closed polygon is a figure bounded by a finite number o

Intersecting Lines Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 8222   Accepted: 3746 Description We all know that a pair of distinct points on a plane de

#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #i

Description Problem D Morley’s Theorem Input: Standard Input Output: Standard Output  Morley’s theorem states that that the lines trisecting the angles of an arbitrary plane triangle meet at

------------------ int n; int main(){ int cas=0; while (~scanf("%d",&n)){ int ans=0; if (n==0) ans=0; else if (n<=78) ans=1; else if (n<=95) ans=2; else if (