2016_NENU_SoftWare_Summer_ Training_3

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

Problem A URAL 2062 Ambitious Experiment

//#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 = 1001000;

int n;

int a[maxn];
LL C[maxn];

void add(int x, int v)
{
    while(x <= n)
    {
        C[x] += v;
        x += x & (-x);
    }
}

LL sum(int x)
{
    LL ret = 0;
    while(x)
    {
        ret += C[x];
        x -= x & (-x);
    }
    return ret;
}

void solve()
{
    int q; scanf("%d", &q);
    while(q --)
    {
        int op, x, l, r;
        scanf("%d", &op);
        if(op == 1)
        {
            scanf("%d",  &x);
            LL ans = a[x];
            for(int j = 1; j * j <= x; j ++)
            {
                if(x % j) continue;
                ans += sum(j);
                if(j != x / j)
                    ans += sum(x / j);
            }
            printf("%I64d\n", ans);
        }
        else
        {
            scanf("%d%d%d", &l, &r, &x);
            add(l, x);
            add(r + 1, -x);
        }
    }
}

int main()
{
    while(scanf("%d", &n) != EOF)
    {
        CLR(C, 0);
        for(int i = 1; i <= n; i ++)
            scanf("%d", &a[i]);
        solve();
    }
    return 0;
}
Problem B URAL 2063 Black and White 

//#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;

void solve(int x){
    for(int i = 1; i <= x; i ++) {
        for(int j = i + 1; j <= x; j ++) {
            printf("? %d %d\n", i, j);
        }
    }
    int t = rand() % (x - 1) + 1;
    printf("! %d %d\n", t, t + 1);
}
int main() {
    int m;
    scanf("%d", &m);
    for(int i = 2; i <= 1 + m; i ++) {
        solve(i);
    }
    return 0;
}
Problem C URAL 2064 Caterpillars 

//#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))

#define _max(a, b) a > b ? a : b

using namespace std;

const int _maxn = 1001000;

vector<int> vec[_maxn];

int n;
int a[_maxn];

inline int Scan()
{
    int res = 0, ch, flag = 0;

    if((ch = getchar()) == '-')             //判断正负
        flag = 1;

    else if(ch >= '0' && ch <= '9')           //得到完整的数
        res = ch - '0';
    while((ch = getchar()) >= '0' && ch <= '9' )
        res = res * 10 + ch - '0';

    return flag ? -res : res;
}

void solve()
{
    sort(a, a + n);
    n = unique(a, a + n) - a;
    int q = Scan();
    while(q --)
    {
        int x = Scan();
        int ans = 0;
        int b = lower_bound(a, a + n, x) - a;
        if(b != n)
        {
            printf("%d\n", x);
            continue;
        }
        for(int i = 1; i * i <= x; i ++)
        {
            int b = lower_bound(a, a + n, i) - a;
            if(b != n)
            {
                int c = x % (a[b] * 2);
                if(c <= a[b]) ans = _max(ans, c);
                else ans = _max(ans, a[b] * 2 - c);
            }
            if(b >= 1)
            {
                b --;
                int c = x % (a[b] * 2);
                if(c <= a[b]) ans = _max(ans, c);
                else ans = _max(ans, a[b] * 2 - c);
                b ++;
            }
            if(b < n - 1)
            {
                b ++;
                int c = x % (a[b] * 2);
                if(c <= a[b]) ans = _max(ans, c);
                else ans = _max(ans, a[b] * 2 - c);
                b --;
            }
            if(i == x / i) continue;
            int j = (x + i - 1) / i;
            b = lower_bound(a, a + n, j) - a;
            if(b != n)
            {
                int c = x % (a[b] * 2);
                if(c <= a[b]) ans = _max(ans, c);
                else ans = _max(ans, a[b] * 2 - c);
            }
            if(b >= 1)
            {
                b --;
                int c = x % (a[b] * 2);
                if(c <= a[b]) ans = _max(ans, c);
                else ans = _max(ans, a[b] * 2 - c);
                b ++;
            }
            if(b < n - 1)
            {
                b ++;
                int c = x % (a[b] * 2);
                if(c <= a[b]) ans = _max(ans, c);
                else ans = _max(ans, a[b] * 2 - c);
                b --;
            }
        }
        printf("%d\n", ans);
    }
    return ;
}

