# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
737098 | ibm2006 | Present (RMI21_present) | C++14 | 556 ms | 35336 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll n,i,x,y,t,j,a[110000],m,k;
vector<ll> v,u[1100000],q;
ll gcd(ll x,ll y)
{
if(x>y)
x^=y^=x^=y;
if(y%x==0)
return x;
return gcd(y%x,x);
}
int main()
{
for(i=0;1;i++)
{
if(t==100001)
break;
v.clear();
q.clear();
x=i; y=0;
while(x>0)
{
v.push_back(x%2);
if(x%2==1)
q.push_back(y+1);
x/=2;
y++;
}
for(j=y-1;j>=0;j--)
{a[j+1]=v[j]; /*printf("%lld:%lld ",j+1,a[j+1]);*/ }
if(i==0)
{
u[t]=q;
t++;
continue;
}
for(j=1;j<=y;j++)
for(k=j+1;k<=y;k++)
{
if(a[j]==0||a[k]==0)
continue;
if(a[gcd(j,k)]==0)
{
x=-1;
// printf("!");
break;
}
}
//printf("%lld %lld\n",i,x);
if(x==0)
{
u[t]=q;
t++;
continue;
}
}
//printf("!");
//return 0;
scanf("%lld",&n);
for(i=1;i<=n;i++)
{
scanf("%lld",&x);
printf("%lld ",u[x].size());
m=u[x].size();
for(j=0;j<m;j++)
printf("%lld ",u[x][j]);
printf("\n");
}
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |