UVa 10193 - All You Need Is Love

题目：判断两个2进制的串是否互质。

分析：数论。首先，将两数装化成十进制；然后，计算gcd即可。

说明：好几天没刷题了╮(╯▽╰)╭，有点不习惯。

#include <iostream>
#include <cstdlib>
#include <cstdio>

using namespace std;

char buf[32];

int gcd( int a, int b )
{
	return (a%b)?gcd(b,a%b):b;
} 

int main()
{
	int n,A,B;
	while ( scanf("%d",&n) != EOF ) 
	for ( int i = 1 ; i <= n ; ++ i ) {
		scanf("%s",buf);
		A = 0;
		for ( int j = 0 ; buf[j] ; ++ j ) {
			A <<= 1;
			A += buf[j]-'0';
		}
		scanf("%s",buf);
		B = 0;
		for ( int j = 0 ; buf[j] ; ++ j ) {
			B <<= 1;
			B += buf[j]-'0';
		}	
		printf("Pair #%d: ",i);
		if ( gcd( A, B ) != 1 )
			printf("All you need is love!\n");
		else printf("Love is not all you need!\n");	
	}
	return 0;
}