收藏 不显示删除回复显示所有回复显示星级回复显示得分回复 [推荐] 【oj每周推荐】（算法）勇敢的（或许是不幸的）CSDNer[问题点数:100分，结帖人:ojlovecd]

using System.Collections.Generic;
using System;
namespace ConsoleApplication1
{
    class Program
    {
        static Dictionary<int, int> dItems = new Dictionary<int, int>();    //存放据有输入数的质因数

        static void Main(string[] args)
        {
            int[] Input = new int[10];  //输入
            int n, MaxInput = 0;        //当前输入，最大输入

            //读入输入
            for (int i = 0; i < 10; i++)
            {
                while (!int.TryParse(Console.ReadLine(), out n) || n <= 0 || n > 10000)
                {
                    Console.WriteLine("该输入无效，请重新输入(需要1-10000的整数)。");
                }
                Input[i] = n;
                if (MaxInput < n)
                {
                    MaxInput = n;
                }
            }

            //求所有程序中可能用到的质数 
            GetItem(MaxInput);

            //分解所有整数
            for (int i = 0; i < 10; i++)
            {
                Split(Input[i]);
            }

            //计算约数个数
            int Count = 1;
            foreach (int i in dItems.Values)
            {
                Count *= 1 + i;
            }

            Console.WriteLine("英雄编号是：" + Count % 10);
            Console.Read();
        }

        //分解P，表示为 a1^b1+a2^b2+...的形式
        private static void Split(int p)
        {
            if (p == 1)
            {
                return;
            }
            if (dItems.ContainsKey(p))  //p是质数
            {
                dItems[p]++;
                return;
            }

            for (int i = 2; i <= p && p > 1; i++)    //找P的质因数
            {
                if (p % i == 0)
                {
                    dItems[i]++;
                    p /= i;
                    i--;
                }
            }
        }

        static void GetItem(int Max)   //筛选法求素数，网上抄了个c的改了下
        {
            int[] sieve = new int[Max + 1]; //Max以内的数

            //step 1:
            //初始化（sieve[i] = 0 表示不在筛中，即不是质数；1表示在筛中）
            for (int i = 2; i <= Max; i++) //从2开始，因为0和1不是质数
                sieve[i] = 1;

            //step 2:
            //偶数(2的倍数)肯定不是质数，所以应该先筛除
            for (int i = 2; i <= Max / 2; i++)
                sieve[i * 2] = 0;

            int p = 2; //第一个质数是2

            //step 3:从sieve中删去P的倍数
            while (p * p <= Max)
            {
                //选下一个p
                p = p + 1;
                while (sieve[p] == 0)
                    p++;

                int t = p * p;
                int s = 2 * p;
                while (t <= Max)
                {
                    sieve[t] = 0;  //删除
                    t = t + s;
                }
            }

            //step 4:　输出结果
            for (int i = 2; i <= Max; i++)
            {
                if (sieve[i] != 0)
                {
                    dItems.Add(i, 0);
                }
            }
        }
    }
}

#include <iostream>
using namespace std;

int SelectPerson(int *P);
int main()
{
  int p[10];
  int target = 0;
  for(int i = 0; i < 10; i++)
     cin >> p[i];
  target = SelectPerson(p);
  if(!target)
     cout << "Some error occured." << endl;
  else
     cout << "The person is " << target%10 << endl;
}

int SelectPerson(int *p)
{
  int sum = 1;
  int index = 0;
  for(int i = 0; i < 10; i++){
    sum *= p[i];
  }
  for(int j = 2; j < sum/2; j++){
    if(sum%j == 0){
        index++;
    }
  }
  return index;
}

using System.Collections.Generic;
using System;
namespace ConsoleApplication1
{
    class Program
    {
        static Dictionary<int, int> dItems = new Dictionary<int, int>();    //存放据有输入数的质因数

        static void Main(string[] args)
        {
            int[] Input = new int[10];  //输入
            int n, MaxInput = 0;        //当前输入，最大输入

            //读入输入
            for (int i = 0; i < 10; i++)
            {
                while (!int.TryParse(Console.ReadLine(), out n) || n <= 0 || n > 10000)
                {
                    Console.WriteLine("该输入无效，请重新输入(需要1-10000的整数)。");
                }
                Input[i] = n;
                if (MaxInput < n)
                {
                    MaxInput = n;
                }
            }

            //求所有程序中可能用到的质数 
            GetItem(MaxInput);

            //分解所有整数
            for (int i = 0; i < 10; i++)
            {
                Split(Input[i]);
            }

            //计算约数个数
            int Count = 1;
            foreach (int i in dItems.Values)
            {
                Count *= 1 + i;
            }

            Console.WriteLine(Count % 10);
        }

