首页 > 其他分享 >2024年大学生计算机大赛决赛-个人赛参考代码

2024年大学生计算机大赛决赛-个人赛参考代码

时间：2024-11-17 15:57:27浏览次数：1  
标签：决赛 cout int ll long 2024 个人赛 include define

比赛链接

A.退休

代码

void solve()
{
  int a, b;
  cin >> a >> b;
  
  int num = a + b;
  int res = (1000000 + num - 1) / num;
  cout << res / 12 << ' ' << res % 12;
}

B.四季

代码

void solve()
{
	int a, b;
	scanf("%d-%d", &a, &b);
	if (b >= 3 && b <= 5) cout << "spring";
	else if (b >= 6 && b <= 8) cout << "summer";
	else if (b >= 9 && b <= 11) cout << "autumn";
	else cout << "winter";
}

C.乘法运算

代码

void solve()
{
  long long a, b, c;
  cin >> a >> c;
  
  b = c - a;
  cout << b << '\n' << a * b;
}

D.三数最大

代码

char a, b, c;

void solve()
{
  cin >> a >> b >> c;
  
  char res = 'A';
  if (a == '>') {
  	if (b == '<') res = 'C';
  	
  	if (c == '>') return void(cout << "-1");
  }
  else {
  	res = 'B';
  	if (c == '<') res = 'C';
  	if (b == '>') return void(cout << "-1");
  }
  
  cout << res;
}

E.小T的误判

代码

string s;

void solve()
{
  cin >> s;
  
  int res = 0;
  for (int i = 0; i < si(s); i += 2)
  {
  	if (s[i] == 'T') i ++;
  	if (s[i] == 'W' && i + 2 < si(s) && s[i + 2] == 'C') res ++; 
  }
  
  cout << res;
}

F.村庄的友谊

代码

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <unordered_set>

#define endl        '\n'
#define ll          long long
#define PII         pair<int, int> 
#define PLL         pair<ll, ll>
#define all(a)      a.begin(), a.end()
#define lowbit(x)   x & -x
#define ent         cout << '\n'
#define out(x)      cout << x << ' '
#define out2(x, y)  cout << x << " ~ " << y << ' '
#define me(a, b)    memset(a, b, sizeof a)
#define mc(a, b)    memcpy(a, b, sizeof a)
#define pk          push_back
#define ur(x)       sort(all(x)), x.erase(unique(all(x)), x.end())
#define fi          first
#define se          second
#define si(x)       int(x.size())
#define chi(x)      (x - '0')
#define ull         unsigned long long
#define Mp          make_pair

using namespace std;

const ll inf = 1e18;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1);
const int mod = 998244353;
const int P = 1e9 + 7;
const int dx[] = {0, 0, 1, -1};
const int dy[] = {-1, 1, 0, 0};
const int N = 1e6 + 10;
const int M = 1000 + 10;

ll n;
int a[N];

bool is_prime(int x)
{
	if (x < 2) return false;
	for (int i = 2; i <= x / i; i ++)
		if (x % i == 0) return false;
	return true;
}

void solve()
{
  cin >> n;
  ll cnt = 0, sum = 0;
  for (int i = 1; i <= n; i ++) 
  {
  	int x;
  	cin >> x;
  	if (x == 1) cnt ++;
  	else if (is_prime(x)) sum ++;
  }
  sum *= cnt;
  
  ll res = n * (n - 1) / 2;
  cout << res - sum;
}

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);

  int t = 1;
  // cin >> t;

  while (t --) solve();

  return 0;
}

G.再多一些0

代码

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <unordered_set>

#define endl        '\n'
#define ll          long long
#define PII         pair<int, int> 
#define PLL         pair<ll, ll>
#define all(a)      a.begin(), a.end()
#define lowbit(x)   x & -x
#define ent         cout << '\n'
#define out(x)      cout << x << ' '
#define out2(x, y)  cout << x << " ~ " << y << ' '
#define me(a, b)    memset(a, b, sizeof a)
#define mc(a, b)    memcpy(a, b, sizeof a)
#define pk          push_back
#define ur(x)       sort(all(x)), x.erase(unique(all(x)), x.end())
#define fi          first
#define se          second
#define si(x)       int(x.size())
#define chi(x)      (x - '0')
#define ull         unsigned long long
#define Mp          make_pair

