【數學1】基礎數學問題 洛谷題單 p1
阿新 • • 發佈:2020-07-10
P1143 進位制轉換
程式碼如下:
#include<bits/stdc++.h> #define mem(a) memset(a,0,sizeof(a)) #define forn(i,n) for(int i=0;i<n;++i) #define for1(i,n) for(int i=1;i<=n;++i) #define IO std::ios::sync_with_stdio(false); std::cin.tie(0) #define ll long long #define inf 0x3f3f3f3f #define lowbit(x) x&(-x) usingnamespace std; const int maxn=1e3+5; int n,t,m; int num[maxn][maxn]; string str; int change(string s) { int res=0; int k=1; for(int i=str.size()-1;i>=0;--i) { if(str[i]<=57&&str[i]>=48) { res+=(str[i]-48)*k; k*=n; }if(str[i]<=70&&str[i]>=65) { res+=(str[i]-65+10)*k; k*=n; } } return res; } char deal(int x) { if(x<10) return '0'+x; else return 'A'+x-10; } void rechange(int k) { if(!k) return; rechange(k/m); putchar(deal(k%m)); } int main() { cin>>n; cin>>str; cin>>m; int x = change(str); rechange(x); cout<<endl; return 0; }
P1469 找筷子
程式碼如下:
#include<bits/stdc++.h> #define mem(a) memset(a,0,sizeof(a)) #define forn(i,n) for(int i=0;i<n;++i) #define for1(i,n) for(int i=1;i<=n;++i) #define IO std::ios::sync_with_stdio(false); std::cin.tie(0) #define ll long long #define inf 0x3f3f3f3f #define lowbit(x) x&(-x) using namespace std; const int maxn=1e3+5; int n,t,m; int num[maxn][maxn]; int main() { scanf("%d",&n); forn(i,n) { scanf("%d",&t); m^=t; } printf("%d\n",m); return 0; }
P1100 高低位交換
程式碼如下:
#include<bits/stdc++.h> #define mem(a) memset(a,0,sizeof(a)) #define forn(i,n) for(int i=0;i<n;++i) #define for1(i,n) for(int i=1;i<=n;++i) #define IO std::ios::sync_with_stdio(false); std::cin.tie(0) #define ll long long #define inf 0x3f3f3f3f #define lowbit(x) x&(-x) using namespace std; const int maxn=1e3+5; ll n,t,m; ll low=65535; //2^16-1 int main() { scanf("%d",&n); t=n; t=t&low; n=n-t; n=n>>16; t=t<<16; m=t+n; printf("%lld\n",m); return 0; }