algzjh的博客

Can you find it? Time Limit: 10000/3000 MS (Java/Others)    Memory Limit: 32768/10000 K (Java/Others) Total Submission(s): 23263    Accepted Submission(s): 5880 Problem Description Give you

UmBasketella Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6840 Accepted: 2648 Description In recent days, people always design new things with multifu

Texas Trip Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5347 Accepted: 1657 Description After a day trip with his friend Dick, Harry noticed a strange

Line belt Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3923    Accepted Submission(s): 1523 Problem Description In a two-dimensio

C - Cup Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Practice HDU 2289 uDebug Descripti

Toxophily Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1939    Accepted Submission(s): 1061 Problem Description The recreation ce

Strange fuction Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6170    Accepted Submission(s): 4366 Problem Description Now, here is

Strange fuction Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5976    Accepted Submission(s): 4230 Problem Description Now, here is

Party All the Time Time Limit: 6000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5283    Accepted Submission(s): 1640 Problem Description In the Da

find the nth digit Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 11884    Accepted Submission(s): 3572 Problem Description 假设： S1

算法实验#include<iostream> #include<cstring> #include<cmath> #include<ctime> #include<cstdlib> #include<algorithm> #include<iomanip> #include<fstream> #include<vector> #include<map> using namespace std; co

Description作为老人的小明非常忧伤，因为他马上要被流放到本部去了，住进全左家垅最有历史感的11舍真是一件非常荣幸的事情。 搬行李是个体力活，小明发现自己的行李太多啦，所以他决定去买很多个袋子来装走。到了超市的小明发现，不同大小的袋子居然价格一样？？？虽然买最大的自然最赚，但是小明是名远近闻名的环保人士，他觉得袋子只要能装下他的行李就够了，并且为了不麻烦收银的小姐姐(⊙o⊙)…，他也只会购

Can you solve this equation? Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 16276    Accepted Submission(s): 7202 Problem Description

Sacrament of the sum Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 2270 Accepted: 1015 Description — The Brother of mine, the Head of Monastic Order want

Pie Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 14832 Accepted: 5088 Special Judge Description My birthday is coming up and traditionally I'm serv

4 Values whose Sum is 0 Time Limit: 15000MS Memory Limit: 228000K Total Submissions: 19783 Accepted: 5909 Case Time Limit: 5000MS Description The SUM problem can

ODDDIV - Odd Numbers of Divisors number-theory Given a positive odd integer K and two positive integers low and high, determine how many integers between low and high contain exactly K divisors.Input

Can you find it?Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/10000 K (Java/Others) Total Submission(s): 29478 Accepted Submission(s): 7353Problem Description Give you three seque

算法实验：#include<iostream> #include<cstring> #include<cmath> #include<ctime> #include<cstdlib> #include<algorithm> #include<iomanip> #include<fstream> #include<map> using namespace std; const int MAXN=1e5

#include<bits/stdc++.h> using namespace std; typedef long long LL; const int MAXN=1e5; int a[MAXN]; int n;int binarysearch(int x) { int L=1,R=n; int M; while(L<=R) { M=(L+R)/2;

Dirt RatioTime Limit: 18000/9000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 1087 Accepted Submission(s): 475 Special JudgeProblem Description In ACM/ICPC

ScheduleTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 153428/153428 K (Java/Others) Total Submission(s): 572 Accepted Submission(s): 219Problem Description There are N schedules, the i-t