using namespace std;

const ll inf = 1e18;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1);
const int mod = 998244353;
const int P = 1e9 + 7;
const int dx[] = {0, 0, 1, -1};
const int dy[] = {-1, 1, 0, 0};
const int N = 1e6 + 10;
const int M = 1000 + 10;

int n, m, res;
string s;
string sal;

int count_2(int x)
{
	int res = 0;
	while (x % 2 == 0) res ++, x /= 2;
	return res;
}

int count_5(int x)
{
	int res = 0;
	while (x % 5 == 0) res ++, x /= 5;
	return res;
}

void solve()
{
  cin >> n >> m;
  
  int cnt2 = count_2(n);
  int cnt5 = count_5(n);
  
  ll num = 1;
  for (int i = 0; i < cnt5; i ++)
  {
  	if (num * 2 > m) break;
  	num *= 2;
  }
  for (int i = 0; i < cnt2; i ++)
  {
  	if (num * 5 > m) break;
  	num *= 5;
  }
  
  // out(num); ent;
  
  while (num * 10 <= m) num *= 10;
  cout << m / num * num;
}

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);

  int t = 1;
  // cin >> t;

  while (t --) solve();

  return 0;
}

H.图样图森破

代码

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <unordered_set>

#define endl        '\n'
#define ll          long long
#define PII         pair<int, int> 
#define PLL         pair<ll, ll>
#define all(a)      a.begin(), a.end()
#define lowbit(x)   x & -x
#define ent         cout << '\n'
#define out(x)      cout << x << ' '
#define out2(x, y)  cout << x << " ~ " << y << ' '
#define me(a, b)    memset(a, b, sizeof a)
#define mc(a, b)    memcpy(a, b, sizeof a)
#define pk          push_back
#define ur(x)       sort(all(x)), x.erase(unique(all(x)), x.end())
#define fi          first
#define se          second
#define si(x)       int(x.size())
#define chi(x)      (x - '0')
#define ull         unsigned long long
#define Mp          make_pair

using namespace std;

const ll inf = 1e18;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1);
const int mod = 998244353;
const int P = 1e9 + 7;
const int dx[] = {0, 0, 1, -1};
const int dy[] = {-1, 1, 0, 0};
const int N = 1e6 + 10;
const int M = 1000 + 10;

int n, L;
int x;

bool check(int mid)
{
	ll res = L;
	ll cnt = 1LL << mid;
	ll sum = (cnt - 1) * 150;
	return res * cnt - sum >= x;
}

void solve()
{
  cin >> L >> n;
  
  while (n --)
  {
  	cin >> x;
  	if (x == L) {
  		cout << 0;
  		ent;
  		continue;
  	}
  	
  	int l = 1, r = 63;
  	while (l < r)
  	{
  		int mid = (l + r) >> 1;
  		if (check(mid)) r = mid;
  		else l = mid + 1;
  	}
  	if (check(l)) {
  		ll cnt = 1LL << l;
  		ll sum = L * cnt - 150 * (cnt - 1);
  		if (sum == x) cout << l << '\n';
  		else cout << -1 << '\n';
  	}
  	else cout << -1 << '\n';
  }
}

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);

  int t = 1;
  // cin >> t;

  while (t --) solve();

  return 0;
}

I.开光灯

代码

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <unordered_set>

#define endl        '\n'
#define ll          long long
#define PII         pair<int, int> 
#define PLL         pair<ll, ll>
#define all(a)      a.begin(), a.end()
#define lowbit(x)   x & -x
#define ent         cout << '\n'
#define out(x)      cout << x << ' '
#define out2(x, y)  cout << x << " ~ " << y << ' '
#define me(a, b)    memset(a, b, sizeof a)
#define mc(a, b)    memcpy(a, b, sizeof a)
#define pk          push_back
#define ur(x)       sort(all(x)), x.erase(unique(all(x)), x.end())
#define fi          first
#define se          second
#define si(x)       int(x.size())
#define chi(x)      (x - '0')
#define ull         unsigned long long
#define Mp          make_pair

using namespace std;

const ll inf = 1e18;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1);
const int mod = 998244353;
const int P = 1e9 + 7;
const int dx[] = {0, 0, 1, -1};
const int dy[] = {-1, 1, 0, 0};
const int N = 1e6 + 10;
const int M = 1000 + 10;

