UVA Solution 161 - Traffic Lights - Solution in C++ | Volume 1

UVA Solution 161 - Traffic Lights - Solution in C++ | Volume 1

Problem Name: Traffic Lights
Problem Number : UVA - 161
Online Judge : UVA Online Judge Solution
Volume: 1
Solution Language : C plus plus

UVA Solution 161 Code in CPP:

#include <iostream>
#include <cstdio>
#include <sstream>
using namespace std;
int main() {
    while(1) {
        int A[105], n = 0, time[105] = {};
        while(scanf("%d", &A[n]) == 1) {
            if(A[n] == 0)
                break;
            n++;
        }
        if(A[0] == 0)
            break;
        int s = 0xffffff, i;
        for(i = 0; i < n; i++) {
            if(A[i] < s)
                s = A[i];
        }
        for(; s <= 18000; s++) {
            int yes = 1;
            for(i = 0; i < n; i++) {
                while(time[i]+A[i]-5 <= s) {
                    time[i] += 2*A[i];
                }
                if(!(time[i] <= s && s < time[i]+A[i]-5)) {
                    s = time[i]-1;
                    yes = 0;
                    break;
                }
            }
            if(yes)
                break;
        }
        if(s > 18000)
            puts("Signals fail to synchronise in 5 hours");
        else
            printf("%02d:%02d:%02d\n", s/3600, s%3600/60, s%60);
    }
    return 0;
}