| Task: | Denominations |
| Sender: | dsedov |
| Submission time: | 2018-09-15 13:10:30 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.02 s | details |
| #2 | ACCEPTED | 0.01 s | details |
| #3 | ACCEPTED | 0.02 s | details |
| #4 | ACCEPTED | 0.01 s | details |
| #5 | ACCEPTED | 0.02 s | details |
| #6 | ACCEPTED | 0.01 s | details |
| #7 | ACCEPTED | 0.03 s | details |
| #8 | ACCEPTED | 0.02 s | details |
| #9 | ACCEPTED | 0.01 s | details |
| #10 | ACCEPTED | 0.01 s | details |
| #11 | ACCEPTED | 0.01 s | details |
| #12 | UNKNOWN | -- | details |
| #13 | UNKNOWN | -- | details |
| #14 | UNKNOWN | -- | details |
| #15 | UNKNOWN | -- | details |
Code
#include <stdio.h>
#include <iostream>
#include <memory.h>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
#define sqr(a) ((a) * (a))
#define pi 3.1415926535897932384626433832795
//#define TASK "a"
int n, a;
int c[1000001];
void Load()
{
cin >> n;
cin >> a;
}
void Solve()
{
if (a != 1)
cout << 1 << endl;
else
cout << "ALL" << endl;
}
int main()
{
// freopen(TASK".in", "r", stdin);
// freopen(TASK".out", "w", stdout);
Load();
Solve();
return 0;
}Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 15 1 2 5 10 20 50 100 200 500 100... |
| correct output |
|---|
| ALL |
| user output |
|---|
| ALL |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 9 2 3 4 5 6 7 8 9 10 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 99 2 3 4 5 6 7 8 9 10 11 12 13 14... |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 999 2 3 4 5 6 7 8 9 10 11 12 13 14... |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 9999 2 3 4 5 6 7 8 9 10 11 12 13 14... |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 99999 2 3 4 5 6 7 8 9 10 11 12 13 14... |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 999999 2 3 4 5 6 7 8 9 10 11 12 13 14... |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 999999 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| correct output |
|---|
| ALL |
| user output |
|---|
| ALL |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 1000000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| correct output |
|---|
| ALL |
| user output |
|---|
| ALL |
Test 10
Verdict: ACCEPTED
| input |
|---|
| 1000000 1 487 820 4599 6672 7832 8293 ... |
| correct output |
|---|
| ALL |
| user output |
|---|
| ALL |
Test 11
Verdict: ACCEPTED
| input |
|---|
| 1000000 628 2499 2887 3482 4061 5947 7... |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 12
Verdict: UNKNOWN
| input |
|---|
| 1 1 |
| correct output |
|---|
| ALL |
| user output |
|---|
| (not available) |
Test 13
Verdict: UNKNOWN
| input |
|---|
| 1 2 |
| correct output |
|---|
| 1 |
| user output |
|---|
| (not available) |
Test 14
Verdict: UNKNOWN
| input |
|---|
| 1 1000000000 |
| correct output |
|---|
| 1 |
| user output |
|---|
| (not available) |
Test 15
Verdict: UNKNOWN
| input |
|---|
| 2 5 6 |
| correct output |
|---|
| 1 |
| user output |
|---|
| (not available) |
