Submission #1867644
Source Code Expand
#include "bits/stdc++.h"
//#include "ext/pb_ds/tree_policy.hpp"
//#include "ext/pb_ds/assoc_container.hpp"
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
#define iout(x) printf("%d\n",x)
#define lout(x) printf("%lld\n",x)
#define REP(x,l,u) for(ll x = l;x<u;x++)
#define RREP(x,l,u) for(ll x = l;x>=u;x--)
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) a.begin(),a.end()
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define MP make_pair
#define sqr(x) ((x)*(x))
#define lowbit(x) (x&(-x))
#define lson (ind<<1)
#define rson (ind<<1|1)
#define se second
#define fi first
#define dbg(x) cerr<<#x<<" = "<<(x)<<endl;
#define sz(x) ((int)x.size())
#define EX0 exit(0);
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
using namespace std;
const int block_size = 320;
typedef complex<ll> point;
const ll mod = 1e9+7;
const ld eps = 1e-9;
const db PI = atan(1)*4;
template<typename T>
inline int sign(const T&a){if(a<0)return -1;if(a>0)return 1;return 0;}
template<typename T> inline void in(T &x){
x = 0; T f = 1; char ch = getchar();
while (!isdigit(ch)) {if (ch == '-') f = -1; ch = getchar();}
while (isdigit(ch)) {x = x * 10 + ch - '0'; ch = getchar();}
x *= f;
}
ll twop(int x){return 1LL<<x;}
template<typename A,typename B > inline void in(A&x,B&y){in(x);in(y);}
template<typename A,typename B,typename C>inline void in(A&x,B&y,C&z){in(x);in(y);in(z);}
template<typename A,typename B,typename C,typename D> inline void in(A&x,B&y,C&z,D&xx){in(x);in(y);in(z);in(xx);}
template <class T>
void upd(T&a,T b) {
a = max(a,b);
}
int main(){
ll a,b;cin>>a>>b;
if(a%b==0)cout<<"YES\n";
else puts("NO");
return 0;
}
Submission Info
Submission Time |
|
Task |
A - 12月6日 |
User |
samzhang |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1970 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 |