自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+
  • 博客(31)
  • 收藏
  • 关注

原创 B - Rightmost Digit

#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>using namespace std;int main(){ long long n,t,n1; cin>>t; while(t--) { int n2; cin>>n; n1=n%10;//找余数 n2=n1;.

2021-03-31 13:44:32 57

原创 A - Count on Canton(二分)

#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<math.h>using namespace std;int main(){ int n; while(cin>>n) { int sum=0,k=1;//k代表是斜着的列数,从第一列开始,同时第m列有m个数字 whil..

2021-03-28 20:25:21 101

原创 Wiki with Adjacent Letters

#include<cstdio>#include<cstring>#include<algorithm>#include<iostream>using namespace std;int a[44];//要把这个数组放到主函数外,因为数组可能会过大int main() { long long n; string s; cin>>n>>s; long long ans=0; for(.

2021-03-25 19:43:59 108

原创 M - Physical Examination(贪心)

#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<functional>using namespace std;const int maxn=2222222;struct time{ long long al,bl;}a[maxn];bool cmp(time c,time d){ return c.al*d.bl&..

2021-03-24 14:35:17 85

原创 H - 字数统计

#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<functional>using namespace std;long long a[10002][102],b[10005];这里注意数据范围,10000*100,很大了,int main(){ int N,L,M,i,j; while(cin>>N&g.

2021-03-22 20:57:19 78

原创 E - Moving Tables(贪心)

#include<algorithm>#include<iostream>#include<string.h>#include<functional>using namespace std;int main(){ int T,n,a,b; int d[404]; cin>>T; while(T--) { memset(d,0,sizeof(d));//要初始化,否则一些数据会是任意值,而不是0; cin&g..

2021-03-22 19:17:26 59

原创 J - Saving HDU

#include <iostream>#include <algorithm>#include <string.h>#include <functional>using namespace std;struct game{ int pri; int ti;}a[222222];bool cmp(game a,game b){ return a.pri>b.pri;}int main(){ int v,n; while.

2021-03-19 11:09:31 40

原创 L1-005 考试座位号

正确代码1:#include <iostream>#include <algorithm>#include <string.h>#include <functional>using namespace std;struct people{ string id; int shi; int kao; }a[2222];int main(){ int n,m,k[1111]; cin>>n; for(int i=0.

2021-03-15 20:37:06 51

原创 L1-040 最佳情侣身高差

#include <iostream>#include <algorithm>#include <string.h>#include <functional>using namespace std;struct pl{ char c;//输入一个字符,不用开数组了 float hh;//身高}a[1111];int main(){ int n; scanf("%d",&n); float h;//注意类型 f.

2021-03-15 18:56:47 78

原创 P3817 小A的糖果

#include <iostream>#include <algorithm>#include <string.h>#include <functional>using namespace std;long long a[2222222];//注意数据范围int main(){ long long x,n; cin>>n>>x; a[0]=0;//加一个初始数据,方便计算 for(int i=.

2021-03-14 09:51:48 29

原创 P1223 排队接水(贪心)

#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<math.h>#include<stdlib.h>using namespace std;int main(){ int n,a[2222],b[2222]; scanf("%d",&n); int sum1=0,sum2=0; .

2021-03-14 09:47:59 99

原创 P5019 [NOIP2018 提高组] 铺设道路(贪心算法)

#include <iostream>#include <algorithm>#include <string.h>#include <functional>using namespace std;int main(){ int n,a[333333]; cin>>n; for(int i=1;i<=n;i++) cin>>a[i]; a[0]=0;//加上一个i=0的数组, int sum=0;.

2021-03-14 09:24:41 250

原创 P1094 [NOIP2007 普及组] 纪念品分组

#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<math.h>#include<stdlib.h>using namespace std;int w,n,a[33333];//不想说话一个数组长度我找了快一个点的错!!!!!!!,int l,r; int sum;int main(){ .

2021-03-13 20:31:52 42

原创 P1208 [USACO1.3]混合牛奶 Mixing Milk

#include <iostream>#include <algorithm>#include <string.h>#include <functional>using namespace std;struct former{ int pr; int nu; }a[2222222];bool cmp(former d,former b){ return d.pr<b.pr;}int main(){ long long n.

2021-03-13 20:06:47 89

原创 判断素数

#include<algorithm>#include<iostream>#include<string.h>#include<math.h>#include<functional>using namespace std; int main() { int n; long long m; scanf("%d",&n); while(n--) { int k=0; scanf("%.

2021-03-12 19:02:52 40

原创 M - The Rank

#include<algorithm>#include<iostream>#include<string.h>#include<functional>//用greater要用它定义using namespace std; int main() { int n,rank; int a[22222],b[2222],c[22222]; cin>>n; int s=0,k=0; for(int j=0;j<n;...

2021-03-12 17:11:46 57

原创 L - Helpful Maths