int n, m;
int a[N];
PII b[N];

void solve()
{
  cin >> n >> m;
  for (int i = 0; i < m; i ++)
  {
  	int l, r;
  	cin >> l >> r;
  	a[l] += 1, a[r + 1] -= 1;
  	b[i] = {l, r};
  }
  
  for (int i = 1; i <= n; i ++) a[i] += a[i - 1];
  for (int i = 1; i <= n; i ++)
  {
  	
  	a[i] %= 2;
  	a[i] += a[i - 1];
  }
  
  for (int i = 0; i < m; i ++)
  {
  	int l = b[i].fi, r = b[i].se;
  	int res = a[l - 1] + a[n] - a[r] + (r - l + 1 - a[r] + a[l - 1]);
  	cout << res << ' ';
  }
}

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);

  int t = 1;
  // cin >> t;

  while (t --) solve();

  return 0;
}

J.上班规划

代码

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <unordered_set>

#define endl        '\n'
#define ll          long long
#define PII         pair<int, int> 
#define PLL         pair<ll, ll>
#define all(a)      a.begin(), a.end()
#define lowbit(x)   x & -x
#define ent         cout << '\n'
#define out(x)      cout << x << ' '
#define out2(x, y)  cout << x << " ~ " << y << ' '
#define me(a, b)    memset(a, b, sizeof a)
#define mc(a, b)    memcpy(a, b, sizeof a)
#define pk          push_back
#define ur(x)       sort(all(x)), x.erase(unique(all(x)), x.end())
#define fi          first
#define se          second
#define si(x)       int(x.size())
#define chi(x)      (x - '0')
#define ull         unsigned long long
#define Mp          make_pair

using namespace std;

const ll inf = 1e18;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1);
const int mod = 998244353;
const int P = 1e9 + 7;
const int dx[] = {0, 0, 1, -1};
const int dy[] = {-1, 1, 0, 0};
const int N = 1e6 + 10;
const int M = 1000 + 10;

ll n, m, num, wt, bt, v;
bool vis[N], st[N], stt[N];
vector<int> g[N];
int s, e;
ll d[N], dd[N], w[N], ddd[N];

void dijkstra(int u, ll c[], bool flag)
{
	for (int i = 1; i <= n; i ++) c[i] = inf, st[i] = 0;
	priority_queue<PLL, vector<PLL>, greater<PLL>> pq;
	c[u] = 0;
	pq.push({c[u], u});
	
	while (!pq.empty())
	{
		auto t = pq.top();
		pq.pop();
		
		if (st[t.se]) continue;
		st[t.se] = 1;
		for (int i : g[t.se])
		{
			ll wi = wt;
			if (flag && (vis[t.se] || stt[t.se])) wi = bt, stt[i] = 1;
			if (c[i] >= t.fi + wi) {
				if (wi == bt) {
					if (w[i] > w[t.se] + v) w[i] = w[t.se] + v;
					else if (!w[i] && c[i] > t.fi + wi) w[i] = w[t.se] + v;
				}
				c[i] = t.fi + wi;
				pq.push({c[i], i});
			}
		}
	}
}

void solve()
{
  cin >> n >> m >> num >> wt >> bt >> v;
  for (int i = 0; i < m; i ++)
  {
  	int x;
  	cin >> x;
  	
  	vis[x] = 1;
  }
  
  while (num --)
  {
  	int a, b;
  	cin >> a >> b;
  	g[a].pk(b);
  	g[b].pk(a);
  }
  
  cin >> s >> e;
  
  dijkstra(s, d, 1);
  dijkstra(e, dd, 0);
  
  ll res = dd[s], ans = 0;
  for (int i = 1; i <= n; i ++)
  {
  	if (vis[i]) {
  		ll sum = d[i] + dd[i];
  		if (sum < res) res = sum, ans = w[i];
  		else if (sum == res && ans > w[i]) ans = w[i];
  	}
  }
  
  cout << res << ' ' << ans;
}

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);

  int t = 1;
  // cin >> t;

  while (t --) solve();

  return 0;
}

K.数组涂染

代码

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <unordered_set>

