Soluciones y Explicación de los problemas ACM ... - ICPC Bolivia

More documents

Recommendations

Info

Explicaciones a los problemas South American Regionals 2008 68 Programa Java que soluciona el problema import java.util.*; class polygons { public static void main(String[] args) { Scanner in = new Scanner(System.in); int N, i, totPer, verLen, j, arcLen, k; int[] X; boolean[] per;//imeter size boolean isPos = true;//ible while(true) { N = in.nextInt(); if(N == 0) break; X = new int[N]; totPer = 0; for(i = 0; i < N; i++) { X[i] = in.nextInt(); totPer = totPer + X[i]; } per = new boolean[totPer]; Arrays.fill(per, false); verLen = 0; for(i = 0; i < N; i++) { per[verLen] = true; verLen = verLen + X[i]; } FOR: for(i = N; i >= 3; i--) { if((totPer % i) == 0) { arcLen = totPer / i; for(j = 0; j < arcLen; j++) { isPos = true; k = j; while(k < totPer) { if(per[k] == false) isPos = false; k = k + arcLen; } if(isPos == true) break FOR; } } isPos = false; }// if(isPos == true) System.out.println(N - i); else System.out.println("-1"); } } }
Explicaciones a los problemas South American Regionals 2008 69 Programa C que soluciona el problema #include #define MAXVERTICES 100000 #define TRUE 1 #define FALSE 0 int distancia[MAXVERTICES+1]; int lado,circunferencia; int n; int check(int k) { int i,j,jj,in,next,numlados,distanciaActual; } lado=circunferencia/k; in=distanciaActual=0; distanciaActual=distancia[in]; while (distanciaActual
Page 1 and 2:
International Collegiate acm Progra
Page 3 and 4:
Explicaciones a los problemas South
Page 5 and 6:
Page 7 and 8:
Page 9 and 10:
Page 11 and 12:
Page 13 and 14:
Page 15 and 16:
Page 17 and 18:
Page 19 and 20: Explicaciones a los problemas South
Page 69: Explicaciones a los problemas South
show all

Soluciones y Explicación de los problemas ACM ... - ICPC Bolivia

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?