int main()
{
    while(scanf("%d", &n) != EOF)
    {
        for(int i = 1; i <= n; i ++)
        {
            a[i - 1] = Scan();
        }
        solve();
    }
    return 0;
}


Problem D URAL 2065 Different Sums

//#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 n, m;
    while(scanf("%d%d", &n, &m) != EOF) {
        m --;
        if(m % 2 == 0) {
            int mxx = m / 2;
            for(int i = 1; i <= mxx; i ++) {
                printf("%d %d ", i, -i);
            }
            for(int i = mxx * 2 + 1; i <= n; i ++) {
                printf("%d ", 0);
            }
            puts("");
        }else{
            int mxx = m / 2;
            for(int i = 1; i <= mxx; i ++) {
                printf("%d %d ", i, -i);
            }
            printf("%d ", mxx + 1);
            for(int i = mxx * 2 + 2; i <= n; i ++) {
                printf("%d ", 0);
            }
            puts("");
        }
    }
    return 0;
}

Problem E URAL 2066 Simple Expression

//#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 a, b, c;

int main()
{
    while(scanf("%d%d%d", &a, &b, &c) != EOF)
    {
        if(c + b > c * b)
            printf("%d\n", a - b - c);
        else printf("%d\n", a - b * c);
    }
    return 0;
}


Problem F URAL 2067 Friends and Berries 

//#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=200020;

struct Point{
    LL x,y;
    int id;
    Point(){}
    Point(LL x,LL y):x(x),y(y){}
    Point operator-(const Point &a){
        return Point(x-a.x,y-a.y);
    }
    LL operator*(Point a){
        return x*a.y-y*a.x;
    }
    void input(int idx){
        scanf("%I64d%I64d",&x,&y);
        id=idx;
    }
    bool friend operator<(const Point &a,const Point &b){
        if(a.x==b.x) return a.y<b.y;
        return a.x<b.x;
    }
}p[maxn];

int main(){
    int n;
    while(scanf("%d",&n)!=EOF){
        for(int i=0;i<n;i++) p[i].input(i);
        sort(p,p+n);
        bool ok=1;
        for(int i=1;i+1<n&&ok;i++){
            if((p[i]-p[0])*(p[i]-p[n-1])!=0) ok=0;
        }
        if(!ok) puts("0");
        else{
            puts("1");
            printf("%d %d\n",p[0].id+1,p[n-1].id+1);
        }
    }
}


Problem G URAL 2068 Game of Nuts

//#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 n;
    while(scanf("%d",&n)!=EOF){
        int sum=0;
        for(int i=0;i<n;i++){
            int tmp;scanf("%d",&tmp);
            sum+=(tmp-1)/2;
        }
        if(sum%2) puts("Daenerys");
        else puts("Stannis");
    }
}

Problem H URAL 2069 Hard Rock

//#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 = 100100;

int n, m;
int a[maxn], b[maxn];

void solve()
{
    int ans = min(a[1], b[m]);
    ans = max(ans, min(a[n], b[1]));
    int mx = a[1];
    for(int i = 2; i <= n; i ++)
        mx = max(mx, a[i]);
    ans = max(ans, min(mx, min(b[1], b[m])));
    mx = b[1];
    for(int i = 2; i <= m; i ++)
        mx = max(mx, b[i]);
    ans = max(ans, min(mx, min(a[1], a[n])));
    printf("%d\n", ans);
}

int main()
{
    while(scanf("%d%d", &n, &m) != EOF)
    {
        for(int i = 1; i <= n; i ++)
            scanf("%d", &a[i]);
        for(int i = 1; i <= m; i ++)
            scanf("%d", &b[i]);
        solve();
    }
    return 0;
}


Problem I URAL 2070 Interesting 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>
#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=1000100;
bool isp[maxn];
int pri[maxn/10],l;

