Submission #201429

---

Source Code Expand

#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<vector<int> > mat;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
#define pb push_back
#define mp make_pair
#define INF 1e+9


int main() {
  int N;
  cin >> N;
  int h,m,s;
  h = N / 3600;
  N = N % 3600;
  m = N / 60;
  N %= 60;
  s = N;
  printf("%02d:%02d:%02d\n", h, m, s);
}

Submission Info

Judge Result