Binomial coefficients

Binomial Coefficient(二项式系数)的计算 二项式系数 C(n, k),或组合数,是定义为形如 (1+x) 的二项式 n 次幂展开后 x 的系数(其中 n 为自然数,k 为整数)。C(n, k) 给出了从 n 个物体中随机选出 k 个物体的所有可选组合的数量。例如 C(4, 2) 表示从 4 个物体中随机选出 2 个,一共有 6 种选法,所以 C(4, 2)=6;类似的,C(5, 2)=10。 由二项式的性质有下面的两个公式 C(n, k) = C(n-1, k-1) + C(n-1, k) C(n, 0) = C(n, n) = 1 现要求 阅读详情
B - Binomial coefficients
Time Limit:3000MS    Memory Limit:0KB    64bit IO Format:%lld & %llu

Description

Download as PDF

Gunnar is quite an old and forgetful researcher. Right now he is writing a paper on security in social networks and it actually involves some combinatorics. He wrote a program for calculating binomial coefficients to help him check some of his calculations.

A binomial coefficient is a number

n $\displaystyle \choosek$ = $\displaystyle {\frac{​{n!}}{​{k!(n - k)!}}}$,
where n and k are non-negative integers.

Gunnar used his program to calculate n$ \choosek$ and got a number m as a result. Unfortunately, since he is forgetful, he forgot the numbers n and k he used as input. These two numbers were a result of a long calculation and they are written on one of many papers lying on his desk. Instead of trying to search for the papers, he tried to reconstruct the numbers n, k from the output he got. Can you help him and find all possible candidates?

Input

On the first line a positive integer: the number of test cases, at most 100. After that per test case:

  • one line with an integer m (2$ \le$m$ \le$1015): the output of Gunnar's program.

Output

Per test case:

  • one line with an integer: the number of ways of expressing m as a binomial coefficient.
  • one line with all pairs (n, k) that satisfy n$ \choosek$ = m. Order them in increasing order of n and, in case of a tie, order them in increasing order of k. Format them as in the sample output.

Sample Input

2
2
15

Sample Output

1
(2,1)
4
(6,2) (6,4) (15,1) (15,14)




主要学习别人的代码的STL的使用;


#include <stdio.h>
#include <vector>
#include <string.h>
#include <iostream>
#include <math.h>
#include <map>
#include <algorithm>

using namespace std;

typedef long long LL;
typedef pair<LL, LL> PLL;
#define MAX 1000000000000009LL

LL C[1000][1000];

void makeC()
{
    memset(C, 0, sizeof (C));
    for (int i = 0; i < 1000; i++)
    {
        C[i][0] = 1;
        for (int j = 1; j <= i; j++)
        {
            C[i][j] = C[i-1][j-1] + C[i-1][j];
            C[i][j] = min(C[i][j], MAX);
        }
    }
}

LL getC(LL a, LL b)
{
    LL ret = 1;
    for (LL i = 1; i <= b; i++)
    {
        LL tmp = ret * (a + 1 - i) / i;
        if (ret == tmp * i / (a + 1 - i))
        {
            ret = tmp;
        }
        else
        {
            return MAX;
        }
    }
    return ret;
}

vector<PLL> ans;
void gao(LL n)
{
    ans.clear();
    for (int i = 1; i < 1000; i++)
    {
        for (int j = 1; j <= i; j++)
        {
            if (C[i][j] == n)
            {
                ans.push_back(PLL(i, j));
            }
        }
    }
    for (int i = 1; i < 10; i++)
    {
        LL l = 1;
        LL r = n;
        while (l <= r)
        {
            LL m = (l + r) >> 1;
            LL t = getC(m, i);
            if (t == n)
            {
                ans.push_back(PLL(m,     i));
                ans.push_back(PLL(m, m - i));
                break;
            }
            else if (t > n)
            {
                r = m - 1;
            }
            else
            {
                l = m + 1;
            }
        }
    }
    sort(ans.begin(), ans.end());
    ans.resize(unique(ans.begin(), ans.end()) - ans.begin());
}

