浙大五月月赛E：P-norm（输入处理）

最新推荐文章于 2024-07-21 23:30:31 发布

nepaul

最新推荐文章于 2024-07-21 23:30:31 发布

阅读量538

点赞数

文章标签： numbers vector extension output function less

本文链接：https://blog.csdn.net/nepaul/article/details/6382047

版权

P-norm

Time Limit: 2 Seconds Memory Limit: 65536 KB Special Judge

In mathematics, the complex numbers are the extension of the real numbers obtained by adjoining an imaginary unit, denoted i, which satisfies: i²=-1. Every complex number can be written in the form a + bi or (a, b), where a and b are real numbers called the real part and the imaginary part of the complex number, respectively. The absolute value (or modulus or magnitude) of a complex number x = a + bi is defined as |x| = sqrt(a² + b²).

In linear algebra, functional analysis and related areas of mathematics, a norm is a function that assigns a strictly positive length or size to all vectors in a vector space, other than the zero vector. P-norm is the most frequently used norm, let p >= 1 be a real number, x = (x₁ x₂ ... x_n)^T, ||x||_p = (|x₁|^p + |x₂|^p + ... + |x_n|^p)^1/p.

Given two vectors x and y in vector space over complex numbers, you job is to calculate ||x - y||_p.

Input

Two vectors in vector space over complex number. The complexs are in notation (Re,Im), and the vectors are in form "x₁ x₂ ... x_n" in a seperate line where 1 <= n <= 16 is the dimension of the vector and both a and b in x_k = a + bi are in range [-16, 16]. Then a real number p specifies which p-norm we will use, p is in range [1, 16].

Each line contains no more than 256 characters, and the blanks only occur between adjacent complexes.

Output

A number: ||x - y||_p. All answers with either an absolute or relative error of less than 1e-6 are considered correct.

Sample Input

(4,0) (0,0)
(0,0) (0,-3)
2
(1,0) (0,1) (-1,0) (0,-1)
(1,0) (0,-1) (-1,0) (0,1)
1
(1.4142135623730950488016887242097,-1.4142135623730950488016887242097)
(0,0)
3.1415926535897932384626433832795
(1,1)
(0,0)
2.7182818284590452353602874713527

Sample Output

5
4
2
1.4142135623730950488016887242097

题意：

思路：

        题目看懂就不难了，问题是题目看不懂！

学习点：输入处理。

           1、sscanf

           2、。。。

源代码（参考）：

一、sscanf，更倾向于这种。

while (scanf ("%s", str) != EOF)
	{
		sscanf (str, " (%lf,%lf)", &a[0][0], &a[0][1]);
		for (i = 1; ; i++)
		{
			scanf ("%s", str);
			if (str[0] != '(')
			{
				sscanf (str, "%lf", &p);
				break;
			}
			sscanf(str, " (%lf,%lf)", &a[i][0], &a[i][1]);
		}
｝

二、

#include<iostream>
#include<string.h>
#include<algorithm>
#include<stdio.h>
#include<math.h>
using namespace std;
struct node
{
	double x,y;
};
int main()
{
	char ch;
	int alen=0,blen=0,i;
	node ca[1000],cb[1000],cc[1000];
	double p,sum;
	while(scanf("(%lf,%lf)",&ca[alen].x,&ca[alen].y)!=EOF){
		alen++;
		for(;ch=getchar(),ch!='/n';alen++){
			scanf("(%lf,%lf)",&ca[alen].x,&ca[alen].y);
		}
		scanf("(%lf,%lf)",&cb[blen].x,&cb[blen].y);
		blen++;
		for(;ch=getchar(),ch!='/n';blen++){
			scanf("(%lf,%lf)",&cb[blen].x,&cb[blen].y);
		}
		scanf("%lf",&p);
		getchar();
		for(i=0;i<alen;i++){
			cc[i].x=ca[i].x-cb[i].x;
			cc[i].y=ca[i].y-cb[i].y;
		}
		sum=0;
		for(i=0;i<alen;i++){
			sum+=sqrt(pow(cc[i].x*cc[i].x+cc[i].y*cc[i].y,p));
		}
		sum=pow(sum,1.0/p);
		printf("%.7lf/n",sum);
		alen=0;blen=0;
	}
}