void init(){
    l=0;
    memset(isp,0,sizeof(isp));
    for(int i=2;i*i<maxn;i++) if(!isp[i]){
        for(int j=i*i;j<maxn;j+=i) isp[j]=1;
    }
    for(int i=2;i<maxn;i++) if(!isp[i]) pri[l++]=i;
}

LL gao(LL n){
    LL ret=n;
    for(int i=0;i<l&&1ll*pri[i]*pri[i]<=n;i++){
        LL now=1ll*pri[i]*pri[i];
        int cnt=2;ret--;
        while(now*pri[i]<=n){
            now*=pri[i];
            cnt++;
            if(!isp[cnt+1]) ret--;
        }
    }
    return ret;
}

int main(){
    init();
    LL L,R;
    while(cin>>L>>R){
//        printf("%lld %lld\n",gao(L-1),gao(R));
        printf("%I64d\n",gao(R)-gao(L-1));
    }
}


Problem J URAL 2071 Juice Cocktails 

//#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;

string s[101000];
int id[101000];
int out[101000];
// A0,B1,P2;
int cnt[100];
int top[100];
int ans[100];

int main() {
    int n;
    while(cin >> n) {
        memset(cnt, 0, sizeof cnt);
        memset(id, 0, sizeof id);

        for(int i = 0; i < n; i ++) {
            string x;
            cin >> s[i];
            x = s[i];
            if(x.find('A') != -1) id[i] |= 1;
            if(x.find('B') != -1) id[i] |= 2;
            if(x.find('P') != -1) id[i] |= 4;
//            printf("id = %d\n", id[i]);
            cnt[id[i]] ++;
        }

        vector<int> t;
        for(int i = 0; i < 8; i ++) {
            if(cnt[i]) t.push_back(i);
        }
//        printf("sz = %d\n", t.size());
        int ned = INF;
        do{
            int tmp = 0;
            if(t[0] & 1) tmp ++;
            if(t[0] & 2) tmp ++;
            if(t[0] & 4) tmp ++;

            for(int i = 1; i < t.size(); i ++) {
                if((t[i - 1] & 1) == 0 && (t[i] & 1)) tmp ++;
                if((t[i - 1] & 2) == 0 && (t[i] & 2)) tmp ++;
                if((t[i - 1] & 4) == 0 && (t[i] & 4)) tmp ++;
            }

            if(tmp < ned) {
                ned = tmp;
                for(int i = 0; i < t.size(); i ++) {
                    ans[i] = t[i];
                }
            }
        }while(next_permutation(t.begin(), t.end()));
        printf("%d\n", ned);
        int hd = 1;
        for(int i = 0; i < t.size(); i ++) {
//            printf("%d ->\n", ans[i]);
            int nowId = ans[i];
            top[nowId] = hd;
            hd += cnt[nowId];
        }
        for(int i = 0; i < n; i ++) {
            int who = id[i];
            out[top[who] ++] = i + 1;
        }
        for(int i = 1; i <= n; i ++) {
            printf("%d%c", out[i], i == n ? '\n' : ' ');
        }
    }
    return 0;
}


/**
7
A
AB
ABP
AP
B
BP
P
*/


Problem K URAL 2072 Kirill the Gardener 3 

//#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 = 1100000;

map<int, int> mp;
vector<int> v[maxn];

struct node{
    int id, x;
    bool operator < (const node& a) const {
        return x < a.x;
    }
}s[maxn];

int top;
LL dp[2];
int pos[2];

