Duke10的博客

#include<stdio.h>int max(int a, int b){ return (a > b ? a : b);}int main(){ int n; while (scanf("%d",&n) != EOF) { int data[100][100] = {0}; int i, j; for (

#include<stdio.h>#include<string.h>int max(int a, int b){ return (a > b ? a : b);}int main(){ int m; scanf("%d",&m); while(m--) { int n, w; scanf("%d%d",&n,&w)

方法1:--------------------------------------------------------------------------------#include<stdio.h>int max(int a, int b){ if (a > b) return a; else return b;}int main()

方法1：--------------------------------------------------------------------------------#include<stdio.h>#include<string.h>#include<stdlib.h>#define MAX(a,b) （ a > b ? a : b）int main(){ int n;

#include<stdio.h>#include<string.h>#define Min(a,b) (a < b ? a : b)int main(){ int n, t; while (~scanf("%d%d",&n,&t) && n + t != 0) { int i, j, a[100] = {0}; for (i = 1;

#include<stdio.h>#include<string.h>int dp[25][25]; // 定义二维数组存放矩阵int max(int a,int b){ if(a>b) return a; else return b;}int main(){ int n,m; while(scanf("%d%d"