Spell checker

3.9-Mimikatz离线读取lsass进程抓取密码 1、使用任务管理器导出(windows NT 6)(可以远程登陆前提下)2、使用procdump 导出lsass.dmp文件ProcDump 是一个命令行实用工具,其主要用途是在管理员或开发人员可用于确定峰值原因的峰值期间监视 CPU峰值和生成故障转储的应用程序。ProcDump 还包括使用窗口挂起 (使用相同的窗口挂起定义,Windows任务管理器使用)、未经处理的异常监视,并且可以根据系统性能计数器的值生成转储。它还可用作可在其他脚本中嵌入的常规进程转储实用工具。因为是微软的所以一般不会被杀软杀掉。 阅读详情

Description

You, as a member of a development team for a new spell checking program, are to write a module that will check the correctness of given words using a known dictionary of all correct words in all their forms. 
If the word is absent in the dictionary then it can be replaced by correct words (from the dictionary) that can be obtained by one of the following operations: 
?deleting of one letter from the word; 
?replacing of one letter in the word with an arbitrary letter; 
?inserting of one arbitrary letter into the word. 
Your task is to write the program that will find all possible replacements from the dictionary for every given word. 

Input

The first part of the input file contains all words from the dictionary. Each word occupies its own line. This part is finished by the single character '#' on a separate line. All words are different. There will be at most 10000 words in the dictionary. 
The next part of the file contains all words that are to be checked. Each word occupies its own line. This part is also finished by the single character '#' on a separate line. There will be at most 50 words that are to be checked. 
All words in the input file (words from the dictionary and words to be checked) consist only of small alphabetic characters and each one contains 15 characters at most. 

Output

Write to the output file exactly one line for every checked word in the order of their appearance in the second part of the input file. If the word is correct (i.e. it exists in the dictionary) write the message: " is correct". If the word is not correct then write this word first, then write the character ':' (colon), and after a single space write all its possible replacements, separated by spaces. The replacements should be written in the order of their appearance in the dictionary (in the first part of the input file). If there are no replacements for this word then the line feed should immediately follow the colon.

Sample Input

i
is
has
have
be
my
more
contest
me
too
if
award
#
me
aware
m
contest
hav
oo
or
i
fi
mre
#

Sample Output

me is correct
aware: award
m: i my me
contest is correct
hav: has have
oo: too
or:
i is correct
fi: i
mre: more me

 

#include<iostream>
#include<string.h>
#include<stdio.h>
#include<ctype.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<math.h>
#include<vector>
#include<deque>
#include<list>
using namespace std;
char map[10010][16];
char str[30];
int isok(int n)
{
    int i,j,k;
    int l1=strlen(str),l2=strlen(map[n]);
    switch(l1-l2)
    {
    case 1:
        k=0;
        for(i=j=0; i<l1;)
            if(str[i]!=map[n][j])
                k++,i++;
            else
                i++,j++;
        if(k==1)
            return 1;
        break;
    case 0:
        k=0;
        for(i=j=0; i<l1; i++,j++)
            if(str[i]!=map[n][j])
                k++;

        if(k==1)
            return 1;
        break;
    case -1:
        k=0;
        for(i=j=0; j<l2;)
            if(str[i]!=map[n][j])
                k++,j++;
            else
                i++,j++;
        if(k==1)
            return 1;
        break;
    }
    return 0;
}
int main()
{
    int i=0,N=0;
    while(scanf("%s",map[N])&&strcmp(map[N],"#")!=0) N++;
    while(scanf("%s",str)&&strcmp(str,"#")!=0)
    {
        for(i=0; i<N; i++)
            if(strcmp(str,map[i])==0)
            {
                printf("%s is correct\n",str);
                break;
            }
        if(i==N)
        {
            printf("%s:",str);
            for(i=0; i<N; i++)
                if(isok(i))
                    printf(" %s",map[i]);
            printf("\n");
        }
    }
    return 0;
}

 

