信息学奥赛一本通T1179-奖学金-题解(C++代码)
摘要：千万别忘记考虑当ny.sum;
}
if(x.score[0]!=y.score[0]){
return x.score[0]>y.score[0];
}
return x.s……
题解列表
蓝桥杯算法提高VIP-输出正反三角形-题解(C语言代码)
摘要：``````c
```c
#include
int main()
{
int n,m,i,j,t,k;
scanf("%d %d",&n,&m);
for(i=……
查找最大元素-题解(C语言代码)
```c#pragmawarning(disable:4996)#include#include#include#includeintmain(){chars[1000];charc=0;inti;while(scanf("%s",&s)!=EOF){for(i=0;i
[编程入门]自由下落的距离计算-题解(C语言代码)
摘要：#include
int main()
{
int i,n;
double sn,hn;
scanf("%lf %d",&sn,&n);
hn=sn/2;
for(i=2;i……
[编程入门]结构体之时间设计-题解(C语言代码)
```c#includestructDate{intyear;intmonth;intday;}date;intdays(intyear,intmonth,intday){inti,sum=0;inta[12]={31,28,31,30,31,
[编程入门]结构体之时间设计-题解(C语言代码)
```c#includestructDate{intyear;intmonth;intday;};boolisLeap(intyear){if(year%4==0&&year%100!=0||year%400==0)returntrue;returnfalse;}intd[12][2]={{31,
[编程入门]结构体之时间设计-题解(C语言代码)
#includestructDate{intyear;intmonth;intday;};boolisLeap(intyear){if(year%4==0&&year%100!=0||year%400==0)returntrue;returnfalse;}intd[12][2]={{31,
蓝桥杯算法提高VIP-和最大子序列-题解(C语言代码)极短代码，在线处理
摘要：```c
#include
int A[100000];
int main()
{
int n, sum = 0, max = -10001;
scanf("%d", &n);
f……
蓝桥杯算法提高VIP-前10名-题解(C语言代码)
摘要：```c
#include
int main()
{
int a[200],n,i,j,temp,min;
scanf("%d",&n);
for(i=0;i……
蓝桥杯算法训练VIP-FBI树-题解(C语言代码)
```c#include#include#includeintcnt;typedefstructTreeNode{chars[1025];structTreeNode*left;structTreeNode*right;}*BinTree;BinTreeCreateTree(char*s1){char