제출 #1248609

#제출 시각아이디문제언어결과실행 시간메모리
1248609hayyyTrol (COCI19_trol)C++20
0 / 50
0 ms328 KiB
#include <bits/stdc++.h> typedef long long ll; using namespace std; int balik(int K, int F = 0) { while (K > 0) { F += K % 10; K /= 10; } if (F > 9) return balik(F); else return F; } int main() { // int Hai; // int Dar; int N; cin >> N; vector<int> A(N); vector<int> B(N); for (int i = 1; i <= N; i++) { cin >> A[i] >> B[i]; int maxim = max(balik(A[i]), balik(B[i])); int minim = min(balik(A[i]), balik(B[i])); // Hai = minim - 1; // Dar = maxim; int H = minim*(minim)/2; int D = maxim*(maxim + 1)/2; cout << D - H << endl; } } // output // 15 // 3
#Verdict Execution timeMemoryGrader output
Fetching results...