int main() {
    int n;
    while(scanf("%d", &n) != EOF) {
        top = 0;
        mp.clear();
        for(int i = 0; i < n; i ++) {
            v[i].clear();
        }
        for(int i = 0; i < n; i ++) {
            scanf("%d", &s[i].x);
            s[i].id = i + 1;
        }

        sort(s, s + n);

        for(int i = 0; i < n; i ++) {
            if(mp.count(s[i].x) == 0) {
                mp[s[i].x] = top ++;
            }
            v[mp[s[i].x]].push_back(s[i].id);
        }

        for(int i = 0; i < top; i ++) {
            sort(v[i].begin(), v[i].end());
        }

        dp[0] = dp[1] = 0;
        pos[0] = pos[1] = 1;

        for(int i = 0; i < top; i ++) {
            int sz = v[i].size();
            LL len = v[i][sz - 1] - v[i][0];
            LL dp0 = dp[0], dp1 = dp[1];
            dp[0] = min(dp0 + abs(v[i][sz - 1] - pos[0]) + len, dp1 + abs(v[i][sz - 1] - pos[1]) + len) + sz;
            dp[1] = min(dp0 + abs(v[i][0] - pos[0]) + len, dp1 + abs(v[i][0] - pos[1]) + len) + sz;
            pos[0] = v[i][0];
            pos[1] = v[i][sz - 1];
//            printf("%lld <-> %lld %d %d\n", dp[0], dp[1], pos[0], pos[1]);
        }
        LL ans = min(dp[0], dp[1]);
        printf("%I64d\n", ans);
    }
    return 0;
}


Problem L URAL 2073 Log Files 
//#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;

char pl[200] = "+------------------------------+--------+-------------+";

char sp[5][200] =
{
    "+------------------------------+--------+-------------+",
    "|Contest name                  |Date    |ABCDEFGHIJKLM|",
    "+------------------------------+--------+-------------+"
};

/**
+------------------------------+--------+-------------+
|Contest name                  |Date    |ABCDEFGHIJKLM|
+------------------------------+--------+-------------+
|Codeforces Gamma Round 512    |29.02.16|ooo.o        |
+------------------------------+--------+-------------+
|URKOP                         |17.10.15|oo..xo.o.o.. |
+------------------------------+--------+-------------+
*/

int n;
char ch[200];

int main()
{
//    freopen("L.txt", "r", stdin);
    while(scanf("%d", &n) != EOF)
    {
        getchar();
        puts(sp[0]);
        puts(sp[1]);
        while(n --)
        {
            puts(pl);
            putchar('|');
            gets(ch); int len = strlen(ch);
            for(int i = 0; i < 30; i ++)
            {
                if(i < len) putchar(ch[i]);
                else putchar(' ');
            }
            putchar('|');
            gets(ch);
            for(int i = 0; i < 8; i ++)
                putchar(ch[i]);
            putchar('|');
            int a, b; scanf("%d%d", &a, &b);
            int vis[20] = {0};
            getchar();
            for(int i = 0; i < b; i ++)
            {
                gets(ch); int p = ch[0] - 'A';
                if(ch[2] == 'A')
                {
                    vis[p] = 1;
                }
                else if(vis[p] == 0)
                    vis[p] = 2;
            }
            for(int i = 0; i < 13; i ++)
            {
                if(i < a)
                {
                    if(vis[i] == 0) putchar('.');
                    else if(vis[i] == 1) putchar('o');
                    else putchar('x');
                }
                else putchar(' ');
            }
            putchar('|');
            puts("");
        }
        puts(pl);
    }
    return 0;
}



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_1
ok_again的专栏
07-30 629
题意都忘了，我找了之前ac的部分题目的代码，大家讲究看一下吧，不会再问我。
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 #3 (题解)
ShadowGhostH的博客
07-26 228
A 题意 分析 代码 B 题意 分析 代码 C 题意 分析 代码 D 题意 分析 E 题意 分析 代码 F 题意 分析 代码 G 题意 分析 代码 H 题意 分析 代码 特别感谢由Muvsea提供的部分思路与代码 A 题意 输出1378n1378n1378^n 的个位数字是多少？ 分析 我们知道对于一个数的n次幂，他的个位数字会以一...
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
3. **多边形处理**：模板提供了处理多边形的方法，包括判断点是否在多边形内、求多边形面积等。这对于解决涉及平面图形的问题非常有用。 4. **多边形切割**：在一些复杂的几何问题中，可能需要将一个多边形切割成多...
Nenu python期末作业.zip
最新发布
06-14
3. **函数**：函数是代码的可重用模块，Python中的函数可以接受参数并返回值。了解如何定义、调用和使用内置函数，以及如何创建自定义函数，是提高编程效率的关键。 4. **模块和包**：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
- *3* [Numpy＆pandas](https://blog.csdn.net/qq_43607232/article/details/127475202)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值