摘要: #include <stdio.h> #include <stdlib.h> //稀疏多项式合并 typedef struct Pnode{ float coef; //系数 int expn; //指数 struct Pnode *next;//指针域 }PNODE,*Polynomial; // 阅读全文
posted @ 2022-07-15 11:27 kangobs 阅读(56) 评论(0) 推荐(0)
摘要: 计算在区间1到n的所有整数中,数字x(0<x<9)出现的次数?例如在1到11中,1出现了4次。 #include<stdio.h> #include<stdlib.h> int CountX(int n,int x) { int yushu,res; int count = 0; if(n == 0 阅读全文
posted @ 2022-07-13 21:17 kangobs 阅读(76) 评论(0) 推荐(0)
摘要: 输入:50 输出:31035053229546199656252032972759319953190362094566672920420940313 #include<stdio.h> #include<stdlib.h> #define length 100000 int b[length]; v 阅读全文
posted @ 2022-07-12 12:25 kangobs 阅读(86) 评论(0) 推荐(0)
摘要: #include <stdio.h> #include <stdlib.h> int main() { int arr[101]; int n,i; int flag = 1001; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&arr[i]); if 阅读全文
posted @ 2022-07-06 16:16 kangobs 阅读(520) 评论(0) 推荐(0)
摘要: #include <stdio.h> #include <stdlib.h> int main() { int a,b,c; scanf("%d%d%d",&a,&b,&c); float m1,m2; int max1,max2,max3,temp1; if(a>b) { temp1 = a; i 阅读全文
posted @ 2022-07-06 15:35 kangobs 阅读(1062) 评论(0) 推荐(0)
摘要: #include <stdio.h> #include <stdlib.h> int cti(char c) { int num = 100; if(c=='0') num = 0; else if(c=='1') num = 1; else if(c=='2') num = 2; else if( 阅读全文
posted @ 2022-06-29 14:34 kangobs 阅读(467) 评论(0) 推荐(0)
摘要: #include<iostream> using namespace std; /* class Base1{ }; class Base2{ }; class Base3{ }; class Derived: public Base1,public Base2,public Base3 { }; 阅读全文
posted @ 2022-03-10 10:38 kangobs 阅读(15) 评论(0) 推荐(0)
摘要: import pandas as pd import matplotlib.pyplot as plt #以下两行设置全局字体,在本例中,坐标轴刻度和图例均用新罗马字体来表示 plt.rcParams['font.sans-serif']=['TimesNewRoman','SimSun'] # [ 阅读全文
posted @ 2021-10-17 20:40 kangobs 阅读(76) 评论(0) 推荐(0)
摘要: #include<stdio.h> #include<Windows.h> #include<time.h> struct clock { int hour; int minute; int second; }; typedef struct clock CLOCK; int main() { CL 阅读全文
posted @ 2021-07-28 11:17 kangobs 阅读(358) 评论(0) 推荐(0)
摘要: #include<stdio.h> int main() { int a[] = { 23,4,7,3,9,1,0 }; int n = 7,temp; for(int i =1;i<n;i++) for (int j = 0; j < n - i; j++) { if (a[j] > a[j + 阅读全文
posted @ 2021-07-28 10:28 kangobs 阅读(21) 评论(0) 推荐(0)