1 solutions
-
0
C++ :
#include <bits/stdc++.h> using namespace std; string n; int turn; int main() { cin>>turn; for(int a=1;a<=turn;a++) { bool flag=1; cin>>n; int x=n.length(); int p[15],maxx=-999; for(int i=0;i<x;i++) { if(n[i]>='0' and n[i]<='9') p[i]=n[i]-'0'; else { cout<<"0 0 0 1"<<endl; flag=0; break; } maxx=max(maxx,p[i]); } if(!flag) continue; if(maxx>=8) cout<<"0 0 1 1"; else if(maxx>=2) cout<<"0 1 1 1"; else cout<<"1 1 1 1"; cout<<endl; } return 0; }
- 1
Information
- ID
- 9157
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By