#define endl        '\n'
#define ll          long long
#define PII         pair<int, int> 
#define PLL         pair<ll, ll>
#define all(a)      a.begin(), a.end()
#define lowbit(x)   x & -x
#define ent         cout << '\n'
#define out(x)      cout << x << ' '
#define out2(x, y)  cout << x << " ~ " << y << ' '
#define me(a, b)    memset(a, b, sizeof a)
#define mc(a, b)    memcpy(a, b, sizeof a)
#define pk          push_back
#define ur(x)       sort(all(x)), x.erase(unique(all(x)), x.end())
#define fi          first
#define se          second
#define si(x)       int(x.size())
#define chi(x)      (x - '0')
#define ull         unsigned long long
#define Mp          make_pair

using namespace std;

const ll inf = 1e18;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1);
const int mod = 998244353;
const int P = 1e9 + 7;
const int dx[] = {0, 0, 1, -1};
const int dy[] = {-1, 1, 0, 0};
const int N = 1e6 + 10;
const int M = 1000 + 10;

int n;
int a[N], p[N];

struct node {
	int w, u, v;
};

vector<node> g;

int lcm(int a, int b)
{
	return a / __gcd(a, b) * b;
}

int find(int x)
{
	if (p[x] != x) p[x] = find(p[x]);
	return p[x];
}

ll kruskal()
{
	for (int i = 1; i <= n; i ++) p[i] = i;
	
	ll res = 0;
	for (auto [w, u, v] : g)
	{
		int pu = find(u), pv = find(v);
		if (pu != pv) 
		{
			p[pu] = pv;
			res += w;
		}
	}
	return res;
}

void solve()
{
  cin >> n;
  ll res = 0;
  for (int i = 1; i <= n; i ++) cin >> a[i], res += a[i];
  
  for (int i = 1; i < n; i ++)
  	for (int j = i + 1; j <= n; j ++)
  		g.pk({lcm(a[i], a[j]), i, j});
  		
  sort(all(g), [&](node a, node b){
  	return a.w < b.w;
  });
  
  res += kruskal();
  
  cout << res;
}

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);

  int t = 1;
  // cin >> t;

  while (t --) solve();

  return 0;
}

L.小可的red子序列

代码

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <unordered_set>

#define endl        '\n'
#define ll          long long
#define PII         pair<int, int> 
#define PLL         pair<ll, ll>
#define all(a)      a.begin(), a.end()
#define lowbit(x)   x & -x
#define ent         cout << '\n'
#define out(x)      cout << x << ' '
#define out2(x, y)  cout << x << " ~ " << y << ' '
#define me(a, b)    memset(a, b, sizeof a)
#define mc(a, b)    memcpy(a, b, sizeof a)
#define pk          push_back
#define ur(x)       sort(all(x)), x.erase(unique(all(x)), x.end())
#define fi          first
#define se          second
#define si(x)       int(x.size())
#define chi(x)      (x - '0')
#define ull         unsigned long long
#define Mp          make_pair

using namespace std;

const ll inf = 1e18;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1);
const int mod = 998244353;
const int P = 1e9 + 7;
const int dx[] = {0, 0, 1, -1};
const int dy[] = {-1, 1, 0, 0};
const int N = 1e6 + 10;
const int M = 1000 + 10;

int n;
string s;
ll r[N], d[N];

void solve()
{
  cin >> s;
  s = ' ' + s;
  
  for (int i = 1; i < si(s); i ++)
  	r[i] = (r[i - 1] + (s[i] == 'r' ? i : 0)) % P;
  for (int i = si(s) - 1; i; i --)
  	d[i] = (d[i + 1] + (s[i] == 'd' ? si(s) - i : 0)) % P;
  
  ll res = 0;
  for(int i = 1; i < si(s); i ++)
  	if (s[i] == 'e') res = (res + r[i] * d[i]) % P;
  	
  cout << res;
}

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);

  int t = 1;
  // cin >> t;

  while (t --) solve();

  return 0;
}

M.寻找jyuwin

代码

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <unordered_set>

#define endl        '\n'
#define ll          long long
#define PII         pair<int, int> 
#define PLL         pair<ll, ll>
#define all(a)      a.begin(), a.end()
#define lowbit(x)   x & -x
#define ent         cout << '\n'
#define out(x)      cout << x << ' '
#define out2(x, y)  cout << x << " ~ " << y << ' '
#define me(a, b)    memset(a, b, sizeof a)
#define mc(a, b)    memcpy(a, b, sizeof a)
#define pk          push_back
#define ur(x)       sort(all(x)), x.erase(unique(all(x)), x.end())
#define fi          first
#define se          second
#define si(x)       int(x.size())
#define chi(x)      (x - '0')
#define ull         unsigned long long
#define Mp          make_pair

