Submission #984142

#TimeUsernameProblemLanguageResultExecution timeMemory
984142ASGA_RedSea코알라 (APIO17_koala)C++17
0 / 100
1 ms356 KiB
/**
 
                                    * بسم الله الرحمن الرحيم *
 
                ﴾ رَبِّ اشْرَحْ لِي صَدْرِي * وَيَسِّرْ لِي أَمْرِي * وَاحْلُلْ عُقْدَةً مِّن لِّسَانِي * يَفْقَهُوا قَوْلِي ﴿
 
*/
 
/// author : "ASGA"
 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
 

void playRound(int b[],int r[]);
 
int minValue(int n,int w){
    return 0;
}
 
int maxValue(int n,int w){
    return --n;
}
 
bool greaterValue(int n,int w){
    int b[n]{},r[n]{};
    b[0] = w - 1;
    playRound(b,r);
    return (r[0] != w);
}
 
void allValues(int n,int w,int p[]){
    for(int i = 0;i < n;i++)p[i] = i + 1;
}
#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...