Submission #2816090
Source Code Expand
#include<iostream> #include<algorithm> #include<math.h> #include<cstdio> #include<ctype.h> #include<stdio.h> #include<set> #include<vector> #include<map> #include<functional> #include<iomanip> #include<queue> #include<ciso646> #include<random> #include<numeric> #include<string> using namespace std; typedef long long ll; ll dx[] = { 1,1,0,-1,-1,-1,0,1 }; ll dy[] = { 0,1,1,1,0,-1,-1,-1 }; ll prime(ll x) { ll i; if (x < 2)return 0; else if (x == 2) return 1; if (x % 2 == 0) return 0; for (i = 3; i*i <= x; i += 2) { if (x%i == 0) return 0; } return 1; } ll gcd(ll a, ll b) { if (a<b) { return gcd(b, a); } else if (a%b) { return gcd(b, a%b); } else { return b; } } ll MOD = 1000000007; int main() { ll n, x; cin >> n; cin >> x; cout << 525 * (n - x) + 540 * x << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - プレミアム会員 |
User | sintan |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 834 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 | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask1_random01.txt, subtask1_random02.txt, subtask1_random03.txt, subtask1_random04.txt, subtask1_random05.txt, subtask1_random06.txt, subtask1_random07.txt, subtask1_random08.txt, subtask1_random09.txt, subtask1_random10.txt, subtask1_random11.txt, subtask1_random12.txt, subtask1_random13.txt, subtask1_random14.txt, subtask1_random15.txt, subtask1_random16.txt, subtask1_random17.txt, subtask1_random18.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 1 ms | 256 KB |
subtask0_sample_02.txt | AC | 1 ms | 256 KB |
subtask0_sample_03.txt | AC | 1 ms | 256 KB |
subtask0_sample_04.txt | AC | 1 ms | 256 KB |
subtask1_random01.txt | AC | 1 ms | 256 KB |
subtask1_random02.txt | AC | 1 ms | 256 KB |
subtask1_random03.txt | AC | 1 ms | 256 KB |
subtask1_random04.txt | AC | 1 ms | 256 KB |
subtask1_random05.txt | AC | 1 ms | 256 KB |
subtask1_random06.txt | AC | 1 ms | 256 KB |
subtask1_random07.txt | AC | 1 ms | 256 KB |
subtask1_random08.txt | AC | 1 ms | 256 KB |
subtask1_random09.txt | AC | 1 ms | 256 KB |
subtask1_random10.txt | AC | 1 ms | 256 KB |
subtask1_random11.txt | AC | 1 ms | 256 KB |
subtask1_random12.txt | AC | 1 ms | 256 KB |
subtask1_random13.txt | AC | 1 ms | 256 KB |
subtask1_random14.txt | AC | 1 ms | 256 KB |
subtask1_random15.txt | AC | 1 ms | 256 KB |
subtask1_random16.txt | AC | 1 ms | 256 KB |
subtask1_random17.txt | AC | 1 ms | 256 KB |
subtask1_random18.txt | AC | 1 ms | 256 KB |