win10+tensorflow-gpu(1.12.0)+cuda9.0+cudnn成功配置多台机器

舍友买了几台新笔记本,我们装tensorflow玩玩,实测1060MQ,1060,甚至960显卡都ok 第一步:下载安装anaconda3 第二步:安装tensorflow-gpu 打开anaconda prompt,输入命令 pip install tensorflow-gpu -i htt...

2018-11-15 13:01:16

阅读数 3851

评论数 0

HDU 1094 A+B for input-output practice(6)

problem description Your task is to calculate the sum of some integers. input Input contains multiple test cases, and one case one line. Each case...

2018-09-02 12:02:28

阅读数 71

评论数 0

HDU 1093 for input-output practice(5)

problem description Your task is to calculate the sum of some integers. input Input contains an integer N in the first line, and then N lines foll...

2018-09-02 11:56:08

阅读数 56

评论数 0

HDU 1092 for input-output practice(4)

problem description Your task is to Calculate the sum of some integers. input Input contains multiple test cases. Each test case contains a intege...

2018-09-02 11:53:07

阅读数 53

评论数 0

HDU 1091 for input-output practice(3)

problem description Your task is to Calculate a + b. input Input contains multiple test cases. Each test case contains a pair of integers a and b,...

2018-09-02 11:50:23

阅读数 51

评论数 0

HDU 1090 for input-output practice(2)

problem description Your task is to Calculate a + b. input Input contains an integer N in the first line, and then N lines follow. Each line consi...

2018-09-02 11:46:38

阅读数 37

评论数 0

HDU 1089 for input-output practice(1)

problem description Your task is to Calculate a + b. Too easy?! Of course! I specially designed the problem for acm beginners. You must have foun...

2018-09-02 11:39:12

阅读数 38

评论数 0

HDU 1087 super jumping!jumping!jumping!

problem description Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and k...

2018-09-02 11:36:33

阅读数 94

评论数 0

HDU 1064 financial management

problem description Larry graduated this year and finally has a job. He’s making a lot of money, but somehow never seems to have enough. Larry has d...

2018-09-02 11:17:35

阅读数 38

评论数 0

HDU 1062 text reverse

problem description Ignatius likes to write words in reverse way. Given a single line of text which is written by Ignatius, you should reverse all t...

2018-09-02 11:13:41

阅读数 41

评论数 0

HDU 1060 leftmost digit

解题思路: N^N用科学计数法表示为a*10^x 我们要得到的就是a 以10为底取对数 log10(N^N)=log10(a)+x Nlog10(N)=log10(a)+x log10(a)=Nlog10(N)-x a=10^(Nlog10(N)-x) 而由HDU 1018题(ht...

2018-09-02 11:09:34

阅读数 36

评论数 0

HDU 1052 tian ji--the horse racing

思路: 首先比较最慢的马。 1.如果田忌最慢的马比齐王最慢的马还慢:那么让田忌最慢的马去和齐王最快的马比。输一次。 2.如果田忌最慢的马比齐王最慢的马快:那么让两个比,胜一次。 3.如果最慢的马一样快:再比较田忌和齐王最快的马。如果田忌最快的马比齐王最快的马快,就让两个最快的马比。胜一次。...

2018-09-01 15:46:51

阅读数 30

评论数 0

HDU 1022 train problem 1(栈)

problem description As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(be...

2018-09-01 15:32:01

阅读数 50

评论数 0

HDU 1018 big number(求n!的位数)

problem description In many applications very large integers numbers are required. Some of these applications are using keys for secure transmission...

2018-09-01 15:16:11

阅读数 36

评论数 0

HDU 1010 tempter of the bone(DFS)

problem description The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, ...

2018-09-01 15:07:46

阅读数 38

评论数 0

HDU 1009 fatmouse' trade(贪心)

problem description FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBe...

2018-09-01 15:00:11

阅读数 48

评论数 0

HDU 1005 number sequence(重点题)

problem description A 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, yo...

2018-09-01 14:51:16

阅读数 55

评论数 0

HDU 1004 let the balloon rise

problem description contest time again! how excited it is to see balloons floating around. but to tell you a secret, the judges’ favourite time is s...

2018-09-01 14:10:16

阅读数 34

评论数 0

HDU 1003 max sum

problem description given 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),t...

2018-09-01 13:49:25

阅读数 32

评论数 0

HDU 1001 sum problem

problem description hey, welcome to HDOJ. in this problem, your task is to calculate SUM(n)=1+2+3+…+n. input the input will consist of a series ...

2018-09-01 13:19:34

阅读数 38

评论数 0

提示
确定要删除当前文章?
取消 删除