精华内容
下载资源
问答
  • Crow-开源

    2021-04-14 04:33:08
    Crow是符合ASPICE PAM的需求管理和控制工具,其重点是维护工件(CRS,TRS,体系结构,设计,代码和测试)之间的双向可追溯性,并跟踪软件变更请求的影响。
  • crow::Crow app; using namespace crow::security_middleware; using Type = Sources::Type; // Configure HTTP security headers when adding middleware; they'll be returned with every response app....
  • 网格框架Crow.zip

    2019-07-19 11:00:27
    Crow 是一个用于网页上的网格框架,而不仅仅是网格。 标签:Crow CSS框架
  • Mike Crow 是一个用于 Node.js 和浏览器的微服务工具包。 这是我对 seneca 背后的概念的重写,将业务逻辑拆分为可更改的小块功能。 与 seneca 不同,mike 不关心硬件意义上的扩展,而是帮助您保持组织和灵活。 因此...
  • crow.github.io-源码

    2021-03-22 18:30:35
    crow.github.io
  • android-crow-viewer-源码

    2021-02-17 23:07:15
    android-crow-viewer
  • Crow是用于运行Web服务的C ++微框架。 它使用类似于Python的Flask的路由,使其易于使用。 它也非常快,击败了多个现有的C ++框架以及非C ++框架。 产品特点 易于布线(类似于长颈瓶)。 类型安全的处理程序。 速度...
  • Crow's Nest-开源

    2021-05-03 17:10:40
    Crow的巢是一个基于Web的Unix(类似)服务器监视工具,在测试过程中使用解释性语言脚本。
  • 由“ Crows by Crows”团队制作的游戏应用程序。 2016 Hackathon Entry。 使用 / 产品。 NodeQuest是一款具有以下功能的视频游戏: 前提。 您控制着一个武士,无法攻击,但具有跳跃技巧,他必须通过一个装满便便...
  • Memory and Crow

    2018-10-03 21:03:31
    Description There are n integers b1, b2, …, bn written in... For all i from 1 to n, values ai are defined by the crows performing the following procedure: The crow sets ai initially 0. The crow th...

    Description
    There are n integers b1, b2, …, bn written in a row. For all i from 1 to n, values ai are defined by the crows performing the following procedure:

    The crow sets ai initially 0.
    The crow then adds bi to ai, subtracts bi + 1, adds the bi + 2 number, and so on until the n’th number. Thus, ai = bi - bi + 1 + bi + 2 - bi + 3…
    Memory gives you the values a1, a2, …, an, and he now wants you to find the initial numbers b1, b2, …, bn written in the row? Can you do it?

    Input
    The first line of the input contains a single integer n (2 ≤ n ≤ 100 000) — the number of integers written in the row.

    The next line contains n, the i’th of which is ai ( - 109 ≤ ai ≤ 109) — the value of the i’th number.

    Output
    Print n integers corresponding to the sequence b1, b2, …, bn. It’s guaranteed that the answer is unique and fits in 32-bit integer type.

    Examples
    Input
    5
    6 -4 8 -2 3
    Output
    2 4 6 1 3
    Input
    5
    3 -2 -1 5 6
    Output
    1 -3 4 11 6
    Note
    In the first sample test, the crows report the numbers 6, - 4, 8, - 2, and 3 when he starts at indices 1, 2, 3, 4 and 5 respectively. It is easy to check that the sequence 2 4 6 1 3 satisfies the reports. For example, 6 = 2 - 4 + 6 - 1 + 3, and  - 4 = 4 - 6 + 1 - 3.

    In the second sample test, the sequence 1,  - 3, 4, 11, 6 satisfies the reports. For example, 5 = 11 - 6 and 6 = 6.

    分析可得bi=ai+ai+1

    #include <stdio.h>
    #include <stdlib.h>
    
    /* run this program using the console pauser or add your own getch, system("pause") or input loop */
    
    int main(int argc, char *argv[]) {
    	int n;
    	scanf("%d",&n);
    	int i;
    	int a[100000];
    	for(i=0;i<n;i++){
    		scanf("%d",&a[i]);
    	}
    	for(i=0;i<n-1;i++){
    		printf("%d ",a[i]+a[i+1]);
    	}
    	printf("%d\n",a[i]);
    	return 0;
    }
    
    展开全文
  • 3D-Crow.zip

    2019-09-17 12:01:31
    3D-Crow.zip,C快速打开小部件,3D建模使用专门的软件来创建物理对象的数字模型。它是3D计算机图形的一个方面,用于视频游戏,3D打印和VR,以及其他应用程序。
  • crow18120.github.io-源码

    2021-03-20 16:43:56
    crow18120.github.io
  • crow是一个简单的命令行实用程序,可让您在某些文件更改时运行任意命令。 演示版 每次保存文件时,乌鸦都会被用来重新执行测试的演示。另外,请参阅其他。 安装 用go get安装 go get github.com/maaslalani/crow 从...
  • 文章目录The CrowDefinition CROW(定义 CROWCROW's consequences(CROW 导致的后果)1. The INFANT - Their first steps...2. The CHILD - the next step3. The ADULT mind - Growing up MentallyConceptual ...

    The Crow

    Definition CROW(定义 CROW)

    Definition CROW: Build in limit. The maximum number of individual items a mind can hold in focus at any one time.

    定义 CROW:内置限制。一个头脑一次可以集中处理的最大单个项目数。

    Definition FOCUS: A choice. The selected items you choose to think about, hold in your mind, at any one time.

    定义 FOCUS:选择。您选择考虑的所选项目随时都牢记在心。

    Knowing What is your CROW is not a contest to see who can have the highest number. What is important is that you realize that you have a CROW. Look into yourself and see the CROW in action.

    知道自己的 CROW 并不是争辩谁可以拥有最高的数目。重要的是要意识到自己有 CROW。调查自己,看看 CROW 的作用。

    CROW’s consequences(CROW 导致的后果)

    The consequences of the limit of the number of items one can hold in focus.

    人的项目数限制的后果。

    1. The INFANT - Their first steps…

    Definition SENSATION: Individual stimuli.

    定义 SENSATION:个体刺激

    Definition PERCEPTION: Automatic integrations of sensations by the mind into one smell, one image, one sound, one taste… Etc.

    定义 PERCEPTION:头脑中的感觉自动整合为一种气味,一种图像,一种声音,一种味道…等等。

    Notice that your mind does the integration automatically, it takes MANY individual sensations and integrates them into ONE perception.

    请注意,您的大脑会自动进行整合,需要许多个感知并将其整合到一个感觉。

    The resulting single perception easily fit into the size of your minds focus, the crow. However, as you grow up, the number of perceptions accumulates, becoming overwhelming in type and number…

    由此产生的单一感知能力很容易适应您的注意力范围,即 CROW。但是,随着您的成长,感知的数量不断累积,其类型和数量变得越来越庞大……

    2. The CHILD - the next step

    Let’s use the same method, with all those perceptions… “Take MANY perceptions and convert it into ONE” abstraction. This time however the “Many-To-One Conversion” process will not be automatic. You have to CHOOSE to do it.

    让我们对所有这些感知使用相同的方法…“采用许多感知并将其转换为一个”抽象。但是,这次“多对一转换”过程将不会自动进行。您必须选择这样做。

    What is the ONE thing you are creating when you convert many perceptions to one new thing? YOU are creating ‘A’ mental entity, a word, an idea, a concept.

    当您将多种观念转化为一件新事物时,您正在创建的一件事物是什么?您正在创建一个心理实体,一个词,一个想法,一个概念。

    Words are your friend. A word represents all the MANY things that have that defined property. One WORD is easier to deal with mentally, rather than the huge number of actual things that have that property. Words are tools of cognition.

    单词是你的朋友。一个词代表具有定义属性的所有许多事物。一个单词在思想上更容易处理,而不是拥有该属性的大量实际事物。言语是认知的工具。

    DEFINITION Defining property: Characteristic(s) that explain the most about a thing.

    定义 属性:最能解释事物的特性。

    DEFINITION Concept: Mental Entity, represented by a word. That one word represents ALL things that share the defining characteristic(s).

    定义 概念:心理实体,用单词表示。这个词代表了所有具有共同特征的事物。

    DEFINITION Concept Formation: The act of looking at many things, selecting out those that have similar characteristics (defining characteristics) and creating a word that is use to represent all those specific things; past, present and future.

    定义 概念形成:观察许多事物,选择具有相似特征(定义特征)的事物,并创建一个用来表示所有特定事物的单词的行为;过去,现在和未来。

    DEFINITION First level concept: Concepts formed directly from observations of the physical world/perceptions.

    定义 一级概念:直接从对物理世界/感知的观察中形成的概念。

    DEFINITION Volitional: Choice, as in choosing to create and use concepts, as necessitated by the limited size of your crow.

    定义 自愿:选择,如选择创建和使用概念时,CROW 有限的尺寸所必需。

    3. The ADULT mind - Growing up Mentally

    It is Creating Concepts from Concepts.

    它是从概念创造概念。

    • Abstraction
    AbstractionStage
    Physical RealityThings have an identity
    Sensations from some organsAutomatic:Structures
    Perceptions from SensationsAutomatic:Infant level
    Concepts from PerceptionsVolitional:Child level
    Concepts from ConceptsVolitional:Adult level Mental Functioning

    Conceptual Hierarchy(概念层次)

    Concepts should NOT be disembodied things, floating around inside you head, disconnected from reality. You should be able to trace your concepts ‘up to the most abstract generalized concept’ and ‘down to the physical foundation of the conceptual hierarchy’

    概念不应该是无形的东西,漂浮在您的脑海中,与现实脱节。您应该能够“向上追溯到最抽象的广义概念”和“向下追溯到概念层次结构的物理基础”。

    DEFINITION KNOWLEDGE/UNDERSTANDING: Achieved only when you have a concept linked down through the conceptual hierarchy to the physical.

    定义 知识/理解:仅当您有一个概念通过概念层次结构向下链接到物理对象时才可实现。

    DEFINITION CONCEPUTAL HIERARCHY: also called a Conceptual Tree, or Inheritance Hierarchy. Achieved by the Identification of a new concept that is built upon prior concepts.

    定义 概念层次结构:也称为概念树或继承层次结构。通过识别基于先前概念的新概念来实现。

    The world around you…(总结升华)

    In every course of study you undertake, you should create a mental hierarchy for that topic. Why, it makes it vastly easier to hold the world in your mind, thus you become much quicker at applying that understanding and you become creative and actually enjoy your life.

    在您进行的每门学习课程中,您都应该为该主题创建一个思维层次。为什么,这使您轻松掌握世界,因此您可以更快地运用这种理解,变得富有创造力,并真正享受生活。

    The Puzzle of life: Knowledge is knowing what the pieces are, and how they fit together. Nothing less !

    人生之谜:知识就是知道各个部分是什么,以及它们如何组合在一起。没什么!

    Be sure to be able to connect your ideas back to physical reality !

    确保能够将您的想法与物理现实联系起来!


    1. The Crow, Concepts and the Concept Hierarchy

    Creating Concepts from Concepts:

    在这里插入图片描述

    Concepts should NOT be disembodied things, floating around inside you head, disconnected from reality. You should be able to trace your concepts ‘up to the most abstract generalized concept’ and ‘down to the physical foundation of the conceptual hierarchy’

    概念不应该是无形的东西,漂浮在您的脑海中,与现实脱节。您应该能够“向上追溯到最抽象的广义概念”和“向下追溯到概念层次结构的物理基础”。


    2. Data, Data Structures, UML, ADT and Implementation

    Digits – a Limited solution to your overflowing CROW…

    数字是一个很好的概念和抽象。

    How do you represent a count greater than the number of … number symbols/glyphs, greater then 9 ? Use a modern Number System.

    数字系统是对数字更高一层的抽象。


    3. C++ - IDE, Classes, ADT and the SDLC(Software Development Life Cycle)

    Each step of the SDLC needs to be Documented and Seriously Reviewed, with signature sign off.

    SDLC的每个步骤都必须记录在案,并经过认真审查,并签名签名。

    The ’conceptual hierarchy’ in we discussed in the CROW lecture is called an ‘Inheritance Hierarchy’ in OOP.

    Good programming is to only have functions public. WHY ? Well, when someone enters a value, you should pass the entered amount orvalue through a function to VALIDATE it. Good programming validates!

    验证!


    4. Lists

    Dangling Pointers:

    Issued delete ptrVar command.
    Did not set ptrVar to NULL.
    Memory released back to Memory Manager, and is now available for reuse.
    Tried to access memory at that location. Someone else is using it.
    Causes ERRORS.

    Memory Leak:

    Pointer Variable goes out of scope.
    Memory Address that was in pointer variable, still held by OS as being used.
    Causes you to run out of RAM… Think Internet 24 by 7, code running all the time.
    Ways to fix are to RE-Start system to reset memory, or fix the code.

    Good code example for pointer use:

    int *myPointer = NULL;      //create the pointer, use NULL to indicate pointer is empty
    myPointer = new int;        //allocate space in memory, assign address to pointer
    *myPointer = 36;            //store a value to the memory location
    delete myPointer;           //release memory back to memory manager, it now available for reuse
    myPointer =NULL;            //use NULL to indicate pointer is empty
    

    5. Search and Sort List - Big O

    all comparison sorts, and so cannot perform better than O(nlog n) in the average or worst case.

    integer sorting algorithms and other sorting algorithms that are not comparison sorts. As such, they are not limited by a O(nlog n) lower bound.


    6. Stack

    Stacks are commonly coded using pointers or arrays.


    7. Queue

    Queues are commonly coded using:

    1. Circular Array
      • cons: Maximum number of objects: add isFull operation.
    2. Open two direction linked list
      • pros: No maximum number of objects

    8. Trees and Recursion

    NOTE: an ADT LIST is a type of tree where each node has only one child.

    Tree sare commonly coded using:

    1. linked Tree
      • pros: No maximum number of objects
    2. Array
      • cons: Maximum number of objects: add isFull operation

    The Basic definition of Recursion: Recursion is the repetition of series of steps, and while doing so, breaks a problem down into successive smaller parts until they reach a situation where you can no longer break it into smaller parts… This smallest part is called the base or ending case.


    9. Heaps

    • Array Heap
    • Linked Heap: Heaps are incredibly difficult to implement with pointers. Nearly all implementation of Heaps are simply done with arrays or vectors.

    10. Priority Queue

    • ADT Unsorted List:
      • Very Inefficient.
    • ADT Sorted List:
      • More efficient. But when you insert a node, the LIST must be re-sorted.
    • ADT HEAP:
      • Very Efficient. The ADT Heap is a common Implementation of a Priority Queue, with its Min or MAX Parent-Child priority sort order.
    • Linked List:
      • Insert at the beginning of list –O(1), Find max O(N)–More Difficult to program.
    • Binary Search Tree:
      • Insert O(logN), Fine max O(logN).

    11. Binary Search Tree (BST)

    Recursion VS Iteration, Compare versions of Tree algorithms:

    1. Is the depth of recursion relatively shallow?
    2. Is the recursive solution shorter or cleaner?
    3. Is the recursive version much less efficient?

    12. File I/O

    1. 读示例
    2. 写示例
    3. 异常处理示例

    13. ADT Hash Table and Dictionary

    Two keys that product the same hash value. Collisions occur when different elements are mapped to the same cell.

    • Collision with Chaining: Chaining lets each cell in the table point to a linked list of entries that map there.
    • Collision with Linear Probing: fast if table is sparse
    • Double Hashing: use 2nd hash function

    Hashing is the process that calculates where in an array a data item should be, rather then searching for it.

    It allows efficient retrievals, insertions and deletions.

    Hash function should be easy to compute and it should scatter the items evenly throughout the table.

    Collisions occur when two different search keys hash into same array location. Two strategies to resolve collisions are using probing and chaining, respectively.


    14. Graphs

    We need to “mark” a vertex as visited. DFS uses a stack; BFS uses a queue

    • Adjacency Matrix
    • Adjacency List

    15. Sets and Bags

    • Sets(collections of elements with no duplicates and no ordering), and
    • Bags(collections of elements that allow duplicates but are not ordered)
    1. Implementing Sets with Lists
    2. Implementing Sets with Binary Search Trees
    3. Implementing Sets with AVL Trees

    16. Machine Learning - Neural Networks

    A network is a graph with nodes and interconnection between nodes.

    • Input Sensations( Automatic ): network of specialized neurons
    • Perceptions( Automatic ): Integrations of the Sensations to a single view. ( Many to one via a network of neurons)
    • Conception: Takes many Perceptions and abstract out key features. Conceptions… ( Volitional ), Achieved with a Network of Neurons

    Neural visual networks are composed of many heterogeneous layers:

    • Input
    • Convolution: Feature extractions
    • Polling: Feature Abstraction
    • Fully Connected: Classification
    • Training

    Today, modern managers are more interested in hiring Computer Science graduates who have knowledge of Computer Science AND a subject matter knowledge.

    The point: Having a dual major, or at the very least a major in CS and a minor in a subject area, increase your ability to be hired and retain a good job.

    Example: Computers and Genetics(The Wonders of the World–Seeing our Common Humanity)


    展开全文
  • Crow 是 HTCondor 的监控工具包。 它由三个部分组成: 收集器 ( .../bin/ ) 中间件服务器( .../server/ ) html 前端 ( .../html ) 集电极 收集器crow运行在 HTCondor 提交节点上(与 schedd 一起)。 它并行...
  • Bird Flock Crow v2.3.unitypackage,unity鸟类集群插件
  • Crow Translate 中文版是一种使用 C ++/Qt 编程的简单轻巧的翻译器,它允许使用 Google,Yandex 和 Bing 翻译 API 来翻译和说文本。 您可能也对该项目中使用的我的库 QOnlineTranslator 感兴趣。 开源免费的翻译...
  • c++ crow入门填坑坑

    千次阅读 2020-05-04 01:17:11
    看到介绍是类似Flask的就...写的安装总出这样那样的错,我是直接下载下来,将include下的crow/和crow.h放入/usr/local/include/下,能用就行哈哈哈。 g++版本 >> g++ (Ubuntu 7.5.0-3ubuntu1~18.04) 7.5.0 它...

    看到介绍是类似Flask的就心动了
    安装环境是Ubuntu 18;
    官方上:https://github.com/ipkn/crow
    写的安装总出这样那样的错,我是直接下载下来,将include下的crow/和crow.h放入/usr/local/include/下,能用就行哈哈哈。

    g++版本

    >> g++ (Ubuntu 7.5.0-3ubuntu1~18.04) 7.5.0
    

    它依赖boost库;先安装boost:

    >> sudo apt-get install libboost-all-dev
    

    看似都具备了,我试着编译helloworld的例子:

    >> g++ -std=c++11 helloworld.cpp -o helloworld
    

    开始报错一大堆:

    节选了开头部分
    /tmp/ccr4aqhz.o:在函数‘__static_initialization_and_destruction_0(int, int)’中:
    helloworld.cpp:(.text+0x91c):对‘boost::system::generic_category()’未定义的引用
    helloworld.cpp:(.text+0x928):对‘boost::system::generic_category()’未定义的引用
    helloworld.cpp:(.text+0x934):对‘boost::system::system_category()’未定义的引用
    

    查了一会原来是引用错误,要加后面的 -lboost_system -lboost_filesystem:

    >> g++ -std=c++11 helloworld.cpp -o helloworld -lboost_system -lboost_filesystem
    

    结果又报错:

    /usr/bin/ld: /tmp/ccmIgsRQ.o: undefined reference to symbol 'pthread_sigmask@@GLIBC_2.2.5'
    //lib/x86_64-linux-gnu/libpthread.so.0: 无法添加符号: DSO missing from command line
    collect2: error: ld returned 1 exit status
    
    

    又开始查,还要加个不知道为啥的东西:

    >> g++ -std=c++11 helloworld.cpp -o helloworld -lboost_system -lboost_filesystem -L../boost/stage/lib -pthread
    

    终于编译通过,运行程序:

    >> ./helloworld 
    (2020-05-03 16:52:01) [INFO    ] Crow/0.1 server is running at 0.0.0.0:18080 using 1 threads
    (2020-05-03 16:52:01) [INFO    ] Call `app.loglevel(crow::LogLevel::Warning)` to hide Info level logs.
    

    测试了一下,终于可以了,关于crow的东西网上不多,都是东拼西凑搞出来的。

    >> curl http://localhost:18080
    Hello world!
    
    展开全文
  • 受启发,Crows 是一个与框架无关的微型库,用于在 Ruby 类中进行授权。 一组乌鸦给你的用户授权,因为夜深了,充满了恐惧…… Crows 为您提供了一些帮助器来检查current_user可以对某些记录进行操作。 这使您可以...
  • Data Crow数据乌鸦是一款简单好用的管理软件。软件最突出的特点是它不仅是一个管理DVD、CD、软件和书籍的软件,也提供一个方法来管理全部文件。软件界面美观简洁、简单全面、实用方便,无需培训,即可快速上手,...
  • 语言:Bahasa Indonesia,Bahasa Melayu,Deutsch,English,Filipino,Français,Kiswahili,Nederlands,Norsk,Tiếng ...Crow Wallpapers和New Tab扩展程序为默认的Chrome New Tab页面带来了全新外观。 随着每个Chrome浏览器
  • 乌鸦 从网址创建唯一的单词列表 用法 (crow:collect-from-file "urls.list" "output.list") 安装
  • Monyer.htm Crow

    2008-09-05 22:12:43
    Monyer.htm Crow修改版 2008-09-05
  • pyramid_crow pyramid_crow提供了一个pyramid软件包,用于与raven集成,该软件包是自动的,并且符合raven的http_context标准。 用法 使用pyramid.includes配置文件设置或config.include('pyramid_crow')包含pyramid...
  • 要通过 Crow 搜索算法 (CSA) 解决约束优化问题,请使用提供的 MATLAB 代码来解决工程设计问题。
  • Crow的设计易于使用,应允许用户执行几乎所需的所有操作,而无需自定义渲染器或不安全的代码。 最新文档可在找到。 可以在查看最新版本。 您可能还需要考虑查看WIP展示项目 。 此板条箱需要支持OpenGL 3.3的GPU。 ...
  • As the Crow Flies

    2017-09-23 01:31:08
    Frequent flier miles are counted "as the crow flies" (i.e., the shortest route across the earth's surface that connects the cities along the route). The earth's surface is a perfect sphere with ...
  • 题目描述: There are n integers b1, b2, …, bn written in a row. For all i from 1 to n, values ai are defined by the ...The crow then adds bi to ai, subtracts bi + 1, adds the bi + 2 number, an

    题目描述:
    There are n integers b1, b2, …, bn written in a row. For all i from 1 to n, values ai are defined by the crows performing the following procedure:

    The crow sets ai initially 0.
    The crow then adds bi to ai, subtracts bi + 1, adds the bi + 2 number, and so on until the n’th number. Thus, ai = bi - bi + 1 + bi + 2 - bi + 3…
    Memory gives you the values a1, a2, …, an, and he now wants you to find the initial numbers b1, b2, …, bn written in the row? Can you do it?

    Input
    The first line of the input contains a single integer n (2 ≤ n ≤ 100 000) — the number of integers written in the row.

    The next line contains n, the i’th of which is ai ( - 109 ≤ ai ≤ 109) — the value of the i’th number.

    Output
    Print n integers corresponding to the sequence b1, b2, …, bn. It’s guaranteed that the answer is unique and fits in 32-bit integer type.

    Examples
    5
    6 -4 8 -2 3
    2 4 6 1 3

    5
    3 -2 -1 5 6
    1 -3 4 11 6

    题目描述:
    有两个数组,一个数组为a,一个为b ,在给你一个数n,和数组啊,我们要求出数组b的每个元素,并且我们知道ai = bi - bi + 1 + bi + 2 - bi + 3…
    到底是什么意思呢
    就是a1 = b1-b2-b3+b4…
    a2 = b2-b3+b4-b5…
    依次类推
    然后让我们求出满足a数组的b数组的元素。

    解题思路:
    乍一看感觉还挺难的,但其实只要出发点找对就so easy,我们发现an和bn是相同的,并且我们只要从bn倒推回来是不是就可以顺利找到答案了,在倒退过程中不难发现bn = an + an+1;
    直接上代码

    #include <iostream>
    #include <cstdio>
    
    using namespace std;
    const int maxn = 1e5+10;
    
    int A[maxn],B[maxn];//分别存储a,b数组
    
    int main () {
    	int n;
    	cin >> n;
    	for(int i = 1;i <= n;i++) 
    		scanf("%d",&A[i]);
    	B[n] = A[n];
    	for(int i = n-1;i > 0;i--)//倒推找出数组b的每个元素
    		B[i] = A[i]+A[i+1];
    	for (int i = 1;i <= n;i++) {
    		if(i == 1)
    			cout << B[i];
    		else 
    			cout << " " << B[i];
    	}
    	cout << "\n";
    	return 0; 
    }
    
    展开全文

空空如也

空空如也

1 2 3 4 5 ... 20
收藏数 6,042
精华内容 2,416
关键字:

Crow