        //分解P，表示为 a1^b1+a2^b2+...的形式
        private static void Split(int p)
        {
            if (p == 1)
            {
                return;
            }
            if (dItems.ContainsKey(p))  //p是质数
            {
                dItems[p]++;
                return;
            }

            int[] tmp = new int[dItems.Count];
            dItems.Keys.CopyTo(tmp, 0);
            foreach (int i in tmp)
            {
                if (i > p || p <= 1)
                {
                    break;
                }
                while (p % i == 0 && p > 1)
                {
                    dItems[i]++;
                    p /= i;
                }
            }
        }

        static void GetItem(int Max)   //筛选法求素数，网上抄了个c的改了下
        {
            int[] sieve = new int[Max + 1]; //Max以内的数

            //step 1:
            //初始化（sieve[i] = 0 表示不在筛中，即不是质数；1表示在筛中）
            for (int i = 2; i <= Max; i++) //从2开始，因为0和1不是质数
                sieve[i] = 1;

            //step 2:
            //偶数(2的倍数)肯定不是质数，所以应该先筛除
            for (int i = 2; i <= Max / 2; i++)
                sieve[i * 2] = 0;

            int p = 2; //第一个质数是2

            //step 3:从sieve中删去P的倍数
            while (p * p <= Max)
            {
                //选下一个p
                p = p + 1;
                while (sieve[p] == 0)
                    p++;

                int t = p * p;
                int s = 2 * p;
                while (t <= Max)
                {
                    sieve[t] = 0;  //删除
                    t = t + s;
                }
            }

            //step 4:　输出结果
            for (int i = 2; i <= Max; i++)
            {
                if (sieve[i] != 0)
                {
                    dItems.Add(i, 0);
                }
            }
        }
    }
}

#include <iostream>
using namespace std;

int SelectPerson(int *P);
int main()
{
  int p[10];
  int target = 0;
  for(int i = 0; i < 10; i++)
     cin >> p[i];
  target = SelectPerson(p);
  if(!target)
     cout << "Some error occured." << endl;
  else
     cout << "The person is " << target%10 << endl;
  return 1;
}

int SelectPerson(int *p)
{
  int sum = 1;
  int index = 0;
  for(int i = 0; i < 10; i++){
    sum *= p[i];
  }
  for(int j = 2; j < sum/2; j++){
    if(sum%j == 0){
        index++;
    }
  }
  return index;
}

#include <iostream>
using namespace std;

int SelectPerson(int *P);
int main()
{
  int p[10];
  int target = 0;
  for(int i = 0; i < 10; i++)
     cin >> p[i];
  target = SelectPerson(p);
  if(!target)
     cout << "Some error occured." << endl;
  else
     cout << "The person is " << target%10 << endl;
  return 1;
}

int SelectPerson(int *p)
{
  int sum = 1;
  int index = 1;
  for(int i = 0; i < 10; i++){
    sum *= p[i];
  }
  if(sum == 1 ) return sum;
  cout << sum <<endl;
  for(int j = 1; j <= sum/2; j++){
    if(sum%j == 0){
        index++;
    }
  }
  return index;
}

namespace FindHero
{
   public class FindHero
   {
      public virtual int GetHeroID()
      {
         //对各CSDNer输入的数进行排序
         SortByNuber();

         //求各CSDNer输入的数进行质因数分解
         GetSubmultiple();

         //将上面的质因数分解结果汇总，即得各CSDNer输入的数的乘积的质因数分解结果
         List<int> TotalDivisor = new List<int>();
         for (int i = 0; i < CSDNerCount; ++i)
         {
            if (_people[i].Number != 1)
            {
               TotalDivisor.Add(_people[i].Number);
            }
            TotalDivisor.AddRange(_people[i].Divisor);
         }

         //对乘积的质因数分解的结果进行排序，以方便统计各质因数出现的次数
         TotalDivisor.Sort();
         int DivisorCount = 1, HeroID = 1;
         //统计各质因数出现的次数，同时计算约数个数的个位数
         for (int i = 1; i < TotalDivisor.Count; ++i)
         {
            if (TotalDivisor[i] == TotalDivisor[i - 1])
            {
               //如果这个质因数和上一个相同，则这个质因数的出现次数加一
               ++DivisorCount;
            }
            else
            {
               //如果这是一个新的质因数，则进行计算，并重置计数器
               HeroID = HeroID * (DivisorCount + 1) % 10;//计算约数的个数，但是只需要个位，所以取余
               DivisorCount = 1;
            }
         }
         HeroID = HeroID * (DivisorCount + 1) % 10;//将最后一个质因数个数加入计算
         return HeroID;
      }

