杭电基础
蠢材在学习中
Gluskin
盒盒盒
展开
-
杭电oj2123(JAVA
Problem DescriptionIn this problem you need to make a multiply table of N * N ,just like the sample out. The element in the ithrow and jthcolumn should be the product(乘积) of i and j.InputThe first line of input is an integer C which indicate th..原创 2021-11-26 11:53:17 · 303 阅读 · 0 评论 -
杭电oj1013(JAVA
Problem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting value contains two or more digits, those digits are s.原创 2021-11-20 16:43:34 · 402 阅读 · 0 评论 -
杭电oj2502(JAVA
Problem Description当寒月还在读大一的时候,他在一本武林秘籍中(据后来考证,估计是计算机基础,狂汗-ing),发现了神奇的二进制数。如果一个正整数m表示成二进制,它的位数为n(不包含前导0),寒月称它为一个n二进制数。所有的n二进制数中,1的总个数被称为n对应的月之数。例如,3二进制数总共有4个,分别是4(100)、5(101)、6(110)、7(111),他们中1的个数一共是1+2+2+3=8,所以3对应的月之数就是8。Input给你一个整数T,表示输入数据...原创 2021-11-18 19:12:00 · 101 阅读 · 0 评论 -
杭电oj2053(JAVA
import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner sc=new Scanner(System.in); while(sc.hasNext()) { int n=sc.nextInt();//第几个灯 int e=0;//记录灯的状态 for (int i = 1; i <= n; i++) { if (n%i==0) .原创 2021-11-16 15:02:52 · 564 阅读 · 0 评论 -
杭电oj2088(JAVA
Problem DescriptionLittle Bob likes playing with his box of bricks. He puts the bricks one upon another and builds stacks of different height. “Look, I've built a wall!”, he tells his older sister Alice. “Nah, you should make all stacks the same height..原创 2021-11-15 19:34:51 · 366 阅读 · 0 评论 -
杭电oj2076(JAVA
Problem Description时间过的好快,一个学期就这么的过去了,xhd在傻傻的看着表,出于对数据的渴望,突然他想知道这个表的时针和分针的夹角是多少。现在xhd知道的只有时间,请你帮他算出这个夹角。注:夹角的范围[0,180],时针和分针的转动是连续而不是离散的。Input输入数据的第一行是一个数据T,表示有T组数据。每组数据有三个整数h(0 <= h < 24),m(0 <= m < 60),s(0 <= s < 60)分别表示时、分、秒.原创 2021-11-15 17:29:33 · 96 阅读 · 0 评论 -
杭电oj2111(JAVA
话说上回讲到海东集团面临内外交困,公司的元老也只剩下XHD夫妇二人了。显然,作为多年拼搏的商人,XHD不会坐以待毙的。一天,当他正在苦思冥想解困良策的时候,突然想到了自己的传家宝,那是公司成立的时候,父亲作为贺礼送来的一个锦囊,徐父当时交代,不到万不得已的时候,不要打开它。“现在不正是最需要的时候吗?”,一边想,XHD一边找到了这个精心保管的锦囊,打开一看,里面只有一句话“杭城北麓千人洞有宝”。二话不说,XHD拿起一个大口袋就出发了,这个千人洞他是知道的,小的时候,爸爸曾经带他来过这个隐蔽的路口...原创 2021-11-12 16:37:29 · 70 阅读 · 0 评论 -
杭电oj1009(JAVA
FatMouse' TradeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33703 Accepted Submission(s): 10981Problem DescriptionFatMouse prepared M p...原创 2021-11-09 21:31:23 · 101 阅读 · 0 评论 -
HUD2060(JAVA
求出最大得分可能的思路,1.当Ball_Left<=6时,必剩下颜色球,由高分球黑球开始累加得到最大分数2.当Ball_Left>6时,必存在6个颜色球,接着我们可知道(Ball_Left - 6)为所剩的红球数目,随后击中黑球得分最高import java.util.Scanner;public class Main2060 { public static void main(String[] args) { Scanner sc = new Scanner(System原创 2021-11-06 21:48:35 · 100 阅读 · 0 评论 -
HUD2022(JAVA
import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner sc=new Scanner(System.in); while (sc.hasNext()) { int n=sc.nextInt(); int m=sc.nextInt(); int a=0,b=0; .原创 2021-10-28 12:45:45 · 158 阅读 · 0 评论 -
杭电oj2032(JAVA
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while(sc.hasNext()){ int n=sc.nextInt(); int arr[][]=new int[n].原创 2021-10-28 12:44:08 · 129 阅读 · 0 评论 -
杭电oj2035(JAVA
import java.util.Scanner;public class Main {public static void main(String[] args) { Scanner scanner=new Scanner(System.in); while (scanner.hasNext()){ int a=scanner.nextInt()%1000;//直接取后三位,方便后续高效运算 int b=scanner.nextInt(); if (a==0&&b==.原创 2021-10-27 16:59:19 · 180 阅读 · 0 评论 -
杭电oj2020(JAVA
import java.util.Scanner;public class Main2020 { public static void main(String[] args) { Scanner sc=new Scanner(System.in); while(sc.hasNext()){ int n=sc.nextInt(); int arr[]=new int[n]; if(n==0){break;} for (int i = 0; i < arr.len.原创 2021-10-27 14:33:30 · 135 阅读 · 0 评论