codeforces 935 C. Fifa and Fafa

搞定安卓11+抓包难题:用Kitsune Mask、magic_overlayfs和LSPosed三件套绕过SSL Pinning(保姆级教程) 本文详细解析了安卓11+系统中抓包面临的核心挑战,包括SSL Pinning和Root检测机制,并提供了使用Kitsune Mask、magic_overlayfs和LSPosed三件套的完整解决方案。通过动态分区技术解析和工具链配置,帮助开发者绕过安全限制,实现高效抓包分析。 阅读详情

Description

Fifa and Fafa are sharing a flat. Fifa loves video games and wants to download a new soccer game. Unfortunately, Fafa heavily uses the internet which consumes the quota. Fifa can access the internet through his Wi-Fi access point. This access point can be accessed within a range of r meters (this range can be chosen by Fifa) from its position. Fifa must put the access point inside the flat which has a circular shape of radius R. Fifa wants to minimize the area that is not covered by the access point inside the flat without letting Fafa or anyone outside the flat to get access to the internet.

The world is represented as an infinite 2D plane. The flat is centered at (x1, y1) and has radius R and Fafa’s laptop is located at (x2, y2), not necessarily inside the flat. Find the position and the radius chosen by Fifa for his access point which minimizes the uncovered area.

Input

The single line of the input contains 5 space-separated integers R, x1, y1, x2, y2 (1 ≤ R ≤ 105, |x1|, |y1|, |x2|, |y2| ≤ 105).

Output

Print three space-separated numbers xap, yap, r where (xap, yap) is the position which Fifa chose for the access point and r is the radius of its range.

Your answer will be considered correct if the radius does not differ from optimal more than 10 − 6 absolutely or relatively, and also the radius you printed can be changed by no more than 10 − 6 (absolutely or relatively) in such a way that all points outside the flat and Fafa’s laptop position are outside circle of the access point range.

Examples

Input
5 3 3 1 1
Output
3.7677669529663684 3.7677669529663684 3.914213562373095

Input
10 5 5 5 15
Output
5.0 5.0 10.0


题意:在一个圆形房间中,设置一个最大的圆形WI-FI范围,该范围不能超出房间,也不能覆盖fafa所在的点。
思路:先以房间中心建立相对坐标系,再选取fafa所在的直径长的那部分作为WI-FI的直径。

sketch

如图,(x3, y3)利用相似三角形是容易计算的,x3=−x1Rx21+y21√,y3=−y1Rx21+y21√,所以x2=x1+x32,y2=y1+y32,半径为R+Ra2

#include<stdio.h>
#include<math.h>
int main(){
   double R,aR,iR,xR,yR,xa,ya,xi,yi,xt,yt;
    scanf("%lf %lf %lf %lf %lf",&R,&xR,&yR,&xa,&ya);
    xa=xa-xR;
    ya=ya-yR;
    //相对坐标
    aR=sqrt(xa*xa+ya*ya);
    //Fafa在外面的情况
    if(aR-R>0.0000001){
        printf("%.10f %.10f %.10f\n",xR,yR,R);
        return 0;
    }
    //Fafa在中心的情况
    if(aR<0.0000001){
       printf("%.10f %.10f %.10f\n",xR+0.5*R,yR,R*0.5);
        return 0;
    }
    xt=-1*xa*R/aR;
    yt=-1*ya*R/aR;
    xi=(xt+xa)/2;
    yi=(yt+ya)/2;
    iR=(R+aR)/2;
    printf("%.10f %.10f %.10f\n",xi+xR,yi+yR,iR);
    return 0;
}
跳蛛优化算法(JSOA)详解:从生物启发到算法实现 摘要: 跳蛛优化算法(JSOA)是一种受跳蛛狩猎行为启发的元启发式优化算法,通过模拟跳蛛的搜索猎物、迫害行为、跳跃捕食和信息素通信四种策略实现高效寻优。算法将跳蛛个体位置映射为候选解,利用物理学模型(匀加速运动、抛射轨迹)和随机策略(柯西分布、信息素机制)平衡全局探索与局部开发。JSOA具有参数少、收敛快的特点,适用于函数优化、路径规划等领域,其生物行为与数学抽象的对应关系(如表1所示)是其核心创新点。 阅读详情

