zoukankan      html  css  js  c++  java
  • POJ 2603

    Brave balloonists
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 4934   Accepted: 2074

    Description

    Ten mathematicians are flying on a balloon over the Pacific ocean. When they are crossing the equator they decide to celebrate this event and open a bottle of champagne. Unfortunately, the cork makes a hole in the balloon. Hydrogen is leaking out and the balloon is descending now. Soon it will fall into the ocean and all the balloonists will be eaten by hungry sharks.
    But not everything is lost yet. One of the balloonists can sacrifice himself jumping out, so that his friends would live a little longer. Only one problem still exists ¾ who is the one to get out. There is a fair way to solve this problem. First, each of them writes an integer ai not less than 1 and not more than 10000. Then they calculate the magic number N that is the number of positive integer divisors of the product a1*a2*...*a10. For example, the number of positive integer divisors of 6 is 4 (they are 1,2,3,6). The hero (a mathematician who will be thrown out) is determined according to the last digit of N. Your task is to find this digit.

    Input

    Input file contains ten numbers separated by a space.

    Output

    Output file should consist of a single digit from 0 to 9 - the last digit of N.

    Sample Input

    1
    2
    6
    1
    3
    1
    1
    1
    1
    1
    

    Sample Output

    9

    Source


    题意:

    求十个数的乘积的因子个数;

    解题思路:把十个数的结果进行因式分解得:s=a1^p1*a2^p2*...

    则在0p1内取任意个a1,0p2内取任意个a2,所以最后的约数个数为:(p1+1*(p2+1)*...%10

     

     1 #include <iostream>
     2 #include<cstdio>
     3 #include<cstring>
     4 #include<cstdlib>
     5 #include<cstring>
     6 #include<algorithm>
     7 #include<cmath>
     8 #include<map>
     9 #define maxn  10007
    10 
    11 using namespace std;
    12 int num[11];
    13 int ans[maxn];
    14 bool prime[maxn];
    15 void slove(int value)
    16 {
    17         for(int i=2;i*i<=value;i++)
    18         {
    19           while(value%i==0){
    20             ans[i]++;
    21             value=value/i;
    22           }
    23         }
    24         if(value!=1) ans[value]+=1;
    25 }
    26 int main()
    27 {
    28    // freopen("in.txt","r",stdin);
    29     memset(ans,0,sizeof(ans));
    30     for(int i=0;i<10;i++) scanf("%d",&num[i]);
    31     for(int i=0;i<10;i++) slove(num[i]);
    32     long long res=1;
    33     for(int i=2;i<maxn;i++)
    34         res*=(ans[i]+1),res=res%10;
    35         res=res%10;
    36         printf("%lld
    ",res);
    37         return 0;
    38 }

     

     

  • 相关阅读:
    React-Native: bios打开VT-x选项
    React-Native:解决真机调试时候Could not get BatchedBridge, make sure your bundle is packaged properly
    node.js异步编程的几种模式
    第29章 电容触摸屏—触摸画板
    第28章 LTDC—液晶显示中英文
    第27章 LTDC/DMA2D—液晶显示
    第26章 FMC—扩展外部SDRAM
    第25章 串行FLASH文件系统FatFs
    第24章 QSPI—读写串行FLASH
    第23章 I2C—读写EEPR
  • 原文地址:https://www.cnblogs.com/codeyuan/p/4328485.html
Copyright © 2011-2022 走看看