thunder_fart→Why is this solution submitting in C++ 17 but showing tle for C++ 23 VaishCodes→different output in vs code and codeforces MikeMirzayanov→Codeforces: .NET 9 = C# 13 + F# 9 Otherwordly→Happy Eid!
The package for this problem was not updated by the problem writer or Codeforces administration after we've upgraded the judging servers. To adjust the time limit constraint, a solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers,...
769D k-Interesting Pairs Of Integers: Accepted (another solution) Apr 4, 2024 770A New Password: Accepted Apr 4, 2024 770B 770B: Simpler solution Apr 6, 2024 770C Update online-courses-in-bsu.cpp Sep 23, 2019 770D Rename draw_brackets.py to draw-brackets.py Sep 16, 2019 ...
1195D - Submarine in the Rybinsk Sea (easy edition) - Wrong answer Educational Codeforces Round 68 - 2/7 1194A - Remove a Progression - Accepted 1194B - Yet Another Crosses Problem - Time limit exceeded 1194C - From S To T - Accepted Codeforces Round #573 (Div. 2) - 3/6 1191A ...
In this problem we define Fibonacci numbers as follows: f(1) = 1, f(2) = 1, f(x) = f(x - 1) + f(x - 2) for all x > 2. Sasha is a very talented boy and he managed to perform all queries in five seconds. Will you be able to write the...
codeforces742B Arpa’s obvious problem and Mehrdad’s terrible solution(水) 题意: 给出一系列数字,求两两异或为x有几对。 要点: 看范围10^5就知道直接循环肯定gg,所以用一个num[x]存储x出现过几次,一般用两个for可以简化,像下面这样: #include<cstdio>#include<iostream>#include<cstring>#include<...
Pipes are connected if they are adjacent in the system and their ends are connected. Here are examples of connected pipes: Examples of connected pipes Let’s describe the problem using some example: The first example input And its solution is below: ...
In the second sample the friends will only implement the second problem, as Vasya and Tonya are sure about the solution. 懒得说 #include<cstdio>#include<cstring>#include<algorithm>usingnamespacestd;inta[1005][10];intmain(){intn,ans=0;scanf("%d",&n);for(inti=0;i<n;i++){intcnt=0...
If there is no solution to the problem, print -1. Otherwise print four space-separated integers that correspond to the coordinates of the two other trees. If there are several solutions you can output any of them. Note that must be in the range ( - 1000 ≤ ...
The package for this problem was not updated by the problem writer or Codeforces administration after we've upgraded the judging servers. To adjust the time limit constraint, a solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers,...