Duang~o-优快云博客

原创 shǎ崽 OrOrOrOrz

#include<iostream>#include<cstdio>#include<string>#include<algorithm>using namespace std;int main(){ int N,a[10001],b[5001],c[5001],i; while(~scanf("%d",&N)) { for(i=1;i<=N;i++) scanf("%.

2021-03-26 19:05:04 109

#include<iostream>#include<cstdio>#include<algorithm>using namespace std;bool camp(int a,int b){ return a>b;}int main(){ int n,l,m; while(cin>>n>>l>>m) { int b[n+1]={0},c[n]={0}; int p[n+1][l+1],sum=0,..

2021-03-22 20:33:14 150

原创迷瘴

#include<iostream>#include<stdio.h>#include<algorithm>using namespace std;int main(){ int c,n,w; double v,a[999]; cin>>c; while(c--) { cin>>n>>v>>w; for(int i=0;i<n;i++) { cin>>a[i]; ..

2021-03-21 19:27:33 131

原创 FatMouse‘ Trade

#include <iostream>#include<stdio.h>#include<algorithm>#include<string>#include<iomanip>using namespace std;struct cc{ double c; int a,b;} f[999999];bool cmp(cc x,cc y){ return x.c>y.c;}int main(){ ..

2021-03-21 09:45:10 82

原创调和平均

#include <stdio.h>#include <stdlib.h>#include<math.h>int main(){ int N,i; double a[9999],x; double sum=0.0; scanf("%d",&N); for(i=0; i<N; i++) { scanf("%lf",&a[i]); sum+=1/a[i]; .

2021-03-20 19:20:38 142

原创洛希极限

#include <stdio.h>#include <stdlib.h>int main(){ double a,b,c,x; while(~scanf("%lf%lf%lf",&a,&b,&c)) { if(b==1) { x=a*1.26; } else x=a*2.455; printf("..

2021-03-20 19:06:46 340 1

原创吃鱼还是吃肉

#include <stdio.h>#include <stdlib.h>int main(){ int N,a,b,c; scanf("%d",&N); while(N--) { scanf("%d%d%d",&a,&b,&c); if(a==1) { if(b!=130) { if..

2021-03-20 10:12:30 864

原创新胖子公式

#include <stdio.h>#include <stdlib.h>int main(){ float w,h,s; while(~scanf("%f %f",&w,&h)) { s=1.0*w/(h*h); printf("%.1f\n",s); if(s>25) printf("PANG\n"); else p.

2021-03-20 09:29:24 117

原创谁是赢家

#include <stdio.h>#include <stdlib.h>int main(){ int pa,pb,x,y,z,t; scanf("%d%d",&pa,&pb); scanf("%d%d%d",&x,&y,&z); t=x+y+z; if((pa>pb&&t<3)||(pa<pb&&t==0)) printf("T.

2021-03-20 09:17:24 130

原创到底是不是太胖了

#include <stdio.h>#include <stdlib.h>#include<math.h>int main(){ int N,h,w; double ss; float s; scanf("%d",&N); while(~scanf("%d %d",&h,&w)) { s=(h-100)*0.9*2; ss=fabs(w-s); .

2021-03-20 08:45:21 83

原创今年暑假不AC

#include <iostream>#include<algorithm>using namespace std;struct node{ int st,ed;} a[999];bool cmp(node x,node y){ return x.ed<y.ed;}int main(){ int n; while(cin>>n&&n) { for(int i=0; i&..

2021-03-18 20:45:58 71

原创 climbing worm

#include<stdio.h>int main(){ int n,u,d,sum,t; while(~scanf("%d%d%d",&n,&u,&d) ) { if(n==0) break; sum=0;t=0; while(t<=n) { t=t+u; sum++; if(t>=n) break; sum++; t=t-d; } printf("%d\n",sum); }...

2021-03-18 20:44:39 89

原创电子汪

#include<stdio.h>#include<stdlib.h>#include<string.h>int main(){ int n,m,i; scanf("%d%d",&n,&m); for(i=0;i<n+m;i++) printf("Wang!"); return 0;}

2021-03-18 19:04:57 385

原创装睡