相关推荐

本地部署了qwen2.5:0.8b ,对接openclaw 后,电脑卡的要死

OpenClaw 强制 16k 上下文 + 无限历史 + Agent 调度,把 0.8b 压垮。按上面配置:轻量化 + 限历史 + 驻留显存,电脑立刻不卡。

专注于技术研发行业技术主要有AI人工智能视觉识别、物联网技术、电商平台、app原生技术、微信小程序、鸿蒙语言开发、办公企业oa、ERP等,致力于做东半球最优秀的程序员 978

Codeforces Round #465 (Div. 2) C. Fifa and Fafa(计算几何)

描述 Fifa and Fafa are sharing a flat. Fifa loves video games and wants to download a new soccer game. Unfortunately, Fafa heavily uses the internet which consumes the quota. Fifa can access t...

riba2534的博客 1417

从零到一:用AXI DataMover在Zynq MPSoC上实现高效DMA传输(附Vitis HLS驱动示例)

本文详细介绍了如何在Xilinx Zynq UltraScale+ MPSoC平台上使用AXI DataMover实现高效的DMA数据传输。通过解析AXI DataMover架构、Vivado工程配置、Vitis HLS驱动开发及性能优化技巧,帮助开发者快速构建高性能数据传输通道,并提供了可直接复用的代码示例。

weixin_42520796的博客 430

Codeforces-935C:Fifa and Fafa

C. Fifa and Fafatime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputFifa and Fafa are sharing a flat. Fifa loves video games and wants to download a ne...

Mitsuha_的博客 987

单相PWM整流器四象限运行原理

简述单相PWM整流器四象限运行原理。

m0_75208156的博客 8307

从战略到执行:业务领先模型 BLM 的第一把钥匙「差距分析」

业务领先模型「BLM」(Business Leadership Model),俗称“别乱摸”,起源于哈佛商学院的战略理论研究,是一套完整的战略规划方法论。 后来被 IBM 发扬光大,IBM 在转型关键时期完成了对 BLM 模型的导入和创新,从此这个模型成为 IBM 中高层用于战略制定与执行联接的方法与平台。 再到后来华为花巨资引入了 BLM 模型,经过多年的应用,将其演化成了公司战略规划和落地的主要方法与流程,也因此被中国科技企业所认识和接受。 BLM 模型可以解决哪些问题? 在企业内,

产品线负责人 2403

codeforces 935C Fifa and Fafa

C. Fifa and Fafatime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputFifa and Fafa are sharing a flat. Fifa loves video games and wants to download a ne...

kolmikl 701

2025年华为杯D题:低空湍流监测及最优航路规划思路与Matlab实现

2025年华为杯D题:低空湍流监测及最优航路规划思路与Matlab实现

前程算法屋的博客 774

codeforces 935C. Fifa and Fafa(圆)

题目链接codeforces 935 C 题意: 给一个半径,两个点求圆过第二个点的最大外切圆,如果第二个点在圆外,直接输出第一个点和半径 题解 以第二个点为起点,过第二个点做一条射线,交于圆上,长度即为所求直径,然后求出点的坐标 1.圆的方程 (x - a) * (x - a) + (y - b) * (y - b) = r *r 2.求根公式 x = ( -b+sq...

error311的博客 402

【06】新国都——新国都 嵌入式笔试,校招,题目记录及解析

本文总结了新国都嵌入式校招笔试题目及解析,内容涵盖C语言基础、Linux系统、数据结构与算法等多个方面。主要包括:1)不定项选择题10道,涉及字符串常量、蓝牙与GPRS区别、编译错误识别等;2)判断题10道,考察Linux权限、循环控制、内存管理等;3)填空题5道,包括编码计算、逻辑运算、宏定义等;4)简答题2道,解析全局变量引用和进程线程区别。题目难度适中,重点考察嵌入式开发基础知识和编程能力,并提供详细解析和扩展知识链接,对准备嵌入式相关笔试具有参考价值。

