Pagini recente »
Clasament simulare_oji_clasa_a_7-a
|
Cod sursă (job #95466)
|
Istoria paginii runda/s15_9c_tema
|
Istoria paginii runda/nu_este_greu
|
Cod sursă (job #386461)
Cod sursă (job
#386461)
#include <stdio.h>
#include <stdlib.h>
int v[10000];
int main() {
FILE *fin, *fout;
int n, i, ok, r, t, ok2;
fin = fopen ( "ruleta1.in", "r" );
fscanf ( fin, "%d", &n );
for ( i = 0; i < n; i ++ )
fscanf ( fin, "%d", &v[i] );
fclose ( fin );
ok = 0;
r = 0;
while ( ok == 0 ) {
ok2 = 0;
for ( i = 0; i < n - 1; i ++ ) {
if ( v[i] != 0 && v[i+1] != 0 && v[i] <= v[i+1] ) {
v[i+1] = v[i+1] - v[i];
ok2 = 1;
}
}
if ( v[n-1] != 0 && v[0] != 0 && v[n-1] <= v[0] ) {
v[0] = v[0] - v[n-1];
ok2 = 1;
}
if ( ok2 == 0 )
ok = 1;
r ++;
}
t = 0;
for ( i = 0; i < n; i ++ ) {
if ( v[i] != 0 )
t ++;
}
fout = fopen ( "ruleta1.out", "w" );
fprintf ( fout, "%d %d", r, t );
fclose ( fout );
return 0;
}