Codeforces Round #451 (Div. 2) A

#include<iostream>#include<algorithm>#include<iomanip>#include<cstdio>#include<cstdlib>#include<cstring>#include<string>#include<cmath>#include<set>#include<queue>#include<stack>#include<map>#define PI acos(-1.0)#define in freopen("in.txt", "r", stdin)#define out freopen("out.txt", "w", stdout)#define kuaidian ios::sync_with_stdio(0);using namespace std;typedef long long ll;typedef unsigned long long ull;const int maxn = 2e5 + 7, maxd = 1e8;const ll mod = 1e9 + 7;const int INF = 0x7f7f7f7f;int T, n;int main() {    kuaidian;    cin >> n;    if(n%10 == 0) cout << n << endl;    else if(n%10 >= 5) {        cout << (n/10+1)*10 << endl;    }    else {        cout << (n/10*10) << endl;    }    return 0;}