zhang_han666的博客

#include<stdio.h>#include<stdlib.h>#include<math.h>int HaveSame(int a[],int n){ int i = 0; int result=20000; for (i = 1; i < n; i++) { if (a[i] == a[i...

超时，得了90分。#include<stdio.h>#include<stdlib.h>#include<math.h>int islast(int a[], int n, int *result){ int sum = 0; for (int i = 1; i <= n; i++) { if (a...

ccf201712-4，赋权图的变种，没想明白，只写了 弗洛伊德算法，得了30分。#include<stdio.h>#include<stdlib.h>#include<math.h>int matrice[520][520];int path[520][520];int dis[520];int main(){ int n, m...

贪心算法。#include<stdio.h>int getmax(int n){ int result = 0; if (n / 50) { result+= ((n / 50) * 7); n %= 50; } if (n / 30) { result += ((n / 30)...