wps for linux 無法啟動

 
安裝完wps後，產生：error while loading shared libraries: libgthread-2.0.so.0: cannot open shared object file: No such file or directory

Step 1. 
因為wps是32bit的系統，所以要安裝32的library
sudo apt-get install ia32-libs

缺少的字體文件：
下載：http://bbs.wps.cn/thread-22355435-1-1.html
之後複製到:~/.fonts 或 /usr/share/fonts/wps-office

參考自：http://blog.sina.com.cn/s/blog_6c9d65a10101adlw.html

c033: Prime Cuts、UVA 406

#include<stdio.h>

int primes[] = {1,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997} ;

int main(){
    int N, C ;
    int i ;

    while(scanf("%d %d", &N, &C)==2){
        int count = 0 ;
        for(i=0 ; i<sizeof(primes)/sizeof(int) ; ++i){
            if(primes[i]<=N) count++ ;
            else break ;
        }
        int C_new = (count%2 ? 2*C-1 : 2*C ) ;
        int low, high ;
        if(C_new>count) {
            low = 0, high = count-1 ;
        }
        else{
            if(count%2){
                int mid = count/2 ;
                low = mid-(C-1) ;
                high = mid+(C-1) ;
            }
            else{
                int mid1 = count/2-1 ;
                int mid2 = count/2 ;
                low = mid1-(C-1) ;
                high = mid2+(C-1) ;
            }
        }
        printf("%d %d:", N, C) ;
        for(i=low ; i<=high ; ++i)
            printf(" %d",primes[i]) ;
        printf("\n\n") ;
    }
    return 0 ;
}

c032. 00382 - Perfection、UVA 382

#include<stdio.h>
#include<stdlib.h>
#include<math.h>

int sum_divisor(int n){
    if(n==1) return 0 ;
    else{
        int sum = 1, i ;
        for(i=2 ; i<=sqrt(n) ; ++i){
            if(!(n%i)){
                if(i == n/i) sum += i ;
                else sum += i+n/i ;
            }
        }
        return sum ;
    }
}

int main(){
    int n ;
    int sum ;
    int i ;
    puts("PERFECTION OUTPUT") ;
    while(scanf("%d",&n)==1 && n){
        printf("%5d  ",n) ;
        sum = sum_divisor(n) ;
        if(sum < n) puts("DEFICIENT") ;
        else if(sum > n) puts("ABUNDANT") ;
        else puts("PERFECT") ;
    }
    puts("END OF OUTPUT") ;
    return 0;
}

c031: Count on Cantor、UVA 264

#include<stdio.h>
#include<stdlib.h>
#define swap(a,b){int t; t=a; a=b; b=t;}

int main(){
    int n ;
    int i ;
    while(scanf("%d",&n)==1){
        for(i=1 ; i<4473 ; ++i){
            int low = (i*i-i+2)>>1 ;
            int high = ((i+1)*(i+1)-(i+1)+2)>>1 ;
            if(n>=low && n<high){
                int left=1, right=i ;
                int d=n-low ;
                left += d, right -= d;
                if(i%2) swap(left,right) ;
                printf("TERM %d IS %d/%d\n", n, left, right) ;
            }
        }
    }
    return 0 ;
}