程序员,他们想的是什么?他们想的永远都是技术,他们崇尚的也永远都是技术。 1435

YOLOv11改进入门篇 | 手把手讲解改进模块如何实现高效涨点,以SimAM注意力模块为例

本文记录的是基于SimAM注意力模块的YOLOv11目标检测方法研究。SimAM注意力模块通过优化能量函数来获得每个神经元的三维权重,而或增加计算复杂度。若是有轻量化需求的小伙伴,无参的注意力模块也许是一个不错的选择。

Limiiiing的博客 9045

Codeforces Round #465 (Div. 2) C. Fifa and Fafa (SB题)

题意是这样的:在大圆里找一个小圆,这个圆要求在不包括一个点的前提下,尽可能的大,输出圆心坐标和半径 比赛的时候很遗憾……差一点就A了,我们先来判断我们不包括的点的情况,如果这个点在圆的外面,那问题就很简单了,只要输出大圆就行 如果这个点在大圆内,那我们先考虑一般情况: p点是我们不想包括的点,这个圆就是以p点到大圆圆心的延长线与大圆的交点为直径的圆,直径是p点和圆形的距离加上半径,小圆的...

limn204的专栏 276

华为OD机试真题 新系统【小学英语老师批改作文】

华为OD机试 新系统真题【小学英语老师批改作文】,提供C语言、Java、C++、Python、Go、JavaScript源码实现,并提供完整思路讲解,以及在线OJ模拟做题。华为OD机试真题【小学英语老师批改作文】

qq_45776114的博客 927

Codeforces 935 C Fifa and Fafa

935 C 题意:Fifa想用wifi下载足球游戏, 但是Fafa是个流浪狂魔, 所以Fifa想让他的wifi在公寓里尽量覆盖最大的面积,并且不覆盖到Fafa和公寓外的人,fafa的坐标可以在公寓外。 题解:求半径最大的地方就好了, 这个半径最大的位置一定在Fafa和公寓中心的连线上(前提是Fafa不和公寓中心重合且fafa在公寓范围内)。 代码: 1 #includ...

dengpangbu3703的博客 186

TMS_WebGMaps_1.9.8.0_Full_Source

TMS_WebGMaps_1.9.8.0_Full_Source 全源码 delphi cbuilder

怀旧版电脑GBC模拟器

再现原版GBC掌机的界面,电脑运行连游戏界面都一样大小,很怀旧,很真实,(英文版)强烈推荐,很小的文件,很难才找到的。

【CodeForces 935C --- Fifa and Fafa】几何 || 圆

【CodeForces 935C --- Fifa and Fafa】几何 || 圆 题目来源:点击进入【CodeForces 935C — Fifa and Fafa】 Description Fifa and Fafa are sharing a flat. Fifa loves video games and wants to download a new soccer game. Unfo...

来日浅谈的博客 650

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

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

codeforces 935-C.Fifa and Fafa(几何)

http://codeforces.com/problemset/problem/935/C 题目大意: 给出一个圆的圆心和半径,另外再给出一个点,问在这个圆内求一个最大的圆保证这个点不在这个圆内(可以在圆上),求圆的圆心和半径。 解题思路: 利用相似三角形,先判断圆心和点的距离大于半径和两点重合的情况,再结合相似求出圆心即可。 #include&lt;iostream&gt; #inc...

HJ 415

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

Codeforces 935C Fifa and Fafa

题意:    一直小A和小B是室友同住在一个公寓之中,但是小A不想要小B蹭自己的wifi。现在知道小B所在点求小A把wifi安装在哪里可以使得覆盖公寓的半径最大。 代码: #include&lt;bits/stdc++.h&gt; using namespace std; double R; double sqt(double a,double b,double c,double d) { ...