技术分享 | mimikatz的常见使用方法 0x00简介 Mimikatz 是一款功能强大的轻量级调试神器,通过它你可以提升进程权限注入进程读取进程内存,当然他最大的亮点就是他可以直接从 lsass.exe 进程中获取当前登录系统用户名的密码, lsass是微软Windows系统的安全机制它主要用于本地安全和登陆策略,通常我们在登陆系统时输入密码之后,密码便会储存在 lsass内存中,经过其 wdigest 和 tspkg 两个模块调用后,对其使用可逆的算法进行加密并存储在内存之中, 而 mimikatz 正是通过对lsass逆算获取到明文密码!也就 阅读详情

相关推荐

VSCode中插件Code Spell Checker

Code Spell Checker

qq_42078081的博客 1万+

Mimikatz + procdump 的使用

控制远程的服务器后,‘帮助’对方下载mimikatz,然后以管理员身份运行 ​​​​​​https://github.com/gentilkiwi/mimikatz/releases privilege::debug 提取权限 sekurlsa::logonpasswords 抓取密码 mimikatz是从 lsass.exe进程中获取windows的账号及密码的, 这时,我们可以帮对方安装一个procdump64.exe(这是微软自己的工具,可以放心使用) 然后从 lsass.exe

键盘上温暖而又美好的时光 . 7587

codemirror-spell-checker:在CodeMirror中进行简单的拼写检查

CodeMirror拼写检查器 拼写检查非常简单,您可以在60秒内完成设置。 它将以浅红色突出显示所有拼写错误的单词。 与其他CodeMirror模式(例如GitHub Flavored Markdown)结合使用时效果很好。 安装 通过 。 npm install codemirror-spell-checker --save 通过。 bower install codemirror-spell-checker --save 通过 。 请注意,jsDelivr可能需要几天时间才能更新到最新版本。 < link rel =" stylesheet " href =" https://cdn.jsdelivr.net/codemirror.spell-checker/latest/spell-checker.min.css " > < script src =" https://cdn

1035 Spell checker

<br />Spell checkerTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10052 Accepted: 3713<br />DescriptionYou, as a member of a development team for a new spell checking program, are to write a module that will check the correctness of given words

hqd_acm的专栏 1014

codemirror-spellckecker:CodeMirror +拼写检查+快速修复