int main ()
{
    makeC();
    int T;
    cin >> T;
    while (T--)
    {
        LL n;
        cin >> n;
        gao(n);
        int sz = ans.size();
        cout << sz << endl;
        for (int i = 0; i < sz; i++)
        {
            if (i)
            {
                cout << " ";
            }
            cout << "(" << ans[i].first << "," << ans[i].second << ")";
        }
        cout << endl;
    }
    return 0;
}


huggingface使用git上传model或者Dataset到HF,当然也可以上传代码,以及大文件,很哇塞!!! huggingface使用git上传model或者Dataset到HF,当然也可以上传代码,以及大文件,很哇塞!!! 第一次使用时,需要使用设置系统全局的huggingface token,这。点击huggingface首页右上角的头像 → settings → access tokens,创建一个write权限的token,名字可以随便取。 阅读详情

相关推荐

VSCode多文件C语言项目编译实战:从配置到运行

本文详细讲解了如何在VSCode中配置多文件C语言项目的编译环境。通过手把手教学,指导读者创建项目结构、编写代码,并重点深度配置task.json与launch.json文件,实现一键编译和调试所有C文件,解决常见的“undefined reference”等链接错误,提升开发效率。

g8f9d0s1a2的博客 1098

二项式系数(Binomial Coefficients)

7. 与排序算法的结合与对比二项式系数常与排序算法结合,用于优化半导体调度。如果需要进一步扩展(如并行计算二项式系数、结合其他算法、具体半导体场景优化),请提供详细需求,我可以提供更定制化的实现!5. C#实现二项式系数以下提供三种C#实现:直接公式法、动态规划法和乘法公式法,适用于半导体场景中的组合计数。. 空间复杂度:( O(k) )(优化后仅存一行)。优点:支持模运算,避免溢出。5.2 动态规划法适合中到大规模 ( n ),支持模运算。优点:高效,避免溢出,适合大 ( n ) 和模运算。

专注于前沿技术的探索与实践,热衷于从代码逻辑、架构设计到行业应用等多维度深挖技术本质。期待在技术之路上与你共同成长~ 1422

微信小程序网关逆向分析:从协议、签名到会话管理的安全架构剖析

在现代Web与移动应用开发中,API网关作为客户端与后端服务之间的关键通信枢纽,承担着协议转换、流量调度、安全防护与性能优化等核心职责。其工作原理通常涉及统一的请求路由、身份认证、参数校验与响应聚合。从技术价值看,深入理解网关机制不仅能帮助开发者构建更健壮、可扩展的微服务架构,还能为安全评估、性能调优与故障排查提供基础。在移动生态如微信小程序中,网关设计尤为关键,它需要处理微信特有的登录态、数据加密与防重放攻击等安全需求。本文聚焦于微信小程序网关的逆向分析方法,通过结合网络抓包与代码反编译技术,深入解析其通

weixin_29323493的博客 443

组合数学复习

等价着色数: 等价着色是指考虑到对称性质后,两种着色方案被认为是相同的。换句话说,如果两个着色方案可以通过图的自同构来映射,那么它们是等价的。如果我们着色这个图的三个顶点,如果两种着色方案可以通过旋转三角形来相互映射,那么它们是等价的。如果我们只关心颜色不同的情况,而不考虑这种旋转,那么就是在考虑非等价的情况。非等价着色数: 非等价着色数则是不考虑图的自同构,只考虑颜色方案不同的情况下的着色数。如果置换的set有n个元素,那么有n!

double_yellow的博客 1300

论文记录:Affine Formation Maneuver Control of Multiagent Systems

多智能体编队控制仿真记录 实现功能:平移/旋转/尺寸缩放/shear,见截图 注意:本仿真图只是起到了演示效果,中间过程速度产生突变,实际中是不允许的。需要进行速度规划,这一点论文中仿真图更为贴合实际。 参考论文:Zhao, S. (2018). Affine Formation Maneuver Control of Multiagent Systems. IEEE Transactions on Automatic Control, 63(12), 4140–4155. 突然发现有个博主写得很好,参考:

