# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1151787 | Muhammad_Aneeq | Light Bulbs (EGOI24_lightbulbs) | C++20 | 0 ms | 408 KiB |
/*
بسم الله الرحمن الرحيم
Author:
(:Muhammad Aneeq:)
*/
#include <iostream>
#include <vector>
#include <algorithm>
#warning check the output
using namespace std;
inline void solve()
{
int n;
cin>>n;
int gr[n][n]={};
vector<int>ind;
for (int i=0;i<n;i++)
ind.push_back(i);
int z=0;
do
{
for (int i=0;i<n;i++)
for (int j=0;j<n;j++)
gr[i][j]=0;
for (int i=0;i<n;i++)
gr[i][ind[i]]=1;
cout<<"? ";
for (int i=0;i<n;i++)
{
for (int j=0;j<n;j++)
cout<<gr[i][j];
cout<<endl;
}
int z;
cin>>z;
if (z==n*n)
{
cout<<"! ";
for (int i=0;i<n;i++)
{
for (int j=0;j<n;j++)
cout<<gr[i][j];
cout<<endl;
}
return;
}
}
while(next_permutation(begin(ind),end(ind)));
}
int main()
{
int t=1;
for (int i=1;i<=t;i++)
{
solve();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |