제출 #381876

#제출 시각아이디문제언어결과실행 시간메모리
381876SlavitaVepar (COCI21_vepar)C++14
0 / 70
2 ms492 KiB
#include <iostream> using namespace std; #include <bits/stdc++.h> #define ve vector<int> #define pb push_back #define mp make_pair #define fi first #define se second #define pi pair<int,int> #define all(v) v.begin(),v.end() #define si(v) (int)v.size() #define en '\n' using namespace std; typedef long long ll; typedef unsigned long long ull; const int N = 1e4 + 228; const int big = 1e9; int n; ull fa[N]; int main(){ iostream::sync_with_stdio(false); cin.tie(0); ios_base::sync_with_stdio(false); cout.tie(0); //freopen("input.txt","r",stdin); //freopen("output.txt","w",stdout); cin >> n; fa[1] = 1; for (int i = 2; i <= 50; i++) fa[i] = fa[i - 1] * 1ll * i; for (int i = 1; i <= n; i++){ ull l1, r1, l2, r2; cin >> l1 >> r1 >> l2 >> r2; if ((fa[r2] / fa[l2]) % (fa[r1] / fa[l1]) == 0) cout << "DA\n"; else cout << "NE\n"; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...