uva 128（简单题）

题意：求一个字符串转化为2进制右移十六位加上一个数整除34943为零。

思路：转化为大数求余数。

代码如下：

/**************************************************
 * Author     : xiaohao Z
 * Blog     : http://www.cnblogs.com/shu-xiaohao/
 * Last modified : 2014-03-25 08:21
 * Filename     : uva_128.cpp
 * Description     : 
 * ************************************************/

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#define MP(a, b) make_pair(a, b)
#define PB(a) push_back(a)

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<unsigned int,unsigned int> puu;
typedef pair<int, double> pid;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;

const int INF = 0x3f3f3f3f;
const double eps = 1E-6;
const int LEN = 1010;
char str[LEN], ch[] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F'}, ans[LEN];

void out(ll num){
    memset(ans, '0', sizeof ans);
    for(int i=3; num; i--){
        ans[i] = ch[num%16];
        num /= 16;
    }
}

int main()
{
//    freopen("in.txt", "r", stdin);

    while(gets(str)){
        if(str[0] == '#') break;
        int len = strlen(str);
           ll cs = 0;
        for(int i=0; i<len; i++){
            cs <<= 8;
            cs += str[i];
            cs %= 34943;
        }
        cs <<= 16;
        cs %= 34943;
        cs = 34943 - cs;
        cs %= 34943;
        out(cs);
        for(int i=0; i<=1; i++) cout << ans[i];
        cout << ' ';
        for(int i=2; i<=3; i++) cout << ans[i];
        cout << endl;
    }
    return 0;
}