第16届 IEEE 极限编程大赛参赛记录

第一次参赛，RK 333
和研究生学长学姐一起打的，可惜我太菜了，没能做出更多的题目

记录一下题目吧

题目链接

第一小时

我先签了最简单的题目
然后一起找规律
找了半个小时，才发现是字符串解密
而且偏移量规则特别简单
而最难的题目不会写

第二小时
一道字符串模拟，丢给队友写了
然后我在想一道难的，可惜完全没思路
最后随机化骗分
后来三个人一起看字符串处理
最后是学姐写的，但是只有90，不知道哪里没考虑到

第三小时
我和学长开梦之队
可惜不会DP,直接打的暴力
dfs爆搜骗分
【update: 然鹅赛后发现是折半查找… ，我是真的菜！！！】

后来开andman
一开始以为是树剖
后来学长发现是LCA+前缀乘积+逆元
然后套板子

结果我犯病了(背锅
漏写一行代码
de了1个小时才AC

后来又是一道字符串+图论
全队讨论2个小时才有正确思路
但是发现恶心的问题

他处理的字符串，不是普通的字符串
可能会出现一些怪怪的字符
然后我c++编译过不去
给学姐写的
链式前向星又写了蛮久
好在后来A了

接着一道简单数论
直接快速幂秒了
困难版本的不会写，打暴力
PY和JAVA分别骗分
biginter 永远滴神

再后来一道BFS题目
我写了300+行都不能AC
真的离谱
但是又不知道哪里错
再次背锅
【update: 赛后补题过的，漏考虑了啊啊啊啊啊啊啊啊啊啊啊】

一道图论简单题
度数考虑下就秒了

然后是一道DP
经典例题了属于是
加油行驶问题
队友喂的题意
直接秒了

最后一道
outpost
队友喂的题意
写的二分+二维ST表
说实话
这种码量的数据结构真的蛮恶心的
de了半个小时才出来

ANDMAN

前缀乘积，用LCA维护
注意逆元
扩展操作，暴力执行

#include<bits/stdc++.h>
#define endl "\n"
#define ls p<<1
#define rs p<<1|1
#define int long long
#define pb push_back
#define mem(a,b) memset(a,b,sizeof (a))
#define For(i,a,b) for (int i=(a);i<=(b);i++)
#define io std::ios::sync_with_stdio(false);std::cin.tie(0);std::cout.tie(0)
using namespace std;
typedef pair<int,int> PII;
typedef unsigned long long u64;
typedef long long ll;mt19937_64 mrand(random_device{}());
void random_shuffle();
template<typename T>
inline void read(T &x){int f=1;x=0;char c=getchar();while(!isdigit(c)){if (c=='-')f=-1;c=getchar();}while(isdigit(c)){x=x*10+c-'0';c=getchar();}x=f*x;
}
template <typename T>
inline void print(T x)
{if(x<0){putchar('-');x=-x;}if(x>9)print(x/10);putchar(x%10+'0');
}
// long long long
// ¨ºy¡Á¨¦?a1? N+10
// ¨®D?¨°¨ª? or ?T?¨°¨ª?
// ?¨¤¡Á¨¦¨ºy?Y,3?¨º??¡¥
// LLLLLLLLLLLLLconst int N=3e5+10,M=1e3+10;
const ll inf=8e18;
const int mod=1e9+7;int t,n,m,idx;int h[N],e[N],ne[N],dep[N];
int w[N],sum[N],par[N];
int st[N][20];
void add(int a,int b){e[idx]=b;ne[idx]=h[a];h[a]=idx++;
}void dfs(int x,int fa)
{dep[x]=dep[fa]+1;st[x][0]=fa;par[x] = fa;sum[x] = sum[fa]*w[x]%mod;for(int i=1;i<=19;i++){st[x][i] = st[st[x][i-1]][i-1];}for(int i=h[x];i!=-1;i=ne[i]){int j=e[i];if(j==fa)continue;dfs(j,x);}
}
int LCA(int x,int y)
{if(dep[x]<dep[y])swap(x,y);for(int i=19;i>=0;i--){if(dep[st[x][i]]>=dep[y]){x=st[x][i];}}if(x==y)return x;for(int i=19;i>=0;i--){if(st[x][i]!=st[y][i]){x=st[x][i];y=st[y][i];}}return st[x][0];
}int qmi(int a,int b,int p)
{int res=1;a%=p;while(b){if(b&1){res=res*a%p;}a=a*a%p;b>>=1;}return res;
}
void change(int x,int fa,int v ){{sum[x] = sum[fa]*v%mod;sum[x] = (sum[x] %mod + mod) %mod;for(int i=h[x];i!=-1;i=ne[i]){int j=e[i];if(j==fa)continue;change(j,x,w[j] );}}}
void solve()
{mem(h,-1);idx = 0;cin>>n;For(i,1,n)cin>>w[i];For(i,1,n-1){int a,b;cin>>a>>b;add(a,b);add(b,a);}dfs(1,0);/*For(i,1,n){cout<<sum[i]<<" ";}cout<<endl;*/int q;cin>>q;int p = mod;while(q--){int a,b,ty;cin>>ty>>a>>b;if(ty == 1){w[a]=b;change(a,par[a],b);}else{int fa = LCA(a,b);int res = sum[a]*sum[b]%mod;int inv = qmi(sum[fa],p-2,p);//cout<<fa<<" "<<inv<<" ";res = res*inv%p;res =(res%p+p)%p;//cout<<par[fa]<<" ";inv = qmi(sum[par[fa]],p-2,p);res = (res*inv)%p;cout<<res<<endl;}}
}
signed main()
{io;sum[0]=1;cin>>t;//t=1;while(t--)solve();return 0;
}

OUTPOST
二分 + 二维ST表

#include <bits/stdc++.h>
#define endl "\n"
#define ls p << 1
#define rs p << 1 | 1
#define int long long
#define pb push_back
#define mem(a, b) memset(a, b, sizeof(a))
#define For(i, a, b) for (int i = (a); i <= (b); i++)
#define io                            \std::ios::sync_with_stdio(false); \std::cin.tie(0);                  \std::cout.tie(0)
using namespace std;
typedef pair<int, int> PII;
typedef unsigned long long u64;
typedef long long ll;// mt19937_64 mrand(random_device{}());
// void random_shuffle();
template <typename T>
inline void read(T& x) {int f = 1;x = 0;char c = getchar();while (!isdigit(c)) {if (c == '-')f = -1;c = getchar();}while (isdigit(c)) {x = x * 10 + c - '0';c = getchar();}x = f * x;
}
template <typename T>
inline void print(T x) {if (x < 0) {putchar('-');x = -x;}if (x > 9)print(x / 10);putchar(x % 10 + '0');
}
// long long long
// 数组开够 N+10
// 有向图 or 无向图
// 多组数据,初始化
// LLLLLLLLLLLLLconst int N = 5e4 + 10, M = 1e3 + 10;
const ll inf = 1e18;
const int mod = 998244353;int n, m, ask;
int ar[11][N];
int st1[11][N][17], st2[11][N][17];
int st3[N][11][5], st4[N][11][5];signed main() {io;cin >> n >> m >> ask;For(i, 1, n) {For(j, 1, m) {cin >> ar[i][j];int x = ar[i][j];st1[i][j][0] = x;st2[i][j][0] = x;st3[j][i][0] = x;st4[j][i][0] = x;}}For(pos, 1, n) {For(j, 1, 16) {for (int i = 1; i + (1 << j) - 1 <= m; i++) {st1[pos][i][j] = max(st1[pos][i][j - 1], st1[pos][i + (1 << (j - 1))][j - 1]);st2[pos][i][j] = min(st2[pos][i][j - 1], st2[pos][i + (1 << (j - 1))][j - 1]);}}}For(pos, 1, m) {For(j, 1, 4) {for (int i = 1; i + (1 << j) - 1 <= n; ++i) {st3[pos][i][j] = max(st3[pos][i][j - 1], st3[pos][i + (1 << (j - 1))][j - 1]);st4[pos][i][j] = min(st4[pos][i][j - 1], st4[pos][i + (1 << (j - 1))][j - 1]);}}}int res = 1;For(p, 1, n) {auto l = 1LL, r = m, mid = 0LL;int le = __lg(p);while (l < r) {int f = 0;mid = l + r + 1 >> 1;int len = __lg(mid);For(a, 1, n - p + 1) {For(b, 1, m - mid + 1) {int i = a;int j = b;int x = a + p - 1;int y = b + mid - 1;int mx = -1, mi = inf;int edg = mx;For(k, i, x) {mx = max({mx, st1[k][j][len], st1[k][y - (1 << len) + 1][len]});mi = min({mi, st2[k][j][len], st2[k][y - (1 << len) + 1][len]});}edg = max({st1[i][j][len], st1[i][y - (1 << len) + 1][len],st1[x][j][len], st1[x][y - (1 << len) + 1][len]});edg = max({edg, st3[j][i][le], st3[j][x - (1 << le) + 1][le]});edg = max({edg, st3[y][i][le], st3[y][x - (1 << le) + 1][le]});if (mx <= mi + ask) {if (edg == mx) {f = 1;break;}}}if (f)break;}if (f) {res = max(res, p * mid);l = mid;} else {r = mid - 1;}}}cout << res;return 0;
}

invisible ghost
分类讨论
【1】地图中没有鬼，表现为 q.size == 0
【2】pacman自己躲起来了，碰不到鬼表现为 dis[xa][ya] = 0
【3】普通情况，需要考虑最后到达的点
采用双向BFS,考虑人能够到达的点中，距离鬼最远的距离
然后再次BFS，寻找路径即可

#include <bits/stdc++.h>
#define endl "\n"
#define ls p << 1
#define rs p << 1 | 1
//#define int long long
#define pb push_back
#define mem(a, b) memset(a, b, sizeof(a))
#define For(i, a, b) for (int i = (a); i <= (b); i++)
#define io                            \std::ios::sync_with_stdio(false); \std::cin.tie(0);                  \std::cout.tie(0)
using namespace std;
typedef pair<int, int> PII;
typedef unsigned long long u64;
typedef long long ll;mt19937_64 mrand(random_device{}());
void random_shuffle();
template <typename T>
inline void read(T& x) {int f = 1;x = 0;char c = getchar();while (!isdigit(c)) {if (c == '-')f = -1;c = getchar();}while (isdigit(c)) {x = x * 10 + c - '0';c = getchar();}x = f * x;
}
template <typename T>
inline void print(T x) {if (x < 0) {putchar('-');x = -x;}if (x > 9)print(x / 10);putchar(x % 10 + '0');
}
// long long long
// Êý×é¿ª¹» N+10
// ÓÐÏòÍ¼ or ÎÞÏòÍ¼
// ¶à×éÊý¾Ý,³õÊ¼»¯
// LLLLLLLLLLLLLconst int N = 1e3 + 10, M = 1e3 + 10;
const ll inf = 8e18;
const int mod = 1e9 + 7;int a[] = {1, 0, 0, -1}, b[] = {0, -1, 1, 0};
int t, n, m;
int st[N][N], dis[N][N];
int pre[N][N];
bool ar[N][N], vis[N][N], bos[N][N];typedef pair<PII, int> my;
string zxy = "DLRU ";void solve(int id) {cin >> n >> m;string s;int xa, ya, fa, fb;queue<my> q;xa = ya = fa = fb = 0;For(i, 1, n) {cin >> s;For(j, 1, m) {ar[i][j] = vis[i][j] = bos[i][j] = (0);st[i][j] = dis[i][j] = 0;pre[i][j] = -1;char ch = s[j - 1];if (ch == 'P') {xa = fa = i;ya = fb = j;} else if (ch == 'G') {dis[i][j] = 1;// q.push({{i, j}, 1});q.push(make_pair(make_pair(i, j), 1));bos[i][j] = 1;} else if (ch == 'X') {ar[i][j] = 1;}}}// cout << q.size() << endl;if (0 == q.size()) {cout << "Case #" << id << ":"<< " INFINITE ";// q.push({{xa, ya}, 1});q.push(make_pair(make_pair(xa, ya), 1));while (q.size()) {int len = q.size();For(o, 1, len) {auto p = q.front();q.pop();auto one = p.first;auto x = one.first, y = one.second;st[x][y] = 1;For(k, 0, 3) {int xx = x + a[k], yy = y + b[k];if (xx >= 1 && xx <= n && yy >= 1 && yy <= m) {if (ar[xx][yy] == 0 && st[xx][yy] == 0 && pre[xx][yy] == -1) {st[xx][yy] = 1;pre[xx][yy] = 3 - k;q.push(make_pair(make_pair(xx, yy), 0));// q.push({{xx, yy}, 0});}}}}}fa = fb = 0;For(i, 1, n) {For(j, 1, m) {if (st[i][j]) {fa = i;fb = j;break;}}if (fa || fb)break;}if (fa == xa && ya == fb) {cout << "STAY\n";return;}// cout<<fa<<" "<<xa<<" "<<ya<<" "<<fb<<endl;string path = "";while (fa != xa || fb != ya) {int k = pre[fa][fb];path += zxy[3 - k];fa += a[k];fb += b[k];// cout<<fa<<" "<<fb<<endl;}reverse(path.begin(), path.end());cout << path << endl;return;} else {// return;int d = 0;// cout << "???\n";// return;while (q.size()) {int len = q.size();For(o, 1, len) {auto p = q.front();q.pop();auto one = p.first;auto x = one.first, y = one.second;d = p.second;// dis[x][y] = d;// cout << x << " " << y << " " << d << endl;For(k, 0, 3) {int xx = x + a[k], yy = y + b[k];if (xx >= 1 && xx <= n && yy >= 1 && yy <= m) {if (ar[xx][yy] == 0 && st[xx][yy] == 0 && dis[xx][yy] == 0) {dis[xx][yy] = d + 1;// q.push({{xx, yy}, d + 1});q.push(make_pair(make_pair(xx, yy), d + 1));}}}}}// cout << "!!!\n";// return;if (0 == dis[xa][ya]) {{cout << "Case #" << id << ":"<< " INFINITE ";// q.push({{xa, ya}, 1});q.push(make_pair(make_pair(xa, ya), 1));while (q.size()) {int len = q.size();For(o, 1, len) {auto p = q.front();q.pop();auto one = p.first;auto x = one.first, y = one.second;st[x][y] = 1;For(k, 0, 3) {int xx = x + a[k], yy = y + b[k];if (xx >= 1 && xx <= n && yy >= 1 && yy <= m) {if (ar[xx][yy] == 0 && st[xx][yy] == 0 && pre[xx][yy] == -1) {st[xx][yy] = 1;pre[xx][yy] = 3 - k;// q.push({{xx, yy}, 0});q.push(make_pair(make_pair(xx, yy), 0));}}}}}int f = 0;fa = fb = 0;For(i, 1, n) {For(j, 1, m) {if (st[i][j]) {fa = i;fb = j;f = 1;break;}}if (fa || fb || f)break;}if (fa == xa && ya == fb) {cout << "STAY\n";return;}// cout<<fa<<" "<<xa<<" "<<ya<<" "<<fb<<endl;string path = "";while (fa != xa || fb != ya) {int k = pre[fa][fb];path += zxy[3 - k];fa += a[k];fb += b[k];// cout<<fa<<" "<<fb<<endl;}reverse(path.begin(), path.end());cout << path << endl;return;}} else {{while (q.size()) {q.pop();}// q.push({{xa, ya}, 1});q.push(make_pair(make_pair(xa, ya), 1));st[xa][ya] = 1;vis[xa][ya] = 1;For(i, 1, n) {For(j, 1, m) {if (ar[i][j] == 0) {if (dis[i][j] == 1) {// q.push({{i, j}, 1});q.push(make_pair(make_pair(i, j), 1));st[i][j] = -1;}}}}int f = 0;// cout << "ASDASDASD\n";// return;{auto one = q;while (one.size()) {auto p = one.front();one.pop();auto x = p.first.first;auto y = p.first.second;auto d = p.second;auto kind = st[x][y];// cout << x << " " << y << " " << kind << endl;}// return;}int cnt = 1;while (q.size()) {int len = q.size();For(o, 1, len) {auto p = q.front();q.pop();auto x = p.first.first;auto y = p.first.second;auto d = p.second;auto kind = st[x][y];// cout << x << " " << y << " " << kind << endl;// return;For(k, 0, 3) {int xx = x + a[k], yy = y + b[k];if (xx >= 1 && xx <= n && yy >= 1 && yy <= m) {// cout << xx << " " << yy << endl;if (kind == 1) {if (ar[xx][yy] == 0 && st[xx][yy] == 0) {st[xx][yy] = 1;pre[xx][yy] = 3 - k;dis[xx][yy] = d + 1;vis[xx][yy] = 1;cnt++;// q.push({{xx, yy}, d + 1});q.push(make_pair(make_pair(xx, yy), d + 1));}} else if (kind == -1) {if (ar[xx][yy] == 0 && st[xx][yy] != -1) {if (st[xx][yy] == 1) {cnt--;if (cnt == 0) {f = 1;break;}}st[xx][yy] = -1;dis[xx][yy] = d + 1;// q.push({{xx, yy}, d + 1});q.push(make_pair(make_pair(xx, yy), d + 1));}}}}if (f)break;}if (f)break;}while (q.size())q.pop();For(i, 1, n) {For(j, 1, m) {if (bos[i][j]) {dis[i][j] = 1;// q.push({{i, j}, 1});q.push(make_pair(make_pair(i, j), 1));} elsedis[i][j] = 0;}}d = 0;while (q.size()) {int len = q.size();For(o, 1, len) {auto p = q.front();q.pop();auto one = p.first;auto x = one.first, y = one.second;d = p.second;// dis[x][y] = d;// cout << x << " " << y << endl;For(k, 0, 3) {int xx = x + a[k], yy = y + b[k];if (xx >= 1 && xx <= n && yy >= 1 && yy <= m) {if (ar[xx][yy] == 0 && dis[xx][yy] == 0) {dis[xx][yy] = d + 1;// q.push({{xx, yy}, d + 1});q.push(make_pair(make_pair(xx, yy), d + 1));}}}}}/*For(i, 1, n) {For(j, 1, m) {cout << dis[i][j] << " ";}cout << endl;}cout << endl;For(i, 1, n) {For(j, 1, m) {cout << vis[i][j] << " ";}cout << endl;}cout << endl;*/fa = fb = 0;For(i, 1, n) {For(j, 1, m) {if (vis[i][j]) {if (dis[i][j] > dis[fa][fb]) {fa = i;fb = j;}}}}cout << "Case #" << id << ":"<< " " << dis[fa][fb] - 2 << " ";// cout << xa << " " << ya << " " << fa << " " << fb << endl;if (fa == xa && ya == fb) {cout << "STAY\n";return;}// return;string path = "";while (fa != xa || fb != ya) {int k = pre[fa][fb];path += zxy[3 - k];fa += a[k];fb += b[k];}reverse(path.begin(), path.end());cout << path << endl;return;}}}
}
signed main() {io;cin >> t;For(i, 1, t) solve(i);return 0;
}

DreamTeam

#include <bits/stdc++.h>
#define endl "\n"
#define ls p << 1
#define rs p << 1 | 1
#define int long long
#define pb push_back
#define mem(a, b) memset(a, b, sizeof(a))
#define For(i, a, b) for (int i = (a); i <= (b); i++)
#define io                            \std::ios::sync_with_stdio(false); \std::cin.tie(0);                  \std::cout.tie(0)
using namespace std;
typedef pair<int, int> PII;
typedef unsigned long long u64;
typedef long long ll;// mt19937_64 mrand(random_device{}());
// void random_shuffle();
template <typename T>
inline void read(T& x) {int f = 1;x = 0;char c = getchar();while (!isdigit(c)) {if (c == '-')f = -1;c = getchar();}while (isdigit(c)) {x = x * 10 + c - '0';c = getchar();}x = f * x;
}
template <typename T>
inline void print(T x) {if (x < 0) {putchar('-');x = -x;}if (x > 9)print(x / 10);putchar(x % 10 + '0');
}
// long long long
// ???? N+10
// ??? or ???
// ????,???
// LLLLLLLLLLLLLconst int N = 1e3 + 10, M = 1e6 + 10;
const ll inf = 1e18;
const int mod = 998244353;typedef pair<int, string> my;
int mon;
my ar[6][N], br[N];
int num[10];
my a[M], b[M], tmp[M];
int la, lb, cnt;
int ans, res;
string player;void dfs(int x, int sum, string s) {if (sum > mon)return;if (x == 2) {la++;a[la] = make_pair(sum, s);return;}int len = num[x];For(i, 1, len) {dfs(x + 1, sum + ar[x][i].first, s + ar[x][i].second + " ");}
}void dfs1(int x, int sum, string s) {if (sum > mon)return;if (x == 5) {lb++;b[lb] = make_pair(sum, s);return;}int len = num[x];For(i, 1, len) {dfs1(x + 1, sum + ar[x][i].first, s + ar[x][i].second + " ");}
}signed main() {cin >> mon;For(i, 0, 4) {cin >> num[i];For(j, 1, num[i]) {cin >> ar[i][j].second;cin >> ar[i][j].first;// ar[i][j].first = 100;}sort(ar[i] + 1, ar[i] + num[i] + 1, greater<my>());int cnt = 0;for (int j = 1; j <= num[i]; j++) {if (j == 1) {cnt++;br[cnt] = ar[i][j];} else {if (ar[i][j].first == ar[i][j - 1].first) {;} else {cnt++;br[cnt] = ar[i][j];}}}For(j, 1, cnt) {ar[i][j] = br[j];}}dfs(0, 0, "");sort(a + 1, a + la + 1);cnt = 1;tmp[1] = a[1];For(i, 2, la) {if (a[i].first == a[i - 1].first)continue;else {cnt++;tmp[cnt] = a[i];}}la = cnt;For(i, 1, cnt) {a[i] = tmp[i];// cout << a[i].first << " " << a[i].second << endl;}dfs1(2, 0, "");sort(b + 1, b + lb + 1);cnt = 1;tmp[1] = b[1];For(i, 2, lb) {if (b[i].first == b[i - 1].first)continue;else {cnt++;tmp[cnt] = b[i];}}lb = cnt;For(i, 1, cnt) {b[i] = tmp[i];// cout << b[i].first << " " << b[i].second << endl;}For(i, 1, la) {my t = make_pair(mon - a[i].first, "");auto p = upper_bound(b + 1, b + lb + 1, t) - b;// cout << p << "\n";if (b[p].first + a[i].first > mon || p > lb) {p--;}if (p > lb || p <= 0)continue;if (p > 0) {ans = b[p].first + a[i].first;if (res < ans) {res = ans;player = a[i].second + b[p].second;} else if (res == ans) {string st = a[i].second + b[p].second;if (st < player) {player = st;}}}// cout << b[p].first << " " << b[p].second << endl;}// cout << endl;// cout << player << endl;// cout << res << endl;int j = 0;int len = player.size();for (int i = 0; i < len; ++i) {if (player[i] == ' ') {cout << player.substr(j, i - j) << endl;j = i + 1;}}
}

下半夜就没有过题了
不会做加上状态也下去了
最后醒来就200+的排名
但是印度老哥开始发力
然后333哈哈哈哈
就酱吧

第16届 IEEE 极限编程大赛参赛记录相关推荐

第二届无线通信AI大赛参赛总结
参加了第二届无线通信AI大赛基于 AI 的信道状态信息反馈题 ,最后仅得第13名,不论成绩好坏,毕竟花了几个星期时间,还是应该做个梳理总结. 一.赛题简介 1.数据和任务赛题数据是来自多 ...
第16届智能车竞赛参赛队员提问-05-24
简介: 本文收集了参加第16届智能车竞赛同学在5月20号之后的一些提问. 关键词: 智能车竞赛,提问 §01 阳光的眷顾卓大大,请问今年的室内组,会有这样的光吗? ▲ 上帝之光照射在赛场上回复: ...
CST全国大学生软件测试大赛参赛记录分享
2020年2月10日更新: 零基础的同学建议看一下这一篇:移动应用测试脚本编写案例Demo 2019年11月6日更新: [题目下载]2019年CST全国大学生软件测试大赛试题下载,持续更新. [超详细 ...
2018 IEEE极限编程大赛题解
去年742,今年72,也算一种小小的进步. 明年前30(笑 1. Drawing Rooted Binary Trees 给定一个树的中序和前序的遍历,要求输出这棵树(包括空格的) 1 #includ ...
人工智能掼蛋大赛参赛记录
首先感谢主办方,虽然只是拿了个优胜奖,但是也有5000块奖金,吃的住的都很好!! 大赛官网: https://www.bagevent.com/event/6808642 参赛选手作品代码: http ...
第44届世界技能大赛中国参赛项目集训选手名单公布，388人入选！（人社部今日发文）
一.飞机维修项目(5人) 叶钟盛江西航空技师学院刘运中航工业江西洪都航空工业集团有限责任公司彭胜中航工业江西洪都航空工业集团有限责任公司薛惠荣中航工业江西洪都航空工业集团有限责任 ...
2023年（第16届）中国大学生计算机设计大赛
前言:作者19届现在大四,今年参加了计算机设计大赛获得了国赛二等奖并参加其他A类比赛获得国奖,现在给20.21.22届的同学做一个交流文章.以2022的计算机设计大赛为主. 为什么要参加大学生计算机设 ...
必看！嘉宾寄语 × 赛制 Q＆A：2023年（第16届）中国大学生计算机设计大赛大数据主题赛 - 和鲸赛道正式开赛
导语:中国大学生计算机设计大赛 - 大数据应用大类 - 大数据主题赛 - 和鲸赛道已于 1 月 28 日正式开赛,作为协办方,和鲸特别邀请到了大赛组委会常务副主任杜小勇教授为广大参赛选手寄语,此外,我 ...
地表车神争霸赛，且看第16届大学生智能汽车竞赛
§01 智能车竞赛 2021年8月20日至25日,第16届全国大学生智能汽车竞赛总决赛即将拉开帷幕!很荣幸,英飞凌参与其中,见证青年学生在智能车领域的精彩表现 . 全国大学生智能汽车竞赛是考察 ...

第16届 IEEE 极限编程大赛参赛记录

第16届 IEEE 极限编程大赛参赛记录相关推荐

最新文章

热门文章

第16届 IEEE 极限编程大赛 参赛记录

第16届 IEEE 极限编程大赛 参赛记录相关推荐

最新文章

热门文章

第16届 IEEE 极限编程大赛参赛记录

第16届 IEEE 极限编程大赛参赛记录相关推荐