04 2023 档案
摘要：#include <iostream> using namespace std; const int N=2500; int p[N]; const int MAXW = 30000; const int MaxVertexNum = 30; typedef char VertexType; int
阅读全文
摘要：#include<iostream> #include<algorithm> using namespace std; const int maxn=1010; struct node//三元组结构 { int id;//工作编号 int ab;//在哪个机器 int times;//时间 bool
阅读全文
摘要：#include<iostream> #include<algorithm> using namespace std; struct m{ int a; int b; }; struct m N[1001],N1[1001],N2[1001]; int n; bool cmp1(m x,m y){
阅读全文
摘要：#include<bits/stdc++.h> struct Str { int w; int num; }; int n; int a[1010], b[1010]; Str s[5000]; int u, v; int ans[1010]; bool cmp(Str x, Str y) { re
阅读全文
摘要：#include<stdio.h> #include<string.h> #define MAXN 10 int a[MAXN][MAXN]; int main() { int n,t=0; while(scanf("%d",&n)!=EOF) { memset(a,0,sizeof(a)); t=
阅读全文
摘要：#include <iostream> #include <cstring> using namespace std; const int maxn = 100000; int prime[maxn] = { 0 }, visit[maxn] = { 0 }, cnt = 0, n; void li
阅读全文
摘要：#include<algorithm> #include<iostream> #include<cstdio> #define N 600 using namespace std; typedef struct{ int dl=-1,t=-1,fl=0,val=0; } Game; //t代表做的时
阅读全文
摘要：/* #include <iostream> #include <vector> using namespace std; #define max(N1,N2) N1>N2?N1:N2 int main() { /* 第一行输入背包容量V和物体的个数n 接下来有n行，每行包含两个数字，分别为该物体的
阅读全文
摘要：#include <iostream> #include <cmath> using namespace std; #define SIZE 2001 #define base 3 #define multiple 2 char p[SIZE][SIZE]; void universe(int n,
阅读全文
摘要：#include <iostream> #include<vector> using namespace std; int main() { vector<int>a; int n; while (cin >> n) { if (n == 0)break; int sum = 0; int i =
阅读全文
摘要：#include <iostream> using namespace std; int cube[105][105]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++)
阅读全文
