Codeforces Round 787 (Div. 3)

Solutions are presented as using the least memory and the fastest execution time. It also takes the top 10 most recent solutions from each language. If you want to limit to a specific index, click the "Solved" button and go to that problem.

ContestId
Name
Phase
Frozen
Duration (Seconds)
Relative Time
Start Time
1675 Codeforces Round 787 (Div. 3) FINISHED False 8100 80061899 May 5, 2022, 2:35 p.m.

Problems

Solved$
Index
Name
Type
Tags
Community Tag
Rating
( 33466 ) A Food for Animals PROGRAMMING math

B'In the pet store on sale there are: Polycarp has x dogs and y cats. Is it possible that he will be able to buy food for all his animals in the store? Each of his dogs and each of his cats should receive one pack of suitable food for it. The first line of input contains an integer t ( 1 <= t <= 10^4 ) -- the number of test cases in the input. Then t lines are given, each containing a description of one test case. Each description consists of five integers a, b, c, x and y ( 0 <= a,b,c,x,y <= 10^8 ). For each test case in a separate line, output: You can output YES and NO in any case (for example, strings yEs, yes, Yes and YES will be recognized as a positive response). '...

Tutorials

102550

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
156001893 ludidilu A May 5, 2022, 4:36 p.m. OK C# 8 TESTS 11 93 2867200
156027847 bluemegane A May 5, 2022, 10:21 p.m. OK C# 8 TESTS 11 108 3276800
156034528 luadham A May 6, 2022, 2:17 a.m. OK Clang++17 Diagnostics TESTS 11 186 0
156032855 chenbxxx A May 6, 2022, 1:26 a.m. OK Clang++17 Diagnostics TESTS 11 186 0
156037889 0x000922 A May 6, 2022, 3:40 a.m. OK Clang++17 Diagnostics TESTS 11 248 0

remove filters

Back to search problems