70 lines
1.3 KiB
C
70 lines
1.3 KiB
C
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <time.h>
|
|
|
|
int n;
|
|
int maxnomb = 10;
|
|
int m = 10;
|
|
int res;
|
|
int i = 0, j = 0;
|
|
int r = 0;
|
|
int form;
|
|
int num = 0;
|
|
|
|
int racineCarree(int n) {
|
|
for(i = 1 ; i <= maxnomb ; i++){
|
|
r = i*i;
|
|
if(r == n){
|
|
return i;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
void trispecial(int n[m]) {
|
|
int tabr[m];
|
|
int pair;
|
|
for(i = 0 ; i < m ; i++){
|
|
tabr[j] = racineCarree(n[j]);
|
|
if(tabr[j] == -1){
|
|
pair++;
|
|
}
|
|
}
|
|
for(i = 0 ; i < m ; i++){
|
|
if(i%2 != 0){
|
|
for(j = 0 ; j < m ; j++){
|
|
if(pair%2 == 0){
|
|
for(int t = 0 ; t<m ; t++){
|
|
num = num + n[t];
|
|
}
|
|
num = num*n[j];
|
|
}else{
|
|
for(int t = 0 ; t<m ; t++){
|
|
num = num + tabr[t];
|
|
}
|
|
num = num*n[j];
|
|
}
|
|
}
|
|
n[i] = num;
|
|
}
|
|
}
|
|
}
|
|
|
|
int main(int argc, char** argv) {
|
|
int tab[m];
|
|
tab[0] = 3;
|
|
tab[1] = 5;
|
|
tab[2] = 25;
|
|
tab[3] = 16;
|
|
for(i = 0; i < m; i++){
|
|
printf("%d\n",tab[i]);
|
|
}
|
|
trispecial(tab);
|
|
printf("[");
|
|
for (i = 0 ; i < m ; i++){
|
|
printf("%d", tab[i]);
|
|
printf(",");
|
|
}
|
|
printf("]\n");
|
|
return EXIT_SUCCESS;
|
|
} |