label stringlengths 1 2 | index stringlengths 1 5 | code stringlengths 87 8.24k |
|---|---|---|
18 | 8500 | int main()
{
int n,a[100][100],i,j,k,m;
cin>>n;
for (k=1;k<=n;k++)
{
int num=0;
int sum=0;
for (i=0;i<n;i++) //??
for (j=0;j<n;j++)
cin>>a[i][j];
for (m=0;m<n-1;m++) //n-1?
{
for (i=0;i<n-num;i++)
{
int rowm=a[i][0];
for (j=0;j<n-num;j++) //???min
{
if (a[i][j]<rowm) rowm=a[... |
18 | 8501 | // ?????????.cpp : ??????????????
//
//?????
int min(int a[],int nx) //min???????????
{ //min????
int x,min;
min = a[0];
for (x = 0;x <= nx - 1;x++) //????????????
{
if (a[x] <= min)
{
min = a[x];
}
}
return min; //?????
} /... |
18 | 8502 | int main()
{
int n=0,a[110][110]={0},j=0,i=0,k=0,l=0,min=100000,sum=0;
int (*p)[110]=a;
cin>>n;
for(k=0;k<n;k++)
{
sum=0;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
cin>>*(*(p+i)+j);
}
for(l=0;l<n-1;l++)
{
for(i=1;i<=n-l;i++)
{
min=100000;
for(j=1;j<=n-l;j++)
{
if(*(*(p+i)+j)... |
18 | 8503 | int main(){
int a[101][101];
int n,i,j,t,min,count=0,m;
cin>>n;
for(m=0;m<n;m++){
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
cin>>a[i][j];
count=0;
for(t=n;t>=2;t--){
for(i=1;i<=t;i++){
min=a[i][1];
for(j=1;j<=t;j++)
min=(a[i][j]<min?a[i][j]:min);
for(j=1;j<=t;j++)
a[i][j]-=min;
}
... |
18 | 8504 |
int main() //????
{
const int MAX=50000;
int n;
cin>>n;
for (int k=0;k<n;k++)
{
int jz[110][110];
for (int i=0;i<n;i++)
for (int j=0;j<n;j++)
cin>>jz[i][j];
int ans=0;
for (int x=0;x<n-1;x++)
{
for (int i=0;i<n-x;i++)
{
int min=MAX;
for (int j=0;j<n-x;j++)
if (jz[i][j]<min) ... |
18 | 8505 | void main()
{
int n=0;
scanf("%d",&n);
int i,j,k;
int flag=0;
int gl(int num[][200],int n);
for(i=0;i<n;i++)
{
int sum=0;
int num[200][200]={0};
for(j=0;j<n;j++)
for(k=0;k<n;k++)
scanf("%d",&num[j][k]);
sum=gl(num,n);
printf("%d\n",sum);
}
}
int gl(int num[][200],int n)
{
int i=0,j=0,k=0;
in... |
18 | 8506 | /*-----------------------------------------*\
|? ? ? ?????????? |
|? ? ???? |
|? ? ? ??2010 ? 12 ? 01 ? |
|? ? ?1000012758 |
\*-----------------------------------------*/
int a[100][100][100];//n?n*n???
int Sum(int n, int t[100][100])
{
int sum = 0, min = 0... |
18 | 8507 | int main()
{
int n,m,i,j,k,sum,min;
cin >>m;
for(i=1;i<=m;i++)//m×éÊý¾Ý Ñ­»·ÊäÈë
{
int a[m][m];
for(j=0;j<m;j++)//Ñ­»·ÊäÈë¾ØÕó
for(k=0;k<m;k++)
... |
18 | 8508 | int find_min( int x ,int side);//???x?????
int find_miny(int y,int side);//???y?????
int a[120][120],sum;//??,a[1][1]??
void caozuo( int side );//??
int main()
{
int i,j,n,k;
cin>>n;//??
for(k=1;k<=n;k++)
{
sum=0;
memset(a,0,sizeof(a));//??
for(i=0;i<=n-1;i++)
for(j=0;j<=n-1;j++)
... |
18 | 8509 | //?????????
int sum=0,n;
void GuiLing(int num[][100],int n,int move);
void XiaoJian(int num[][100],int move);
int main()
{
int i,j,t,num[100][100];
cin>>n;
for (t=0;t<n;t++)
{
sum=0;
for (i=0;i<n;i++)
for (j=0;j<n;j++)
cin>>num[i][j];
XiaoJian(num,0);
cout<<... |
18 | 8510 | int n,a[100][100][100];
int main()
{int min,sum[100]={0};
cin>>n;
for(int k=0;k<n;k++)
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
cin>>a[k][i][j];
for(int r=n;r>1;r--)
{
for(int k=0;k<n;k++)
{ for(int i=0;i<r;i++)
{
min=a[k][i][0];
for(int j=1;j<r;j++)
{if(a[k][i][j]<min)
min=a[k][i][j];}
for(int j=0;... |
18 | 8511 | void suo(int b[101][101],int n)
{
int row=0,l=0;
for(int i=1;i<n-1;i++)
for(int j=0;j<n;j++)
b[i][j]=b[i+1][j];
for(int j=1;j<n-1;j++)
for(int i=0;i<n;i++)
b[i][j]=b[i][j+1];
return;
}
int square(int a[101][101],int n)
{
if(n==1)
return 0;
for(int i=0;i<n;i++)
{
int min=a[i][0];
for(int j=1;j<n;j... |
18 | 8512 | int minx[1000],miny[1000];
int n,m,a[105][105],b[105][105];
void calc_min(){
for(int i=0;i<m;i++){
minx[i]=100000;miny[i]=100000;
}
for(int i=0;i<m;i++)
for(int j=0;j<m;j++){
if(a[i][j]<minx[i])minx[i]=a[i][j];
//if(a[i][j]<miny... |
18 | 8513 | /*
* test04_05.cpp
*
* Created on: 2010-12-31
* Author: 10139
* ?? - ?????????
?? ???2009????
??
????n*n????3<=n<=100?????????????
??n-1???????????????????1*1????????????
???????????????????????????????????????????????????
??????????????????... |
18 | 8514 | int tozero(int n);
void delete1(int,int);
void delete2(int,int);
void movea (int);
int a[100][100],sum=0;
int main()
{
int n,i,j,k;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
for(j=0;j<=99;j++)
for(k=0;k<=99;k++)
*(*(a+j)+k)=0;
int r,l,lim=99;
char c;
for(r=0;r<n;r++)
for(l=0;l<n;l++)
{
scanf("%d"... |
18 | 8515 | /*
* n2.cpp
*
* Created on: 2011-11-12
* Author: Administrator
*/
int a[100][100];
int search1(int num,int n) //??n???num?????
{
int i,min;
min=a[num][0];
for(i=1;i<n;i++)
if(a[num][i]<min) min=a[num][i];
return min;
}
int search2(int num,int n) //??n???num?????
{
int j,min;
min=a[0][num]... |
18 | 8516 |
int main()
{
int n,a[102][102]={0},sum=0;
cin>>n;
int i,j,k,cc;
for(i=0;i<n;i++)
{sum=0;
for(j=1;j<=n;j++)
{
for(k=1;k<=n;k++)
{
cin>>*(*(a+j)+k);
}
}
cc=n;
while(cc>1)
{
int min=10000;
for(j=1;j<=cc;j++)
{
for(k=1;k<=cc;k++)
{
if(min>*(*(a+j)+k)) min=*(*(a+j)+k);... |
18 | 8517 | int Min(int a[],int n)
{
int i,min;
min=a[0];
for(i=1;i<n;i++)
{
if(a[i]<min)
{
min=a[i];
}
}
return min;
}
int main()
{
int n,i,N,dd1,dd2,j,min;
int row[100][100],col[100][100],sum[100];
scanf("%d\n",&n);
N=n;
for(i=0;i<N;i++)
{
for(dd1=0;dd1<N;dd1++)
{
for(dd2=0;dd2<N;dd2++)
{
scan... |
18 | 8518 | int main()
{
int n, a[100][100], i, k, l, min, sum = 0, j;
cin >> n;
for (l = 1; l <= n; l++)
{
for (i = 0; i < n; i++)
for (j =0; j < n; j++)
cin >> a[i][j];
for (k = n;; k--)
{
for (i = 0; i < k; i++)
{
min = a[i][0];
for (j = 0; j < k; j++)
{
if (a[i][j] < min)
min = a[i... |
18 | 8519 | void jian(int a[100][100],int n)
{
int i,j,min;
for(i=0;i<n;i++)
{
min=a[i][0];
for(j=0;j<n;j++)
{
if(a[i][j]<min)
min=a[i][j];
}
if(min!=0)
{
for(j=0;j<n;j++)
a[i][j]-=min;
}
}
for(i=0;i<n;i++)
{
min=a[0][i];
for(j=0;j<n;j++)
{
if(a[j][i]<min)
min=a[j][i];
}
if(min... |
18 | 8520 | void r(int m);
void l(int m);
void fun(int m);
void Try(int i); //¶¨Òå4¸öº¯Êý
int a[100][100], n, s[100] = {0};
int main()
{
int i, j, k, sum;
cin>>n;
for(i = 0; i < n; i++)
{
sum = 0;
for(j = 0; j < n; j++... |
18 | 8521 |
int main(){
int n,t,sum,m;
int a[100][100]; //????????
int i,j,k; //????
cin>>n;
for(k=0;k<n;k++){
sum=0;
m=n;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
cin>>a[i][j]; //??n?n???
while(m>1){
for(i=0;i<m;i++){
t=a[i][0];
for(j=1;j<m;j++)
{if(a[i][j]<t)
t=a[i][j];
}
for(j=0;j<m;j++){
a[i][j]=... |
18 | 8522 | int a[200][200],sum=0;
void xj(int n)
{
int i,j;
if(n>=2)
{
for(i=1;i<n;i++)
for(j=0;j<n;j++)
a[i][j]=a[i+1][j];
for(i=1;i<n;i++)
for(j=0;j<n;j++)
a[j][i]=a[j][i+1];
}
}
void gl(int n)
{
int i,j;
if(n>=2)
{
for(i=0;i<n;i++)
{
int min=a[i][0];
for(j=1;j<n;j++)
{
if(a[i][j]<min)... |
18 | 8523 | //********************************
//*???2.cpp **
//*?????? 1200012768 **
//*???2012.11.21 **
//*???????????? **
//********************************
int sum = 0, r_small[100] = {0}, c_small[100] = {0};
int fun(int num[][100], int n);
void small1(int num[][100], int n);
void small2(int num[][100], int n);
int mai... |
18 | 8524 | int n,i,j,k,l,len=0,sum=0;
int array[100][100];
void guilinhang(int a)
{
int min=array[a][0];
for(l=0;l<len;l++)
{
if(array[a][l]<min)
min=array[a][l];
}
for(l=0;l<len;l++)
array[a][l]=array[a][l]-min;
}
void guilinlie(int a)
{
int min=array[0][a];
for(l=0;l<len;l++)
{
if(array[l][a]<min)
min=array[... |
18 | 8525 | int mat[100][100], n, sum = 0;
int rmin(int a[][100], int x)
{
int i, rsmall = a[x][0];
for(i = 0; i < n; i++)
{
if(rsmall > a[x][i])
{
rsmall = a[x][i];
}
}
return rsmall;
}
int cmin(int a[][100], int y)
{
int i, csmall = a[0][y];
for(i = 0; i < n; i++)
{
if(csmall > a[i][y])
{
csmall = a[i][y]... |
18 | 8526 | main()
{
int n,m=0,min,sum=0;
int i,j,k,q;
scanf("%d",&n);
int **a=(int **)calloc(n,sizeof(int *));
for(k=0;k<n;k++)
{
for(i=0;i<n;i++)
{
a[i]=(int *)calloc(n,sizeof(int));
for(j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
... |
18 | 8527 | /*****************************************************
/* ? ?: ?????????
/* ? ?: ????n*n????3<=n<=100?????????????
/* ??n-1???????????????????1*1????????????
/* ???????????????????????????????????????????????????
/* ??????????????????????????????????0?
/* ????????????n*n????????????
... |
18 | 8528 | /*
* 6.cpp
*
* Created on: 2011-12-31
* Author: 2011
*/
int main(){
int num,i,j,sum;
cin>>num;
int n=num,min,t=num;
while(num>0){
n=t;
int a[n][n];
sum=0;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
cin>>a[i][j];
while(n>1){
for(i=0;i<n;i++){
min=a[i][0];
for(j=0;j<n;j++)
if(a[i][j]<mi... |
18 | 8529 | /**
*@file 1000012767_1.cpp
*@author ??
*@date 2010.12.01
*@description
* ????????????????
*/
int g_a; //???? g_a ????
int g_Matrix[100][100]; //???? g_Matrix ???????
int Operation(int); //Operation ?????????
void lineDel(int); //lineDel ?????
void rowDel(int); //rowDel ?????
void Transform(int); //Tr... |
18 | 8530 |
int a[100][100]={0};//????
int n=0;
void find()
{
int i,j;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
cin>>*(*(a+i)+j);
int sum=0;
int l=0;
int m=10000;
for(l=n;l>1;l--){
for(i=0;i<l;i++){m=10000;
for(j=0;j<l;j++)
m=min(m,*(*(a+i)+j));
for(j=0;j<l;j++)
*(*(a+i)+j)=*(*(a+i)+j)-m;}
for(j=0;j<l;j++){
m=... |
18 | 8531 | int main(){
int n;
int i,j,k;
cin>>n;
for(i = 0;i<n;++i){
int sum =0;
int t[101][101] = {0};
for(j=0;j<n;++j){
for(k=0;k<n;++k){
cin>>t[j][k];
}
}
int cnt = n;
while(cnt > 1){
for(j=0;j<cnt;++j){
... |
18 | 8532 | int sum (int);
int a[100][100];
int main ()
{
int n, i, j, k;
cin >> n;
for (i = 1; i <= n; i++)
{
for (j = 0; j < n; j++)
{
for (k = 0; k < n; k++)
cin >> a[j][k];
}
cout << sum(n) << endl;
}
return 0;
}
int sum (int n)
{
int i, j, min;
for (i = 0; i < n; i++)
{
min = a[i][0];
for (j = 1; ... |
18 | 8533 | //********************************
//*???????????? **
//*?????? 1200012827 **
//*???2012.11.24 **
//********************************
int board[100][100];
void Subduction(int); //????
void Turn(int);
int n; //????
int sum;
int main()
{
int i;
cin >> n;
for (i = 0;i <= n-1;i++)
... |
18 | 8534 | int main()
{
int n,k,i,j,a[200][200],x,p,q,min,sum;
cin>>n;
for (k=1;k<=n;k++)
{
sum=0;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
{
cin>>a[i][j];
}
for (x=n;x>=2;x--)
{
for (p=1;p<=x;p++)
{
min=10000;
for (q=1;q<=x;q++)
if (min>=a[p][q]) min=a[p][q];
for (q=1;q<=x;q++)
a[p][q]=a[... |
18 | 8535 | void hang(int a[100][100],int n)
{
int i,j;
for(i=2;i<=n-1;i++)
{
for(j=1;j<=n;j++)
{
a[j][i]=a[j][i+1];
}
}
}
void lie (int a[100][100],int n)
{
int i,j;
for(i=2;i<=n-1;i++)
{
for(j=1;j<=n;j++)
{
a[i][j]=a[i+1][j];
}
}
}
void xiaohang(int a[100][100],int n)
{
int i,j;
for(i=1;i<=n;i++)
{
... |
18 | 8536 | //**********************************
//**** ?????? *****
//**** 1200016612 *****
//** ???????????? ****
//**********************************
int main() //?????
{
int n=0,i=0,j=0,k=0,s=0;
int b[100],a[100][100]; //??a[100][10... |
18 | 8537 | //============================================================================
// Name : 2.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
void putout(int... |
18 | 8538 | int main(){
int n,i,j,k,z,sum,min;
int a[105][105];
cin>>n;
for(int z=0;z<n;z++){
sum=0;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
cin>>*(*(a+i)+j);
for(k=0;k<n-1;k++){
for(i=0;i<n-k;i++){
min=100000000;
for(j=0;j<n-k;j++)
if(*(*(a+i)+j)<min) min=*(*(a+i)+j);
for(j=0;j<n-k;j++)
*(*(a+i... |
18 | 8539 | int main()
{
int array[100][100]={0};
int times,m,n,i,j,k;
cin>>times;
m=times;
while(m--)
{
n=times;
int (*p)[100]=array;
for(i=0;i<times;i++)
for(j=0;j<times;j++)
cin>>*( *(p+i)+j );
int sum=0;
for(k=1;k<=times-1;k++)
{
int min,now;
for(i=0;i<n;i++)
{
min=*( *(p+i) );
for(j=1... |
18 | 8540 |
int main()
{
int n,a[120][120]={0},i,N,j,sum,k,ii,jj,all,zhong=999;
cin>>n;
N=n;
all=N;
for(jj=1;jj<=N;jj++)
{
n=N;sum=0;
for(i=1;i<=N;i++)
for(j=1;j<=N;j++)
cin>>*(*(a+i-1)+j-1);
for(k=1;k<=N-1;k++)
{
for(ii=0;ii<=n-1;ii++)
{
zhong=999;
for(i=0;i<=n-1;i++)
{
if(*(*(a+ii)+i)<=zh... |
18 | 8541 | /*
?? - ?????????
?? //
??
????n*n????3<=n<=100???????????????n-1???????????????????1*1????????????
?????????????????????????????????????????????????????????????????????????????????????0?
????????????n*n????????????????????a[][]??????a[1][1]???????????????(n-1)*(n-1)????
??????????(n-1)*(n-1)... |
18 | 8542 | /*
* ditui7.cpp
*??????
* Created on: 2011-11-15
* Author: APPLE
*/
int main() //?????
{
int i,n,j,a[100][100],b,min,k,sum=0; //????
cin>>n;
b=n;
while(b>0)
{for(i=0;i<n;i++) //????
for(j=0;j<n... |
18 | 8543 | int main()
{ int n,i,j,k,number;
scanf("%d",&n);
number=n;
for(i=0;i<number;i++)
{ int p,q,a[100][100],minnum[100],sum=0;
for(p=0;p<number;p++)
{ for(q=0;q<number;q++)
{ scanf("%d",&a[p][q]);}
}
n=number;
while(n>1)
{
for(p=0;p<... |
18 | 8544 | int main(){
int n,a[100][100],sum=0,i,j,h,min,min1,k=0;
scanf("%d",&n);
for(h=0;h<n;h++){
sum=0;
k=0;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
while(k<n-1){
for(i=0;i<n-k;i++){
min=a[i][0];
for(j=0;j<n-k;j++){
if(a[i][j]<min)
min=a[i][j];
}
for(j=0;j<n-k;j++){
... |
18 | 8545 | /*
*???: matrix_seq.cpp
*??: ???
*????: 2012-11-19
*??: ????????????a[1][1]??
*/
int a[MAXSIZE][MAXSIZE],n;
void sub_to_zero() //????
{
int m; //????????
for (int i=0;i<n;i++){ //????
m=a[i][0];
for (int j=1;j<n;j++){ //??????
if (a[i][j]<m)
m=a[i][j];
}
if (m>0){
for (int j=0;j<n;j++) //??... |
18 | 8546 | int cal(int a[100][101],int n)
{
int i,j,k,min,t=0,p,b[100][101]={0};
for(i=0;i<n;i++)
{
min=a[i][0];
for(j=0;j<n;j++)
{
if(a[i][j]<min)
min=a[i][j];
}
for(j=0;j<n;j++)
{
a[i][j]-=min;
}
}
for(i=0;i<n;i++)
{
p=1;
min=a[0][i];
for(j=0;j<n;j++)
{
if(a[j][i]<min)
min=a[j][i];
... |
18 | 8547 | int main()
{int a[100][100][100]={0};
int min[100][100]={0};
int n,i,j,k,l,s,sum[100]={0};
cin>>n;
for(i=0;i<n;i++)
{for(j=0;j<n;j++)
{for(k=0;k<n;k++)
cin>>a[i][j][k];}}
for(i=0;i<n;i++)
{for(s=n;s>1;s--)
{for(j=0;j<s;j++)
{min[i][j]=a[i][j][0];
for(l=0;l<s;l++)
... |
18 | 8548 | //#define main xmain
int main()
{
int a[100][100];
int i, j, k, m, n;
int min, sum;
scanf("%d", &m);
for (k=0; k<m; k++) {
/* ??? */
n = m;
sum = 0;
/* ??n*n?? */
for (i=0; i<n; i++) {
for (j=0; j<n; j++) {
scanf("%d", &a[i][j]);... |
18 | 8549 | /*
* file homework 10_1
* author ??
* date 2010-12-03
* description
?????????????????a[1][1]??
*/
int Matrix(int a[][100], int sum, int n);
int main()
{
int a[100][100];
int n, i, j, k, sum = 0;
cin >> n;
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
for (k = 0; k < n; k++)
c... |
18 | 8550 | int n,a[100][100];
void hang(int m)
{
int min=10000;
for(int i=0;i<n;i++)
{
if(a[m][i]<min) min=a[m][i];
}
for(int i=0;i<n;i++) a[m][i]-=min;
}
void lie(int m)
{
int min=10000;
for(int i=0;i<n;i++)
{
if(a[i][m]<min) min=a[i][m];
}
for(int... |
18 | 8551 | int n,m,min1;
int a[110][110];
void del()
{
int i,j;
for(i=0;i<m;i++)
for(j=1;j<m;j++)
a[i][j]=a[i][j+1];
for(i=0;i<m;i++)
for(j=1;j<m;j++)
a[j][i]=a[j+1][i];
}
void delmin(int x,int y,int dx,int dy)
{
if(x==m||y==m)
return;
if(a[x][y]<min1)
min1=a[x][y];
delmin(x+dx,y+dy,dx,dy);
a[x][y]-=min1;
}
i... |
18 | 8552 | int main()
{
int n=0,i=0,j=0,time=0,sum=0;
cin>>n;
int s=n;
int a[100][100],b[100],c[100];
for(time=0;time<s;time++) //while??????????????? .time??????????????????+1
{
for(i=0;i<100;i++)
{
b[i]=1000000;
c[i]=10... |
18 | 8553 |
int main()
{
int num;
cin >> num;
int n = num, numcas = num;
int a[301][301];
while (num--)
{
int s = 0;
memset(a, 0, sizeof(a));
for (int i = 0; i < numcas; i++)
for (int j = 0; j < numcas; j++)
{
cin >> a[i][j];
}
n = numcas;
while (1)
{
if (n == 0) {cout << s << endl; break;} ... |
18 | 8554 |
int main()
{
int n;
scanf("%d",&n);
int sz[49][49][49];
int i,j,k;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
for(k=1;k<=n;k++)
{
scanf("%d",&sz[i][j][k]);
}
}
}
int nn,min;
int re[49]={0};
for(i=1;i<=n;i++) //???
{
for(nn=1;nn<=n-1;nn++) ... |
18 | 8555 | int main()
{
int n, a[100][100] = {0}, i = 0, j = 0, min = 1000;
int flag = 0, sum = 0, k = 0,l = 0;
cin >> n;
for (l = 0; l < n; l++)
{
for (i = 0; i < n * n; i++)
cin >> a[i / n][i % n];
for (k = 0; k < n - 1 ; k++)
{
for (i = 0; i < n - flag; i++)
{
min = 1000;
for (j = 0; j < n - flag; j... |
18 | 8556 | /*
* 6.cpp
*
* Created on: 2011-12-31
* Author: 2011
*/
int main()
{
int n,m;
cin>>n;
m=n;
while(m>0)
{
m=m-1;
int a[n][n],b[n-1],s=0;
int (*p)[n]=NULL,*q=NULL;
p=a;
q=b;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
cin>>*(*(p+i)+j);
int imin,... |
18 | 8557 | int main()
{
int n,i,j,k,a[100][100],p,min,sum=0;
cin>>n;
for(p=1;p<=n;p++)
{
for(i=0;i<=n-1;i++)
{
for(j=0;j<=n-1;j++)
{
cin>>a[i][j];
}
}
for(k=1;k<=n-1;k++)
{
for(i=0;i<=n-1;i++)
{
min=a[i][0];
for(j=k;j<=n-1;j++)
{
if(a[i][j]<min)
{min=a[i][j];}
}
fo... |
18 | 8558 | int main()
{
int n,i,j,k,min,max,sum,m;
int a[110][110]={0};
cin>>n;
for(i=0;i<n;i++)
{
m=n;
sum=0;
for(j=0;j<n;j++)
for(k=0;k<n;k++)
cin>>*(*(a+j)+k);
for(m=n;m>1;m--)
{
for(j=0;j<m;j++)
{
for(k=0;k<m;k++)
{
if(!k)
{
min=*(*(a+j)+k);
}
else if(min>*(*(a+j)+... |
18 | 8559 | /*
* ???? ?????????
*
* ??: 2011-11-6
* ??????
*/
int main (){
int a[100][100],n,m,i,j,x,y;
cin>>n;
for(m=1;m<=n;m++){
int s=0,t=0;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
cin>>a[i][j];
for(y=n;y>=2;y--){
for(i=0;i<n-t;i++){
x=a[i][0];
for(j=0;j<n-t;j++)
if(x>a[i][j])x=a[i][j];
for(j=0;... |
18 | 8560 | void Delete(int a[][101], int, int); //??Delete????????????
int check_min(int a[], int); //??check_min?????????????
int sum[101], a[101][101]; //??????sum[101]???????????????, a[101][101]??????????????????
int main()
{
int n, p;
int i, j, l, m, k;
memset(a, 0, sizeof(... |
18 | 8561 | //============================================================================
// Name : 8.2.cpp
// Author : Zhang Yu
// Version :
// Copyright : Your copyright notice
// Description : ?????????
//============================================================================
int matrix[101][101][101];
... |
18 | 8562 | int main()
{
int n;
cin>>n;
int a[n][n][n],b[n],min1[n],min2[n],c[n][n-1],sum[n];
int i,j,k,l,p; //k????????,i????,j????,l??????
for(i=0;i<n;i++)
sum[i]=0;
for(k=0;k<n;k++)
{
for(i=0;i<n;i++) //????n*n??
{
for(j=0;j<n;j++)
{
... |
18 | 8563 | int main()
{
int n;
int i,j,k;
int q;
int a[110][110];
int (*p)[110]=a;
cin>>n;
q=n;
for(k=1;k<=q;k++)
{
int sum=0;
n=q;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
cin>>*(*(p+i)+j);
while(1)
{
if(n==1)break;
int min=0;
for(i=1;i<=n;i++)
{
min=9999999;
for(j=1;j<=n;j++)
if(min>*(*(p... |
18 | 8564 | int sub(int num[200][200],int n);//?????
int main()
{
int i,j,k,n,num[200][200]={0};
cin>>n;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
for(k=0;k<n;k++)
cin>>num[j][k];//????
cout<<sub(num,n)<<endl;
}
return 0;
}
int sub(int num[200][200],int n)
{
int sum=0,j,i,min=1000;
for(j=0;j<n;j++)//??????
{
min=10... |
18 | 8565 | /*
* final6.cpp
*
* Created on: 2013-1-12
* Author: wangyinzhi
*/
int main(){
int n,m;
cin>>n;
m=n;
int sum=0;
for (int i = 0; i < m; i++) {
n=m;
int a[100][100];
sum=0;
for (int j = 0; j < n; j++) {
for(int k=0;k<n;k++){
cin>>a[j][k];
}
}
while(n>1){
for (int j = 0; j < n; j+... |
18 | 8566 | int main()
{
int n, i, j, k,a[102][102],min=100000,sum=0, t;
cin>>n;
for(k=1;k<=n;k++)
{
sum=0;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
cin>>a[i][j];
}
}
for(t = 0;t <= n-2; t++)
{
for(i=1;i<=n-t ;i++)
{
min = 100000;
for(j=1;j<=n-t;j++)
{
min = min < a[i... |
18 | 8567 | int a[100][100] = {0}, sum = 0;
void guiling(int n)
{
int i, j, min;
for (i = 0; i < n; i++)
{
min = a[i][0];
for (j = 0; j < n; j++)
{
if (a[i][j] < min)
min = a[i][j];
}
for (j = 0; j < n; j++)
a[i][j] -= min;
}
for (j = 0; j < n; j++)
{
min = a[0][j];
for (i = 0; i < n; i++)
{
if (... |
18 | 8568 |
int array[100][100];
int (*p)[100]=array;
int sum;
int n;
int times;
void zero()
{
int xmin=10000,ymin=10000;
for(int i=0;i<=n-1-times;i++)
{
for(int j=0;j<=n-1-times;j++)
if(*(*(p+i)+j)<xmin)
{
xmin=*(*(p+i)+j);
}
for(int j=0;j<=n-1-times;j++)
... |
18 | 8569 | int n, a[101][101], s;
void cal()
{
int i, j, k, l, m;
for (j = 0; j < n; ++ j)
for (k = 0; k < n; ++ k)
cin >> a[j][k];
s = 0;
for (j = 0; j < n; ++ j)
{
for (k = j; k < n; ++ k)//?????????????????
{
for (m = l = j; l < n; ++ l)
if (a[... |
18 | 8570 | int main()
{
int p,n,j,k,min,sum;
cin >> p;
int a[100][100];
n = p;
for(int i = 0; i < p; i++)
{
sum = 0;
for(j = 0;j < n;j++)
for (k = 0;k < n;k++)
cin >> a[j][k];
do
{
for(j = 0; j < n; j++)
{
min = a[j][0];
for (k = 1; k < n; k++)
{
if (min > a[j][k])
min = a[... |
18 | 8571 |
int findmin(int *a, int n, int step)
{
int min = 32767;
while(n>0)
{
if(min>*a) min=*a;
a+=step;
n--;
}
return min;
}
void main()
{
int n,k,a[100][100],i,j,l, sum,t;
scanf("%d",&n);
for(k=0;k<n;k++)
{
for(i=0;i<n;i++)
for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
sum=0;
for(i=n;i>=2;i--)
{
f... |
18 | 8572 |
void main()
{
int n;
int i,j,a[100][100];
int min,k;
scanf("%d",&n);
int tn,sum;
for(k=0;k<n;k++)
{
for(i=0;i<n;i++)
{ for(j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
}
}
sum=0;tn=n;
while(tn>1)
{
//guiling
for(i=0;i<tn;i++)
{ min=a[i][0];
for(j=0;j<tn;j++)
{
if(min>a[i][j])... |
18 | 8573 |
int f(int a[100][100],int n)
{
static int s=0;
int i,j;
double m1,m2;
int *p;
if(n==1)
{printf("%d\n",s);s=0;}
if(n>1)
{
for(i=0;i<n;i++)
{p=a[i];
m1=100000;
for(j=0;j<n;j++)
if(p[j]<=m1) m1=p[j];
for(j=0;j<n;j++)
p[j]=p[j]-m1;}
for(j=0;j<n... |
18 | 8574 | //********************************
//*???????????? **
//*?????? 1200012988 **
//*???2012.11.19 **
//********************************
int a[100][100]; //??a?????
int smaller(int a, int b)
{
if(a >= b)
return b;
else
return a;
}
int Sum(int n)
{
for (int i = 0; i <... |
18 | 8575 | /*
* 5.cpp
*
* Created on: 2013-12-13
* Author: g199
*/
int main()
{
int a[100][100];
int n,i,j,k,s1;
cin>>n;
for(i=0;i<n;i++)
{
int s=0;
for(j=0;j<n;j++)
for(k=0;k<n;k++)
cin>>a[j][k];
s1=n;
while(s1>1)
{
for(j=0;j<n;j++)
{
int min=a[j][0];
for(k=1;k<n;k++)
if... |
18 | 8576 | //
// main.cpp
// juzhen
//
// Created by blues cookie on 12-11-21.
// Copyright (c) 2012? blues cookie. All rights reserved.
//
int a[100][100];
int result=0;
int min1;
int minh(int n,int j)//???J?n?????????
{
int i,min_a;
min_a=a[j][0];
for(i=0;i<n;i++)
{
if(min_a>a[j][i])
{
... |
18 | 8577 | int main()
{
int nq,times,i,j,min,m;
cin>>nq;
const int n=nq;
int sum[n];
int a[n][n][n];
for(times=0;times<n;times++)
for(i=0;i<n;i++)
for(j=0;j<n;j++)
cin>>a[times][i][j];//??n?????
for(times=0;times<n;times++)
{sum[times]=0;
for(m=n;m>1;m--)
{
for(i=0;i<m;i++)
{
min=a[times][i][0];
... |
18 | 8578 | //**************************
//*??????????? **
//*?????? **
//*???2012-11-25 **
//*???1200012957 **
//**************************
int a[100][100];
int sum(int n)
{
if (n == 1)
{
return 0;
}
int i, j, p, min, a11;
for (i = 0; i < n; i++ )
{
p = 0;
for (j = 0; j < n; j++ )
{
if (a[i][j] < a[i][p])
{
... |
18 | 8579 | int a[100][100];
int f(int n,int a[][100])//???????a[1][1]?????
{
int i,j,k;
for(i=0;i<n;i++)//???
{
int min=a[i][0];
for(j=1;j<n;j++)
if(a[i][j]<min)min=a[i][j];
if(min>0)
for(j=0;j<n;j++)
... |
18 | 8580 |
int main()
{
int n,i,j,y,m1,m2,p;
int a[103][103],s=0;
cin >> n;
for(y=1;y<=n;y++)
{
p=n;
s=0;m1=999999;m2=999999;
for(i=1;i<=p;i++)
for(j=1;j<=p;j++)
cin >> a[i][j];
while(p>1)
{
//for(i=1;i<=p;i++)for(j=1;j<=p;j++)cout << a[i][j];
for(i=1;i<=p;i++)
{
m1=a[i][1];
for(j=1;j<=... |
18 | 8581 |
int main()
{
int a[102][102] , i , k , j , l , n , s , (*p)[102] , (*q)[102] , min ;
cin >> n ;
for (k = 1 ; k <= n ; k ++ )
{
for (i = 0 , s = 0 , p = &a[0] ; i < n ; i ++ )
for (j = 0 ; j < n ; j ++ )
cin >> *(*(p + i) + j) ;
for (i = 0 , p = &a[0] , q = &a[n] ; i < n ;... |
18 | 8582 | /*
* ???2.cpp
* Created on: 2012-11-13
* Author: ???
* ??:?????????
*/
int a[100][100]; //??????
int sum; //??????
int f(int n) //????
{
if(n==1) return 0; //?n?1???0
int i,j,min=0,sum=0; //????
for(i=0;i<n;i++) //?????
{
min=a[i][0]; //?????????
for(j... |
18 | 8583 | int minrow(int a[100][100],int i,int m)
{
int b=a[i][0],j;
for(j=0;j<m;j++)
{
if(a[i][j]<b)
b=a[i][j];
}
return b;
}
int mincolumn(int a[100][100],int j,int m)
{
int b=a[0][j],i;
for(i=0;i<m;i++)
{
if(a[i][j]<b)
b=a[i][j];
}
return b;
}
void row(int a[100][100],int m)
{
int i,j,b;
for(i=0;i<m;i++)... |
18 | 8584 | int main()
{
int a[100][100];
int i,j,k,n,sum,min=0,m;
cin>>n;
for(m=0;m<n;m++)
{
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
cin>>a[i][j];
}
}
sum=0;
for(k=0;k<n-1;k++)
{
for(i=0;i<n-k;i++)
{
min=a[i][0];
for(j=0;j<n-k;j++)
{
if(a[i][j]<min)
min=a[i][j];
}
f... |
18 | 8585 | //1000012915???
int GL(int,int [][101]); //????a[1][1]???
void Delete(int,int [][101]); //???????????
int min(int,int); //??????
int main()
{
int Sum[101],n,a[101][101],i,j,k; //????????Sum
cin>>n; //??n
for(i=0;i<n;i++)
{
for(j=0;j<n;j++) ... |
18 | 8586 |
int a[200][200][200];
int main()
{
int n,sum[200];
int p,k,i,j;
int min;
cin>>n;
for (p=0;p<n;p++)
{
sum[p]=0;
for (i=0;i<n;i++)
for (j=0;j<n;j++)
cin>>a[p][i][j];
for (k=0;k<n-1;k++)
{
for (i=0;i<n-k;i++)
{
min=a[p][i][0];
for (j=0;j<n-k;j++)
if (min>a[p][i][j]) min=a[p][i... |
18 | 8587 |
int main()
{
int n;
cin >> n;
int matrix[100][100] = {0};
int time, min, sum = 0, k;
for (k = 1; k <= n; k++)
{
int i, j;
for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
cin >> *(*(matrix + i) + j);
sum = 0;
for (time = 1; time < n; time++)
{
for (i = 0; i <= n - time; i++)
{
min = *(... |
18 | 8588 |
int main() {
int n, k, i, j, sum, min,anw=0;
int test[100][100];
cin >> n;
sum = n;
for (k = 0; k < sum; k++) {
n=sum;
for (i = 0; i < sum; i++)
for (j = 0; j < sum; j++) {
cin >> test[i][j];
}
anw=0;
while (n != 1) {
for (i = 0; i < n; i++) {//?????
min = test[i][0];
for (j = 0; j < ... |
18 | 8589 |
int main()
{
int nn,n; cin>>nn; //nn??????n
int a[101][101];
for (int k=0;k<nn;k++)
{
int ans=0;
for (int i=0;i<nn;i++)
for (int j=0;j<nn;j++)
cin>>a[i][j];
for (int n=nn;n>1;n--)
{
int minh[101],minl[101];
fo... |
18 | 8590 |
int n, m, the_min;
int a[110][110];
void reduce_min(int x, int y, int dx, int dy)
{
if (x == m || y == m) {
return;
}
if (a[x][y] < the_min) {
the_min = a[x][y];
}
reduce_min(x + dx, y + dy, dx, dy);
a[x][y] -= the_min;
}
void reduce()
{
int i, j;
for (i = 0; i < m; i+... |
18 | 8591 |
int main()
{
int n;
cin >> n;
for( int c = 0 ; c < n ; c ++ )
{
int mat[n][n];
for( int i = 0 ; i < n ; i ++ )
for( int j = 0 ; j < n ; j ++ )
cin >> mat[i][j];
int s = 0;
for( int r = n ; r > 1 ; r -- )
{
int m;
//row
for( int i = 0 ; i < r ; i ++ )
{
m = mat[i][0];
for( int j ... |
18 | 8592 | //?????????
int a[100][100],b[100],c[100];
int xiao(int n)
{
int x;
for (int i = 0; i < n;i++)
{
int min = INT_MAX;
for (int j = 0; j < n; j++)
{
if (a[b[i]][c[j]] < min)
min = a[b[i]][b[j]];
}
for (int j = 0; j < n; j++)
{
a[b[i]][c[j]] -= min;
}
}
for (int i = 0; i < n;i++)
{
int min =... |
18 | 8593 |
void Sort(int a[][100],int n)
{
int i, j;
for (i = 0;i < n ;i++)
{
for (j = 1;j < n - 1;j++)
{
a[i][j] = a[i][j + 1];
}
}
for (i = 0;i < n;i++)
{
for (j = 1;j < n - 1;j++)
{
a[j][i] = a[j + 1][i];
}
}
}
void Change(int a[][100],int n)
{
int i, j, l[100] = {0}, r[100] = {0};
for (i = 0;i... |
18 | 8594 | /*
*????.cpp
*??
*2011?11?15?
*?????a[1][1]????
*/
int main()
{
int n,i,j,m,sum=0;
cin>>n;
for (int k=1;k<=n;k++)
{
sum=0;
int a[n+1][n+1];
for (i=0;i<n;i++)
for (j=0;j<n;j++)
cin>>a[i][j];
a[n][n]=a[0][... |
18 | 8595 |
int main(){
int n,t,i,j,k,iTemp; //???????n??n?n????tijk???????iTemp???????????????
cin>>n; //??n
int a[n][n][n],iSum[n]; //??n?n???????????????????
memset(iSum,0,sizeof(iSum));
for (i=0;i<=n-1;i++){ //?i???
for (j=0;j<=n-1;j++){ //?j?
for (k=0;k<=n-1;k++){ //?k?
cin>>a[i][j][k]; //??????
}
}
}
fo... |
18 | 8596 | //------------------------
// ?????????
// 2010/12/5
// ADE
//------------------------
int GuiLing(int a[][101],int n,int sum)
{
int min,i,j;
for(i=0;i<n;i++)
{
min=a[i][0];
for(j=0;j<n;j++)
min=(min<a[i][j])?min:a[i][j];
for(j=0;j<n;j++)
a[i][j]-=min;
} //???
for(j=0;j<n;j++)
{
mi... |
18 | 8597 | int main()
{
int n,i,j,k,len,sum; //len : the length of matrix
int m[100][100];
void cutr0(int m[100][100],int len);
void cutc0(int m[100][100],int len);
void del(int m[100][100],int n);//delete row[1] and column[1];return n-1;
cin >> n;
for (k=1;k<=n;k++)
{
sum=0;
len=n;
for (i=0;i<n;i++)
for (j=0;j<n... |
18 | 8598 | int min2;
int min1;
void diguihang(int i,int n,int a[300][300])//to work out the min of every line
{ if(i==-1)return;
min1=a[i][0];//min1 = INT_MAX;
for(int j=0;j<n;j++)
{
if(a[i][j]<min1)min1=a[i][j];
}
for(int v=0;v<n;v++)
{
a[i][v]=a[i][v]-min1;
}
diguihang(i-1,n,a);//a???????
}
void diguili... |
18 | 8599 | /*
* ?????????.cpp
*
* Created on: 2011-12-31
* Author: ???
*/
int main() {
int n,i,j,a[10000],*p,k=0;
p=a;
cin>>n;
while(k<n){
int total=0,m=n;
k++;
for(i=0;i<n;i++)
for(j=0;j<n;j++){
cin>>*(p+i*n+j);
}
while(m>1){
int min=100000;
for(i=0;i<m;i++){
for(j=0;j<m;j++){
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.