#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
#define EPS 1e-7
int main()
{
	double a,b,c; //不要用 float,精度不够
	scanf("%lf%lf%lf",&a,&b,&c);
	double tmp = b*b - 4*a*c;
	if( tmp < EPS && tmp > - EPS)
		printf("x1=x2=%.5f",(-b)/(2*a)+EPS);  // + EPS是为了防止出现 -0.00000 
	else if( tmp > EPS) {
		double x1 = (-b+sqrt(tmp))/(2*a);
		double x2 = (-b-sqrt(tmp))/(2*a)+EPS;
		if( x1 - x2 > EPS)
			printf("x1=%.5f;x2=%.5f",x1+EPS,x2+EPS);
		else
			printf("x1=%.5f;x2=%.5f",x2+EPS,x1+EPS);
	}
	else {
		
		printf("x1=%.5f+%.5fi;x2=%.5f-%.5fi",(-b)/(2*a)+EPS,sqrt(-tmp)/(2*a)+EPS,(-b)/(2*a)+EPS,sqrt(-tmp)/(2*a)+EPS);
	}
	return 0;
}

 

#include <iostream>
//#include <iomanip>
#include <cstdio>
using namespace std;
const int MX = 110;
short a[MX][MX];  //0-255 so 采用short
short b[MX][MX];
int main()
{
	freopen("f:\\MOOC c++\\week5\\8167.txt", "r", stdin);
	int n,m;
	cin >> n >> m;
	for(int i = 1;i <= n; ++i)
		for(int j = 1; j <= m; ++j )  {
			cin >> a[i][j];
			b[i][j] = a[i][j];
		}
	for(int i = 1;i <= n; ++i)
		for(int j = 1; j <= m; ++j ) {
			if( i > 1 && i < n && j > 1 && j < m) {
				int sum = a[i][j] + a[i-1][j] + a[i+1][j]+a[i][j-1]+a[i][j+1];
				int v = sum / 5;
				//rounding ~~~~
				double f = (double)sum / 5;
				if( f - v - 0.5 > 1e-6)
					++v;

				b[i][j] = v;
			}
		}
	for(int i = 1;i <= n; ++i) {
		for(int j = 1; j <= m; ++j ) 
			cout << b[i][j] << " ";
		cout << endl;
	}
	return 0;
}

#include<iostream>
using namespace std;

int gcd(int a, int b)
{
	if (a % b == 0)
		return b;
	return gcd(b,a%b);
}

int main()
{
	freopen("f:\\freopen.txt", "r", stdin);
	int x, y;
	cin >> x >> y;
	cout << gcd(y, x) << endl;
	return 0;
}

 

#include <iostream>
using namespace std;
int bitManipulation1(int n, int m, int i) {
	return ((n&~(1<<i))|((m>>i)&1)<<i);
}
int main() {
	freopen("f:\\freopen.txt", "r", stdin);
	int n, m, i, t;
	cin >> t;
	while (t--) {
		cin >> n >> m >> i;
		cout << bitManipulation1(n, m, i) << endl;
	}
	return 0;
}

 

 

#include <iostream>
using namespace std;

int bitManipulation2(int n, int i) {
	return (n&~(1 << i))&(~(((n >> i) & 1) << i));
	return n ^ (~0 << (32 - i));
}

int main() {
	freopen("f:\\freopen.txt", "r", stdin);
	int t, n, i;
	cin >> t;
	while (t--) {
		cin >> n >> i;
		cout << bitManipulation2(n, i) << endl;
	}
	return 0;
}