Submission #535906

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <climits>
#include <vector>
#include <numeric>
#include <complex>
#include <map>
#include <bitset>
#include <stack>
#include <queue>
#include <set>
using namespace std;

//#define __int64 long long
#define long __int64
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
const int Vec = 4;
const int Vecy[Vec] = {0,-1,0,1};
const int Vecx[Vec] = {1,0,-1,0};
const int Modd = 1000000007;

int main(){
	int n,m;
	double n2,m2;
	double ans;
	cin >> n >> m;
	n %= 12;
	
	n2 = (n + (m / 60.0)) / 12.0;
	m2 = m / 60.0; 
	
	if(n2 < m2){
		swap(n2,m2);
	}
	
	ans = min(n2 - m2, 1 - n2 + m2) * 360.0;
	cout.precision(12);
	cout << fixed << ans << endl;
	
    
    return 0;
}

Submission Info

Judge Result