結果
| 問題 | No.1201 お菓子配り-4 |
| ユーザー |
 nok0
|
| 提出日時 | 2020-08-28 23:13:07 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 3,114 ms / 4,000 ms |
| コード長 | 5,136 bytes |
| コンパイル時間 | 4,860 ms |
| コンパイル使用メモリ | 194,788 KB |
| 最終ジャッジ日時 | 2025-01-13 19:24:06 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 36 |
コンパイルメッセージ
main.cpp: In function ‘void scan(char*)’:
main.cpp:50:28: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
50 | void scan(char a[]) { scanf("%s", a); }
| ~~~~~^~~~~~~~~
ソースコード
#include<bits/stdc++.h>using namespace std;#pragma region Macros#define ll long long#define ld long double#define FOR(i,l,r) for(ll i=(l);i<(r);++i)#define REP(i,n) FOR(i,0,n)#define REPS(i,n) FOR(i,1,n+1)#define RFOR(i,l,r) for(ll i=(l);i>=(r);--i)#define RREP(i,n) RFOR(i,n-1,0)#define RREPS(i,n) RFOR(i,n,1)#define pb push_back#define eb emplace_back#define SZ(x) ((ll)(x).size())#define all(x) (x).begin(),(x).end()#define rall(x) (x).rbegin(),(x).rend()template<class T = ll> using V = vector<T>;template<class T = ll> using VV = V<V<T>>;using P = pair<ll, ll>;#define VEC(type, name, size)\V<type> name(size);\IN(name)#define VVEC(type, name, h, w)\VV<type> name(h, V<type>(w));\IN(name)#define INT(...)\int __VA_ARGS__;\IN(__VA_ARGS__)#define LL(...)\ll __VA_ARGS__;\IN(__VA_ARGS__)#define STR(...)\string __VA_ARGS__;\IN(__VA_ARGS__)#define CHAR(...)\char __VA_ARGS__;\IN(__VA_ARGS__)#define DOUBLE(...)\DOUBLE __VA_ARGS__;\IN(__VA_ARGS__)#define LD(...)\LD __VA_ARGS__;\IN(__VA_ARGS__)template <class T> void scan(T a) { cin >> a; }void scan(int &a) { cin >> a; }void scan(long long &a) { cin >> a; }void scan(char &a) { cin >> a; }void scan(double &a) { cin >> a; }void scan(long double &a) { cin >> a; }void scan(char a[]) { scanf("%s", a); }void scan(string &a) { cin >> a; }template <class T> void scan(V<T> &);template <class T, class L> void scan(pair<T, L> &);template <class T> void scan(V<T> &a) { for(auto &i : a) scan(i); }template <class T, class L> void scan(pair<T, L> &p){ scan(p.first); scan(p.second); }template <class T> void scan(T &a) { cin >> a; }void IN() {}template <class Head, class... Tail> void IN(Head &head, Tail &... tail) { scan(head); IN(tail...); }template <class T> inline void print(T x){ cout << x << '\n';}struct inputoutputfaster{inputoutputfaster(){ios::sync_with_stdio(false);\cin.tie(nullptr);cout << fixed << setprecision(15);}}inputoutputfaster_;template <class T> V<T> press(V<T> &x){V<T> res = x;sort(all(res));res.erase(unique(all(res)), res.end());REP(i, SZ(x)){x[i] = lower_bound(all(res), x[i]) - res.begin();}return res;}template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return true; }return false; }template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return true; }return false; }inline void Yes(bool b = true) {cout << (b ? "Yes" : "No") << '\n';}inline void YES(bool b = true) {cout << (b ? "YES" : "NO") << '\n';}inline void err(bool b = true) {if(b) {cout << -1 << '\n'; exit(0);}}template<class T> inline void fin(bool b = true, T e = 0) {if(b) {cout << e << '\n'; exit(0);}}template<class T> T divup(T x, T y) {return (x+(y-1))/y;}template <typename T> T pow(T a, long long n, T e = 1) {T ret = e; while (n) {if (n & 1) ret *= a; a *= a; n >>= 1; } return ret; }const ll INF = 1e18;#pragma endregion//Modulo Calculationconst int MOD = 1e9 + 7;// const int MOD = 998244353;//ModInttemplate <int mod>struct ModInt {int x;ModInt() : x(0) {}ModInt(ll x_) {if ((x = x_ % mod + mod) >= mod) x -= mod;}ModInt& operator+=(ModInt rhs) {if ((x += rhs.x) >= mod) x -= mod;return *this;}ModInt& operator-=(ModInt rhs) {if ((x -= rhs.x) < 0) x += mod;return *this;}ModInt& operator*=(ModInt rhs) {x = (unsigned long long)x * rhs.x % mod;return *this;}ModInt& operator/=(ModInt rhs) {x = (unsigned long long)x * rhs.inv().x % mod;return *this;}ModInt operator-() const { return -x < 0 ? mod - x : -x; }ModInt operator+(ModInt rhs) const { return ModInt(*this) += rhs; }ModInt operator-(ModInt rhs) const { return ModInt(*this) -= rhs; }ModInt operator*(ModInt rhs) const { return ModInt(*this) *= rhs; }ModInt operator/(ModInt rhs) const { return ModInt(*this) /= rhs; }ModInt &operator++ () { *this += 1; return *this;}ModInt operator++ (int) { *this += 1; return *this - 1;}ModInt &operator-- () { *this -= 1; return *this;}ModInt operator-- (int) { *this -= 1; return *this + 1;}bool operator==(ModInt rhs) const { return x == rhs.x; }bool operator!=(ModInt rhs) const { return x != rhs.x; }bool operator<=(ModInt rhs) const { return x <= rhs.x; }bool operator>=(ModInt rhs) const { return x >= rhs.x; }bool operator<(ModInt rhs) const { return x < rhs.x; }bool operator>(ModInt rhs) const { return x > rhs.x; }ModInt inv() const { return pow(*this, mod - 2); }friend ostream& operator<<(ostream& s, ModInt<mod> a) {s << a.x;return s;}friend istream& operator>>(istream& s, ModInt<mod>& a) {s >> a.x;return s;}};using mint = ModInt<MOD>;mint res;int main(){INT(n, m);VEC(int, a, n);VEC(int, b, m);REP(i, n) REP(j, m){ll x = a[i], y = b[j];res += x * y + x - y + __gcd(x, y);}print(res);}