2016_NENU_SoftWare_Summer_ Training_1

最新推荐文章于 2021-02-24 07:24:51 发布
最新推荐文章于 2021-02-24 07:24:51 发布
阅读量629 收藏
点赞数 1
分类专栏： 比赛总结 文章标签： 比赛总结
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/ok_again/article/details/52074699
版权

题意都忘了，我找了之前ac的部分题目的代码，大家将就看一下吧，不会再问我。

A - Promotions

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<map>
#define xx first
#define yy second
#define LL long long
#define MP make_pair
#define INF 0x3f3f3f3f
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1|1
#define CLR(a, b) memset(a, b, sizeof(a))

using namespace std;

int cnt[10000];
int cnt2[10000];
vector<int> v[10000];
vector<int> g[10000];
bool vis[10000];

int bfs(int x) {
    queue<int> q;
    q.push(x);
    vis[x] = true;
    int ret = 0;
    while(!q.empty()) {
        int a = q.front();
        q.pop();
        for(int i = 0; i < v[a].size(); i ++) {
            int to = v[a][i];
            if(vis[to]) continue;
            vis[to] = true;
            ret ++;
            q.push(to);
        }
    }
    return ret;
}
int bfs2(int x) {
    queue<int> q;
    q.push(x);
    vis[x] = true;
    int ret = 0;
    while(!q.empty()) {
        int a = q.front();
        q.pop();
        for(int i = 0; i < g[a].size(); i ++) {
            int to = g[a][i];
            if(vis[to]) continue;
            vis[to] = true;
            ret ++;
            q.push(to);
        }
    }
    return ret;
}
int main() {
    int a, b, e, p;
    while(scanf("%d%d%d%d", &a, &b, &e, &p) != EOF) {
        for(int i = 0; i < e; i ++) {
            v[i].clear();
            cnt[i] = 0;
            cnt2[i] = 0;
        }
        for(int i = 0; i < p; i ++) {
            int x, y;
            scanf("%d%d", &x, &y);
            v[y].push_back(x);
            g[x].push_back(y);
        }

        for(int i = 0; i < e; i ++) {
            for(int j = 0; j < e; j ++) {
                vis[j] = false;
            }
            cnt[i] = bfs(i);
            for(int j = 0; j < e; j ++) {
                vis[j] = false;
            }
            cnt2[i] = bfs2(i);
        }

        int out1 = 0, out2 = 0, out3 = 0;
        for(int i = 0; i < e; i ++) {
            if(cnt[i] >= b) out3 ++;
            if(cnt2[i] >= e - a) out1 ++;
            if(cnt2[i] >= e - b) out2 ++;
        }

        printf("%d\n%d\n%d\n", out1, out2, out3);
    }
    return 0;
}
B - Black Vienna 

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<map>
#define xx first
#define yy second
#define LL long long
#define MP make_pair
#define INF 0x3f3f3f3f
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1|1
#define CLR(a, b) memset(a, b, sizeof(a))

using namespace std;

char s[100][10];
int a[100];
int b[100];
int n;
vector<int> g[100];
int belong[100];
bool vis[100];

bool dfs(int u) {
    for(int i = 0; i < g[u].size(); i ++) {
        int v = g[u][i];
        if(belong[v] != -1) {
            if(belong[v] == belong[u]) return false;
        } else {
            belong[v] = 1 - belong[u];
            if(!dfs(v)) return false;
        }
    }
    return true;
}

bool initMy(int x, int y, int z) {
    memset(belong, -1, sizeof belong);
    belong[x] = belong[y] = belong[z] = 2;
    for(int i = 0; i < 26; i ++) {
        g[i].clear();
    }
    for(int i = 0; i < n; i ++) {
        int u = s[i][0];
        int v = s[i][1];
        if(b[i] == 0) {
            if(belong[u] != 2) {
                if(belong[u] == -1) belong[u] = 1 - a[i];
                else if(belong[u] != 1 - a[i]) return false;
            }
            if(belong[v] != 2) {
                if(belong[v] == -1) belong[v] = 1 - a[i];
                else if(belong[v] != 1 - a[i]) return false;
            }
        } else if(b[i] == 2) {
            if(belong[u] == -1) belong[u] = a[i];
            else if(belong[u] != a[i]) return false;
            if(belong[v] == -1) belong[v] = a[i];
            else if(belong[v] != a[i]) return false;
        } else {
            if(belong[u] == 2) {
                if(belong[v] != -1 && belong[v] != a[i]) return false;
                belong[v] = a[i];
                continue;
            }
            if(belong[v] == 2) {
                if(belong[u] != -1 && belong[u] != a[i]) return false;
                belong[u] = a[i];
                continue;
            }
            g[u].push_back(v);
            g[v].push_back(u);
        }
    }
    memset(vis, 0, sizeof vis);
    for(int i = 0; i < 26; i ++) {
        if(belong[i] != -1 && belong[i] != 2) {
            if(!dfs(i)) return false;
        }
    }
    for(int  i = 0; i < 26; i ++) {
        if(belong[i] != -1) continue;
        belong[i] = 0;
        if(!dfs(i)) return false;
    }
    return true;
}

