Submission #19291528
Source Code Expand
Copy
#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>
using namespace std;
template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
out << "["; bool first = true;
for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
out << "["; bool first = true;
for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
out << "{"; bool first = true;
for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
out << "{"; bool first = true;
for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
typedef long long int64;
typedef pair<int, int> ii;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }
struct fast_ios {
fast_ios() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
};
} fast_ios_;
int64 power_mod(int64 a, int64 n, int p = MOD) {
int64 ret = 1;
for (; n; n >>= 1) {
if (n & 1) ret = ret * a % p;
a = a * a % p;
}
return ret;
}
int main() {
int64 n, m;
cin >> n >> m;
int64 rem = power_mod(10, n, m * m);
rem /= m;
rem = rem % m;
cout << rem << '\n';
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Simple Math 2 |
User |
cuiaoxiang |
Language |
C++ (Clang 10.0.0) |
Score |
300 |
Code Size |
2865 Byte |
Status |
AC |
Exec Time |
7 ms |
Memory |
3156 KB |
Compile Error
./Main.cpp:78:42: warning: unused variable 'inf' [-Wunused-const-variable]
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
^
1 warning generated.
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
300 / 300 |
Status |
AC
|
|
Set Name |
Test Cases |
Sample |
|
All |
example_00, example_01, example_02, max_random_00, max_random_01, max_random_02, max_random_03, max_random_04, small_m_00, small_m_01, small_m_02, small_m_03, small_m_04, small_m_05, small_m_06, small_m_07, small_m_08, small_m_09, special_00, special_01, special_02, special_03, special_04 |
Case Name |
Status |
Exec Time |
Memory |
example_00 |
AC |
7 ms |
2968 KB |
example_01 |
AC |
2 ms |
2948 KB |
example_02 |
AC |
2 ms |
3088 KB |
max_random_00 |
AC |
2 ms |
3068 KB |
max_random_01 |
AC |
2 ms |
3056 KB |
max_random_02 |
AC |
2 ms |
3140 KB |
max_random_03 |
AC |
3 ms |
3056 KB |
max_random_04 |
AC |
3 ms |
3124 KB |
small_m_00 |
AC |
2 ms |
2968 KB |
small_m_01 |
AC |
2 ms |
3000 KB |
small_m_02 |
AC |
2 ms |
3124 KB |
small_m_03 |
AC |
2 ms |
3092 KB |
small_m_04 |
AC |
2 ms |
3148 KB |
small_m_05 |
AC |
2 ms |
3156 KB |
small_m_06 |
AC |
1 ms |
3068 KB |
small_m_07 |
AC |
1 ms |
3036 KB |
small_m_08 |
AC |
2 ms |
3156 KB |
small_m_09 |
AC |
2 ms |
3108 KB |
special_00 |
AC |
1 ms |
2952 KB |
special_01 |
AC |
2 ms |
2948 KB |
special_02 |
AC |
2 ms |
3004 KB |
special_03 |
AC |
2 ms |
2952 KB |
special_04 |
AC |
2 ms |
2976 KB |