- int main(){
- int m,x,y;
- scanf("%d%d%d",&m,&x,&y);
- for(int i=9;i>0;i--){
- for(int j=9;j>=0;j--){
- int jia=i*10+j,yi=j*10+i;
- if(fabs(jia-yi)*y==x*yi){
- //fabs() 为求浮点数 的函数
- double bing=1.0*yi/y;
- string s1=jia>m?"Cong":(jia==m?"Ping":"Gai");
- string s2=yi>m?"Cong":(yi==m?"Ping":"Gai");
- string s3=bing>m?"Cong":(bing==m?"Ping":"Gai");
- cout<<jia<<s1<<s2<<s3;
- return 0;
- }
- }
- }
- cout<<"No Solution";
- return 0;
- }
- //4
- #include<bits/stdc++.h>
- using namespace std;
- int main(){
- int n;
- scanf("%d",&n);
- vector<int> v(n+1);
- for(int i=1;i<=n;i++)
- scanf("%d",&v[i]);
- for(int i=1;i<=n;i++){
- for(int j=i+1;j<=n;j++){
- vector<int> lie,a(n+1,1);
- a[i]=a[j]=-1;
- for(int k=1;k<=n;k++)
- if(v[k]*a[abs(v[k])]<0) lie.push_back(k);
- if(lie.size()==2&&a[lie[0]]+a[lie[1]]==0){
- printf("%d %d",i,j);
- return 0;
- }
- }
- }
- cout<<"No Solution";
- return 0;
- }
- //5
- #include<bits/stdc++.h>
- using namespace std;
- int main(){
- int n,k,t1,t2;
- map<int,vector<int>> m;
- scanf("%d%d",&n,&k);
- for(int i=0;i<n;i++){
- scanf("%d%d",&t1,&t2);
- m[t1].push_back(t2);
- m[t2].push_back(t1);
- }
- while(k--){
- int cnt,flag=0,a[100000]={
- 0
- };
- scanf("%d",&cnt);
- vector<int>v(cnt);
- for(int i=0;i<cnt;i++){
- scanf("%d",&v[i]);
- a[v[i]]=1;
- }
- for(int i=0;i<v.size();i++)
- for(int j=0;j<m[v[i]].size();j++)
- if(a[m[v[i]][j]]==1) flag=1;
- printf("%s\n",flag?"No":"Yes");
- }
- return 0;
- }
来源: http://www.bubuko.com/infodetail-2970972.html