bool judge(int x, int y, int z) {
    if(!initMy(x, y, z)) return false;
    return true;
}

int main() {
    while(scanf("%d", &n) != EOF) {
        for(int i = 0; i < n; i ++) {
            scanf("%s%d%d", s[i], &a[i], &b[i]);
            a[i] --;
            s[i][0] -= 'A';
            s[i][1] -= 'A';
        }
        int ans = 0;
        for(int i = 0; i < 26; i ++) {
            for(int j = i + 1; j < 26; j ++) {
                for(int k = j + 1; k < 26; k ++) {
                    if(judge(i, j, k)) {
                        ans ++;
                    }
                }
            }
        }
        printf("%d\n", ans);
    }
    return 0;
}
/**
0
2
AB 1 1
AC 2 1

3
AB 1 1
AC 2 1
BC 2 1
3
AB 1 1
AC 2 1
BC 2 1
3
AB 1 1
AC 2 1
BC 2 1
3
AB 1 1
AC 2 1
BC 2 1
3
AB 1 1
AC 2 1
BC 2 1
3
AB 1 1
AC 2 1
BC 2 1
3
AB 1 1
AC 2 1
BC 2 1
3
AB 1 1
AC 2 1
BC 2 1
3
AB 1 1
AC 2 1
BC 2 1

*/
C - Canvas Painting 

//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<map>
#define xx first
#define yy second
#define LL long long
#define MP make_pair
#define inf 0x3f3f3f3f
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1|1
#define CLR(a, b) memset(a, b, sizeof(a))

using namespace std;

int main()
{
    int T, n;
    scanf("%d", &T);
    while(T --)
    {
        scanf("%d", &n);
        priority_queue<LL> Q;
        for(int i = 0; i < n; i ++)
        {
            LL a; scanf("%lld", &a);
            Q.push(-a);
        }
        LL ans = 0;
        while(true)
        {
            if(Q.size() == 1) break;
            LL u = -Q.top(); Q.pop();
            LL v = -Q.top(); Q.pop();
            ans += u + v;
            Q.push(-u - v);
        }
        printf("%lld\n", ans);
    }
    return 0;
}
D - Dice Cup 

//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<map>
#define xx first
#define yy second
#define LL long long
#define MP make_pair
#define inf 0x3f3f3f3f
#define CLR(a, b) memset(a, b, sizeof(a))

using namespace std;

const int maxn = 111;

int cnt[maxn];

int main()
{
    int n, m, flag = 0;
    while(scanf("%d%d", &n, &m) != EOF)
    {
        CLR(cnt, 0);
        for(int i = 1; i <= n; i ++)
        {
            for(int j = 1; j <= m; j ++)
                cnt[i + j] ++;
        }
        vector<int> ans;
        int tmp = 0;
        for(int i = 2; i <= n + m; i ++)
        {
            if(cnt[i] > tmp)
            {
                tmp = cnt[i];
                ans.clear(); ans.push_back(i);
            }
            else if(cnt[i] == tmp) ans.push_back(i);
        }
        if(flag) puts("");
        flag = 1;
        for(int i = 0; i < ans.size(); i ++)
            printf("%d\n", ans[i]);
    }
    return 0;
}
E - Wooden Signs 

//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<bitset>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<map>
#define xx first
#define yy second
#define LL long long
#define MP make_pair
#define INF 0x3f3f3f3f
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1|1
#define CLR(a, b) memset(a, b, sizeof(a))

using namespace std;

const int maxn = 2222;

LL dp[maxn][maxn];

int a[maxn];

const int MOD = 2147483647;

