Submission #3565779
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define IOS ios::sync_with_stdio(false), cin.tie(0) #define REP(i, n) for (int i = 0; i < n; i++) #define FOR(i, a, b) for (int i = a; i < b; i++) #define ALL(x) (x).begin(), (x).end() #define dump(x) cout << (x) << endl #define LMAX 9223372036854775807LL #define LMIN -9223372036854775807LL using ll = long long; template<typename T> using vec = vector<T>; using P = pair<ll, ll>; template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val){ fill((T *)array, (T *)(array + N), val); } const ll INF = 1e18; const ll mod = 1e9 + 7; //int dx[4] = {1,0,-1,0}; //int dy[4] = {0,1,0,-1}; //ll pas[51][52]; signed main(){ IOS; ll x,y; cin >> x >> y; if(x % y == 0)dump(-1); else dump(x); }
Submission Info
Submission Time | |
---|---|
Task | A - Two Integers |
User | jgvt5ti |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 827 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_000.txt, 0_001.txt |
All | 0_000.txt, 0_001.txt, 1_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_000.txt | AC | 1 ms | 256 KB |
0_001.txt | AC | 1 ms | 256 KB |
1_002.txt | AC | 1 ms | 256 KB |
1_003.txt | AC | 1 ms | 256 KB |
1_004.txt | AC | 1 ms | 256 KB |
1_005.txt | AC | 1 ms | 256 KB |
1_006.txt | AC | 1 ms | 256 KB |
1_007.txt | AC | 1 ms | 256 KB |
1_008.txt | AC | 1 ms | 256 KB |
1_009.txt | AC | 1 ms | 256 KB |
1_010.txt | AC | 1 ms | 256 KB |
1_011.txt | AC | 1 ms | 256 KB |
1_012.txt | AC | 1 ms | 256 KB |
1_013.txt | AC | 1 ms | 256 KB |
for_sample.txt | AC | 1 ms | 256 KB |