#include #include #include 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