提出 #65632814
ソースコード 拡げる
#include <bits/stdc++.h>
#define all(c) c.begin(), c.end()
#define sz(c) ll(c.size())
#define ll long long
#define tr(a, it) for (auto it = a.begin(); it != a.end(); it++)
#define present(c, x) (c.find(x) != c.end())
#define cpresent(c, x) (find(all(c), x) != c.end())
#define vi vector<int>
#define vll vector<ll>
#define vvll vector<vll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define pll pair<ll, ll>
#define inf 1e9
#define MOD 1000000007
#define MAXN 10000
#define madar 1e18
#define moda 998244353
#define loop(i, s, e) for (ll i = s; i < e; i++)
#define revloop(i, s, e) for (ll i = s; i >= e; i--)
#define newl cout << endl
#define pb push_back
#define f first
#define s second
using namespace std;
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
ll gcd(ll a, ll b){
if(!(a%b)) return b;
return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return (a*b)/gcd(a,b);
}
ll MSB(ll n)
{
ll ans = -1;
while (n) {
ans++;
n /= 2;
}
return ans;
}
ll power(ll a, ll b, ll mod) { // to calculate (a^b)%mod
ll p = 1;
while (b > 0) {
if (b & 1)
p = (p * a) % mod;
a = (a * a) % mod;
b = b >> 1;
}
return p;
}
ll inv_mod(ll n, ll mod) {
return power(n, mod - 2, mod);
}
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// #ifdef LOCAL
// #include "debug.h"
// #endif
void solve(int tc) {
int r, c; cin >> r >> c;
if(c == 1){
if(r >= 1600 && r <= 2999){
cout << "Yes\n";
}else{
cout << "No\n";
}
}else{
if(r >= 1200 && r <= 2399){
cout << "Yes\n";
}else{
cout << "No\n";
}
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
// auto start = std::chrono::high_resolution_clock::now();
// freopen("input.txt", "r", stdin);
// freopen("output1.txt", "w", stdout);
int t = 1;
// cin >> t;
int tc = 0;
while (t--) {
tc++;
solve(tc);
}
// newl;
// auto end = chrono::high_resolution_clock::now();
// auto duration = chrono::duration_cast<chrono::milliseconds>(end - start);
// cout << "Time taken: " << duration.count() << " milliseconds" << std::endl;
return 0;
}
提出情報
| 提出日時 |
|
| 問題 |
A - Is it rated? |
| ユーザ |
arikrrr77 |
| 言語 |
C++ 20 (gcc 12.2) |
| 得点 |
100 |
| コード長 |
2630 Byte |
| 結果 |
AC |
| 実行時間 |
1 ms |
| メモリ |
3600 KiB |
コンパイルエラー
Main.cpp: In function ‘void solve(int)’:
Main.cpp:71:16: warning: unused parameter ‘tc’ [-Wunused-parameter]
71 | void solve(int tc) {
| ~~~~^~
ジャッジ結果
| セット名 |
Sample |
All |
| 得点 / 配点 |
0 / 0 |
100 / 100 |
| 結果 |
|
|
| セット名 |
テストケース |
| Sample |
00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt |
| All |
00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt |
| ケース名 |
結果 |
実行時間 |
メモリ |
| 00_sample_00.txt |
AC |
1 ms |
3456 KiB |
| 00_sample_01.txt |
AC |
1 ms |
3456 KiB |
| 00_sample_02.txt |
AC |
1 ms |
3392 KiB |
| 00_sample_03.txt |
AC |
1 ms |
3416 KiB |
| 01_test_00.txt |
AC |
1 ms |
3600 KiB |
| 01_test_01.txt |
AC |
1 ms |
3456 KiB |
| 01_test_02.txt |
AC |
1 ms |
3528 KiB |
| 01_test_03.txt |
AC |
1 ms |
3324 KiB |
| 01_test_04.txt |
AC |
1 ms |
3600 KiB |
| 01_test_05.txt |
AC |
1 ms |
3396 KiB |
| 01_test_06.txt |
AC |
1 ms |
3472 KiB |
| 01_test_07.txt |
AC |
1 ms |
3444 KiB |
| 01_test_08.txt |
AC |
1 ms |
3524 KiB |
| 01_test_09.txt |
AC |
1 ms |
3456 KiB |
| 01_test_10.txt |
AC |
1 ms |
3388 KiB |
| 01_test_11.txt |
AC |
1 ms |
3600 KiB |
| 01_test_12.txt |
AC |
1 ms |
3328 KiB |
| 01_test_13.txt |
AC |
1 ms |
3468 KiB |
| 01_test_14.txt |
AC |
1 ms |
3460 KiB |
| 01_test_15.txt |
AC |
1 ms |
3524 KiB |
| 01_test_16.txt |
AC |
1 ms |
3476 KiB |
| 01_test_17.txt |
AC |
1 ms |
3600 KiB |