reger_hy的博客

#include <iostream>#define N 501using namespace std;void PRINT(int A[][N],int sum,int n){ int i,j; if(sum > n+1) { i=sum-n; j=n; } else { i=1;j=sum-i;

#include <iostream>using namespace std;int A[1001][1001];int main(int argc, char *argv[]){ int m,n; cin >> m >> n; for(int i=1;i<=m;i++) { for(int j=1;j<=n;j++) cin >> A[i][j];

#include <iostream>#include <cstring>using namespace std;void SORT(int A[],int length){ for(int i=2;i<length;i++) { int key=A[i]; int j=i-1; while(j>0 && A[j]<key)

#include <iostream>#include <math.h>using namespace std;int main(int argc, char *argv[]){ int first,second,max; max=0; int n; cin >> n; cin >> first; for(int i=2;i<=n;i++) {