-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBinaryClock.cpp
More file actions
73 lines (70 loc) · 1.3 KB
/
BinaryClock.cpp
File metadata and controls
73 lines (70 loc) · 1.3 KB
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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
/*
* ICPC NY 2008C
* Created by Ziyi Tang
* Basic Binary
*/
//#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <list>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <bitset>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
typedef vector<pi> vpi;
typedef vector<vpi> vvpi;
const int INF = (int)1E9;
const long INFL = (long)1E18;
const int dir[4][2] = {{-1,0},{0,1},{1,0},{0,-1}};
#define REP(i,s,t) for(int i=(s);i<(t);i++)
#define FILL(x,v) memset(x,v,sizeof(x))
#define MAXN 1000
int main(){
int n;
cin >> n;
getchar();
REP(t,1,n+1){
string line;
getline(cin,line);
int h,m,s;
vi all;
h = stoi(line.substr(0,2));
m = stoi(line.substr(3,2));
s = stoi(line.substr(6,2));
all.push_back(h);
all.push_back(m);
all.push_back(s);
string hor, ver;
for(int i = 5; i >= 0; i--){
REP(j,0,3){
if(all[j] & (1 << i))
ver+='1';
else
ver+='0';
}
}
REP(j,0,3){
for(int i = 5; i >= 0; i--){
if(all[j] & (1 << i))
hor+='1';
else
hor+='0';
}
}
printf("%d %s %s\n",t,ver.c_str(),hor.c_str());
}
return 0;
}