Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 66796 Accepted Submission(s): 1529
原创
2023-07-04 21:05:05
21阅读
u Calculate eTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12753Accepted Submission(s):
转载
2011-07-27 18:22:00
93阅读
2评论
Accepted today?" Yes, the sentence is mentioned frequently in lcy's course "
转载
2011-08-12 17:03:00
75阅读
2评论
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int STOP = 5;
int UP = 6;
int DOWN = 4;
Scann
原创
2023-05-10 09:55:29
78阅读
hdu1030一道有规律的数学题，
仔细分析就可以得出结果，嘿嘿。。
作者：贾钰(Jeick Jia) CS@SCU
时间：2011-4-25
Problem Description
A triangle field is numbered with successive integers in the way shown on the picture below
原创
2011-04-25 21:21:25
1381阅读
MilkTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5689Accepted Submission(s): 1291Problem DescriptionIgnatius drinks milk everyday, now he is in the supermarket and he wants to choose a bottle of milk. There are many kinds of milk in the supermar
转载
2011-08-01 19:19:00
95阅读
2评论
hdu1033题目很长，很难懂，愣是把题目翻来覆去读了好多遍，最后才晓得，原来是个很简单的问题。
向量的旋转，当前向量的末端是完成旋转后向量的起始端。相当于把向量沿着其方向平移其模长度后再旋转。
题目的大概意思就是这个，A顺时针旋转，V逆时针旋转，每次旋转均为90°。
设有点start，end，temp；start,end分别为向量的起始和终止端点，temp为旋转过程中向量的终点。
原创
2011-05-02 21:51:07
857阅读
ElevatorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16549Accepted Submission(s):
转载
2011-07-27 17:57:00
89阅读
2评论
AssignmentsTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 645Accepted Submission(s):
转载
2011-07-28 13:22:00
80阅读
2评论
TicketsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 385Accepted Submission(s): 192Problem DescriptionJesus, what a great movie! Thousands of people are rushing to the cinema. However, this is really a tuff time for Joe who sells the film tickets
转载
2011-08-05 10:52:00
109阅读
2评论
Osu!
Problem Description
Osu! is a very popular music game. Basically, it is a game about clicking. Some points will appear on the screen at some time, and you have to click them at a correct ti
转载
2017-07-31 14:55:00
77阅读
2评论
雪影蓝枫 如果可以，每个人都愿意走向优秀！当你下定了决心时，就意味着你要比别人付出更多！ by @scau_Joseph HDU ACM 1050 Moving Tables Problem Description The famous ACM (Advanced Computer Maker) Company has rented a floor of a buildin
原创
2013-08-02 11:35:00
874阅读
Number SequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s):
转载
2011-07-26 16:35:00
79阅读
2评论
Permutation CountingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 493Accepted Submission(s):
转载
2011-07-28 16:09:00
90阅读
2评论
Humble NumbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6085Accepted Submission(s): 2639Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16,
转载
2011-07-31 21:43:00
93阅读
2评论
SeasideTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 396Accepted Submission(s): 272Problem DescriptionXiaoY is living in a big city, there are N towns in it and some towns near the sea. All these towns are numbered from 0 to N-1 and XiaoY lives i
转载
2011-07-28 16:35:00
36阅读
2评论
nt dep, int n, int m)beginoutput the value of dep.if dep < m and x[a[dep]] + x[b[dep]] != c[dep] t
转载
2011-08-22 23:56:00
70阅读
2评论
JohnTime Limit: 5000/1000 MS (Java/Others)Memory L
转载
2011-08-29 16:15:00
106阅读
2评论
#include
char str[1001];
int main(){
while(scanf("%s",str)&&(str[0]-'0')){
int i=0;
int sum=0;
while(str[i]){
sum+=str[i++]-'0';
}
int n=sum;
原创
2023-08-21 16:40:53
69阅读
Uniform GeneratorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6215Accepted Submission(s):
转载
2011-07-27 23:23:00
100阅读
2评论
