回答的问题(155)

1071. Speech Patterns (25)

1

import java.util.HashMap; import java.util.Map; import java.util.Map.Entry; import java.util.Scanner; public class Main { public static void main(Str...

发表于 2016-07-25 19:49:44
Find More Coins (30)

1

import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in)...

发表于 2016-07-25 16:31:37
A+B in Hogwarts (20)

1

import java.util.Scanner; public class Main{ private static final int[] W = {100000000,17,29}; public static void main(String[] args) { Scanner in...

发表于 2016-07-23 20:03:06
To Fill or Not to Fill (25)

2

import java.util.Iterator; import java.util.PriorityQueue; import java.util.Queue; import java.util.Scanner; import java.util.TreeSet; public class Ma...

发表于 2016-07-23 17:52:33
A+B and C (64bit) (20)

1

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt();...

发表于 2016-07-22 21:33:16
Student List for Course (25)

0

java最后一个超时 import java.util.Scanner; import java.util.TreeSet; public class Main { public static void main(String[] args) { Scanner in = ...

发表于 2016-07-20 19:14:41
Set Similarity (25)

3

import java.util.HashSet; import java.util.Scanner; public class No1021 { public static void main(String[] args) { Scanner in = new Scanner(System....

发表于 2016-07-19 22:07:35
Are They Equal (25)

1

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt();...

发表于 2016-07-18 23:34:26
Prime Factors (25)

1

import java.util.Scanner; import java.util.ArrayList; public class Main { public static void main(String[] args) { Scanner in = new Scanner(System....

发表于 2016-07-18 16:39:37
Stack (30)

3

import java.util.Scanner; import java.util.Stack; public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in);...

发表于 2016-07-17 20:36:52

扫描二维码，关注牛客网
意见反馈
下载牛客APP，随时随地刷题

扫一扫，把题目装进口袋

求职之前，先上牛客: 扫描二维码，进入QQ群



扫描二维码，关注牛客公众号

公司地址：北京市朝阳区北苑路北美国际商务中心K2座一层-北京牛客科技有限公司
联系方式：010-60728802 投诉举报电话：010-57596212（朝阳人力社保局）
牛客科技© All rights reserved admin@nowcoder.com
京ICP备14055008号-4 增值电信业务经营许可证营业执照人力资源服务许可证
京公网安备 11010502036488号