3 haohulala

TA的排名 1w+

### 《Multiple-Operation Image Anti-Forensics with WGAN-GP Framework 》代码复现

2020-09-17 12:21:27

### 1051 Pop Sequence (25分)

Given a stack which can keepMnumbers at most. PushNnumbers in the order of 1, 2, 3, ...,Nand pop randomly. You are supposed to tell if a given sequence of numbers is a possible pop sequence of the stack. For example, ifMis 5 andNis 7, we can obta...

2020-08-29 09:24:36

### 1023 Have Fun with Numbers (20分)

Notice that the number 123456789 is a 9-digit number consisting exactly the numbers from 1 to 9, with no duplication. Double it we will obtain 246913578, which happens to be another 9-digit number consisting exactly the numbers from 1 to 9, only in a diffe

2020-08-14 15:41:12

### 1004 Counting Leaves (30分)

A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.Input Specification:Each input file contains one test case. Each case starts with a line containing0&lt;N&lt;100, the number of nod.

2020-08-13 13:46:19

### 基于pytorch的segnet实现，使用camvid数据集训练

2020-08-01 13:19:24

### 基于pytorch的FCN网络简单实现

2020-07-29 11:48:48

### 使用pytorch进行迁移学习模型下载失败解决办法

2020-07-26 20:25:12

### 神经网络中转置卷积上采样与反最大池化上采样的对比

2020-07-23 20:51:55

### 1102 Invert a Binary Tree (25分)

The following is from Max Howell @twitter:Google: 90% of our engineers use the software you wrote (Homebrew), but you can't invert a binary tree on a whiteboard so fuck off.Now it's your turn to prove that YOU CAN invert a binary tree!Input Specifi

2020-07-16 19:16:10

### pytorch CNN CIFAR10数据集识别

2020-07-16 14:55:24

### 1021 Deepest Root (25分)

A graph which is connected and acyclic can be considered a tree. The height of the tree depends on the selected root. Now you are supposed to find the root that results in a highest tree. Such a root is calledthe deepest root.Input Specification:Each .

2020-07-15 15:52:32

### 卷积动画详解

2020-07-14 10:43:31

### 1020 Tree Traversals (25分)

Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to output the level order traversal sequence of the corresponding binary tree.Input Specification:Each inpu

2020-07-13 16:20:13

### pytorch全连接神经网络进行MNIST识别

2020-07-13 11:42:22

### 1103 Integer Factorization (30分)

TheK−Pfactorization of a positive integerNis to writeNas the sum of theP-th power ofKpositive integers. You are supposed to write a program to find theK−Pfactorization ofNfor any positive integersN,KandP.Input Specification:Each input ...

2020-07-10 10:14:15

### 1037 Magic Coupon

The magic shop in Mars is offering some magic coupons. Each coupon has an integerNprinted on it, meaning that when you use this coupon with a product, you may getNtimes the value of that product back! What is more, the shop also offers some bonus produ...

2020-07-10 08:33:48

### 1033 To Fill or Not to Fill

1033To Fill or Not to Fill(25分)With highways available, driving a car from Hangzhou to any other city is easy. But since the tank capacity of a car is limited, we have to find gas stations on the way from time to time. Different gas station may give di..

2020-07-09 17:07:38

### 1003 Emergency (25分)

As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the length of each road between any pair of cities are marked

2020-07-08 20:39:47

### python构建决策树

2020-07-03 12:22:06

### pytorch 实现minist手写识别体

from 莫烦pythonimport torchimport torch.nn as nnimport torch.utils.data as Dataimport torchvision # 数据库模块import matplotlib.pyplot as plttorch.manual_seed(1) # reproducible# Hyper ParametersEPOCH = 1 # 训练整批数据多少次, 为了节约时间, 我们只训练一次

2020-06-24 10:07:24

• 签到新秀
签到新秀
累计签到获取，不积跬步，无以至千里，继续坚持！
• 新人勋章
新人勋章
• 持之以恒
持之以恒
授予每个自然月内发布4篇或4篇以上原创或翻译IT博文的用户。不积跬步无以至千里，不积小流无以成江海，程序人生的精彩需要坚持不懈地积累！
• 1024勋章
1024勋章
#1024程序员节#活动勋章，当日发布原创博客即可获得
• 勤写标兵Lv4
勤写标兵Lv4
授予每个自然周发布9篇以上（包括9篇）原创IT博文的用户。本勋章将于次周周三上午根据用户上周的博文发布情况由系统自动颁发。
• 学习力
学习力
《原力计划【第二季】》第一期主题勋章 ，第一期活动已经结束啦，小伙伴们可以去参加第二期打卡挑战活动获取更多勋章哦。
• 原力新人
原力新人
在《原力计划【第二季】》打卡挑战活动中，成功参与本活动并发布一篇原创文章的博主，即可获得此勋章。
• 分享小兵
分享小兵
成功上传3个资源即可获取