UVALive 4874 进制转换
2011-07-29 20:57
267 查看
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cctype>
#include <cstdlib>
#define MAX 10000
using namespace std;
int M,N;
int B;
int x[MAX];
int y[MAX];
int To_B(int n,int a[])
{
//cout<<"***\n";
int count = 0;
while(1)
{
a[count++] = n % B;
n /= B;
if(n == 0) break;
}
// cout<<count<<endl;
return count;
}
int deal()
{
//cout<<"deal\n";
int len1 = To_B(M,x);
int len2 = To_B(N,y);
int temp[MAX];
memset(temp,0,sizeof(temp));
int i,cc = 0;
for( i = 0;i < len1 || i < len2;i++)
temp[cc++] = (x[i]+y[i])%B;
int r = 0;
int ff = 1;
for(int k = 0;k < cc;k++)
{
r += temp[k] * ff;
ff *= B;
}
return r;
}
int main()
{
freopen("in.in","r",stdin);
int test_case;
cin>>test_case;
while(test_case--)
{
int cas;
cin>>cas;
cout<<cas<<" ";
cin>>B>>M>>N;
memset(x,0,sizeof(x));
memset(y,0,sizeof(y));
int temp = deal();
cout<<temp<<endl;
}
return 0;
}
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cctype>
#include <cstdlib>
#define MAX 10000
using namespace std;
int M,N;
int B;
int x[MAX];
int y[MAX];
int To_B(int n,int a[])
{
//cout<<"***\n";
int count = 0;
while(1)
{
a[count++] = n % B;
n /= B;
if(n == 0) break;
}
// cout<<count<<endl;
return count;
}
int deal()
{
//cout<<"deal\n";
int len1 = To_B(M,x);
int len2 = To_B(N,y);
int temp[MAX];
memset(temp,0,sizeof(temp));
int i,cc = 0;
for( i = 0;i < len1 || i < len2;i++)
temp[cc++] = (x[i]+y[i])%B;
int r = 0;
int ff = 1;
for(int k = 0;k < cc;k++)
{
r += temp[k] * ff;
ff *= B;
}
return r;
}
int main()
{
freopen("in.in","r",stdin);
int test_case;
cin>>test_case;
while(test_case--)
{
int cas;
cin>>cas;
cout<<cas<<" ";
cin>>B>>M>>N;
memset(x,0,sizeof(x));
memset(y,0,sizeof(y));
int temp = deal();
cout<<temp<<endl;
}
return 0;
}
相关文章推荐
- Kejin Game UVALive - 7264 拆点+最小割 15北京区域赛
- UVALIVE 4819 最大流
- 【UVALive】2037 - Digital Rivers(找规律,暴力)
- UVALive 3263 That Nice Euler Circuit
- UVALive - 4329 Ping pong
- UVALive - 5798
- UVALive 2034 Hot or Cold?【数学】
- DP->UVALive 4764
- UVALive6886 Golf Bot[FFT]
- UVALive 2957 Bring Them There(拆点+最大流)
- UVaLive3942
- UVALive 6571 It Can Be Arranged
- UVAlive 3662 Another Minimum Spanning Tree 莫队算法,曼哈顿最小生成树
- UVAlive 4857 - Halloween Costumes 区间dp
- UVALive 6663 Count the Regions 离散+bfs染色_(:зゝ∠)_
- UVALive - 7163
- UVALive5796点双联通分量or边双联通分量
- UVALive - 3942 Remember the Word Trie
- UVALive 2995 Image Is Everything 策略问题
- UVALive3211- Now or later(二分+2-SAT)