by 引领天下 @ 2019-04-25 18:42:07
```cpp
include<bits/stdc++.h>
using namespace std;
int main() { int n,g,l,k[10000][3],pd[10000];
memset(k,0,sizeof(k));
memset(pd,0,sizeof(pd));
cin>>n>>l>>g;
for(int i=1;i<=n;i++)
{
cin>>k[i][1]>>k[i][2];
}
for(int i=1;i<=n;i++)
{
if(k[i][1]<l || k[i][2]<l)
{
cout<<"Too Young"<<endl;
k[i][1]=-1,k[i][2]=-1;
}
}
for(int i=1;i<=n;i++)
{
while(k[i][1]>l || k[i][2]>l)
{
k[i][1]/=2;
k[i][2]/=2;
}
}
for(int i=1;i<=n;i++)
{
if(k[i][1]==k[i][2] && (k[i][1]!=-1 && k[i][2]!=-1))
{
cout<<"Sometimes Naive"<<endl;
}
if(k[i][1]!=k[i][2] && (k[i][1]!=-1 && k[i][2]!=-1))
{
cout<<"Too Simple"<<endl;
}
}
return 0;
}
```
by Shui_Dream @ 2019-04-25 18:47:34
帮你一下
by Shui_Dream @ 2019-04-25 18:47:54
@[哲学濠](/space/show?uid=137383) 不用那么复杂吧
by Shui_Dream @ 2019-04-25 18:49:08
@[哲学濠](/space/show?uid=137383)
```cpp
#include<bits/stdc++.h>
using namespace std;
int n,l,g,a,b;
int main()
{
cin>>n>>l>>g;
for(int i=1;i<=n;i++)
{
cin>>a>>b;
while(a>g || b>g)
{
a/=2;
b/=2;
}
if(a<l || b<l) cout<<"Too Young";
else if(a>=l && b>=l && a!=b) cout<<"Too Simple";
else cout<<"Sometimes Naive";
cout<<"\n";
}
return 0;
}
```
这是我的程序
by Shui_Dream @ 2019-04-25 18:51:31
我靠14黑1蓝?
by skydogli @ 2019-04-25 18:55:30
1紫2蓝。。
by skydogli @ 2019-04-25 18:56:09
抄题解请自重
by 小粉兔 @ 2019-04-25 19:11:40
抄袭确认：
[P4249提交记录](https://www.luogu.org/recordnew/show/12458896) 第一篇题解
[P4630提交记录](https://www.luogu.org/recordnew/show/12458377) 第一篇题解
by wxwoo @ 2019-04-25 19:38:58