Submission #1187885
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include <cstdio> #include <utility> #include <string> #include <sstream> #include <fstream> #include <cmath> #include <stack> #include <queue> #include <list> #include <map> #include <iomanip> #include <set> using namespace std; typedef vector<int> VI; typedef vector<VI> VVI; #define MAX(x,y) ( (x) > (y) ? (x) : (y) ) #define MIN(x, y) ( (x) < (y) ? (x) : (y) ) #define FOR(i,a,b) for(int i=(a);i<(b);i++) #define REP(i,n) FOR(i,0,n) #define IVFOR(p,a) for(vector<int>::iterator p = (a).begin(); p!=(a).end(); p++) #define ILFOR(p,a) for(list<int>::iterator p = (a).begin(); p!=(a).end(); p++) #define ALL(a) (a).begin(),(a).end() #define SORT(c) sort((c).begin(),(c).end()) #define CHECK(x) cout << #x << " = " << (x) << endl #define FINA(y) cout << (y) << endl int main(){ int m, d; cin >> m >> d; if(m % d == 0) FINA("YES"); else FINA("NO"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 12月6日 |
User | Rx17Qq |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 988 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 10_rand_00.txt, 10_rand_01.txt, 10_rand_02.txt, 10_rand_03.txt, 10_rand_04.txt, 10_rand_05.txt, 10_rand_06.txt, 10_rand_07.txt, 10_rand_08.txt, 10_rand_09.txt, 10_rand_10.txt, 10_rand_11.txt, 10_rand_12.txt, 10_rand_13.txt, 10_rand_14.txt, 10_rand_15.txt, 10_rand_16.txt, 10_rand_17.txt, 10_rand_18.txt, 10_rand_19.txt, 10_rand_20.txt, 10_rand_21.txt, 10_rand_22.txt, 10_rand_23.txt, 10_rand_24.txt, 10_rand_25.txt, 10_rand_26.txt, 10_rand_27.txt, 10_rand_28.txt, 10_rand_29.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_00.txt | AC | 1 ms | 256 KB |
00_sample_01.txt | AC | 1 ms | 256 KB |
00_sample_02.txt | AC | 1 ms | 256 KB |
10_rand_00.txt | AC | 1 ms | 256 KB |
10_rand_01.txt | AC | 1 ms | 256 KB |
10_rand_02.txt | AC | 1 ms | 256 KB |
10_rand_03.txt | AC | 1 ms | 256 KB |
10_rand_04.txt | AC | 1 ms | 256 KB |
10_rand_05.txt | AC | 1 ms | 256 KB |
10_rand_06.txt | AC | 1 ms | 256 KB |
10_rand_07.txt | AC | 1 ms | 256 KB |
10_rand_08.txt | AC | 1 ms | 256 KB |
10_rand_09.txt | AC | 1 ms | 256 KB |
10_rand_10.txt | AC | 1 ms | 256 KB |
10_rand_11.txt | AC | 1 ms | 256 KB |
10_rand_12.txt | AC | 1 ms | 256 KB |
10_rand_13.txt | AC | 1 ms | 256 KB |
10_rand_14.txt | AC | 1 ms | 256 KB |
10_rand_15.txt | AC | 1 ms | 256 KB |
10_rand_16.txt | AC | 1 ms | 256 KB |
10_rand_17.txt | AC | 1 ms | 256 KB |
10_rand_18.txt | AC | 1 ms | 256 KB |
10_rand_19.txt | AC | 1 ms | 256 KB |
10_rand_20.txt | AC | 1 ms | 256 KB |
10_rand_21.txt | AC | 1 ms | 256 KB |
10_rand_22.txt | AC | 1 ms | 256 KB |
10_rand_23.txt | AC | 1 ms | 256 KB |
10_rand_24.txt | AC | 1 ms | 256 KB |
10_rand_25.txt | AC | 1 ms | 256 KB |
10_rand_26.txt | AC | 1 ms | 256 KB |
10_rand_27.txt | AC | 1 ms | 256 KB |
10_rand_28.txt | AC | 1 ms | 256 KB |
10_rand_29.txt | AC | 1 ms | 256 KB |