Submission #4028171


Source Code Expand

#pragma once
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <deque>
#include <numeric>
#include <iomanip>
#define M_PI acos(-1)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1000000007;
const int MAX_V = 201;
int now = 0;
int deco[1000];

int st[30][100000];
ll dp[52][2510];
const int MAX = 510000;
const int MOD = 1000000007;

long long fac[MAX], finv[MAX], inv[MAX];

// テーブルを作る前処理
void COMinit() {
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	for (int i = 2; i < MAX; i++) {
		fac[i] = fac[i - 1] * i % MOD;
		inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
		finv[i] = finv[i - 1] * inv[i] % MOD;
	}
}

// 二項係数計算
long long COM(int n, int k) {
	if (n < k) return 0;
	if (n < 0 || k < 0) return 0;
	return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int B[30];
int t[100010];
struct edge {
	int t;
	ll cost;
	edge(int _t,ll _cost) : t(_t)
							, cost(_cost){
	}
};
int table[15][15];
int n, m;
ll h;

bool use[15];
int ct[15];
bool memo[15][15][15];
string format(int val){
	ostringstream sout;
	sout << std::setfill('0') << setw(2) << val;
	return sout.str();
}
void Solve() {
	int n;
	cin >> n;
	int hour = n / 60 / 60;
	int minu = (n - hour * 60 * 60) / 60;
	int sec = n % 60;

	cout << format(hour) << ":" << format(minu) << ":" << format(sec) << endl;
	
}
int main() {
	Solve();
	return 0;
}

Submission Info

Submission Time
Task B - 入浴時間
User moxn_nxom
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1693 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Compile Error

./Main.cpp:1:9: warning: #pragma once in main file
 #pragma once
         ^
./Main.cpp:19:0: warning: "M_PI" redefined
 #define M_PI acos(-1)
 ^
In file included from /usr/include/c++/5/cmath:44:0,
                 from ./Main.cpp:15:
/usr/include/math.h:372:0: note: this is the location of the previous definition
 # define M_PI  3.14159265358979323846 /* pi */
 ^

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 14
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