joj

JOJ 上的典型题目分类以及参考书目

JOJ上的典型题目分类以及参考书目                                        ----摘录自《吉林大学ACM国际大学生程序设计竞赛简介》训练重点:基本算法,基本程序设计能力基本算法
yoyouhappy的秘密花园·2007-07-17 20:00

yoyo的假期作业

yoyo的假期作业教练布置了20+10道题，kaka听说不简单作业：JOJ1004101610171034    1050106210651083109211011151116711701171117411751183117811131129
yoyouhappy的秘密花园·2007-07-17 17:00

JOJ ACM 1149

Given a positive integer n, nd the positions of all 1's in its binary representation. The position of the least significant bit is 0. Example The positions of 1's in the binary representation
fuliang·2007-04-09 23:00

JOJ ACM 1149

Given a positive integer n, nd the positions of all 1's in its binary representation. The position of the least significant bit is 0. Example The positions of 1's in the binary representation
fuliang·2007-04-09 23:00

JOJ ACM 1107

The most important part of a GSM network is so called Base Transceiver Station (BTS). These transceivers form the areas called cells (this term gave the name to the cellular phone) and every phone con
fuliang·2007-04-09 23:00

JOJ ACM 1107

The most important part of a GSM network is so called Base Transceiver Station (BTS). These transceivers form the areas called cells (this term gave the name to the cellular phone) and every phone con
fuliang·2007-04-09 23:00

JOJ ACM 1146

For each list of words, output a line with each word reversed without changing the order of the words. This problem contains multiple test cases! The first line of a multiple input is an integer N
fuliang·2007-04-09 23:00

JOJ ACM 1146

For each list of words, output a line with each word reversed without changing the order of the words. This problem contains multiple test cases! The first line of a multiple input is an integer N
fuliang·2007-04-09 23:00

JOJ ACM 1148

A prime number is a counting number (1, 2, 3, ...) that is evenly divisible only by 1 and itself. In this problem you are to write a program that will cut some number of prime numbers from the list of
fuliang·2007-04-09 23:00

JOJ ACM 1148

A prime number is a counting number (1, 2, 3, ...) that is evenly divisible only by 1 and itself. In this problem you are to write a program that will cut some number of prime numbers from the list of
fuliang·2007-04-09 23:00

JOJ ACM 2155

Mr. Jojer has written an article, but now he wants to make a copy of it and check out how many characters he has used. Input and Output You will be given an article, you should output this article
fuliang·2007-04-09 23:00

JOJ ACM 2155

Mr. Jojer has written an article, but now he wants to make a copy of it and check out how many characters he has used. Input and Output You will be given an article, you should output this article
fuliang·2007-04-09 23:00

JOJ ACM 1237

1237 A character string is said to have period k if it can be formed by concatenating one or more repetitions of another string of length k. For example, the string "abcabcabcabc" has per
fuliang·2007-04-09 23:00

JOJ ACM 1237

1237 A character string is said to have period k if it can be formed by concatenating one or more repetitions of another string of length k. For example, the string "abcabcabcabc" has per
fuliang·2007-04-09 23:00

JOJ ACM 1184

To calculate the circumference of a circle seems to be an easy task - provided you know its diameter. But what if you don't? You are given the cartesian coordinates of three non-collinear points in
fuliang·2007-04-09 18:00

JOJ ACM 1184

To calculate the circumference of a circle seems to be an easy task - provided you know its diameter. But what if you don't? You are given the cartesian coordinates of three non-collinear points in
fuliang·2007-04-09 18:00

JOJ ACM 1149

Given a positive integer n, nd the positions of all 1's in its binary representation. The position of the least significant bit is 0. Example The positions of 1's in the binary representation of 13
fuliang·2007-04-09 17:00

JOJ ACM 1149

Given a positive integer n, nd the positions of all 1's in its binary representation. The position of the least significant bit is 0. Example The positions of 1's in the binary representation of 13
fuliang·2007-04-09 17:00

ACM常见问题解答

A：本次比赛不直接提供模拟题，选手可以直接到吉林大学ACM站点的在线测试（JOJ）中作题（http://acm.jlu.edu.cn）。站点上的题目与本次比赛
oraclestudy·2007-03-21 10:00
上一页 3 4 5 6 7 8 9 10 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他