Pinned Repositories
Adjacency-Matrix
题目描述 Give you a directed graph G with n nodes and m edges. Please print the adjacency matrix A of G. Hints: adjacency matrix is a way to represent a graph. Suppose we have a directed graph G, if there is an edge from node i to node j in G, we have A[i][j] = 1 in G’s corresponding adjacency matrix A, otherwise, A[i][j] = 0. 输入 The first line will be an integer T (1 <= T <= 50). T is the number of test case. For each test case, the first line will be two integers n and m. ( 1 <= n <= 500, 0 <= m <= n*n) Then there will be m lines. Each line will have two integers x y. x y means there is an edge from x to y. All nodes are labeled from 1 to n. 输出 For each test case, print the adjacency matrix. 样例输入 2 3 5 1 2 2 1 1 3 3 2 2 3 1 0 样例输出 0 1 1 1 0 1 0 1 0 0
afu.github.io
AiLearning
AiLearning: 机器学习 - MachineLearning - ML、深度学习 - DeepLearning - DL、自然语言处理 NLP
Algorithm-learning
algorithm design and analysis
An-Information-Theoretic-Analysis-for-Federated-Learning-under-Concept-Drift
An-Information-Theoretic-Analysis-for-Federated-Learning-under-Concept-Drift
aurora-imui
General IM UI components. Android/iOS/RectNative ready. 通用 IM 聊天 UI 组件,已经同时支持 Android/iOS/RN。
auto-attack
Code relative to "Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attacks"
AutoAE
AAAI-23: Reliable Robustness Evaluation via Automatically Constructed Attack Ensembles
awesome-courses
:books: List of awesome university courses for learning Computer Science!
document-scanner-1
An OpenCV based document scanner
LeegerPENG's Repositories
LeegerPENG/document-scanner-1
An OpenCV based document scanner
LeegerPENG/Adjacency-Matrix
题目描述 Give you a directed graph G with n nodes and m edges. Please print the adjacency matrix A of G. Hints: adjacency matrix is a way to represent a graph. Suppose we have a directed graph G, if there is an edge from node i to node j in G, we have A[i][j] = 1 in G’s corresponding adjacency matrix A, otherwise, A[i][j] = 0. 输入 The first line will be an integer T (1 <= T <= 50). T is the number of test case. For each test case, the first line will be two integers n and m. ( 1 <= n <= 500, 0 <= m <= n*n) Then there will be m lines. Each line will have two integers x y. x y means there is an edge from x to y. All nodes are labeled from 1 to n. 输出 For each test case, print the adjacency matrix. 样例输入 2 3 5 1 2 2 1 1 3 3 2 2 3 1 0 样例输出 0 1 1 1 0 1 0 1 0 0
LeegerPENG/afu.github.io
LeegerPENG/Algorithm-learning
algorithm design and analysis
LeegerPENG/awesome-courses
:books: List of awesome university courses for learning Computer Science!
LeegerPENG/CNTK
Microsoft Cognitive Toolkit (CNTK), an open source deep-learning toolkit
LeegerPENG/CS-180
UCLA CS 180
LeegerPENG/Data-Base-Learning
CS307
LeegerPENG/demo4Fish
仿闲鱼首页Demo
LeegerPENG/JAVA-learning
LeegerPENG/leegerPENG.github.io
LeegerPENG/Neural-Style-Transfer-Papers
:pencil2: Neural Style Transfer: A Review
LeegerPENG/ResNet20-CIFAR-10
ResNet20, CIFAR-10,
LeegerPENG/tabbar
Android仿淘宝闲鱼底部TabBar,Base from https://github.com/NoCodeNoWife/LLRiseTabBar-Android
LeegerPENG/tutorials
机器学习相关教程
LeegerPENG/XianYu
仿闲鱼 App