If today is Wednesday, the day after Tomorrow is Friday, if today is Saturday, the day after Tomorrow is Monday. We correspond Monday to Sunday with numbers 1 to 7. Given one day, please output that day "day after Tomorrow" is the days of the week.
Today for the group competition, had to give up personal netease written test ...
3h only AC l1-1 ~ l1-8, l2-1, l2-3 ~ l2-4, l3-1 (all AC after the game)
L2-2 (AC) and l3-3 (AC) each had 22 points, L2-2 first wanted to use the list to simulate, but
Record a vegetable-driven growth.
Topic links
A look at the topic, I thought you can use the LCA algorithm to write, wrote a half-day, later found not a tree (WOC ...)Look at the topic, not more than 5 generations, then the direct mob Search,
When
Gregory larsen,2016/01/01 (first released: 2014/01/29)original link:http://www.sqlservercentral.com/articles/Stairway+Series/104517/this SeriesThis article is part of the stair series: T-SQL Staircase: Beyond the basicsfrom his staircase to the
Use BFS breadth search First BFS find Endword, while storing the number of layers in each word and then endword as the target, find Startword, build the path.
hashmap path = new hashmap (); BFS generates path void BFs (string start, String end,
Topic Link: Click to open the link
IDEA: Analog Division operations
#include
using namespace std;
int main () {
int num;
int temp = 0,cnt = 0;
string s = "";
CIN >> num;
do{
cnt++;
Temp = temp * + 1;
S.append (1, ' 0 ' + (temp/num));
#include #include #include #
include #include #include using namespace std;
const int size=500;
const int inf=0x3f3f3f3f;
Input list int n,m,s,d;
temporary variables int i,j,t;
Auxiliary vector vectorrescueteamnum;//do not think that the vector
This question is not difficult. The essence is BFS. Starting from a word, his next layer can be changed step by step and never changed to those strings. The question is, how can we determine the strings that can be changed? There are two conditions:
Given two words (start and end), and a dictionary, find all shortest transformation sequence (s) from start to end, such that:
Only one letter can be changed at a time
Each intermediate word must exist in the dictionary
For example,
Given:Start =
Footage of the picture is a bit messy, the sky part of the white, the overall is not very good. When dealing with the background part of the deep pressure to reduce the clutter of the area, and then give the sky part of the light material, the final
Backlight in the darker environment is more beautiful. The position of the light source is set first, then the remote area is deepened, the highlight color turns to a slightly brighter orange or orange red, and the sunlight effect is rendered at the
There is a listing here ↑
3h only AC l1-1 ~ l1-8, l2-1 ~ l2-3, l3-2
L3-1 is nearly finished, or the hand is too slow.
L2-4 (Keng Gen forgot how to write ...) "Finished" and l3-3 don't have time to read it.
Match website:
6-1 Simple output integer (10 points)
This requires implementing a function that prints all positive integers from 1 to n for a given positive integer n. function Interface Definition:
void printn (int N);
where n is the parameter passed in by
l1-024. Acquired time limitMemory Limit 65536 KBCode length limit 8000 BChen, standard author of the procedure for the award of questions
If today is Wednesday, the day after Tomorrow is Friday, if today is Saturday, the day after Tomorrow is Monday.
l2-001. Emergency response time limit of MSMemory Limit 65536 KBCode length limit 8000 BChen, standard author of the procedure for the award of questions
As the head of a city's emergency rescue team, you have a special national map. The map shows a
l2-023. Graph coloring problem time limit (ms)Memory Limit 65536 KBCode length limit 8000 BChen, standard author of the procedure for the award of questions
The graph coloring problem is a well-known NP-complete problem. Given the graph G = (V, E),
Topic Link: Click to open the link
Idea: STL set + sort
#include using namespace std;
String name[105];
int num[105];
Double aver[105];
int cnt[105];
Set s;
struct node{int index,count;
Double average; Node (int a,int b,double C): Index (a),
to the flame retardant capacity requirements are much high.
According to the standard of gb12666.5-90 beam vertical combustion test, the flame retardant according to its capacity and test time (external fire ignition time) of the length of a, B, c three categories.
The calculation method of the specimen cable capacity is as follows:
V=n (S1-S2) ÷1000
The root number of n-cable specimen in type;
s1-Sample Cable outer section (MM2);
The sum of the metal area of the s2-sample cable (mm2);
S
Mineral deposits are processed into powder and then processed to produce a variety of high value-added products, which are widely used in metallurgy, chemical engineering, construction materials, and other industries. At present, domestic powder grinding equipment mainly include Raymond Mill, high-pressure suspension roller mill, three-ring medium speed mill, overpressure ladder grinding, etc. During this period, Raytheon Mill and
The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion;
products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the
content of the page makes you feel confusing, please write us an email, we will handle the problem
within 5 days after receiving your email.
If you find any instances of plagiarism from the community, please send an email to:
info-contact@alibabacloud.com
and provide relevant evidence. A staff member will contact you within 5 working days.