using namespace std;

const ll inf = 1e18;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1);
const int mod = 998244353;
const int P = 1e9 + 7;
const int dx[] = {0, 0, 1, -1};
const int dy[] = {-1, 1, 0, 0};
const int N = 1e6 + 10;
const int M = 1000 + 10;

int n, m;

void solve()
{
  cin >> n >> m;
  vector<vector<char>> g(n + 1, vector<char>(m + 1));
  for (int i = 1; i <= n; i ++)
  	for (int j = 1; j <= m; j ++)
  		cin >> g[i][j];
  	
  vector<vector<int>> sj(n + 1, vector<int>(m + 1)), sy(n + 1, vector<int>(m + 1)), su(n + 1, vector<int>(m + 1)), sw(n + 1, vector<int>(m + 1)), sI(n + 1, vector<int>(m + 1)), sn(n + 1, vector<int>(m + 1));
	for (int i = 1; i <= n; i ++)
		for (int j = 1; j <= m; j ++)
		{
			sj[i][j] = sj[i - 1][j] + sj[i][j - 1] - sj[i - 1][j - 1] + (g[i][j] == 'j');
			sy[i][j] = sy[i - 1][j] + sy[i][j - 1] - sy[i - 1][j - 1] + (g[i][j] == 'y');
			su[i][j] = su[i - 1][j] + su[i][j - 1] - su[i - 1][j - 1] + (g[i][j] == 'u');
			sw[i][j] = sw[i - 1][j] + sw[i][j - 1] - sw[i - 1][j - 1] + (g[i][j] == 'w');
			sI[i][j] = sI[i - 1][j] + sI[i][j - 1] - sI[i - 1][j - 1] + (g[i][j] == 'i');
			sn[i][j] = sn[i - 1][j] + sn[i][j - 1] - sn[i - 1][j - 1] + (g[i][j] == 'n');
		}
	
	int res = INF;
	
	if (!sj[n][m] || !sy[n][m] || !su[n][m] || !sw[n][m] || !sI[n][m] || !sn[n][m]) return void(cout << -1);
	
	int minp = min(n, m), maxp = max(n, m);
	
	for (int i = 1; i <= minp; i ++)
	{
		for (int ii = 1; ii <= i; ii ++)
		{
			for (int j = 1, jj = 1; j <= maxp; j ++)
			{
				while (jj <= j) {
					int ix = i, iix = ii, jy = j, jjy = jj;
					if (m < n) swap(ix, jy), swap(iix, jjy);
					int cntj = sj[ix][jy] - sj[iix - 1][jy] - sj[ix][jjy - 1] + sj[iix - 1][jjy - 1];
					int cnty = sy[ix][jy] - sy[iix - 1][jy] - sy[ix][jjy - 1] + sy[iix - 1][jjy - 1];
					int cntu = su[ix][jy] - su[iix - 1][jy] - su[ix][jjy - 1] + su[iix - 1][jjy - 1];
					int cntw = sw[ix][jy] - sw[iix - 1][jy] - sw[ix][jjy - 1] + sw[iix - 1][jjy - 1];
					int cnti = sI[ix][jy] - sI[iix - 1][jy] - sI[ix][jjy - 1] + sI[iix - 1][jjy - 1];
					int cntn = sn[ix][jy] - sn[iix - 1][jy] - sn[ix][jjy - 1] + sn[iix - 1][jjy - 1];
					
					if (cntj && cnty && cntu && cntw && cnti && cntn) {
						res = min(res, (jy - jjy + 1) * (ix - iix + 1));
						jj ++;
					}
					else break;
				}
			}
		}
	}
	
	cout << res;
}

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);

  int t = 1;
  // cin >> t;

  while (t --) solve();

  return 0;
}

标签：决赛,cout,int,ll,long,2024,个人赛,include,define
From： https://www.cnblogs.com/Natural-TLP/p/18550636

