Submission #7074769
Source Code Expand
#include <bits/stdc++.h>
#define range(i, l, r) for(int (i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (int (i) = (r) - 1; (i) >= l; (i)--)
using namespace std;
template <typename T>
using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
template <typename S, typename T>
ostream& operator <<(ostream& os, pair<S, T> p) {
os << "(";
os << p.first << ", " << p.second;
return os << ")";
}
template <typename T>
ostream& operator <<(ostream& os, vec<T> v) {
os << "[";
if (v.size() == 0) return os << "]";
for (int i = 0; i < v.size() - 1; i++) {
os << v.at(i) << ", ";
}
return os << v.at(v.size() - 1) << "]";
}
template <typename T>
ostream& operator <<(ostream& os, set<T>& s) {
os << "{";
if (s.begin() == s.end()) return os << "}";
auto it_first_item = s.begin();
cout << *it_first_item;
for (auto it = ++it_first_item; it != s.end(); it++) {
cout << ", " << *it;
}
return cout << "}";
}
template <typename T>
ostream& operator <<(ostream& os, unordered_set<T>& s) {
os << "{";
if (s.begin() == s.end()) return os << "}";
auto it_first_item = s.begin();
cout << *it_first_item;
for (auto it = ++it_first_item; it != s.end(); it++) {
cout << ", " << *it;
}
return cout << "}";
}
template <typename K, typename V>
ostream& operator <<(ostream& os, map<K, V> m) {
os << "{";
if (m.begin() == m.end()) return os << "}";
auto it_first_item = m.begin();
cout << it_first_item->first << ": " << it_first_item->second;
for (auto it = ++it_first_item; it != m.end(); it++) {
cout << ", " << it->first << ": " << it->second;
}
return os << "}";
}
template <typename K, typename V>
ostream& operator <<(ostream& os, unordered_map<K, V> m) {
os << "{";
if (m.begin() == m.end()) return os << "}";
auto it_first_item = m.begin();
cout << it_first_item->first << ": " << it_first_item->second;
for (auto it = ++it_first_item; it != m.end(); it++) {
cout << ", " << it->first << ": " << it->second;
}
return os << "}";
}
lint pow(lint num, lint e, lint MOD) {
lint res = 1;
lint cur_num = num;
while (e) {
if (e & 1) {
res *= cur_num;
res %= MOD;
}
cur_num *= cur_num;
cur_num %= MOD;
e >>= 1;
}
return res;
}
int main() {
cin.tie(0); cout.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cout << setw(2) << setfill('0');
lint N;
cin >> N;
lint min = N / 60, sec = N % 60;
lint hour = min / 60; min = min % 60;
cout << hour << ":";
cout << setw(2) << setfill('0') << min << ":";
cout << setw(2) << setfill('0') << sec << "\n";
}
Submission Info
Submission Time |
|
Task |
B - 入浴時間 |
User |
tmsausa |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
2968 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
sample_01.txt, sample_02.txt, test_1.txt, test_17977.txt, test_25298.txt, test_36922.txt, test_44309.txt, test_52415.txt, test_60165.txt, test_65487.txt, test_70993.txt, test_80915.txt, test_84810.txt, test_86399.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
1 ms |
256 KB |
sample_02.txt |
AC |
1 ms |
256 KB |
test_1.txt |
AC |
1 ms |
256 KB |
test_17977.txt |
AC |
1 ms |
256 KB |
test_25298.txt |
AC |
1 ms |
256 KB |
test_36922.txt |
AC |
1 ms |
256 KB |
test_44309.txt |
AC |
1 ms |
256 KB |
test_52415.txt |
AC |
1 ms |
256 KB |
test_60165.txt |
AC |
1 ms |
256 KB |
test_65487.txt |
AC |
1 ms |
256 KB |
test_70993.txt |
AC |
1 ms |
256 KB |
test_80915.txt |
AC |
1 ms |
256 KB |
test_84810.txt |
AC |
1 ms |
256 KB |
test_86399.txt |
AC |
1 ms |
256 KB |