W1H1J1的博客 2108

从无人机到机械臂:深入聊聊LQR和LQG在实际项目里的那些‘坑’与最佳实践

本文深入探讨了LQR和LQG在无人机和机械臂等实际项目中的应用挑战与最佳实践。从系统建模的妥协艺术到调参的系统化方法,再到离散化的细节处理,文章分享了工程实践中的宝贵经验。特别强调了如何应对传感器噪声、未建模动态等现实问题,并提供了实用的调试工具和诊断流程,帮助工程师避免常见陷阱,提升控制系统的稳定性和性能。

weixin_28683391的博客 387

Binomial Coefficient(二项式系数)

In mathematics, any of the positive integers that occurs as a coefficient in the binomial theorem is a binomial coefficient. Commonly, a binomial coefficient is indexed by a pair of integers n ≥ k ≥ 0...

HONEY MOOSE 2247

MATLAB出现”警告: 名称不存在或不是目录“的解决方案

MATLAB出现 警告: 名称不存在或不是目录 的解决方案1. 出现错误2. 问题解释3. 解决方法4. 特殊情况5. 问题解决6. 多多点赞交流 1. 出现错误 打开MATLAB突然发现,出现下面的错误: 提示我们不存在这样的路径。 2. 问题解释 这样的错误很明显,我们曾经在预设路径中添加了这个文件夹。 在某种情况下,我们把它删除了,现在MATLAB找不到它了。 (这里我在桌面上添加了新建文件夹,然后将其添加到MATLAB的搜索路径中。之后把新建文件夹删除了,所以就会出现这样的报错) 3. 解决方法

qq_18820125的博客 5万+

Binomial Coefficient二项式系数)-- Dynamic Programming(动态规划)

在数学上,二项式系数是二项式定理中各项的系数。以下是关于二项式系数的通常的定义: 1)二项式系数C(n,k)可视为(1+xn)\left ( 1+ x^{n} \right )(1+xn)的多项式展开式中, xnx^{n}xn项的系数。 2)二项式系数C(n,k)还给出了从n个对象中选择k个对象的方式数量。更正式的来说,具有n个元素的集合中包含K个元素的子集的数量。 问题:编写一个只有两个参数n和...

qq_43697503的博客 1681

GPU 运维实战:H100/H800/B300 换卡与压测

(烧多久、看什么、什么算合格)。文末还给了一个能直接跑的验收判定脚本,三个真实场景的裁决输出都在。

老韩的Linux云计算架构师进阶之路 281

从零开始之驱动发开、linux驱动(七、字符驱动之led最终版)

我们上一接用的gpiolib非常杂乱,使用了两种 1.各硬件厂商实现的,如s3c_gpio_cfgpin(S5PV210_GPJ0(5), S3C_GPIO_SFN(1)) 2.系统公共的,如gpio_set_value(S5PV210_GPJ0(4),val) 其实公共的也是对各硬件厂商的封装,用那个都可以,个人建议用系统公共的,应为这样换芯片厂商,不影响任何使用。   2.错误处理基...

To_run_away的博客 2388

POJ 3219 Binomial Coefficients

思想深奥,代码操简单的数学问题。 题目链接:http://poj.org/problem?id=3219 CSUST 2012年暑假8月组队后个人赛第12场:http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=11900#problem/D D - Binomial Coefficients Time Li

free斩 1205

SAP:QUERY中SQ02增加选择屏幕权限控制

【代码】SAP:QUERY中SQ02增加选择屏幕权限控制。

weixin_43734184的博客 2327

Binomial Coefficients, Kind Of

Recently, akshiM met a task that needed binomial coefficients to solve. He wrote a code he usually does that looked like this: Unfortunately, he made an error, since the right formula is the following: But his team member keblidA is interested in values th

Pretty Boy Fox的博客 1162

深度学习工具包 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")

假人有限元模型

假人模型,车辆碰撞假人有限元模型,适合做乘员安全的研究者利用

Binomial Coefficients

