oj.uz

답안 #659309

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
659309 2022-11-17T11:57:40 Z shmad Trol (COCI19_trol) C++17
50 / 50
 1 ms 320 KB 
#pragma GCC optimize("O3", "unroll-loops") // "Ofast" 	
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt") 

#include <bits/stdc++.h>

#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)

using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vvt = vt< vt<ll> >;

const int N = 1e6 + 5, mod = 1e9 + 7, B = 500;
const ll inf = 1e18 + 7, LIM = (1ll << 60);
const ld eps = 1e-6;

int q;

int get (int x) {
	while (x > 9) {
		int nx = x, res = 0;
		while (nx) res += nx % 10, nx /= 10;
		x = res;
	}
	return x;
}

void solve () {
	cin >> q;
	while (q--) {
		int l, r;
		cin >> l >> r;
		int ans = 0;
		if (r < 9) {   
			for (int i = l; i <= r; i++) ans += get(i);
			cout << ans << '\n';
			continue;
		}
		while (get(l) != 1) ans += get(l++);
		while (get(r) != 9) ans += get(r--);
		ans += ((r - l + 1) / 9) * 45;
		cout << ans << '\n';
	}
	cout << '\n';
}

bool testcases = 0;

signed main() {
#ifdef ONLINE_JUDGE
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
#endif
	cin.tie(0) -> sync_with_stdio(0);
	int test = 1;
	if (testcases) cin >> test;
	for (int cs = 1; cs <= test; cs++) {
		solve();
	}
}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 320 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct