Submission #4666985
Source Code Expand
#include <ios> #include <iomanip> #include <iostream> #include <functional> #include <cstdio> #include <cstdlib> #include <cstring> #include <algorithm> #include <string> #include <sstream> #include <complex> #include <vector> #include <list> #include <queue> #include <deque> #include <stack> #include <map> #include <set> #include <climits> using namespace std; typedef long long int ll; #define rep(i, n) for(int i = 0; i < (int)(n); i++) #define all(x) (x).begin(),(x).end() #define MOD 1000000007 #define INF (1e9) #define PI (acos(-1)) #define print(x) cout << x << endl #define yes cout << "Yes" << endl #define YES cout << "YES" << endl #define no cout << "No" << endl #define NO cout << "NO" << endl ll gcd(ll a, ll b) { return b ? gcd(b,a%b) : a;} ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } typedef pair <ll,ll> P; int main() { ll A, B, C; cin >> A >> B >> C; ll ans = A % MOD * B % MOD * C % MOD; print(ans % MOD); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 直方体 |
User | akimotty |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1012 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 1 ms | 256 KB |
0_03.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 1 ms | 256 KB |
1_02.txt | AC | 1 ms | 256 KB |
1_03.txt | AC | 1 ms | 256 KB |
1_04.txt | AC | 1 ms | 256 KB |