1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
# include<iostream>
# include<cstdio>
# include<cstring>
# include<algorithm>
using namespace std;
int a[4];
int t[4];
int vis[4];
int main()
{
    while(~scanf("%d%d%d%d",a,a+1,a+2,a+3))
    {
        bool flag=false;
        sort(a,a+4);
        memset(vis,0,sizeof(vis));
        for(int i=0;i<4;++i){
            if(a[i]>2)
                break;
            vis[i]=1;
            for(int j=0;j<4;++j) if(!vis[j]){
                if(a[i]*10+a[j]>23)
                    break;
                vis[j]=1;
                for(int k=0;k<4;++k) if(!vis[k]){
                    if(a[k]>5)
                        break;
                    vis[k]=1;
                    for(int l=0;l<4;++l) if(!vis[l]){
                        if(a[k]*10+a[l]>59)
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX