competitive programming

(for (int i=0;i<n;++i){)

for (int i=0;i<n;++i){

(while (1){)

while (1){

(using namespace std;)

using namespace std;

(int n; cin >> n;)

int n; cin >> n;

(cout << -1 << '\n';)

cout << -1 << '\n';

(cout << (ok?"yes":"no") << '\n';)

cout << (ok?"yes":"no") << '\n';

(else if)

else if

(vector<int> a(n); cin >> a;)

vector<int> a(n); cin >> a;

(for (;t--;){)

for (;t--;){

(dp[i+1][j+1]+=dp[i][j]*2;)

dp[i+1][j+1]+=dp[i][j]*2;

(using mint=modint<mod>;)

using mint=modint<mod>;

(cout << fixed << setprecision(10);)

cout << fixed << setprecision(10);

(vector<vector<int>> s(n);)

vector<vector<int>> s(n);

(const int max_n=100010;)

const int max_n=100010;

(auto dfs=[&](auto self)->void{)

auto dfs=[&](auto self)->void{

(while (!pq.empty()){)

while (!pq.empty()){

(sort(all(v));)

sort(all(v));

(cout << ans << '\n';)

cout << ans << '\n';

(void solve(){)

void solve(){

(assert(check(ans));)

assert(check(ans));