Scribd Logo
Upload

Welcome to Scribd!

  • Code - UVa 568 - Just The Facts

    Uploaded by

    thextroid
    6 views2 pages
    This document discusses source code solutions to UVa Online Judge problems in C and C++. It provides the source code for UVa problem 568 "Just the Facts", which involves precomputing the last digit of the factorial of numbers up to 10,000 and then printing the last digit of the factorial of given numbers. The code uses an array to store the precomputed last digits of the factorials and loops to calculate and store the values, then takes user input and prints the matching precomputed last digit of the factorial.

    Original Description:

    dsfa

    Original Title

    Code_ UVa 568 - Just the Facts

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses source code solutions to UVa Online Judge problems in C and C++. It provides the source code for UVa problem 568 "Just the Facts", which involves precomputing the last digit of the factorial of numbers up to 10,000 and then printing the last digit of the factorial of given numbers. The code uses an array to store the precomputed last digits of the factorials and loops to calculate and store the values, then takes user input and prints the matching precomputed last digit of the factorial.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    6 views2 pages

    Code - UVa 568 - Just The Facts

    Uploaded by

    thextroid
    This document discusses source code solutions to UVa Online Judge problems in C and C++. It provides the source code for UVa problem 568 "Just the Facts", which involves precomputing the last digit of the factorial of numbers up to 10,000 and then printing the last digit of the factorial of given numbers. The code uses an array to store the precomputed last digits of the factorials and loops to calculate and store the values, then takes user input and prints the matching precomputed last digit of the factorial.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 2

    Cambiando el contenido de este documento

    Code
    Soluciones de problemas de la UVA. C, C++, Algorithms.

    Home Useful Links Source Codes

    01 Knapsack (1) Ad Hoc (1) Backtracking (1) Binary Search Tree (1) bits (1) Brute Force (1) codelib (2) Data Structures (1) Dijkstra (1) DP (2) Graphs (1) Heaps (1) Joseph (1)
    Maximum 1-D Sum (1) Maximum Contiguous Sum (1) Primes (1) Priority Queues (1) Recursion (1) Sieve of Atkins (1) UVaOJ Vol-102 (1) UVaOJ Vol-109 (1) UVaOJ Vol-5 (1)

    S a t u r d a y, M a r c h 5 , 2 0 11

    UVa 568 - Just the Facts

    /* 568 C "Just the Facts" */

    /* @BEGIN_OF_SOURCE_CODE */

    #include <stdio.h>

    #define FACT_UPTO 10001

    int n, fact_lnzd[FACT_UPTO] ;

    void precompute(void)
    {
    int i, fact ;

    fact_lnzd[0] = fact_lnzd[1] = fact = 1 ;

    for (i=2; i<=FACT_UPTO; i++) {


    fact = fact * i ;
    while (fact%10==0)
    fact /= 10 ;
    fact = fact%100000 ;
    fact_lnzd[i] = fact%10 ;
    }
    }

    int main()
    {
    precompute() ;
    while (scanf("%d", &n) != EOF)
    printf("%5d -> %d\n", n, fact_lnzd[n]) ;
    return 0;
    }

    /* @END_OF_SOURCE_CODE */

    Posted by Right now at 3:21 AM


    Labels: Ad Hoc, UVaOJ Vol-5

    No comments:

    Post a Comment

    Enter your comment...

    Comment as: Israel Marino (G Sign out

    Publish Preview Notify me

    Newer Post Home Older Post

    Subscribe to: Post Comments (Atom)

    Followers

    Seguidores (0)

    Seguir

    Archive

    March (4)
    February (1)
    January (6)

    Statistics @felix-halim Hits

    4,996

    Simple theme. Powered by Blogger.

    You might also like