import java.io.*; import java.util.*; import java.math.*; class Main{ void sol() { Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in))); while(in.hasNext()) { String a=in.next(); String b=in.next(); BigInteger b1,b2; boolean f=false; for(int i=2; i<=36; i++) { try{ b1=new BigInteger(a,i); } catch(Exception e) { continue; } for(int j=2; j<=36; j++) { try{ b2= new BigInteger(b,j); } catch(Exception e) { continue; } if(b1.compareTo(b2)==0){ f=true; System.out.println(a + " (base " + i + ") = " + b + " (base " + j + ")"); break; } } if(f) break; } if(!f) System.out.println(a + " is not equal to " + b + " in any base 2..36"); } } public static void main(String args[]) { Main uva343 = new Main(); uva343.sol(); } }
Wednesday, November 2, 2016
UVa 343
UVa 10302
#include<bits/stdc++.h> #define ll long long using namespace std; int main() { ll a[50005]; a[1]=1; for(ll i=2; i<=50005; i++) { a[i]=a[i-1]+(i*i*i); } ll n; while(cin>>n) { cout<<a[n]<<endl; } return 0; }
UVa 392
#include<bits/stdc++.h> #define M 9 using namespace std; int main() { int a[M],fr,i; while(cin>>a[0]) { for(i=1;i<M;i++) cin>>a[i]; fr=8; for(i=0;i<M;i++) if(a[i]!=0) { fr=i; break; } if(fr==8) cout<<a[fr]; else { if(a[fr]==-1) cout<<"-"; else if(a[fr]==1) cout<<""; else cout<<a[fr]; cout<<"x"; if(fr!=7) cout<<"^"<<8-fr; for(i=fr+1;i<M;i++) if(a[i]!=0) { if(a[i]<0) cout<<" - "; else cout<<" + "; if((a[i]!=-1 && a[i]!=1) || i==8) { if(a[i]<0) cout<<a[i]*(-1); else cout<<a[i]; } if(i!=8) cout<<"x"; if(i!=7 && i!=8) cout<<"^"<<8-i; } } cout<<endl; } return 0; }
Subscribe to:
Posts (Atom)