Accepted
Code
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
void solve(int cs) {
int64_t n;
cin >> n;
for (int i = 1; i <= 10; i++) {
int64_t t = n * i;
if (t % 10 == 0) {
cout << i << "\n";
return;
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tc = 1;
// cin >> tc;
for (int cs = 1; cs <= tc; cs++) {
solve(cs);
}
return 0;
}
Information
- Submit By
- Type
- Submission
- Problem
- P1012 Zéros de fin
- Language
- C++20 (G++ 13.2.0)
- Submit At
- 2024-07-11 11:35:27
- Judged At
- 2024-11-11 03:27:35
- Judged By
- Score
- 100
- Total Time
- 2ms
- Peak Memory
- 324.0 KiB