From 56a296a51e95cf2b3164d15287f5ad445d167db6 Mon Sep 17 00:00:00 2001
From: Aditya Naik
Date: Thu, 10 May 2018 00:17:38 -0400
Subject: more reorg

---
 average/average.cpp | 119 ----------------------------------------------------
 1 file changed, 119 deletions(-)
 delete mode 100644 average/average.cpp

(limited to 'average/average.cpp')

diff --git a/average/average.cpp b/average/average.cpp
deleted file mode 100644
index 5627b61..0000000
--- a/average/average.cpp
+++ /dev/null
@@ -1,119 +0,0 @@
-#include <iostream>
-#include <cmath>
-#include <iomanip>
-using namespace std;
-
-int find_gcd(int a, int b);
-void printer(int c, int q, int num, int deno);
-
-int main(){
-    int n, cnum=0;
-    cin>>n;
-    
-    while(n>0){
-	cnum++;
-	int nm, sum=0;
-	for(int i=0; i<n; i++){
-	    cin>>nm;
-	    sum += nm;
-	}
-	int gcd;	
-	int deno, num, q;
-	if(abs(sum)>=n){
-	    if(sum % n == 0){
-		num = sum/n;
-		deno = 0;
-		q = 0;
-	    }
-	    else{
-		gcd = find_gcd(sum,n);
-		while(gcd != 1){
-		    sum /= gcd;
-		    n /= gcd;
-		    gcd = find_gcd(sum,n);	    
-		}
-		q = (sum-(sum%n))/n;
-		num = sum%n;
-		deno = n;
-	    }
-	}
-	else{ //abs(sum)<n
-	    gcd = find_gcd(n,sum);
-	    while(gcd != 1){
-		sum /= gcd;
-		n /= gcd;
-		gcd = find_gcd(n,sum);	    
-	    }
-	    q = 0;
-	    num = sum;
-	    deno = n;
-	}
-	printer(cnum, q, num, deno);
-        cin >> n;
-	
-    }
-}
-
-void printer(int c, int q, int num, int deno){
-    int dl=0, ql=0, nl=0, x=deno, y=q, z = num;
-    while (x /= 10)
-	dl++;
-    while(y /= 10)
-	ql++;
-    while(z /= 10)
-	nl++;
-    if(deno == 1 || deno == 0){
-	if(num<0)
-	    cout<<"Case "<<c<<":\n"<<"- "<<abs(num)<<endl;
-	else
-	    cout<<"Case "<<c<<":\n"<<num<<endl;
-    }
-    else if(q == 0){
-	if(num<0 || deno<0){
-	    cout<<"Case "<<c<<":\n";
-	    for(int k=0;k<dl+2;k++) cout<<" ";	    
-	    cout<<abs(num)<<endl;
-	    cout<<"- ";
-	    for(int k=0;k<dl+1;k++) cout<<"-";	    
-	    cout<<endl;
-	    cout<<"  "<<abs(deno)<<endl;	    
-	}
-	else{
-	    cout<<"Case "<<c<<":\n";
-	    for(int k=0;k<dl;k++) cout<<" ";	    
-	    cout<<abs(num)<<endl;
-	    for(int k=0;k<dl+1;k++) cout<<"-";	    
-	    cout<<endl;
-	    cout<<abs(deno)<<endl;
-	}
-    }
-    else{
-	if(num<0 || deno<0){
-	    cout<<"Case "<<c<<":\n";
-	    for(int k=0;k<dl+2+ql-nl+1;k++) cout<<" ";	    
-	    cout<<abs(num)<<endl;
-	    cout<<"- "<<abs(q);
-	    for(int k=0;k<dl+1;k++) cout<<"-";	    
-	    cout<<endl;
-	    for(int k=0;k<3+ql;k++) cout<<" ";	    	    
-	    cout<<abs(deno)<<endl;
-	}
-	else{
-	    cout<<"Case "<<c<<":\n";
-	    for(int k=0;k<dl+1+ql-nl;k++) cout<<" ";	    
-	    cout<<num<<endl;
-	    cout<<q;
-	    for(int k=0;k<dl+1;k++) cout<<"-";	    
-	    cout<<endl;
-	    for(int k=0;k<2+ql-1;k++) cout<<" ";	    	    
-	    cout<<deno<<endl;
-	}
-    }
-}
-
-int find_gcd(int a, int b){
-    if(b==0)
-	return a;
-    else
-	return find_gcd(b, a % b);
-}
-- 
cgit v1.2.3