http://icpc.upc.edu.cn/problem.php?cid=1706&amp;pid=1 #include&lt;cstdio&gt; #include&lt;algorithm&gt; #include&lt;cmath&gt; using namespace std; long long n,a[10000000],i,k1,ans,k; double max1=1000...

Amber的博客 465

pscad IEEE标准系统搭建说明

pscad IEEE标准系统搭建说明,包含典型的IEEE 9节点、14节点、30节点、39节点和118节点系统。内含标准测试系统的原始数据和潮流结果。

POJ3219 Binomial Coefficients

POJ3219 Binomial Coefficients 观察题目,典型的Lucas定理,但是我认为本题最妙的解法不是Lucas 首先一个结论:对于C(n,r),如果n&r=r则C(n,r)为奇数,反之为偶数 证明: 代码于是就变得非常简单: #include<iostream> using namespace std; int main() { long long ...

AlexTYJ的博客 241

IDEA的使用指南

IDEA基于java的使用手册,可以最快速的上手,在使用中不断的丰富自己的使用技巧.

Uva 1649 Binomial coefficients

有一定难度的一道题目,网上已经有大神给出了思路,其实也就是按照别人的方法得知最大的k值不会超过26,那么对于不同的k值,我们直接二分查找是否存在对应的n值即可,如果存在就保存对应的结果,如果不存在就进行下一轮的查找,具体实现见如下代码: #include #include #include #include #include #include #include #include #include

zju2016的博客 397

UVa 1649 Binomial Coefficients

本题要求对于给定的组合数值 m,找出所有满足 C(n,k)=m 的整数对 (n,k),其中 m 最大可达 10^15。解题关键是将组合数方程转化为对数形式:n×(n-1)×...×(n-k+1)=m×k!。两边取对数后,通过估算 (m×k!)^(1/k) 得到 n 的近似值,只需在估计值附近极小范围(±3)内搜索,比较对数之和是否在允许误差内,即可快速定位候选解。该方法避免了大整数运算溢出,且 k 最大不超过 30,搜索效率高。最后加入平凡解 (m,1) 和 (m,m-1),排序去重后输出。算法复杂度低,可

寂静山林 1002

Spoj 9887 Binomial coefficients 构造

版权声明:本文为博主原创文章,未经博主同意不得转载。 https://blog.csdn.net/qq574857122/article/details/37778285 ...

weixin_30500473的博客 87

SPOJ NWERC11A Binomial coefficients

组合数单调性+二分。这道题犯了一个很二逼的错误,调了很久很久才能AC。。。好无语啊,以后要细心些了。看到这题的第一反应是,不会做。。。但是后来仔细想了想,其实我们很容易发现,对于其中的满足的情况C(n, k),我们只需要求k             但是要是这样写的话我们发现,即使k 小于30,在相乘的时候也会超long long。怎么办呢?仔细想想,我们可以用二分求出小于6的情况(单独这样求

ok_again的专栏 1278

51nod1245 Binomial Coefficients Revenge

要不等待 要不放弃 不要让纠结占据你的生活

reflash的博客 796

51nod 1245 Binomial Coefficients Revenge

Kummer+数位dp

我要吃熊猫 390

1649 - Binomial coefficients

Sample Input 2 2 15 Sample Output 1 (2,1) 4 (6,2) (6,4) (15,1) (15,14) 点击打开链接 人家的: #define _CRT_SECURE_NO_WARNINGS #include #include #include #include #include #include #incl

你的你的都是你的的博客 313

poj 3219 Binomial Coefficients

//判断C(n,k)的奇偶性//如果n!中因子2的个数大于k!和(n-k)!中因子2的个数之和,那么C(n,k)就是偶数,否则C(n,k)就是奇数。//而且计算N!中2的阶数,只要计算N/2+N/4……#include <iostream> using namespace std;int fac(int d) //计算d!中2的阶数,即因子2的个数{ in...

weixin_30800987的博客 120
上一篇: poj 1743
下一篇: 群赛
struggle_mind
博客等级 码龄15年 39粉丝 153原创
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明:

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

余额充值