#include<stdio.h>#include<stdlib.h>#include<string.h>int main(){ int N,i; char m[15][5]; int h[99],t[99]; scanf("%d",&N); for(i=1;i<=N;i++) { scanf("%s %d %d",&m[i],&h[i],&t[i]); .

2021-03-18 18:58:31 246

原创判断素数

判断素数#include <stdio.h>#include <stdlib.h>#include<math.h>int main(){ int n,i,b; long long a; scanf("%d",&n); while(n--) { scanf("%lld",&a); b=0; if(a==1) printf("No\n"

2021-03-15 19:05:24 67

原创奇偶分家

奇偶分家#include <stdio.h>#include <stdlib.h>int main(){ int N,m,i; int a=0,b=0; scanf("%d",&N); for(i=1; i<=N; i++) { scanf("%d",&m); m=m%2; if(m==0) { a++; }

2021-03-15 18:55:25 666

原创大笨钟

大笨钟#include <stdio.h>#include <stdlib.h>#include<math.h>int main(){ int hh,mm; int d,i; scanf("%02d:%02d",&hh,&mm); if(hh>=0&&hh<=12) printf("Only %02d:%02d. Too early to Dang.\n",hh,mm

2021-03-14 20:56:46 93

原创求证数段和

求证数段和#include <stdio.h>#include <stdlib.h>#include<string.h>int main(){ int a,b,i,x=0,y=0; scanf("%d%d",&a,&b); for(i=a;i<=b;i++) { printf("%5d",i); x+=i; y++; if(y%5==0&am

2021-03-14 12:01:00 99

原创念数字

念数字#include <stdio.h>#include <stdlib.h>#include<string.h>int main(){char c; c=getchar(); while(c!='\n') { if(c=='-') printf("fu"); else if(c=='0') printf("ling"); else i

2021-03-14 11:52:23 90

原创凌乱的yyy//线段覆盖

洛谷【算法1-5】贪心凌乱的yyy//线段覆盖#include <iostream>#include<algorithm>using namespace std;struct cc{ int ks,js;} a[9999999];bool cmp(cc a1,cc a2){ return a1.js<a2.js;}int main(){ int n,i; cin>>n; for(i=1; i<

2021-03-14 10:24:35 99

原创铺设道路

洛谷【算法1-5】贪心铺设道路#include <iostream>#include<algorithm>using namespace std;int n,m[999999];int main(){ cin>>n; for(int i=0; i<n; i++) { cin>>m[i]; } int day=0; for(int i=0; i<n; i++)

2021-03-14 10:00:19 108

原创纪念品分组

洛谷【算法1-5】贪心纪念品分组**首先以为都是一个数一组，组数=n，再判断最大的数是否可以和最小的的数一个组，不可以就说明，最大的数肯定是单独一个组的，删除最大的数，组数不变，如果可以就删除最大的数和最小的数，组数-1，因为最大的数的组可以删除了。（看大佬代码，秒懂！！！）**#include <iostream>#include<algorithm>using namespace std;int price[99999];int main(){ in

2021-03-14 09:21:04 129

原创混合牛奶

洛谷【算法1-5】贪心混合牛奶#include <iostream>#include<algorithm>#include<iomanip>using namespace std;struct cc{ int x,y;} p[9999];int cmp(cc a,cc b){ return a.x<b.x;}int main(){ int n,m,i,j; int zl=0,sum=0; cin&

2021-03-13 19:49:07 131

原创小A的糖果

洛谷【算法1-5】贪心小A的糖果#include <iostream>#include<algorithm>#include<iomanip>using namespace std;int i,a[999999];int main(){ long long n,x,s=0; cin>>n>>x; for(i=1; i<=n; i++) { cin>>a[i];

2021-03-13 14:03:29 92

原创排队接水

洛谷【算法1-5】贪心排队接水#include <iostream>#include<algorithm>#include<iomanip>using namespace std;struct cc{ int x; int sj;} a[999999],t;int main(){ int n,i,j; cin>>n; for(i=1; i<=n; i++) { cin&

2021-03-13 11:38:29 155

原创 Game With Sticks

#include <stdio.h>#include <stdlib.h>int main(){ int n,m; while(~scanf("%d%d",&n,&m)) { if(n==m&&n%2==0) printf("Malvika\n"); if(n==m&&n%2==1) printf("Akshat\n")...

