Pagini recente » Cod sursa (job #666582) | Cod sursa (job #2609851) | Cod sursa (job #1523609) | Cod sursa (job #1829657) | Cod sursa (job #356703)
Cod sursa(job #356703)
#include <stdio.h>
#define Nmax 520
long long a[Nmax][Nmax], b[Nmax][Nmax], v[15];
int n, i, j, l, k, L1, L2, C1, C2, p, u, m, aux;
void binara(int q, int indice){
}
void preprocesare(){
for (i = 1 ; i <= n ; i++)
for (j = 1 ; j <= n ; j++)
b[i][j] = a[i][j] + b[i-1][j] + b[i][j-1] - b[i-1][j-1];
}
void impartire(){
for (i = 1 ; i <= n ; i++){
L1=i;
for (j = 1 ; j <= 9 ; j++){
binara(v[j],1);
for (l = 1 ; l <= 9 ; l++){
binara(v[l],2);
for (k = 1 ; k <= n ; k++){
binara(v[k],3);
}
}
}
}
}
int main(){
FILE * f = fopen("zone.in","r");
FILE * g = fopen("zone.out","w");
fscanf (f, "%d" , &n);
for (i = 1 ; i <= n ; i++)
fscanf(f , "%d" , &v[i]);
for (i = 1 ; i < n ; i++)
for ( j = i + 1 ; j <= n ; j++)
if ( v[i] > v[j] ){
aux = v[i];
v[i] = v[j];
v[j] = aux;
}
preprocesare();
impartire();
fprintf(g , "%d %d %d %d" , L1, L2, C1, C2);
fclose(f);
fclose(g);
return 0;
}