相关文章

  • 20222305 2024-2025-1 《网络与系统攻防技术》实验六实验报告
    网络攻防实验报告姓名：田青学号：20222305实验日期：2024/11/15—2024/11/22实验名称：Metasploit攻击渗透实践指导教师：王志强1.学习内容1.Metasploit：是一款开源安全漏洞利用和测试工具，集成了各种平台上常见的溢出漏洞和流行的shellcode。2.渗透攻击模块（exploits）：被动渗透攻击......
  • 2024长城靶场训练
    仿射密码首先题目描述使用仿射函数y=3x+9加密得到的密文为JYYHWVPIDCOZ，请尝试对其解密。flag为flag{大写明文}。1、使用在线网站直接破解或手工计算破解，获得flag。（参数a=3，b=9，对应仿射函数y=3x+9）仿射密码加密_仿射密码解密手工计算使用解密函数为D(x)=a^-1(x-b)(modm)，......
  • 学期2024-2025-1 学号20241421 《计算机基础与程序设计》第8周学习总结
    作业信息|这个作业属于哪个课程|https://edu.cnblogs.com/campus/besti/2024-2025-1-CFAP||这个作业要求在哪里|https://www.cnblogs.com/rocedu/p/9577842.html#WEEK08||这个作业的目标|功能设计与面向对象设计，面向对象设计过程，面向对象语言三要素，汇编、编译、解释、执行||作......
  • 20222310 2024-2025-1 《网络与系统攻防技术》实验五实验报告
    一、实验内容1.从www.besti.edu.cn、baidu.com、sina.com.cn中选择一个DNS域名进行查询，获取以下信息（1）DNS注册人及联系方式（2）该域名对应IP地址（3）IP地址注册人及联系方式（4）IP地址所在国家、城市和具体地理位置2.尝试获取BBS、论坛、QQ、MSN中某一好友的IP地址，并查询获取该好友所......
  • 2024-2025-1 20241329 《计算机基础与程序设计》第八周学习总结
    作业信息作业归属课程：https://edu.cnblogs.com/campus/besti/2024-2025-1-CFAP作业要求：https://www.cnblogs.com/rocedu/p/9577842.html#WEEK08作业目标：功能设计与面向对象设计；面向对象设计过程；面向对象语言三要素；汇编、编译、解释、执行作业正文：https://www.cnblogs.com/inca......
  • Alpha冲刺（4/14）——2024.11.15
    目录一、团队成员分工与进度二、成员任务问题及处理方式三、冲刺会议内容记录会议内容四、GitHub签入记录及项目运行截图GitHub签入记录五、项目开发进展及燃尽图项目开发进展燃尽图六、团队成员贡献表一、团队成员分工与进度成员完成的任务完成的任务时长剩余时间施......
  • ICPC2024杭州站游记
    Day-??发现杭州站可以报名，但是四处问了问发现并不知道中学生怎么报名？于是去push老叶找HZNU的工作人员报名，最后成功报上了。以为不能跨学校组队于是拉上了高一学弟，仍然沿用了“飞带长队”的队名。Day-?得知海峰加入了凯文队。Day-5加训CCPCHarbin，赢了呆呆鸟罚时。......
  • 20241116
    T1医生厨神秘贪心题。不会。不懂。考虑当\(\maxA_i\lex\)时，可以直接从大往小干。否则需要不断扩大\(x\)使得其超过\(\maxA\)。我们考虑在一个时刻，若存在一个\(a\)使得\(a\lex\land2a\gex\)，那我们直接把这个\(a\)干掉是不劣的，因为你现在干掉这个至多只会拖......
  • 2024华为OD算法真题目录
    文章目录一、什么是华为OD，什么是华为OD机试？二、华为OD面试流程？三、华为OD机试通过率高吗？四、华为OD薪资待遇？五、大家比较关注问题的FAQ......
  • 20241115
    T1自闭题目条件可以扩展到任意矩形的四个顶点。则整个矩阵仅由第一行和第一列决定。容易发现最左上角的格子直接填\(0\)是一定合法的，因此只需要判断是否存在数组\(a_i,b_i\)满足\(A_{i,j}=a_i+b_j\)即可。考虑将给出的限制视为边，\(a_i,b_j\)视为点建图，显然不同连......

赞助商

阅读排行

网站主页关于我们联系我们网站地图

本网站内容转载自其他媒体，侵权联系[admin##ips99.com]。

Copyright © 2020-2023 IPS99 版权所有 IPS99