Submission #2543917
Source Code Expand
#include <bits/stdc++.h> #define rep(i, a, b) for(int i=(a);i<(b);++i) using namespace std; typedef long long ll; typedef pair<int, int> P; const int INF = (1 << 30) - 1; const ll INF64 = ((ll)1 << 62) - 1; const ll MOD = 1e9 + 7; const double PI = 3.1415926535897932384626433832795; int main() { int a,b,c,x,ans = 0; cin >> a >> b >> c >> x; for (int i1 = 0; i1 < a; ++i1) { for (int i2 = 0; i2 < b; ++i2) { for (int i3 = 0; i3 < c; ++i3) { if (i1 * 500 + i2 * 100 + i3 * 50 == x) { ans++; } } } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Coins |
User | naofuwa |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 604 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 200 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample01.txt, sample02.txt, sample03.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, sample01.txt, sample02.txt, sample03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 1 ms | 256 KB |
02.txt | WA | 1 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | WA | 1 ms | 256 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | WA | 1 ms | 256 KB |
07.txt | WA | 1 ms | 256 KB |
08.txt | WA | 1 ms | 256 KB |
09.txt | WA | 1 ms | 256 KB |
10.txt | WA | 1 ms | 256 KB |
sample01.txt | WA | 1 ms | 256 KB |
sample02.txt | AC | 1 ms | 256 KB |
sample03.txt | WA | 1 ms | 256 KB |