int main()
{
    int n;
    while(scanf("%d", &n) != EOF)
    {
        for(int i = 0; i <= n; i ++)
            scanf("%d", &a[i]);
        CLR(dp, 0);
        dp[1][a[0]] = 1;
        for(int i = 2; i <= n; i ++)
        {
            if(a[i] < a[i - 1])
            {
                for(int j = 1; j < a[i]; j ++)
                {
                    dp[i][j] = dp[i - 1][j];
                    dp[i][a[i - 1]] += dp[i - 1][j];
                }
                for(int j = a[i]; j <= a[i - 1]; j ++)
                {
                    dp[i][a[i - 1]] += dp[i - 1][j];
                }
                for(int j = a[i - 1] + 1; j <= n + 1; j ++)
                {
                    dp[i][j] = dp[i - 1][j];
                }
            }
            else
            {
                for(int j = 1; j < a[i - 1]; j ++)
                {
                    dp[i][j] = dp[i - 1][j];
                }
                for(int j = a[i - 1]; j <= a[i]; j ++)
                {
                    dp[i][a[i - 1]] += dp[i - 1][j];
                }
                for(int j = a[i] + 1; j <= n + 1; j ++)
                {
                    dp[i][j] = dp[i - 1][j];
                    dp[i][a[i - 1]] += dp[i - 1][j];
                }
            }
            dp[i][a[i - 1]] %= MOD;
        }
        LL ans = 0;
        for(int i = 1; i <= n + 1; i ++)
        {
            ans += dp[n][i];
            ans %= MOD;
        }
        printf("%lld\n", ans);
    }
    return 0;
}
G - Game of Cards 

//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<map>
#define xx first
#define yy second
#define LL long long
#define MP make_pair
#define INF 0x3f3f3f3f
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1|1
#define CLR(a, b) memset(a, b, sizeof(a))

using namespace std;

const int maxn = 1111;
int a[maxn], sg[maxn];
int vis[maxn][maxn];
int k, cc;

int dfs(int n)
{
    if(n == 0) return 0;
    if(sg[n] != -1) return sg[n];
    for(int i = 0; i <= min(k, n - 1); i ++)
    {
        int t = n - i - a[n - i];
        if(t >= 0) vis[n][dfs(t)] = cc;
    }
    for(int j = 0; j < 1111; j ++) if(vis[n][j] != cc)
    {
        sg[n] = j;
        break;
    }
//    printf("%d -- %d\n", n, sg[n]);
    return sg[n];
}

int main()
{
    int n;
    while(scanf("%d%d", &n, &k) != EOF)
    {
        int ans = 0;
        CLR(vis, 0);
        for(int i = 1; i <= n; i ++)
        {
            cc = i;
            int m; scanf("%d", &m);
            CLR(sg, -1);
            a[0] = 0;
            for(int j = 1; j <= m; j ++)
                scanf("%d", &a[j]);
//            printf("%d --\n", dfs(m));
            ans ^= dfs(m);
        }
        puts(ans ? "Alice can win." : "Bob will win.");
    }
    return 0;
}
H - Sheldon Numbers 

//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<unordered_map>
#define xx first
#define yy second
#define LL long long
#define MP make_pair
#define INF 0x3f3f3f3f
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1|1
#define CLR(a, b) memset(a, b, sizeof(a))

using namespace std;

unsigned LL x, y;

vector<unsigned LL> vec;

void init()
{
    unsigned LL a;
    for(int i = 1; i <= 63; i ++)
    {
        a = (1llu << i) - 1;
        vec.push_back(a);
        for(int j = 1; i + j < 64; j ++)
        {
            unsigned LL tmp = 0;
            int c = 0;
            while(c + i + j <= 63)
            {
                tmp = (tmp << i) + a;
                tmp = (tmp << j);
                c += i + j;
                vec.push_back(tmp);
            }
            tmp = a;
            c = i;
            while(c + i + j <= 63)
            {
                tmp = (tmp << j);
                tmp = (tmp << i) + a;
                c += i + j;
                vec.push_back(tmp);
            }
        }
    }
    vec.push_back(1llu << 63);
    sort(vec.begin(), vec.end());
}

int main()
{
    init();
    while(scanf("%llu%llu", &x, &y) != EOF)
    {
        int r = upper_bound(vec.begin(), vec.end(), y) - vec.begin();
        int l = lower_bound(vec.begin(), vec.end(), x) - vec.begin();
        printf("%d\n", r - l);
    }
    return 0;
}
J - Saint John Festival 

//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<map>
#define xx first
#define yy second
#define LL double
#define MP make_pair
#define INF 0x3f3f3f3f
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1|1
#define CLR(a, b) memset(a, b, sizeof(a))

using namespace std;

struct Point{
    LL x,y;
    Point(){}
    Point(LL x,LL y):x(x),y(y){}
    Point operator+(const Point &a){
        return Point(x+a.x,y+a.y);
    }
    Point operator-(const Point &a){
        return Point(x-a.x,y-a.y);
    }
    Point operator/(const double &a){
        return Point(x/a,y/a);
    }
    LL operator*(const Point &a){
        return x*a.y-y*a.x;
    }
    void input(){
        scanf("%lf%lf",&x,&y);
    }
}L[50050],res[50050];