努力打工 366

Codeforces 935C Fifa and Fafa 题解 附平面几何基础:平面向量基本运算

一路过去好像平面向量也是必学的知识,毕竟用初中知识解题的日子已经过去了.我们来看一个例题. Codeforces 935C Fifa and Fafa 这个题是求一个圆之中不覆盖某点(x,y)的最大圆的圆心坐标和半径.(在圆上算不覆盖) 思路:首先判断某点是不是在圆外,如果在圆外直接输出圆的各项数值. 如果不是,很明显就是找出该点p与圆心连线延长线与圆的交点q,然后输出pq中点坐标和pq距...

Fuko_Ibuki的博客 1万+

CodeForces 935C Fifa and Fafa 计算几何

题意:    小A与小B住在同一个公寓,小B不想让小A用自己的wifi,问小B应该把wifi放在哪里能使得小A用不到且覆盖公寓的面积最大,输出wifi位置,覆盖半径分析:    A点到圆心O 的直线交公寓边的点B,AB的中点就是圆心 |AB|/2就是半径我们可以用AO方向上的单位距离分别在x,y轴上表示多少来算。bug点:1.小A电脑可能不在公寓内2.小A电脑如果在公寓中间需要特判否则会/0代码:...

努力打工 314

Codeforces Round #465 &935C. Fifa and Fafa计算几何

传送门 题意:在平面中,有一个圆,有一个点,问能在这个圆中围出最大的圆的圆心坐标和半径。要求这个最大圆不包含这个点。 思路:比较基础的计算几何,要分三种情况,第一种就是这个点在圆外的情况。第二种是点在圆内。第三种是这个点和圆心重合。 ac代码 #include <iostream> #include <cstdio> #include <al...

weixin_30412577的博客 164

Codeforces Round #465 (Div. 2) C. Fifa and Fafa

C. Fifa and Fafa time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Fifa and Fafa are sharing a flat. Fifa loves video games and want...

ii0789789789的博客 330

CF(935C - Fifa and Fafa)

题目链接:点击打开链接题目大意:   给出一个圆形房间的圆心坐标(x1,y1)和半径 r ,给出另一个点A坐标(x2,y2);要求求出一个不超出房间且不包含点A的最大的圆M,输出圆M的x,y坐标和半径(特别地,当A位于圆M上时,被认为不在圆M 内)题目分析:1.当点A位于圆形房间外时,直接输出圆形房间就好2.当点A与圆形房间的圆心重合时,我们只需要输出一个半径为r/2的,圆心位于以A为圆心以r/2...

Tmotfl的博客 917

CF 935 C. Fifa and Fafa 几何(贪心,相似)

题意:给出圆心(x1,y1)及其半径R的圆A. 和一个非法点(x2,y2)B  求出一组(x,y,r)使得其覆盖的范围在圆内 要求不能覆盖非法点 并且覆盖的面积为最大. 0 新的圆C(x,y,r)肯定和点B已经和圆A相切 否则可以扩大半径 偏移圆心使得 覆盖面积增大. 落在圆A上的切点Q肯定圆上离点B最远点,则BQ经过圆A的半径 同样经过圆C的半径  画图得r=(R+dis)/2

noone0的博客 278

Codeforces Round #465 (Div. 2) C. Fifa and Fafa(圆问题,数论)

C. Fifa and Fafatime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputFifa and Fafa are sharing a flat. Fifa loves video games and wants to download a ne...

WhaleFall 732

cf 465C. Fifa and Fafa

C. Fifa and Fafatime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputFifa and Fafa are sharing a flat. Fifa loves video games and wants to download a ne...

PragIncor的博客 561
上一篇: codeforces 935 B. Fafa and the Gates
下一篇: nowcoder 68 A-圆圆
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明:

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

余额充值