1164 : Circle Intersection

时间限制Time Limit 1 秒Sec 内存限制Memory Limit 128 兆MB 提交次数Submitted 376 次Times 通过次数Solved 72 次Times

特判评测 Special

读写方式与标准评测相同。答案可能不唯一，是否正确由本题的特判程序判定，输出格式以题面为准。 I/O is the same as standard judge. Several outputs may be valid; this problem’s special judge decides correctness. Follow the output format in the statement.

输入Input	标准输入。Standard input.
输出Output	标准输出，格式以题面为准。Standard output; format as specified in the statement.

模板Template

C++ C Java Python

#include <iostream>
using namespace std;
int main() {
    int a, b;
    cin >> a >> b;
    cout << (a + b) << endl;
    return 0;
}

#include <stdio.h>
int main() {
    int a, b;
    scanf("%d%d", &a, &b);
    printf("%d\n", a + b);
    return 0;
}

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int a = in.nextInt();
        int b = in.nextInt();
        System.out.println(a + b);
    }
}

a, b = map(int, input().split())
print(a + b)

题目描述Description

Calculate the length of the intersection of two circles in 3D space.

输入格式Input

There are no more than 10000 test cases. For each test case two lines of integer numbers are given, describing the two circles in 3D space respectively.

A circle in 3D space is described by 7 integer numbers – its radius r and two 3D coordinates. The first coordinate (x₁, y₁, z₁) is its center, while the second (x₂, y₂, z₂) represents the normal vector of the plane where the circle lies.

It is guaranteed that the two circles given are not parallel or coplanar.

1 ≤ r ≤ 10000, all the other input integers are in range [−10000,10000].

输出格式Output

Each case one line, the lengh of the intersection. The error between the result and the answer should not exceed 10⁻⁵.

CSGCPC

1164 : Circle Intersection

题目描述Description

输入格式Input

输出格式Output

样例Sample

出题Author

来源Source