# CTEMP - Editorial

Author: Hitkchapter

Tester: Ankur Kayal

Editorialist: Hitkchapter

Cakewalk

# PREREQUISITES:

Basic Mathematics

# PROBLEM:

In the given problem, the temperature given in Celsius needs to be converted to Cheffin.

# QUICK EXPLANATION:

Simply put values in the formula and round the value to the nearest integer.

# EXPLANATION:

First we derive the temperature in fahrenheit scale and then in kelvin scale. Put the 3 values in our formula and print the answer rounded to the nearest integer using the in-built round function in the math library.

O(1).

# SOLUTIONS:

Setter's Solution
``````#include<bits/stdc++.h>
#include<cmath>
using namespace std;

int main()
{
int no_of_test_cases;
cin >> no_of_test_cases;

while(no_of_test_cases --)
{
float cel;
cin>>cel;
double ans;
ans = (cel/27) + ((cel*9)/5 +9)/9 + (cel + 273 - 72);
int a = round(ans);
cout<<a<<endl;
}

return 0;

}

``````
Tester's Solution
``````#include <bits/stdc++.h>
using namespace std;

//----------------------------------- DEBUG -----------------------------------
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
// debug & operator << (debug & dd, P p) { dd << "(" << p.x << ", " << p.y << ")"; return dd; }

//----------------------------------- END DEBUG --------------------------------

#define trav(a,x) for (auto& a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)

//----------------------------------- DEFINES -----------------------------------

#define sz(x) (int)(x).size()
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define ins insert
#define nl '\n'

//----------------------------------- END DEFINES --------------------------------

//-------------------------- CUSTOM UNORDERED MAP HASH ---------------------------

struct custom_hash{
static uint64_t splitmix64(uint64_t x){
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t a) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(a + FIXED_RANDOM);
}
template<class T> size_t operator()(T a) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
hash<T> x;
return splitmix64(x(a) + FIXED_RANDOM);
}
template<class T, class H> size_t operator()(pair<T, H> a) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
hash<T> x;
hash<H> y;
return splitmix64(x(a.first) * 37 + y(a.second) + FIXED_RANDOM);
}
};
template<class T, class H>using umap=unordered_map<T,H,custom_hash>;

//----------------------- CUSTOM UNORDERED MAP HASH END--------------------------

void run_cases() {
double c;
cin >> c;

double f = c * 9 / 5 + 32 - 23;
f /= 9;
double k = c + 273 - 72;
c /= 27;

double ans = c + f + k;

int64_t res = round(ans);

cout << res << nl;
}

int main() {
ios_base::sync_with_stdio(0); cin.tie(nullptr);

cout << setprecision(0) << fixed;

int tests = 1;
cin >> tests;

for(int test = 1;test <= tests;test++) {
run_cases();
}
}
``````