本文分类:news发布日期:2025/11/23 17:07:04
相关文章
1040. Longest Symmetric String (25)
1040. Longest Symmetric String (25)#include <iostream>
#include <string.h>using namespace std;int main()
{char s[1010];gets(s);int len = strlen(s), i, count, res = 0, j, k;for(i = 0; i <…
建站知识
2025/11/23 17:06:30
1029. Median (25)
1029. Median (25)#include <iostream>
#include <vector>
#include <algorithm>using namespace std;int main()
{int n;scanf("%d", &n);int i;long int num;vector<long int>…
建站知识
2025/11/23 17:06:24
1039. Course List for Student (25)
1039. Course List for Student (25)#include <iostream>
#include <vector>
#include <algorithm>using namespace std;vector<int> v[270000];int getbigindex(char s[])
{return (s[0] - A…
建站知识
2025/11/23 17:06:21
1033. To Fill or Not to Fill (25)
1033. To Fill or Not to Fill (25)#include <iostream>
#include <algorithm>using namespace std;struct node
{double dis, p;
}stations[510];int cmp(node n1, node n2)
{return n1.dis < n2.dis;…
建站知识
2025/11/23 17:05:38
1032. Sharing (25)
1032. Sharing (25)#include <iostream>
#include <vector>using namespace std;struct node
{int address, next;char data;
}nod[100000];int main()
{int begin[2], n;scanf("%d%d%d", &…
建站知识
2025/11/23 17:05:05
1031. Hello World for U (20)
1031. Hello World for U (20)#include <iostream>
#include <string.h>using namespace std;int main()
{char s[100];gets(s);int n1, n2, n = strlen(s), flag = 0;for(n2 = 3; n2 <= n; n2++){for(…
建站知识
2025/11/23 17:04:38
1034. Head of a Gang (30)
1034. Head of a Gang (30)#include <iostream>
#include <vector>
#include <algorithm>using namespace std;int tree[2010], sum[2010], smallindex[2010], bigindex[27000], weight[2010], cur,…
建站知识
2025/11/23 17:04:09
2025 年 11 月工业加湿器厂家权威推荐榜:高压微雾/干雾/纺织/印刷加湿器,喷雾降尘/喷雾造景/喷雾除臭设备,车间/电子车间/冷库加湿系统精选
2025 年 11 月工业加湿器厂家权威推荐榜:高压微雾/干雾/纺织/印刷加湿器,喷雾降尘/喷雾造景/喷雾除臭设备,车间/电子车间/冷库加湿系统精选
随着工业环境控制要求的不断提高,工业加湿器在现代化生产过程中扮演着越…
建站知识
2025/11/23 17:02:05

