H030507的博客

无线通信中的TD系统（TD-LTE）

H030507 — Wed, 22 Feb 2023 09:41:36 +0800

5G中的核心技术

1.1 5G网络架构的演进趋势

H030507 — Wed, 22 Feb 2023 09:31:29 +0800

5G通信技术大赛相关知识记录与补充

open judge 1.4 19:简单计算器

H030507 — Fri, 19 Nov 2021 14:02:20 +0800

#include int main() { int a, b; char c; scanf("%d %d %c", &a, &b, &c); if (c == '+')printf("%d", a + b); else if (c == '-')printf("%d", a - b); else if (c == '*')printf("%d", a * b); else if (c == '/') { if (b ==.

open judge 1.4 20:求一元二次方程的根

H030507 — Thu, 18 Nov 2021 15:31:00 +0800

#include #include int main() { double a = 0; double b = 0; double c = 0; scanf("%lf %lf %lf",&a,&b,&c); if(b*b == 4*a*c) { printf("x1=x2=%.5lf",(0-b+sqrt(b*b-4*a*c))/(2*a)); } .

open judge 1.4 18:点和正方形的关系

H030507 — Thu, 18 Nov 2021 15:26:22 +0800

#include int main() { double x,y; scanf("%lf %lf",&x,&y); if(x<=1&&x>=-1&&y<=1&&y>=-1) printf("yes"); else printf("no"); return 0; }

open judge 1.4 17:判断闰年

H030507 — Thu, 18 Nov 2021 15:24:17 +0800

#include int main() { int a; scanf("%d", &a); if (a % 4 == 0) { if (a % 100 == 0 && a % 400 != 0) { printf("N"); } else { printf("Y"); } } else { printf("N"); } }

open judge 1.4 16:三角形判断

H030507 — Thu, 18 Nov 2021 15:22:14 +0800

#include #include int main() { int a,b,c; scanf("%d %d %d",&a,&b,&c); if (a + b > c&& a + c > b&& b + c > a) printf("yes"); else printf("no"); return 0;...

open judge 1.4 15:最大数输出

H030507 — Thu, 18 Nov 2021 15:19:55 +0800

#include int main () { long int a,b,c; scanf("%ld %ld %ld",&a,&b,&c); long int d=a>b?a:b; long int e=d>c?d:c; printf("%ld",e); return 0; }

open judge 1.4 14:计算邮资

H030507 — Thu, 18 Nov 2021 15:18:59 +0800

# include int main(){ int a,sum; char b; sum = 0; scanf("%d %c",&a,&b); if (a<=1000) sum = 8; else if (a>1000 && a%500==0) sum = 8+((a-1000)/500)*4; else sum = 8+((a-1000)/500)*4+4; if (b=='y') sum = s.

open judge 1.4 13:分段函数

H030507 — Thu, 18 Nov 2021 15:18:04 +0800

#include int main() { float a,b,n; scanf("%f",&a); if(a>=0&&a<5) b=-a+2.5; if(a>=5&&a<10) b=2-1.5*(a-3)*(a-3); if(a>=10&&a<20) b=a/2-1.5; printf(".

open judge 1.4 12:骑车与走路

H030507 — Thu, 18 Nov 2021 15:17:12 +0800

#include int main() { double a,b,n; scanf("%lf",&n); a=n/3+50; b=n/1.2; if(a>b) printf("Walk"); else if(a==b) printf("All"); else if(a

open judge 1.4 11:晶晶赴约会

H030507 — Thu, 18 Nov 2021 15:16:19 +0800

#include int main() { int a; scanf("%d",&a); if(a==1||a==3||a==5) printf("NO"); else printf("YES"); return 0; }

open judge 1.4 10:有一门课不及格的学生

H030507 — Tue, 16 Nov 2021 22:42:45 +0800

#include main() { int a,b; scanf("%d %d",&a,&b); if (a <60&&b>59||b<60&&a>59) printf("1"); else printf("0"); }

open judge 1.4 09:判断能否被3，5，7整除

H030507 — Tue, 16 Nov 2021 22:41:52 +0800

#include int main() { int a; scanf("%d",&a); if(a%3==0 && a%5==0 && a%7==0) printf("3 5 7"); if(a%3==0 && a%5==0 && a%7!=0) printf("3 5"); if(a%3==0 && a%5!=0 && a%7==0) printf("3 7"); .

open judge 1.4 08:判断一个数能否同时被3和5整除

H030507 — Tue, 16 Nov 2021 22:38:38 +0800

#include int main() { int a,b; scanf("%d",&a); if(a%3==0&&a%5==0){ printf("YES"); } else{ printf("NO"); } return 0; }

open judge 1.4 07:收集瓶盖赢大奖

H030507 — Tue, 16 Nov 2021 22:37:18 +0800

#include int main() { int a,b; scanf("%d %d",&a,&b); if(a>=10){ printf("1"); } else{ if(b>=20) printf("1"); else printf("0"); } return 0; }

open judge 1.4 06:判断是否为两位数

H030507 — Tue, 16 Nov 2021 22:35:35 +0800

#include int main() { int a; scanf("%d",&a); if(a>=10&&a<=99) printf("1"); else printf("0"); return 0; }

open judge 1.4 05:整数大小比较

H030507 — Tue, 16 Nov 2021 22:34:18 +0800

#include int main() { long a,b,c; scanf("%ld %ld",&a,&b); if(a>b) printf(">"); else if(a==b) printf("="); else//这里的if(a

open judge 1.4 04:奇偶ASCII值判断

H030507 — Tue, 16 Nov 2021 22:31:05 +0800

#include int main() { char a,b,c; scanf("%c",&a); if(a%2==0) printf("NO"); else printf("YES"); return 0; }

open judge 1.4 03:奇偶数判断

H030507 — Tue, 16 Nov 2021 22:29:44 +0800

#include int main() { int a,b,c; scanf("%d",&a); if(a%2==0) printf("even"); else printf("odd"); return 0; }