zoukankan      html  css  js  c++  java
  • Codeforce-A-Two distinct points(暴力)

    output

    standard output

    You are given two segments [l1;r1][l1;r1] and [l2;r2][l2;r2] on the xx-axis. It is guaranteed that l1<r1l1<r1 and l2<r2l2<r2. Segments may intersect, overlap or even coincide with each other.

    The example of two segments on the xx-axis.

    Your problem is to find two integers aa and bb such that l1≤a≤r1l1≤a≤r1, l2≤b≤r2l2≤b≤r2 and a≠ba≠b. In other words, you have to choose two distinct integer points in such a way that the first point belongs to the segment [l1;r1][l1;r1] and the second one belongs to the segment [l2;r2][l2;r2].

    It is guaranteed that the answer exists. If there are multiple answers, you can print any of them.

    You have to answer qq independent queries.

    Input

    The first line of the input contains one integer qq (1≤q≤5001≤q≤500) — the number of queries.

    Each of the next qq lines contains four integers l1i,r1i,l2il1i,r1i,l2i and r2ir2i (1≤l1i,r1i,l2i,r2i≤109,l1i<r1i,l2i<r2i1≤l1i,r1i,l2i,r2i≤109,l1i<r1i,l2i<r2i) — the ends of the segments in the ii-th query.

    Output

    Print 2q2q integers. For the ii-th query print two integers aiai and bibi — such numbers that l1i≤ai≤r1il1i≤ai≤r1i, l2i≤bi≤r2il2i≤bi≤r2i and ai≠biai≠bi. Queries are numbered in order of the input.

    It is guaranteed that the answer exists. If there are multiple answers, you can print any.

    Example

    input

    Copy

    5
    1 2 1 2
    2 6 3 4
    2 4 1 3
    1 2 1 3
    1 4 5 8
    

    output

    Copy

    2 1
    3 4
    3 2
    1 2
    3 7

    代码:

    #include<cstdio>
    #include<cstring>
    #include<iostream>
    #include<algorithm>
    
    using namespace std;
    
    int main()
    {
    	int n;
    	cin>>n;
    	int l1,r1,l2,r2;
    	for(int t=0;t<n;t++)
    	{
    		scanf("%d%d%d%d",&l1,&r1,&l2,&r2);
    		int fi=l1;
    		int se;
    		for(int t=l2;t<=r2;t++)
    		{
    			if(t!=fi)
    			{
    				se=t;
    				break;
    			}
    		}
    		cout<<fi<<" "<<se<<endl;
    	}
    	
    	return 0;
    }
  • 相关阅读:
    ADB server didn't ACK * failed to start daemon *
    老调重弹:年龄大了,码农何去何从(转)
    HR给应届生的黄金面试技巧
    Android自动开关机实现
    [Android实例] Android ShakeDetector(摇晃检测)教程详解
    Hadoop : MapReduce中的Shuffle和Sort分析
    获得和裁剪图片
    android bitmap compress(图片压缩)
    知识签名(signature of knowledge)
    SVN安装(eclipse)
  • 原文地址:https://www.cnblogs.com/Staceyacm/p/10781831.html
Copyright © 2011-2022 走看看