- 博客(13)
- 资源 (1)
- 收藏
- 关注
原创 问题 D: String Subtraction (20)
题目链接利用string库提供的方法操作;#include<iostream>#include<string>using namespace std; int main(){ string s1, s2; int i; int a = 0;; while (getline(cin, s1)&& getline(cin, s2)) { i = 0; while (s2[i] != '\0')
2020-06-20 22:48:27 86
原创 问题 B: 分组统计
题目链接#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int main(){ int n,m,s[110],g[110],t[110]; while(~scanf("%d",&n))//样例数 { for(int i=0;i<n;i++) { int z[110][2100]={0}; scanf("%d",&am
2020-06-20 22:41:08 179
原创 问题 C: Be Unique (20)
题目链接错误做法:(错误原因:只考虑了出现次数唯一,但是还需要考虑出现的先后顺序,先出现的,唯一数才是我们需要的)#pragma warning(disable:4996);#include<stdio.h>#include<math.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;int main(){ int n;
2020-06-20 21:57:03 121
原创 问题 C: EXCEL排序
题目链接#pragma warning(disable:4996);#include<stdio.h>#include<math.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;struct stu { char num[8]; char name[20]; int grade;}buf[100005];bool cm
2020-06-19 21:52:09 134
原创 问题 I: 排名
题目链接#pragma warning(disable:4996);#include<stdio.h>#include<math.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;struct stu { char name[25]; int point; bool operator<(const stu& a
2020-06-19 21:26:09 246
原创 问题 E: Problem B
题目链接#pragma warning(disable:4996);#include<stdio.h>#include<math.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;bool cmp(int a, int b) { return a > b;}int main(){ int m; while (sc
2020-06-18 23:17:32 131
原创 问题 H: 整数奇偶排序
题目链接#pragma warning(disable:4996);#include<stdio.h>#include<math.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;bool cmp(int a, int b) { return a > b;}int main(){ int a; while (s
2020-06-17 17:52:38 175
原创 问题 B: 首字母大写
题目链接将一维字符串转换成二维的一个个单词组,再分别对但词组处理;#pragma warning(disable:4996);#include<stdio.h>#include<math.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;int main(){ char str[105]; while (gets(st
2020-06-16 14:47:35 148
原创 问题 D: 日期类
题目链接#pragma warning(disable:4996);#include<stdio.h>#include<math.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;#define isyeap(x) x%100!=0&&x%4==0||x%400==0?1:0//判断闰年int dayofmont
2020-06-11 23:04:08 84
原创 问题 A: 日期差值
题目链接#pragma warning(disable:4996);#include<stdio.h>#include<math.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;int month[13][2] = { 0,0, 31,31, 28,29, 31,31, 30,30, 31,31, 30,30,
2020-06-11 22:38:37 101
原创 问题 D: 沙漏图形 tri2str [1*+]
题目链接#pragma warning(disable:4996);#include<stdio.h>#include<math.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;int main(){ int n; cin >> n; int x = n;//控制*数 int bk = 0;//控制空格数
2020-06-11 22:19:42 82
原创 问题 C: 等腰梯形
题目链接其思路类似直角梯形,每往下一层,其*总数加2,但是是左右各加一个;#pragma warning(disable:4996);#include<stdio.h>#include<math.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;int main(){ int m; cin >> m; wh
2020-06-10 19:11:17 171
原创 问题 B: Hello World for U
题目链接#pragma warning(disable:4996);#include<stdio.h>#include<math.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;int main(){ char s[100]; while (scanf("%s", s) != EOF) { int len = st
2020-06-10 18:58:24 85
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人