bool operator<(const Point &l,const Point &r){
    return l.y<r.y||(l.y==r.y&&l.x<r.x);
}
int graham(Point pnt[],int n,Point res[]){
    int i,len,k=0,top=1;
    sort(pnt,pnt+n);
    if(n==0) return 0;res[0]=pnt[0];
    if(n==1) return 1;res[1]=pnt[1];
    if(n==2) return 2;res[2]=pnt[2];
    for(i=2;i<n;i++){
        while(top&&(pnt[i]-res[top-1])*(res[top]-res[top-1])>=0) top--;
        res[++top]=pnt[i];
    }
    len=top;res[++top]=pnt[n-2];
    for(i=n-3;i>=0;i--){
        while(top!=len&&(pnt[i]-res[top-1])*(res[top]-res[top-1])>=0) top--;
        res[++top]=pnt[i];
    }
    return top;
}

bool isin(Point a,int cnt){
    Point g=(res[0]+res[(cnt/3)]+res[(2*cnt/3)])/3.0;
    int l=0,r=cnt;
    while(l+1<r){
        int mid=(l+r)/2;
        LL k=(res[l]-g)*(res[mid]-g);
        LL res1=(res[l]-g)*(a-g);
        LL res2=(res[mid]-g)*(a-g);
        if(k>0){
            if(res1>=0&&res2<0) r=mid;
            else l=mid;
        }else{
            if(res1<0&&res2>=0) l=mid;
            else r=mid;
        }
    }
    r%=cnt;
    LL z=(res[r]-a)*(res[l]-a);
    if(z<=0) return 1;
    else return 0;
}

int main(){
    int n,m;
    while(scanf("%d",&n)!=EOF){
        for(int i=0;i<n;i++) L[i].input();
        n=graham(L,n,res);
        for(int i=0;i<n;i++) res[i+n]=res[i];
        int ans=0;
        scanf("%d",&m);
        for(int i=0;i<m;i++){
            Point p;p.input();
            if(isin(p,n)) ans++;
        }
        printf("%d\n",ans);
    }
}