#include<algorithm>#include<iostream>#include<string.h>#include<functional>using namespace std; int main() { char b[100]; char a[200]; int len; while(gets(a)) { len=strlen(a); if(len==1) ..

2021-03-12 17:07:35 60

原创 K - Building designing

#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<math.h>long long a[666666];using namespace std;bool cmp(int a,int b){ return abs(a)>abs(b);}int main(){ int n,m; cin>>n;..

2021-03-11 23:41:34 53

原创 J - Where is the Marble?

#include <iostream>#include <algorithm>#include <string.h>#include <functional>using namespace std;int main(){ int n,q; int b[22222],a[22222]; int sum=0; while(cin>>n>>q&&n&&q) { ..

2021-03-11 23:38:34 48

原创 I - Solving Order

#include <iostream>#include <algorithm>#include <string.h>#include <functional>using namespace std;struct bolloon{//结构体 string col;//字符串,颜色 int num;//颜色数量 }a[44444];bool cmp(bolloon a,bolloon b){ return a.num>b.num;}.

2021-03-11 23:34:59 38

原创 H - 绝对值排序

普通代码:#include <iostream>#include <math.h>#include <algorithm>#include<functional>using namespace std;int main(){ int n,a[22222],b[22222]; while(cin>>n) { if(n==0) break; for(int i=0;i<n;i++) { ..

2021-03-11 23:30:46 78

原创 G - EXCEL排序

#include <iostream>#include <algorithm>#include <string.h>#include <functional>using namespace std;struct student{ char id[100];//学号 char name[100];//名字 int grade;//成绩}a[555555];//因为题中有大体三种排序方式,所以三个bool,三种排序bool cmp1(s...

2021-03-11 23:24:57 75

原创 F - sort

#include <iostream>#include <algorithm>#include <string.h>#include <functional>using namespace std;const int N=1e6+5;int a[N];int main(){ int n,m; while(~scanf("%d%d",&n,&m)) { for(int i=0;i<n;i++)..

2021-03-11 23:17:56 111

原创 E - 前m大的数

#include <iostream>#include <algorithm>#include <string.h>#include <functional>using namespace std;int n,m,a[777777],b[7777777];//根据公式n*(n-1)/2,n<=3000,可推断出数组大小int main(){ ios::sync_with_stdio(false);//与cin cout相配可..

2021-03-11 23:13:41 43

原创 D - 排名

#include <iostream>#include <algorithm>#include <string.h>#include <functional>using namespace std;struct student{ char id[1000];//准考证号 int sum;//de}a[44444];bool cmp(student a,student b{ int s; //排序 if(a.s...

2021-03-11 22:59:41 73

原创 C - 开门人和关门人

#include<iostream>#include<algorithm>#include<string.h>using namespace std;struct student{ string id;//证件号码 string st;//开始时间 string en; //结束时间}a[2222]; int main() { int n,m,minn,maxn; cin>>n; while(n--) { maxn..

2021-03-11 22:46:26 90

原创 A - DNA Sorting

`#include <iostream>#include <algorithm>#include <string.h>#include <functional>using namespace std;struct DNA{ char str[2222]; int num;}a[55555];bool cmp(DNA a,DNA b){ return a.num<b.num;}int main(){ int n,m,k,i..

2021-03-11 22:41:43 34

原创 R - Vika and Squares(刷油漆)

贪心题。每种颜色至少可以被使用minn次,这是显而易见的。我们要想尽可能多的为正方形上色其实也就是想尽可能多的使用那些颜料多于minn公升的颜色,不难发现我们应该寻找两个min值的最长区间(把整个区间看整一个环形)(把整个区间看整一个环形)(把整个区间看整一个环形)。可以转化为求两个最小值之间的最大距离,手推几组数据可以发现这几组数据都是从最小值之间的最大长度开始算起的。然后,最小值 * n+最小值之间的最大长度=能够用掉的最多油漆。#include <iostream>#...

2021-03-03 15:12:35 127 2

原创 Q - Uncowed Forces

#include <iostream>#include <string.h>#include <algorithm>using namespace std;int main(){ int a[300],b[200]; int hs,hu; for(int i=0;i<5;i++) cin>>a[i]; for(int i=0;i<5;i++) cin>>b[i]; cin>>hs>&...

2021-03-03 14:51:42 58 1

原创 P - Random Teams

考察数学知识#include <iostream>#include <string.h>#include <algorithm>using namespace std;int main(){ int t; long long m,n; cin>>n>>m; cout<<(m-n%m)*(n/m)*(n/m-1)/2+(n%m)*(n/m+1)*(n/m)/2<<" "&lt...

2021-03-01 21:03:30 133

原创 O - Football

#include <iostream>#include <algorithm>#include <cstring>using namespace std;int main(){ int n; string a,b,c;//定义的字符串 cin>>n; cin>>a;//首先输入一个字符串 int sum=1,num=0; for(int i=1;i<=n-1;i++)//再输入剩下的..

2021-03-01 20:59:13 71

空空如也

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除