WZJRJ28

Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 38865 Accepted: 16594DescriptionYou have just moved from Waterloo to a big city. The people here speak an incompre

Bubble SortTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 475    Accepted Submission(s): 291Problem DescriptionP is a permutation o

Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62（音：laoer）。杭州交通管理局经常会扩充一些的士车牌照，新近出来一个好消息，以后上牌照，不再含有不吉利的数字了，这样一来，就可以消除个别的士司机和乘客的心理障碍，更安全地服务大众。不吉利的数字为所有含有4或62的号码。例如：62315 73418 88914都属于不吉利号码。但是，61152虽然含有6和

题意：直线上有n个等距的村庄，每个村庄要么买酒要么卖酒，把k个单位的酒从一个村庄运送到另一个村庄需要k个单位的劳动力，问最少需要多少劳动力。分析：考虑最左边的村庄，它的需求是a[i]，那么它需要向第二个村庄转移abs(a[i])个需求，第二个村子现在需求为a[1]+a[2]，再转移abs(a[1]+a[2])...以此类推累加答案即可。#include#include#

DescriptionThe cows, as you know, have no fingers or thumbs and thus are unable to play Scissors, Paper, Stone' (also known as 'Rock, Paper, Scissors', 'Ro, Sham, Bo', and a host of other names) i

Problem DescriptionDeep neural networks (DNN) have shown significant improvements in several application domains including computer vision and speech recognition. In computer vision, a particular ty

题意：有X和Y两类机器人各n m个，现在要将所有机器人上的信息传送到基点Base.同一时刻每个机器人(包括Base)只能发给一个对象，也只能接受一个对象的信息.X类的机器人发送数据的时间是x，Y类的是y. (x 分析：f(n,m) = f(n,(m-n)/2) + y (m >= n)            f(n,m) = f((n-m)/(pow(2,y/x)) + m,0

DescriptionA balanced number is a non-negative integer that can be balanced if a pivot is placed at some digit. More specifically, imagine each digit as a box with weight indicated by the digit. W

G. Maximum Producttime limit per test1 secondmemory limit per test256 mebibytesinputstandard inputoutputstandard outputFind the number from the range [a, b] which has the

A. Sonya and Queriestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputToday Sonya learned about long integers and invit

E. Garlandstime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLike all children, Alesha loves New Year celebration. Dur

Problem DescriptionFor a number,if the length of continuous odd digits is even and the length of continuous even digits is odd,we call it odd-even number.Now we want to know the amount of odd-even n

题意：给n个点m条边的图，每条边有一个权重，表示两端点的权值和，每个点的权值为0或1，问所有点的最小权重。分析：类似2-SAT的方法对全图染色，注意每个点染两次，取最小值。#include#include#include#include#include#include#include#include#include#include#include#in

题意：给你一些中缀表达式，求他们的后缀表达式。分析：这题主要难点在空行的判断啊T_T.#include#include#include#define N 1005using namespace std;const bool camp[7][7] ={ {1,1,0,0,0,1,1},{1,1,0,0,0,1,1},{1,1,1,1,0,1,1},

题意：给定n和k，问每隔k人的n人约瑟夫游戏中最后出局的三个人的编号。分析:设f(i,j)表示共i个人的约瑟夫环中出局的第j个人的编号，我们每出局一个人重新编号后有f(i,j) = (f(i-1,j-1) + k) % i.#include#include#include#include#include#include#include#include

Another MeaningTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 558    Accepted Submission(s): 262Problem DescriptionAs is known to a

题意：jimmy下班需要穿过一个森林，所以打算每天沿着一条不同的路径回家，他只沿着满足如下条件的(A,B)走：存在一条从B出发的回家路，比所有从A出发的回家路都短，问你一共有多少种回家方案，1为家，2为起点。分析：求一遍从2开始的单元最短路，然后从新构图，只保留d(a) > d(b) 的 (b,a)边，注意这一定是一个DAG(有向无环图)，然后拓扑排序后DP。#

Problem DescriptionProfessor Zhang has kinds of characters and the quantity of thei-th character is ai. Professor Zhang wants to use all the characters build several palindromic strings. He al

A tuple of positive integers {x1, x2, ..., xk} is called simple if for all pairs of positive integers(i,  j) (1  ≤ i  j ≤ k),xi  +  xj is a prime.You are given an array a with n positive integ

Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 37213 Accepted: 12053DescriptionFarmer John wants to repair a small length of the fence around the pasture. He mea

Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3616 Accepted: 1798DescriptionThe CE digital company has built an Automatic Painting Machine (APM) to paint a flat

Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 13871 Accepted: 4932Description将一个８*８的棋盘进行如下分割：将原棋盘割下一块矩形棋盘并使剩下部分也是矩形，再将剩下的部分继续如此分割，这样割了(n-1)次后，连同最后剩下的矩形棋盘共有n块矩形棋

A Martian boy is named s — he has got this name quite recently from his parents for his coming of age birthday. Now he enjoys looking for his name everywhere. If he sees that he can obtain his name fr

Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 9132 Accepted: 4360DescriptionTransmitting and memorizing information is a task that requires different coding systems

Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 37441 Accepted: 10807DescriptionA single positive integer i is given. Write a program to find the digit located in the

题意：有n个老司机，n个下午路线和n个夜间路线，给每个老司机安排一个下午路线和夜间路线，使得每个路线恰好被分配到一个老司机，且需要支付给老司机的总加班费尽量少。如果一个司机的行驶总时间不超过d，则没有加班费，否则超过的部分每小时需要支付r块的加班费。分析：简单贪心，排序后首尾相加一定是最优的组合。#include #include #include using nam

You have an array a[1], a[2], ..., a[n], containing distinct integers from1 to n. Your task is to sort this array in increasing order with the following operation (you may need to apply it multiple

Problem DescriptionMZL loves xor very much.Now he gets an array A.The length of A is n.He wants to know the xor of all (Ai+Aj)(1≤i,j≤n)The xor of an array B is defined as B1 xor B2...xorBn 

POJ 3468 A Simple Problem with Integers（Splay实现）

Vasya works as a watchman in the gallery. Unfortunately, one of the most expensive paintings was stolen while he was on duty. He doesn't want to be fired, so he has to quickly restore the painting. He

Description一块花布条，里面有些图案，另有一块直接可用的小饰条，里面也有一些图案。对于给定的花布条和小饰条，计算一下能从花布条中尽可能剪出几块小饰条来呢？  Input输入中含有一些数据，分别是成对出现的花布条和小饰条，其布条都是用可见ASCII字符表示的，可见的ASCII字符有多少个，布条的花纹也有多少种花样。花纹条和小饰条不会超过1000个

白书原题，简单的单调队列。#include #include #include #define MAXN 100010using namespace std;int t,T,c,n,x[MAXN],y[MAXN],d[MAXN],f[MAXN],dis[MAXN],q[MAXN],w[MAXN]; int main(){ cin.sync_with_stdio(false);

Little Artem has invented a time machine! He could go anywhere in time, but all his thoughts of course are with computer science. He wants to apply this time machine to a well-known data structure:m

Given a directed graph with nnn nodes, labeled 0,1,⋯,n−10,1, \cdots, n-10,1,⋯,n−1.For each i,j> satisfies 0≤i0≤ijn, there exists an edge from the i-th node to the j-th node, the capacity of wh