Information
- ID
- 422
- Time
- 1000ms
- Memory
- 16MiB
- Difficulty
- 7
- Tags
- # Submissions
- 21
- Accepted
- 8
- Uploaded By
#include <bits/stdc++.h>
using namespace std;
#define accelerate ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define endl "\n";
#define mod 12345
#define ll long long
#define PII pair<int,int>
#define INF 0x3f3f3f3f
const int N=1e5+10;
ll n,m,k,x,y,T;
ll a[N];
ll pre[N];
int main(){
accelerate;
cin>>x;
printf("%02d:%02d:%02d",x/3600,x/60%60,x%60);
//cout<<<<":"<<<<":"<<;
return 0;
}
By signing up a 追梦算法网 universal account, you can submit code and join discussions in all online judging services provided by us.