Submission #1688450
Source Code Expand
#include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<limits>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const int inf = numeric_limits<int>::max() ;
const ll linf = numeric_limits<ll>::max() ;
const ull ulinf = numeric_limits<ull>::max();
const double pi = acos(-1);
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
const int dx8[8]={-1,0,1,-1,1,-1,0,1};
const int dy8[8]={-1,-1,-1,0,0,1,1,1};
#define p_queue(i) priority_queue<i>
#define rp_queue(i) priority_queue<i, vector<i>, greater<i>>
#define P(p) cout<<(p)<<endl
#define rep(i,m,n) for(int i = (m); i < (int)(n); i++)
#define mod(i) ((i)%(ll)(1e9 + 7))
#define divm(a,b) (mod(a * modpow((ll)b,(ll)(1e9+5))))
#define rsort(a,b,c) sort(a, b, greater<c>())
#define vsort(v) sort(v.begin(), v.end());
#define rvsort(v) sort(v.end(), v.begin());
#define ft first
#define sd second
#define pb push_back
#define it insert
#define sz(x) ((int)(x).size())
#define lb(a,n,k) (lower_bound(a,a+n,k) - a)
#define vlb(a,k) (lower_bound(a.begin(),a.end(),k) - a.begin())
#define YES cout<<"YES"<< endl
#define NO cout<<"NO"<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define yes cout<<"yes"<<endl
#define no cout<<"no"<<endl
#define ret return
ll modpow(ll i,ll j){ ll tmp=1; while(j){ if(j%2)tmp=mod(tmp*i);i=mod(i*i);j/=2;}return tmp;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
//ll ncr[100][100];
//ll nCr(int n, int r){if(n==r) ret ncr[n][r] = 1; if(r==0) ret ncr[n][r] = 1; if(r==1) ret ncr[n][r] = n;if(ncr[n][r]) ret ncr[n][r]; ret ncr[n][r] = nCr(n-1,r) + nCr(n-1,r-1);}
//ll npr[100][100]={};
//ll nPr(int n,int r){if(npr[n][r])ret npr[n][r];if(r==0)ret npr[n][r] = 1;if(r==1)ret npr[n][r] = n;ret npr[n][r] = n * nPr(n-1,r-1);}
//ll nHr(int n,int r){ret nCr(n+r-1,r);}
///////////////////////////////////////////////////////////////////////////
int main(){
int m,d;
cin >> m >> d;
(m%d == 0 && m >= d)? YES: NO;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - 12月6日 |
User |
hirata0517masato |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
2203 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 |