{"problem":{"name":"E. Meetings","description":{"content":"Two cities A and B are connected by a straight road that is exactly l meters long. At the initial moment of time a cyclist starts moving from city A to city B at a speed v1 meters/second, and a pedest","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":1000,"memory_limit":65536},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF10125E"},"statements":[{"statement_type":"Markdown","content":"Two cities A and B are connected by a straight road that is exactly l meters long. At the initial moment of time a cyclist starts moving from city A to city B at a speed v1 meters/second, and a pedestrian starts moving from city B to city A at a speed v2 meters/second. When one of them reaches a city, the road ends, so the person has to turn around and start moving in the opposite direction by the same road, keeping the original speed. As a result, the cyclist and the pedestrian are traveling between cities A and B indefinitely.\n\nYour task is to calculate the number of times they will meet during the first t seconds. If they meet in exactly t seconds after the initial moment of time, this meeting should also be counted.\n\nThe only line of input contains four integer numbers: l, v1, v2 and t. All numbers are between 1 and 109, inclusively.\n\nPrint a single integer — the number of times the cyclist and the pedestrian will meet during the first t seconds.\n\n## Input\n\nThe only line of input contains four integer numbers: l, v1, v2 and t. All numbers are between 1 and 109, inclusively.\n\n## Output\n\nPrint a single integer — the number of times the cyclist and the pedestrian will meet during the first t seconds.\n\n[samples]","is_translate":false,"language":"English"},{"statement_type":"Markdown","content":"**Definitions**  \nLet $ T_1 = \\{a_1, a_2, a_3\\} $ and $ T_2 = \\{b_1, b_2, b_3\\} $ be two distinct triangles, where each vertex is an integer in $ \\{1, 2, \\dots, 6\\} $.  \n\nAn **edge** is an unordered pair of distinct vertices. Define the set of edges of a triangle $ T = \\{x, y, z\\} $ as:  \n$$ E(T) = \\{ \\{x,y\\}, \\{y,z\\}, \\{z,x\\} \\} $$  \n\nLet $ E = E(T_1) \\cup E(T_2) $ be the multiset of all edges from both triangles.  \n\nA **boundary edge** is an edge that appears in exactly one triangle.  \n\n**Constraints**  \n- $ T_1 \\neq T_2 $ (differ by at least one vertex).  \n- All vertices are integers in $ \\{1, 2, \\dots, 6\\} $.  \n\n**Objective**  \nCompute the number of edges in $ E $ that have multiplicity 1:  \n$$ \\left| \\{ e \\in E \\mid \\text{multiplicity of } e \\text{ in } E \\text{ is } 1 \\} \\right| $$","is_translate":false,"language":"Formal"}],"meta":{"iden":"CF10125E","tags":[],"sample_group":[],"created_at":"2026-03-03 11:00:39"}}