2021-01-29 21:02:40 133

原创 Vanya and Cubes

在这里插入图片描述#include <stdio.h>#include <stdlib.h>int main(){ int n,i,m=0,sum=0,x=0; while(~scanf("%d",&n)) { for(i=1;i<=n;i++) { m+=i; sum+=m; x++; if(sum==n) break..

2021-01-29 20:48:05 83

原创 Regular Bracket Sequence

#include <stdio.h>#include<stdlib.h>#include<string.h>int main(){ int T,i; char a[222222]; scanf("%d",&T); getchar(); while(T--) { gets(a); if(a[0]!=')'&&a[strlen(a)-1]!='('&&..

2021-01-28 20:07:08 93

原创奥兹巫师

#include <stdio.h>#include<stdlib.h>int main(){ int T,n,x,i; scanf("%d",&T); while(T--) { scanf("%d",&n); if(n==1) printf("9"); else if(n==2) printf("98"); els..

2021-01-27 21:35:45 940

原创 Strange List

#include <stdio.h> #include<stdlib.h>int main(){ int t,n,x,a[1111111],i,j; long long sum,temp; scanf("%d",&t); while(t--) { sum=0; temp=1; scanf("%d%d",&n,&x); for(i=0;i<n;i++..

2021-01-27 20:21:44 126

原创 Red and Bule

#include<cstdio>#include<algorithm>using namespace std;int main(){ int n,a,b,sum,ans,t,x; scanf("%d",&n); while(n--) { a=0;b=0;sum=0;ans=0; scanf("%d",&t); while(t--) { ...

2021-01-26 22:42:12 76

原创 Again Twenty Five!

#include <stdio.h>#include <stdlib.h>int main(){ long long int n; while(~scanf("%lld",&n)) printf("25\n"); return 0;}

2021-01-26 21:07:55 165

原创 The New Years : Meeting Friends

#include<stdio.h>#include<stdlib.h>int main(){ int a,b,c; while(~scanf("%d%d%d",&a,&b,&c)) { if(a>b&&b>c) printf("%d\n",a-c); else if(a>c&&c>b) pr..

2021-01-26 21:06:21 264 2

原创 New Year Candles

#include <stdio.h>#include <stdlib.h>int main(){ int a,b,x; x=0; scanf("%d%d",&a,&b); x+=a; while(a>=b) { x+=a/b; a=a/b+a%b; } printf("%d\n",x); return 0;}

2021-01-26 21:01:26 86

原创 FourSegments

#include <stdio.h>#include <stdlib.h>int main(){ int n,a[111],i,j,t; scanf("%d",&n); while(~scanf("%d%d%d%d",&a[0],&a[1],&a[2],&a[3])) { for(i=0; i<3; i++) { for(j=0; j&l...

2021-01-26 20:57:11 150

原创 Maximum GCD

#include<stdio.h>#include<stdlib.h>#include <math.h>int main(){ int x,y;scanf("%d",&x);while(~scanf("%d",&y)){ printf("%d\n",y/2);} return 0;}

2021-01-26 20:54:28 57

原创 Fair Division

#include <stdio.h>#include <stdlib.h>int main(){ int n,a[101],i,x,y,b,z; scanf("%d",&b); while(~scanf("%d",&n)) { z=0;x=0;y=0; for(i=1; i<=n; i++) { scanf("%d",&a[i]); ...

2021-01-26 20:49:22 69

原创 Cards for Friends

#include <stdio.h>#include <stdlib.h>int main(){ int w,h,n,x,a,i; scanf("%d",&a); while(~scanf("%d%d%d",&w,&h,&n)) { x=1; for(i=2;w%i==0;i=i*2) { x=x*2; } for(i=2;h%i==0;...

2021-01-26 20:46:03 65

原创 fence

#include <stdio.h>#include <stdlib.h>int main(){ int n,k,x,i,t,min; int a[222222]; scanf("%d%d",&n,&k); for(i=1;i<=n;i++) scanf("%d",&a[i]); x=0; for(i=1;i<=k;i++) x+=a[i]; min..

2021-01-26 20:38:11 71

空空如也

空空如也