ACM
文章平均质量分 91
china丶龙少
编程,是一种艺术。程序,是一件艺术品。
不懂的人都觉得是几行代码的事,
但我们自己心里要清晰、明白,
忠于理想,不落情怀,天生骄傲…
展开
-
龙少的ACM OJ题解目录
一、 HDU1000 A+B Problem原创 2019-04-04 14:43:36 · 605 阅读 · 0 评论 -
第十三届 ACM/CCPC 吉林省赛 J. Send Scores Problem
ACM/CCPC 历届真题 题解目录Problem J. Send Scores ProblemTime Limit: 1000ms Memory Limit: 512MBDescriptionPlease calculate ⌊cos2((n−1)!+1nπ)⌋⌊\cos^2{(\frac{(n-1)!+1}{n}}π)⌋⌊cos2(n(n−1)!+1π)⌋Inpu...原创 2019-05-22 21:01:24 · 1525 阅读 · 0 评论 -
第十三届 ACM/CCPC 吉林省赛 I. IG
ACM/CCPC 历届真题 题解目录Problem I. IGTime Limit: 1000ms Memory Limit: 512MBDescriptioniG is the most powerful team in the game League of Legends. Now you’regiven a string only contains lowercase ...原创 2019-05-22 19:32:06 · 1341 阅读 · 0 评论 -
第十三届 ACM/CCPC 吉林省赛 G. Spotlight
ACM/CCPC 历届真题 题解目录Problem G. SpotlightTime Limit: 1000ms Memory Limit: 512MBDescriptionA light comes from point s, passed from point e, and finally go to infinite far.There is a light given...原创 2019-05-22 17:18:36 · 1560 阅读 · 0 评论 -
第十三届 ACM/CCPC 吉林省赛 E. Stick War
ACM/CCPC 历届真题 题解目录这里是引用题目大意:如上图方式用木棍拼方块,给你方块的数量,求最少需要用多少根木棍?分析:根据题意,我们很容易发现,将小方块拼成一个大方块,需要的木棍数量最少。那么我们就需要知道,nnn个小方块能拼成多大的大方块?答案是边长为[n][\sqrt{n}][n]。设t=[n],t= [\sqrt{n}],t=[n],而边长为ttt...原创 2019-05-22 11:11:30 · 1817 阅读 · 0 评论 -
第十三届 ACM/CCPC 吉林省赛 A. Boring Game
Problem A. Boring GameTime Limit: 1000ms Memory Limit: 512MBDescriptionLuna wants to play a boring game.She has three integers a, b, c in the beginning.She will play the game k rounds.Each rou...原创 2019-05-21 22:11:38 · 5716 阅读 · 2 评论 -
ACM/CCPC 历届真题 题解目录
一、第十三届 ACM/CCPC 吉林省赛A. Boring Game原创 2019-05-21 20:39:00 · 13858 阅读 · 7 评论 -
HDU 1005 Number Sequence
ACM OJ题解目录本题网址:https://cn.vjudge.net/problem/HDU-1005Number SequenceA number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you ...原创 2019-04-07 14:27:16 · 212 阅读 · 0 评论 -
HDU 1004 Let the Balloon Rise
ACM OJ题解目录本题网址:https://cn.vjudge.net/problem/HDU-1004Let the Balloon RiseContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges’ favorite time ...原创 2019-04-06 13:08:04 · 1067 阅读 · 0 评论 -
HDU 1003 Max Sum
ACM OJ题解目录本题网址:https://cn.vjudge.net/problem/HDU-1003Max SumGiven a sequence a[1],a[2],a[3]…a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max ...原创 2019-04-06 11:33:51 · 463 阅读 · 0 评论 -
HDU 1002 A + B Problem II
ACM OJ题解目录A + B Problem III have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B. InputThe first line of the input contains an integer T(1<...原创 2019-04-04 17:52:48 · 12617 阅读 · 0 评论 -
HDU 1001 Sum Problem
ACM OJ题解目录Sum ProblemHey, welcome to HDOJ(Hangzhou Dianzi University Online Judge).In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 + … + n. InputThe input will consist of a series...原创 2019-04-04 15:12:43 · 471 阅读 · 0 评论 -
HDU 1000 A+B Problem
HDU OJ 题解目录A + B ProblemCalculate A + B. InputEach line will contain two integers A and B. Process to end of file. OutputFor each case, output A + B in one line. Sample Input1 1 Sample O...原创 2019-04-04 14:39:57 · 636 阅读 · 0 评论 -
第十三届 ACM/CCPC 吉林省赛 B. Gift Node
ACM/CCPC 历届真题 题解目录Problem B. Gift NodeTime Limit: 1000ms Memory Limit: 512MB DescriptionYou are given a tree with n nodes (numbered from 1 to n). The root is node 1. Each edge in this tree has a...原创 2019-05-24 11:36:04 · 2526 阅读 · 0 评论