2017年03月_千与千与千

03月

原创 1022

Problem DescriptionAs the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station

2017-03-30 16:57:36 273

原创 1021

Problem DescriptionThere are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2). InputInput consists of a sequence of lines, each containing an i

2017-03-29 21:27:41 511

原创 1020

Problem DescriptionGiven a string containing only 'A' - 'Z', we could encode it using the following method:1. Each sub-string containing k same characters should be encoded to "kX" where "

2017-03-29 13:26:54 665

原创 1019

Problem DescriptionThe least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM of 5, 7 a

2017-03-29 11:43:46 544

原创 1018

Problem DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you

2017-03-29 11:06:59 572

原创 1017

Problem DescriptionGiven two integers n and m, count the number of pairs of integers (a,b) such that 0 This problem contains multiple test cases!The first line of a multiple input is an

2017-03-28 16:05:53 247

原创 1016

Problem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a pri

2017-03-28 15:08:21 407

原创 1015

Problem Description=== Op tech briefing, 2002/11/02 06:42 CST === "The item is locked in a Klein safe behind a painting in the second-floor library. Klein safes are extremely rare; most of the

2017-03-28 11:59:37 310

原创 1014

Problem DescriptionComputer simulations often require random numbers. One way to generate pseudo-random numbers is via a function of the formseed(x+1) = [seed(x) + STEP] % MODwhere '%' i

2017-03-27 15:35:53 642

原创 1013

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 resu

2017-03-27 12:33:25 332

原创 1012

Problem DescriptionA simple mathematical formula for e iswhere n is allowed to go to infinity. This can actually yield very accurate approximations of e using relatively small values of

2017-03-26 16:26:13 560

原创 1010

Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. H

2017-03-24 12:23:34 594

Problem DescriptionFatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.The warehouse has N rooms. The i-th room contai...

2017-03-22 11:12:11 456

原创 1008

#include using namespace std;int main(){ int N; while(cin>>N&&N<100&&N!=0) { int floor[100]={0}; for(int i=1;i<=N;i++) cin>>floor[i]; int sum=0;

2017-03-22 08:50:31 268

原创 1007(分治法，快速排序，但还是时间超限）

#include #include#include #include #include using namespace std;struct Point{ float x,y; bool operator <(const struct Point &t) { if(x==t.x) return y<t.y;

2017-03-20 15:40:44 596

原创 1007（数组，时间超限）

Problem DescriptionHave you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded.In the field of Cyberground, the

2017-03-19 11:16:04 626

原创 1005

Problem DescriptionA 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 are to calculate the value of f(n).

2017-03-18 16:26:50 344

原创 1004

Problem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the conte

2017-03-18 13:22:40 677

原创 1003

Problem DescriptionGiven 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 sum in this sequence is 6 + (-1) + 5 +

2017-03-18 12:24:08 496

原创 1001

Problem DescriptionHey, 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 o

2017-03-18 12:22:05 375

原创 1000

Problem DescriptionCalculate 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 Inp

2017-03-18 12:17:59 164

快速排序优化的几种方法代码实现

快速排序的几种优化方法，对各种优化进行了代码实现，包括使用随机基准，中位数基准、聚集基准等方法。快速排序的几种优化方法，对各种优化进行了代码实现，包括使用随机基准，中位数基准、聚集基准等方法。

2020-09-15

HPL_GPU.rar

使用Linpack测试GPU性能，教程，英文版，环境搭建、参数设置、执行命令都有，可以供参考，就是版本比较早，找不到比较新的版本

2020-07-18

SQL基础教程.rar

SQL基础教程——第二版。Oracle Database 12cR1、 SQL Server 2014、DB2 10.5、PostgreSQL 9.5.3、MySQL 5.7

2020-06-19

OpenACC并行编程实战

OpenACC并行编程实战，详细的介绍了各种构件和导语等，以及openacc的异步操作，与GPU的互操作等

2020-06-15

openmp-4.5.rar

OpenMP 4.5版本官方手册，OpenMP Application Programming Interface version 4.5

2020-06-13

openmp-3.0.rar

openmp官方手册，OpenMP Application Program Interface Version 3.0.