      protected virtual void GetSubmultiple()
      {
         int StartIndex = 0;
         int[] HalfNumber = new int[CSDNerCount];
         for (int i = 0; i < CSDNerCount; ++i)
         {
            HalfNumber[i] = (int)_people[i].Number / 2;
         }
         {
            int i = 2;
            while (i < HalfNumber[CSDNerCount - 1])
            {
               bool flag;
               while (i > HalfNumber[StartIndex])
               {
                  ++StartIndex;
               }
               flag = true;
               for (int m = StartIndex; m < CSDNerCount; ++m)
               {
                  if ((_people[m].Number % i) == 0)
                  {
                     _people[m].Number /= i;
                     flag = false;
                     _people[m].Divisor.Add(i);
                  }
               }
               if (flag)
               {
                  ++i;
               }
            }
         }
      }

      public virtual void SortByNuber()
      {
         int tmpNumber, tmpID;
         for (int i = 0; i < CSDNerCount - 1; ++i)
         {
            for (int m = i + 1; m < CSDNerCount; ++m)
            {
               if (_people[i].Number > _people[m].Number)
               {
                  tmpNumber = _people[i].Number;
                  tmpID = _people[i].ID;
                  _people[i].Number = _people[m].Number;
                  _people[i].ID = _people[m].ID;
                  _people[m].Number = tmpNumber;
                  _people[m].ID = tmpID;
               }
            }
         }
      }
      public struct Person
      {
         public int ID;
         public int Number;
         public List<int> Divisor;
      }
      public FindHero()
      {
         _people = new Person[CSDNerCount];
         for (int i = 0; i < CSDNerCount; ++i)
         {
            _people[i].Divisor = new List<int>();
         }
      }
      public int[] Numbers
      {
         get
         {
            int[] tmp = new int[CSDNerCount];
            for (int i = 0; i < CSDNerCount; ++i)
            {
               tmp[i] = _people[i].Number;
            }
            return tmp;
         }
         set
         {
            for (int i = 0; i < CSDNerCount; ++i)
            {
               if (value[i] < MIN_VALUE || value[i] > MAX_VALUE)
               {
                  throw (new OverflowException());
               }
               _people[i].Number = value[i];
               _people[i].ID = i;
            }
         }
      }
      protected const int CSDNerCount = 10, MIN_VALUE = 1, MAX_VALUE = 10000;
      protected Person[] _people;
   }
   class Program
   {
      static void Main(string[] args)
      {
         int[] Data = new int[10];
         FindHero test = new FindHero();
         for (int i = 0; i < 10; ++i)
         {
            while (!int.TryParse(Console.ReadLine(), out Data[i])) ;
         }
         test.Numbers = Data;
         Console.WriteLine(test.GetHeroID());
      }
   }
}

static void Main(string[] args)
        {
            double[] module = new double[10];   //放10个数，第i位是指i乘以随机数后个位为i的几率。
            //计算module
            for (int i = 0; i < 10; i++)
            {
                module[i] = 0;
            }
            for (int i = 0; i < 10; i++)
            {
                for (int j = 0; j < 10; j++)
                {
                    module[i * j % 10] += 0.1;
                }
            }

            //输出
            double s = 0;
            for (int i = 0; i < 10; i++)
            {
                s += module[i];
                Console.WriteLine("rate of {0}: {1:00.00}%", i, module[i] * 10);
            }
            Console.Read();
        }

#include "stdio.h"
#include "math.h"
void main()
{
    long i,t,j=1,k=0;
    for(i=1;i<=10;i++)
    {
        scanf("%ld",&t);
        j*=t;
    }
    for(i=1;i<=j;i++)
        if(j%i==0)
            k++;
    printf("%d",k%10);
}

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace ConsoleApplication1
{
    class Program
    {
        static void Main(string[] args)
        {
            const int maxNumber = 1000; // 最大的数字范围
            const int toll = 10; // 人数

            #region 生成测试数据
            //var cards = new int[] { 1, 2, 6, 1, 3, 1, 1, 1, 1, 1 };
            var cards = new int[toll]; // 每个人写出的数字
            var random = new Random();
            for (var i = 0; i < cards.Length; i++)
                cards[i] = random.Next(maxNumber) + 1;
            #endregion 生成测试数据

            #region 统计约数出现的次数
            var divisor = new Dictionary<int, int>();
            for (var j = 0; j < cards.Length; j++)
            {
                var i = 2;
                while (cards[j] > 1)
                {
                    if (cards[j] % i == 0)
                    {
                        if (divisor.ContainsKey(i))
                            divisor[i]++;
                        else divisor[i] = 1;
                        cards[j] /= i;
                    } 
                    else i += i == 2 ? 1 : 2;
                }
            }
            #endregion 统计约数出现的次数

            #region 计算约数个数
            var sum = 1;
            foreach (var i in divisor)
                if (i.Value > 0) sum *= (i.Value + 1);
            #endregion 计算约数个数

            Console.WriteLine(sum % toll);
            Console.Read();
        }
    }
}