Hello Everyone, I have been trying to solve this problem "Light Oj — 1313" for so long but could not find any solution. I can understand convex hull and point in polygon part than I got stuck every time. Can anybody tell me how to solve this problem. Thank you .

problem link : (http://www.aichengxu.com/other/3595766.htm) I am giving this link because you must have an account to open the main problem.

I was trying to solve this problem but got stuck i could not find the problem pls help any test case also will be helpful
code : (https://ideone.com/HkPWSw)

Problem Link : (https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1197)

TIA

given the end points of the largest parallel side and the lengths of other three sides of a trapezium how to find other two coordinate points of that trapezium?

if point A, point B, b,c,d are given how to find point C and D?

Edit: Thnx everyone solved it finding circle-circle intersection points

I am getting runtime error in this problem link: https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=752

code: http://ideone.com/TFRDTu

it says "terminate called after throwing an instance of 'std::length_error' what(): vector::_M_fill_insert"

What does it mean and how to solve it TIA

We know that to solve most programming problem we have to think how to solve it but what thinking made that problem? I know there are many experienced problem setter in Codeforces community . Could you pls tell me how do you think to invent a problem, how do you think the test case. Srry for my bad english. Thanks in advance.

given , f(x)=2*(f(x-1)+g(x-1)-1)*(f(x-1)+g(x-1)-3)+12*f(x-1)-13

g(x)=(f(x-1)+g(x-1))*(f(x-1)+g(x-1)-4)+12*g(x-1)-7

here , f(0)=2,g(0)=1

if x is given how to find f(x) and g(x) when 1<=x<=10^18 and x is an non negative integer

Sometimes there are some problems which has input description like this problem in Uva. Can anyone tell me how to take input and how to stop taking input for this type of problems TIA...

Can any one help me in this problem i couldn't find it problem link my solution TIA...

Can any one help in this problem.I tried to solve it by finding in degree edges but getting WA problem link: Uva-10305 my solution : here

Hello everyone, recently we have formed a team, and but we have no idea how to improve ourselves. As there are many people in Codeforces who are competing for years and who have experience , can you share us how you practice to improve to perform in team competition any idea(helpful ;)) will be appreciated.

Also another thing, What do you think is best learn a topic and solve problems or solve problems and learn topic when you face it ? TIA .

Can we devise a formula for a series like this,

S=n+7(n-1+7(n-2+7(n-3+.........)))

when n=1 S=1 first three terms are 1,9,66 someone says it has a formula but i cant find any help!!!

Hi everyone,i am totally new in codeforces.cant understand the rating system,last contest I solved 1st problem and got TLE in second 2 times.Can any one explain how the rating system works,thanks in advance :).

I am new to competitive programming.Just starting to solve problem in UVa and participating in codeforces contest.Is there any online judge that has categorized problems.Also can any one suggest me what type of problems should i start first.