Codemirror-spellckecker +拼写检查+快速修复。 日语: を元に技术用语のLintを行う事を目的にしています。 演示: : 安装 npm install codemirror-spellckecker 用法 字典格式 字典作为JavaScript对象。 var dictionaryItems = [ { pattern: 'Web Socket', expected: 'WebSocket' }, { pattern: '\\bBigTable\\b|Big Table|Big table', expected: 'Bigtable' }, { pattern: '\\bCakePHP\\b', flag: 'i',

js-checker:一个javascript类型检查器

js检查器 js-checker是一个javascript类型检查器。 它可以自动生成界面文档。 安装 # install js-checker npm install js-checker # run test npm run test # get demo .html file npm run html 例子 let { c , t , renderHtml , getHtml } = require ( 'js-checker' ) ; let personType = c . Obj ( { age : t . Num , nick : t . Num , favourites : c . Arr ( t . Str ) , details : c . Optional ( t . Any ) } ) ; //generate interfac

VS Code Code Spell Checker 插件详解

Code Spell Checker 提供了丰富的配置选项,可以通过 VS Code 的设置 (Ctrl+,或Cmd+,) 进行修改,推荐直接编辑文件。以下是常用的配置示例:json// 设置要检查的语言// 添加自定义单词(全局)// 添加工作区特定单词// 忽略的单词// 启用检查的文件类型"html","python"],// 忽略的文件路径// 启用复合词你也可以在项目根目录创建文件进行项目级配置,建议通过.gitignore忽略该文件,使其仅在本机生效。

BillKu的博客 1898

抖音小游戏上架避坑指南:从软著申请到ICP备案全流程解析

本文详细解析了抖音小游戏上架前必须完成的软著申请和ICP备案全流程,提供了清晰的时间线规划与实操避坑指南。文章重点阐述了个人与企业备案的区别、材料准备要点以及平台审核常见问题,旨在帮助独立开发者和小团队高效、合规地完成游戏上架,避免在行政流程中延误项目。

weixin_29276847的博客 1558

Comment-Spell-Checker 使用教程

Comment-Spell-Checker 使用教程 项目介绍 Comment-Spell-Checker 是一个 Xcode 扩展,用于在代码注释中进行拼写检查和自动纠正。这个工具可以帮助开发者确保代码注释的准确性和专业性,从而提高代码的可读性和维护性。 项目快速启动 安装步骤 从 App Store 下载: 在 App Store 中搜索并下载 Comment-Spell-Checker...

gitblog_00917的博客 732

四大厂商网络设备巡检命令实战指南:华为、华三、锐捷、思科

本文详细介绍了华为、华三、锐捷、思科四大厂商网络设备的巡检命令实战指南,涵盖硬件状态、软件运行和网络功能等核心维度。通过具体命令示例和实用技巧,帮助网络工程师高效完成设备巡检,预防潜在故障,确保网络稳定运行。

weixin_29235923的博客 391

紫光同创PGL50H开发板PCIE通信保姆级教程:从IP核安装到Windows设备管理器识别

本文详细介绍了紫光同创PGL50H开发板PCIE通信的全流程,从IP核安装到Windows设备管理器识别。通过环境搭建、工程配置、管脚约束、固件烧录等步骤,帮助开发者快速掌握FPGA与PCIE通信技术,解决实际开发中的常见问题,提升开发效率。

weixin_30500473的博客 433

Google Spell Checker Api Asp.Net C#

In this article you will learn how to use the Google Spell Checker API in Asp.Net C# apps The API is very simple,  spell checking is done

wxl3wei的专栏 1497

极智AI | 谈谈为什么卷积加速更喜欢 NHWC Layout

本文主要讨论一下为什么卷积加速更加喜欢 NHWC 的数据排布。

极智视界 2971

Python 中的 spell checker 库

在上面的示例中,我们创建了一个英文 spell checker 对象,然后将文本分割成单词,最后检测每个单词是否正确。如果单词不正确,我们就打印出错误信息。在上面的示例中,我们创建了一个 spell checker 对象,然后将文本分割成单词,最后检测每个单词是否正确。总之,Python 中的 spell checker 库可以帮助我们检测和纠正文本中的错误,使我们的文本处理工作更加准确和高效。在上面的示例中,我们创建了一个文本对象,然后将文本分割成单词,最后检测每个单词是否正确。

Bruce_xiaowei的博客 1503

Python 爬虫实战:雪球用户数据爬取与投资行为分析(含 API 签名算法解析)

雪球作为国内领先的投资者社区,拥有丰富的用户数据和投资信息。通过爬取雪球用户数据并进行分析,我们可以深入了解用户的持仓偏好、交易行为和投资策略,为企业和投资者提供有价值的市场洞察。

yansideyucsdn的博客 2247

Unity 横版游戏开发天花板?状态机、联机同步与横版动作游戏架构全都有

在 Unity 横版动作游戏开发领域,最耗时间的往往不是角色移动,而是整套“可扩展架构”的搭建。包括角色状态管理、敌人 AI、武器系统、关卡编辑器、联机同步、输入适配、UI 与存档系统等。2D Action Platformer Kit 的核心价值,并不只是“提供素材”,而是它已经帮开发者搭好了一整套适用于横版动作游戏的底层框架。

2403_88403568的博客 425

Comment-Spell-Checker 项目使用教程

Comment-Spell-Checker 项目使用教程 1. 项目的目录结构及介绍 Comment-Spell-Checker 是一个 Xcode 扩展,用于对代码注释进行拼写检查和自动纠正。以下是项目的目录结构及其介绍: Comment-Spell-Checker/ ├── Comment Spell Checker Extension/ │ ├── Comment Spell Check...

gitblog_00708的博客 460

【Python计量】linearmodels面板数据回归(一)

我们以伍德里奇《计量经济学导论现代方法》的”第14章高级面板数据方法“的案例14.1为例,使用jtrain中的数据来进行固定效应估计。

mfsdmlove的博客 9277

10个vscode-spell-checker使用技巧:从入门到精通

vscode-spell-checker是一款简单实用的源代码拼写检查工具,能帮助开发者在编写代码时及时发现并纠正拼写错误,提升代码质量和可读性。无论是新手还是有经验的开发者,掌握以下10个使用技巧,都能让你更高效地利用这款工具。 ## 1. 快速安装与基础配置 ⚡️ 首先,在VS Code的扩展商店中搜索“Code Spell Checker”并安装。安装完成后,它会自动在后台运行,检查你的

gitblog_00132的博客 350

深度学习工具包 DeepLearningToolbox

深度学习工具包Deprecation notice.-----This toolbox is outdated and no longer maintained.There are much better tools available for deep learning than this toolbox, e.g. [Theano](http://deeplearning.net/software/theano/), [torch](http://torch.ch/) or [tensorflow](http://www.tensorflow.org/)I would suggest you use one of the tools mentioned above rather than use this toolbox.Best, Rasmus.DeepLearnToolbox================A Matlab toolbox for Deep Learning.Deep Learning is a new subfield of machine learning that focuses on learning deep hierarchical models of data.It is inspired by the human brain's apparent deep (layered, hierarchical) architecture.A good overview of the theory of Deep Learning theory is[Learning Deep Architectures for AI](http://www.iro.umontreal.ca/~bengioy/papers/ftml_book.pdf)For a more informal introduction, see the following videos by Geoffrey Hinton and Andrew Ng.* [The Next Generation of Neural Networks](http://www.youtube.com/watch?v=AyzOUbkUf3M) (Hinton, 2007)* [Recent Developments in Deep Learning](http://www.youtube.com/watch?v=VdIURAu1-aU) (Hinton, 2010)* [Unsupervised Feature Learning and Deep Learning](http://www.youtube.com/watch?v=ZmNOAtZIgIk) (Ng, 2011)If you use this toolbox in your research please cite [Prediction as a candidate for learning deep hierarchical models of data](http://www2.imm.dtu.dk/pubdb/views/publication_details.php?id=6284)```@MASTERSTHESIS\{IMM2012-06284, author = "R. B. Palm", title = "Prediction as a candidate for learning deep hierarchical models of data", year = "2012",}```Contact: rasmusbergpalm at gmail dot comDirectories included in the toolbox-----------------------------------`NN/` - A library for Feedforward Backpropagation Neural Networks`CNN/` - A library for Convolutional Neural Networks`DBN/` - A library for Deep Belief Networks`SAE/` - A library for Stacked Auto-Encoders`CAE/` - A library for Convolutional Auto-Encoders`util/` - Utility functions used by the libraries`data/` - Data used by the examples`tests/` - unit tests to verify toolbox is workingFor references on each library check REFS.mdSetup-----1. Download.2. addpath(genpath('DeepLearnToolbox'));Example: Deep Belief Network---------------------```matlabfunction test_example_DBNload mnist_uint8;train_x = double(train_x) / 255;test_x = double(test_x) / 255;train_y = double(train_y);test_y = double(test_y);%% ex1 train a 100 hidden unit RBM and visualize its weightsrand('state',0)dbn.sizes = [100];opts.numepochs = 1;opts.batchsize = 100;opts.momentum = 0;opts.alpha = 1;dbn = dbnsetup(dbn, train_x, opts);dbn = dbntrain(dbn, train_x, opts);figure; visualize(dbn.rbm{1}.W'); % Visualize the RBM weights%% ex2 train a 100-100 hidden unit DBN and use its weights to initialize a NNrand('state',0)%train dbndbn.sizes = [100 100];opts.numepochs = 1;opts.batchsize = 100;opts.momentum = 0;opts.alpha = 1;dbn = dbnsetup(dbn, train_x, opts);dbn = dbntrain(dbn, train_x, opts);%unfold dbn to nnnn = dbnunfoldtonn(dbn, 10);nn.activation_function = 'sigm';%train nnopts.numepochs = 1;opts.batchsize = 100;nn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.10, 'Too big error');```Example: Stacked Auto-Encoders---------------------```matlabfunction test_example_SAEload mnist_uint8;train_x = double(train_x)/255;test_x = double(test_x)/255;train_y = double(train_y);test_y = double(test_y);%% ex1 train a 100 hidden unit SDAE and use it to initialize a FFNN% Setup and train a stacked denoising autoencoder (SDAE)rand('state',0)sae = saesetup([784 100]);sae.ae{1}.activation_function = 'sigm';sae.ae{1}.learningRate = 1;sae.ae{1}.inputZeroMaskedFraction = 0.5;opts.numepochs = 1;opts.batchsize = 100;sae = saetrain(sae, train_x, opts);visualize(sae.ae{1}.W{1}(:,2:end)')% Use the SDAE to initialize a FFNNnn = nnsetup([784 100 10]);nn.activation_function = 'sigm';nn.learningRate = 1;nn.W{1} = sae.ae{1}.W{1};% Train the FFNNopts.numepochs = 1;opts.batchsize = 100;nn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.16, 'Too big error');```Example: Convolutional Neural Nets---------------------```matlabfunction test_example_CNNload mnist_uint8;train_x = double(reshape(train_x',28,28,60000))/255;test_x = double(reshape(test_x',28,28,10000))/255;train_y = double(train_y');test_y = double(test_y');%% ex1 Train a 6c-2s-12c-2s Convolutional neural network %will run 1 epoch in about 200 second and get around 11% error. %With 100 epochs you'll get around 1.2% errorrand('state',0)cnn.layers = { struct('type', 'i') %input layer struct('type', 'c', 'outputmaps', 6, 'kernelsize', 5) %convolution layer struct('type', 's', 'scale', 2) %sub sampling layer struct('type', 'c', 'outputmaps', 12, 'kernelsize', 5) %convolution layer struct('type', 's', 'scale', 2) %subsampling layer};cnn = cnnsetup(cnn, train_x, train_y);opts.alpha = 1;opts.batchsize = 50;opts.numepochs = 1;cnn = cnntrain(cnn, train_x, train_y, opts);[er, bad] = cnntest(cnn, test_x, test_y);%plot mean squared errorfigure; plot(cnn.rL);assert(er<0.12, 'Too big error');```Example: Neural Networks---------------------```matlabfunction test_example_NNload mnist_uint8;train_x = double(train_x) / 255;test_x = double(test_x) / 255;train_y = double(train_y);test_y = double(test_y);% normalize[train_x, mu, sigma] = zscore(train_x);test_x = normalize(test_x, mu, sigma);%% ex1 vanilla neural netrand('state',0)nn = nnsetup([784 100 10]);opts.numepochs = 1; % Number of full sweeps through dataopts.batchsize = 100; % Take a mean gradient step over this many samples[nn, L] = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.08, 'Too big error');%% ex2 neural net with L2 weight decayrand('state',0)nn = nnsetup([784 100 10]);nn.weightPenaltyL2 = 1e-4; % L2 weight decayopts.numepochs = 1; % Number of full sweeps through dataopts.batchsize = 100; % Take a mean gradient step over this many samplesnn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');%% ex3 neural net with dropoutrand('state',0)nn = nnsetup([784 100 10]);nn.dropoutFraction = 0.5; % Dropout fraction opts.numepochs = 1; % Number of full sweeps through dataopts.batchsize = 100; % Take a mean gradient step over this many samplesnn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');%% ex4 neural net with sigmoid activation functionrand('state',0)nn = nnsetup([784 100 10]);nn.activation_function = 'sigm'; % Sigmoid activation functionnn.learningRate = 1; % Sigm require a lower learning rateopts.numepochs = 1; % Number of full sweeps through dataopts.batchsize = 100; % Take a mean gradient step over this many samplesnn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');%% ex5 plotting functionalityrand('state',0)nn = nnsetup([784 20 10]);opts.numepochs = 5; % Number of full sweeps through datann.output = 'softmax'; % use softmax outputopts.batchsize = 1000; % Take a mean gradient step over this many samplesopts.plot = 1; % enable plottingnn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');%% ex6 neural net with sigmoid activation and plotting of validation and training error% split training data into training and validation datavx = train_x(1:10000,:);tx = train_x(10001:end,:);vy = train_y(1:10000,:);ty = train_y(10001:end,:);rand('state',0)nn = nnsetup([784 20 10]); nn.output = 'softmax'; % use softmax outputopts.numepochs = 5; % Number of full sweeps through dataopts.batchsize = 1000; % Take a mean gradient step over this many samplesopts.plot = 1; % enable plottingnn = nntrain(nn, tx, ty, opts, vx, vy); % nntrain takes validation set as last two arguments (optionally)[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');```[![Bitdeli Badge](https://d2weczhvl823v0.cloudfront.net/rasmusbergpalm/deeplearntoolbox/trend.png)](https://bitdeli.com/free "Bitdeli Badge")

Probability and Statistics - 4th edition

Probability and Statistics - 4th edition

Coc-Spell-Checker 开源项目使用手册

Coc-Spell-Checker 开源项目使用手册 Coc-Spell-Checker 是一个专为 Neo(Vim) 用户设计的拼写检查增强工具,旨在提升代码文档和注释的拼写准确性。本教程将指导您了解项目的核心组成部分,包括目录结构、启动文件以及配置文件的解析。 1. 项目目录结构及介绍 Coc-Spell-Checker 的项目结构遵循了一般Node.js项目的布局,以下是关键目录及其简介: ...

gitblog_00019的博客 445

锂电池充电器电路设计 里面有电路

锂电池充电器电路设计 里面有电路 3.7V升压到5V电路设计。

推荐项目:Comment Spell Checker - 代码注释的拼写守护者

推荐项目:Comment Spell Checker - 代码注释的拼写守护者 在编程的世界里,清晰准确的注释是沟通代码意图的关键。然而,拼写错误却常常成为开发者的小尴尬。今天,我们要推荐一个神器——Comment Spell Checker,它专为解决这一痛点而来。 项目介绍 Comment Spell Checker 是一款高效实用的Xcode源码编辑器扩展工具,旨在运行拼写检查和自动纠错功...

gitblog_00623的博客 832

解题报告:Spell checker 模拟/string

Description You, as a member of a development team for a new spell checking program, are to write a module that will check the correctness of given words using a known dictionary of all correct wor

Hee的博客~ 471

UVa 671 Spell Checker

本文讨论了一个拼写检查问题,需要判断给定单词是否存在于词典中,或是否可通过一次编辑操作(增删改字符)转换为词典中的单词。输入包含多个数据集,每个数据集由词典和待检查单词组成,输出需要按规则格式化。解题关键在于高效计算编辑距离,并通过预处理词典(按长度分组)优化性能。代码使用动态规划计算编辑距离,并通过集合快速查找,确保在合理时间内处理大规模输入。最终输出按要求格式显示正确或可能的替换单词。

寂静山林 230

Vim中的拼写检查利器:Coc-Spell-Checker

Vim中的拼写检查利器:Coc-Spell-Checker 在编程过程中,文字错误可能会给代码的可读性和理解带来困扰,尤其是在文档和注释中。为此,我们向你推荐一款专为(Neo)Vim打造的高效拼写检查插件——Coc-Spell-Checker。它是从VSCode Spell Checker项目的基础上fork并优化而来,特别针对camelCase编码风格进行了调整,以减少误报。 项目简介 Coc-...

gitblog_00045的博客 486

vscode-spell-checker常见问题解答:解决90%的使用难题

vscode-spell-checker是一款简单实用的源代码拼写检查工具,能够帮助开发者在编写代码时及时发现并纠正拼写错误,提升代码质量和可读性。本文将解答使用过程中90%的常见问题,让你轻松掌握这款工具的使用技巧。 ## 一、功能启用与文件类型支持 ### 1.1 如何确认拼写检查是否已启用? 在VS Code中打开任意文件,通过命令面板(Ctrl+Shift+P或Cmd+Shift+P)

gitblog_00018的博客 376
上一篇: 数据结构实验之链表七:单链表中重复元素的删除
下一篇: 数据结构实验之链表九:双向链表
何处几年
博客等级 码龄8年 10粉丝 55原创
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付:10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值