Blue Bridge Cup AcWing learning notes 4-2 simulated learning (with relevant Blue Bridge real questions: wrong ticket, moving distance, date problem, flight time, takeout priority) (Java)
Students who participate in the blue bridge cup can pay attention to the blogger. The blogger is also preparing the Blue Bridge Cup and can brush questions with the blogger's blog.
Blue Bridge Cup
My AcWing
The title and pictures are from the counseling class of group ab of Blue Bridge Cup C + +
simulation
According to the operation g ...
Added by phant0m on Wed, 09 Mar 2022 06:42:04 +0200
selenium realizes the simulated Login of QQ space and b station
After working all night, it's too unfriendly for me as a novice. I'm going to cry. I finally succeeded. Come on, come on, rush, release it and leave a souvenir for myself
Let's talk about the idea first. When we use selenium automation, it's not very different from when you open the website. So why can you log in when you open the website? Bec ...
Added by gernot on Tue, 15 Feb 2022 22:03:36 +0200
Luogu UVA101 The Blocks Problem [simulation / linked list]
Input format Output format
Meaning translation Initially, there are from left to right
n
n
n wooden blocks numbered
0
...
n
−
1
...
Added by physaux on Thu, 10 Feb 2022 04:24:26 +0200
Summary of leetcode's simulated problem brushing 2
Summary of leetcode's simulated problem brushing 2
1-remodeling matrix Title Link: Title Link stamp here!!!
Idea: simulate the matrix remodeling process. If the number of elements of the original matrix and the remodeling matrix is different, the remodeling cannot be completed. On the contrary, the remodeling can be completed. First convert t ...
Added by coreyp_1 on Mon, 07 Feb 2022 04:32:27 +0200
The difference between c language memcpy() function and memmove() function and Its Simulation Implementation
1.memcpy()
1.1 INTRODUCTION
Header file: #include < string h> memcpy() is used to copy memory data. Its prototype is: void * memcpy ( void * dest, const void * src, size_t num ); memcpy() will copy the first num bytes of the memory content indicated by src to the memory address indicated by dest. Because the passed parameters are re ...
Added by shatztal on Sun, 30 Jan 2022 14:28:41 +0200
2022 Spring Festival blessing wechat automatic reply
As we all know, when we play games or watch the Spring Festival Gala all night, if your friends and relatives send you Spring Festival greetings at this time, and you happen to be in the group war or see the wonderful part, we can't take the time to reply to them. In case they call directly and interrupt our good time, it's easy to make us happ ...
Added by plutoplanet on Thu, 27 Jan 2022 10:47:09 +0200
Luogu P1518 [USACO2.4] two Tamworth cattle The Tamworth Two
That's clever~
Title Link: https://www.luogu.com.cn/problem/P1518
It's difficult to make a turn, and I don't know how to judge when the cycle ends. It's too konjac;
analysis:
1. Since neither cattle nor people can go out of the circle, it is easy to think of adding a circle of obstacles to the outer circle of the whole map, so there is no need ...
Added by rsammy on Wed, 26 Jan 2022 11:53:03 +0200
[data structure and algorithm] in-depth analysis of the solution idea and algorithm example of "spiral matrix"
1, Title Requirements
Give you a matrix with m rows and n columns. Please return all the elements in the matrix in a clockwise spiral order.Example 1:
Input: matrix = [[1,2,3],[4,5,6],[7,8,9]]
Output:[1,2,3,6,9,8,7,4,5]
Example 2:
Input: matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]
Output:[1,2,3,4,8,12,11,10,9,5,6,7]
Tips:
m == mat ...
Added by thegreatdanton on Tue, 04 Jan 2022 14:14:34 +0200
LeetCode 498. Diagonal traversal [c++/java detailed puzzle]
1. Title
Given a matrix with M x N elements (M rows, N columns), return all the elements in the matrix in the order of diagonal traversal, as shown in the following figure.
Example:
input:
[
[ 1, 2, 3 ],
[ 4, 5, 6 ],
[ 7, 8, 9 ]
]
output: [1,2,4,7,5,3,6,8,9]
Explain:
The total number of elements in a given matrix does not exce ...
Added by hurricane on Sat, 25 Dec 2021 19:12:23 +0200
Codeforces round #754 (Div. 2) C. dominiant character problem solving Report
Positive solution
#include<bits/stdc++.h>
#define ll long long
#define pii pair<ll,ll>
using namespace std;
const ll N=1e6+10;
ll n;
char arr[N];
void solve()
{
scanf("%lld",&n);
scanf("%s",arr+1);
ll cont=min(n,7LL);
for(ll i=2; i<=cont; i++)
{
for(ll j=i; j<=n; j++)
{
...
Added by project3 on Fri, 12 Nov 2021 20:51:58 +0200