ok_again
关注
专栏目录
初等数论_1 2016.3.30
追风蹑影
03-29 1033
数论，顾名思义，是对整数进行研究的理论。 是数学学科的一个重要分支，也是ACM竞赛题型中饶有趣味的一个部分。数论，有人戏称为“素论”。 可见对于素数的研究在数论中比重之大。 当然，也有不是对素数操作的算法，在这里我们也将其划归为数论。一、整数1.1 1.2 (1)0可以被任何非0数整除 (2)传递性：a | b && b | c <=> a | c. (3)如果a、b都能被c整除，
安川机器人dx200编程手册_安川DX100DX200通信接口手册
weixin_39979617的博客
12-19 3511
【实例简介】手册介绍了安川机器人配套控制柜DX200的以太网/串行接口通讯功能，可搭配DX200的使用说明书一起学习本手册的使用方法于册结构本用户手册的结构如下第1章通信功能概要阐述了通信功能和接口间的关系并给出了通信功能之概要。第2章使用以太网接口闻述了以太网规格及设定方法第3章使用串行接口(附加规格)阐述了串行接口(附加规格)的规格及设定方法。可用RS-232和RS-422-A/485两种串行...
2016_NENU_SoftWare_Summer_ Training_4
ok_again的专栏
08-29 595
Problem A UVALive 7000 Present Problem //#pragma comment(linker, "/STACK:1024000000,1024000000") #include #include #include #include #include #include #include #include #include #include #define xx f
2016_NENU_SoftWare_Summer_ Training_3
ok_again的专栏
08-06 596
Problem A URAL 2062 Ambitious Experiment //#pragma comment(linker, "/STACK:1024000000,1024000000") #include #include #include #include #include #include #include #include #include #include #define xx
2016_NENU_SoftWare_Summer_ Training_2
ok_again的专栏
08-02 655
Problem A UVALive 7214 Arithmetical CAPTCHA //#pragma comment(linker, "/STACK:1024000000,1024000000") #include #include #include #include #include #include #include #include #include #include #defin
2016_NENU_CS_3
08-11 103
贴一下比赛的代码, 其中 I 题代码源于final大神 ok_again http://acm.hust.edu.cn/vjudge/contest/127444#overview I 1 /************************************************************************* 2 > ...
NENU_CS_segment_tree
11-01 129
单点更新 http://acm.hdu.edu.cn/showproblem.php?pid=1166 题意：单点更新加减，区间查询求和。 1 #include<cstdio> 2 #define lrrt int L,int R,int rt 3 #define iall 1,n,1 4 #define imid int mid=(L+R...
NENU SUMMER TRAINING #1 （题解）
ShadowGhostH的博客
07-24 399
A B C D E F G H I A 题意：定义一个填充块，填充块由 ‘o’, ‘g’ 交替出现组成，并且以 ‘o’ 开头，以 ‘o’ 结尾，形如：”ogo”, “ogogo”, “ogogogo”等，现在给出一个给定长度的字符串，需要将其中所有的填充块换为 ‘***’ 之后输出。 思路：问题的核心在于如何找出所有的填充块，我们可以发现，填充块可以转化成，以o开头与不少于一组...
HDUOJ(Red and Black)_NENUOJ(红与黑)_C++版@FDDLC
LiuXingchang的博客
12-22 584
HDUOJ：http://acm.hdu.edu.cn/showproblem.php?pid=1312 NENUOJ：http://47.106.114.75/contest/21/problem/C   Problem Description There is a rectangular room, covered with square tiles. Each tile is col...
POJ1426(Find The Multiple)_NENUOJ(寻找M)_C语言版@FDDLC
LiuXingchang的博客
12-21 594
POJ1426：http://poj.org/problem?id=1426 NENUOJ：http://47.106.114.75/contest/21/problem/B   Description Given a positive integer n, write a program to find out a nonzero multiple m of n whose decima...
nenu acm 模板
04-02
1. **几何基础**：模板首先提醒用户注意几何问题中的精度问题，因为浮点数计算可能会导致精度损失。这通常需要使用特殊的方法来处理，比如高精度计算或者适当的误差容忍度。 2. **几何公式**：模板包含了各种几何...
Nenu python期末作业.zip
最新发布
06-14
1. **基础语法**：Python的基础包括变量、数据类型（如整型、浮点型、字符串、布尔型）、列表、元组、字典、集合等。理解这些基本概念对于编写任何Python程序都是至关重要的。 2. **流程控制**：Python提供了条件...
java pdfbox 解析报错_pdfBox 解析 pdf文件
weixin_35810162的博客
02-24 1119
Spting boot 项目1.添加依赖org.apache.pdfboxpdfbox2.0.162.PDFTest.javapackage com.nenu.pdf;import org.apache.pdfbox.io.RandomAccessFile;import org.apache.pdfbox.pdfparser.PDFParser;import org.apache.pdfbox.p...
福州大学第十一届程序设计竞赛
ok_again的专栏
04-27 2495
福州大学第十一届程序设计竞赛 Contest Finished! Tag Pro.ID Problem Title Ratio(AC/Submit) 1 大王叫我来巡山呐 80.31%(261/325) 2 防守阵地 I 23.48%(193/822) 3 shadow 13.23%(97/733) 4
ACM-ICPC国际大学生程序设计竞赛北京赛区(2015)网络赛
ok_again的专栏
09-22 2466
补题。 A-The Cats' Feeding Spots 枚举圆心点，然后二分半径。注意圆的边上不能有点。 //#pragma comment(linker, "/STACK:1024000000,1024000000") #include #include #include #include #include #include #include #include #include #
2014东北四省赛
ok_again的专栏
06-09 2021
这次运气真好。。。要是区域赛也有这种运气就好了。
The 11th Zhejiang Provincial Collegiate Programming Contest
ok_again的专栏
04-13 1751
133 - The 11th Zhejiang Provincial Collegiate Programming Contest Solved ID Title Ratio (AC/All) Yes A Pokemon Master 56.58% (391/691) Yes B Problem Arrangement
2015-2016 ACM-ICPC, NEERC, Northern Subregional Contest
ok_again的专栏
11-02 1644
A-Alex Origami Squares 水题。 //#pragma comment(linker, "/STACK:1024000000,1024000000") #include #include #include #include #include #include #include #include #include #include #define xx first #defin
2014 北京、西安邀请赛
ok_again的专栏
05-29 1416
今年有幸能打两场邀请赛，真的是很幸运。。。但是打出来的效果就。。。本来都没脸写总结了的，后来想了想还是写了吧，不然这两场又白打了。             由于两场比赛相隔只有一周，所以我们就给自己放了10+天的假，玩是玩爽了，可惜比的就很烂了。。。稍微记录一下流水账吧，以后反思用。             先说一下北京的吧。             第一天热身赛，能做的只有两道，C题是输出
numpypandasskleam
07-28
result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v91^koosearch_v1,239^v3^insert_chatgpt"}} ] [.reference_item] - *2* [【Python】Numpy&Pandas]...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值