#include<bits/stdc++.h> using namespace std; int digit(int x); int main() { char name1[30] , name2[30], n1[30],n2[30]; int j=0, k=0; float num=0,num1=0,digit1=0,digit2=0; float mean=0; while(gets(name1)) { gets(name2); for(int i=0; i<strlen(name1); i++) { name1[i]=tolower(name1[i]); if(isalpha(name1[i])>0) { n1[j]=name1[i]; j++; } } n1[j]='\0'; j=0; for(int i=0; i<strlen(name2); i++) { name2[i]=tolower(name2[i]); if(isalpha(name2[i])>0) { n2[k]=name2[i]; k++; } } n2[k]='\0'; k=0; for(int i=0; i<strlen(n1); i++) { if(n1[i]=='a') num+=1; else if(n1[i]=='b') num+=2; else if(n1[i]=='c') num+=3; else if(n1[i]=='d') num+=4; else if(n1[i]=='e') num+=5; else if(n1[i]=='f') num+=6; else if(n1[i]=='g') num+=7; else if(n1[i]=='h') num+=8; else if(n1[i]=='i') num+=9; else if(n1[i]=='j') num+=10; else if(n1[i]=='k') num+=11; else if(n1[i]=='l') num+=12; else if(n1[i]=='m') num+=13; else if(n1[i]=='n') num+=14; else if(n1[i]=='o') num+=15; else if(n1[i]=='p') num+=16; else if(n1[i]=='q') num+=17; else if(n1[i]=='r') num+=18; else if(n1[i]=='s') num+=19; else if(n1[i]=='t') num+=20; else if(n1[i]=='u') num+=21; else if(n1[i]=='v') num+=22; else if(n1[i]=='w') num+=23; else if(n1[i]=='x') num+=24; else if(n1[i]=='y') num+=25; else if(n1[i]=='z') num+=26; } for(int i=0; i<strlen(n2); i++) { if(n2[i]=='a') num1+=1; else if(n2[i]=='b') num1+=2; else if(n2[i]=='c') num1+=3; else if(n2[i]=='d') num1+=4; else if(n2[i]=='e') num1+=5; else if(n2[i]=='f') num1+=6; else if(n2[i]=='g') num1+=7; else if(n2[i]=='h') num1+=8; else if(n2[i]=='i') num1+=9; else if(n2[i]=='j') num1+=10; else if(n2[i]=='k') num1+=11; else if(n2[i]=='l') num1+=12; else if(n2[i]=='m') num1+=13; else if(n2[i]=='n') num1+=14; else if(n2[i]=='o') num1+=15; else if(n2[i]=='p') num1+=16; else if(n2[i]=='q') num1+=17; else if(n2[i]=='r') num1+=18; else if(n2[i]=='s') num1+=19; else if(n2[i]=='t') num1+=20; else if(n2[i]=='u') num1+=21; else if(n2[i]=='v') num1+=22; else if(n2[i]=='w') num1+=23; else if(n2[i]=='x') num1+=24; else if(n2[i]=='y') num1+=25; else if(n2[i]=='z') num1+=26; } if(num!=0){ digit1=digit(num); digit2=digit(num1); if(digit1>digit2) mean=(digit2*100)/digit1; else mean=(digit1*100)/digit2; printf("%.2f %%\n",mean); } else{ mean=0; printf("%.2f %%\n",mean); } num=0,num1=0,digit1=0,digit2=0,mean=0; } return 0; } int digit(int x) { int num=x,sum=0,digit=0; if(num<10) return (x); else{ while(num>9){ sum=0; while(num>0){ digit=num%10; num/=10; sum+=digit; } num=sum; } return (num); sum=0; digit=0; } }
I have stored my online judge solutions of my own :)
Tuesday, February 16, 2016
UVA 10424 - Love Calculator
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment