https://www.adonaimedrado.pro.br/wiki/index.php?action=history&feed=atom&title=Solu%C3%A7%C3%A3o%3A_Problema_das_seq%C3%BC%C3%AAncias_alternadas_%28Eduardo_Ramos%29
Solução: Problema das seqüências alternadas (Eduardo Ramos) - Revision history
2026-05-27T06:54:11Z
Revision history for this page on the wiki
MediaWiki 1.26.2
https://www.adonaimedrado.pro.br/wiki/index.php?title=Solu%C3%A7%C3%A3o:_Problema_das_seq%C3%BC%C3%AAncias_alternadas_(Eduardo_Ramos)&diff=3045&oldid=prev
200.17.147.2: New page: <code lang="c"> #include <stdio.h> #include <stdlib.h> int comparar(const void *a, const void *b) { return *(int *)a-*(int *)b; } int compararInverso(const void *a, const void *b) { ...
2009-06-05T17:46:17Z
<p>New page: <code lang="c"> #include <stdio.h> #include <stdlib.h> int comparar(const void *a, const void *b) { return *(int *)a-*(int *)b; } int compararInverso(const void *a, const void *b) { ...</p>
<p><b>New page</b></p><div><code lang="c"><br />
<br />
#include <stdio.h><br />
#include <stdlib.h><br />
<br />
int comparar(const void *a, const void *b)<br />
{<br />
return *(int *)a-*(int *)b;<br />
}<br />
<br />
int compararInverso(const void *a, const void *b)<br />
{<br />
return *(int *)b-*(int *)a;<br />
}<br />
<br />
int main(void) {<br />
<br />
int n,seq;<br />
scanf("%d",&n);<br />
<br />
while (n-- > 0) {<br />
scanf("%d",&seq);<br />
int i, v[seq];<br />
for(i=0;i<seq;i++)<br />
scanf("%d",v+i);<br />
<br />
if (n % 2 != 0) <br />
qsort(v,seq,sizeof(int),comparar);<br />
else<br />
qsort(v,seq,sizeof(int),compararInverso);<br />
<br />
for(i=0;i<seq;i++)<br />
printf("%d ",*(v+i));<br />
printf("\n");<br />
}<br />
<br />
return 0;<br />
}<br />
<br />
<br />
</code></div>
200.17.147.2