欧拉计划17

最新推荐文章于 2023-07-26 09:39:19 发布

chuijiaozha4817

最新推荐文章于 2023-07-26 09:39:19 发布

阅读量141

点赞数 1

原文链接：https://my.oschina.net/u/3772904/blog/1803313

版权

#include <iostream>
using namespace std;
int letter(int n)
{
   if (n == 1 || n == 2 || n == 6 || n == 10)return 3;//注意||左右都要有n==
   if (n == 4 || n == 5 || n == 9)return 4;
   if (n == 3 || n == 7 || n == 8 || n == 40 || n == 50 || n == 60)return 5;
   if (n == 11 || n == 12 || n == 20 || n == 30 || n == 80 ||n==90)return 6;
   if (n == 15 || n == 16 || n == 70)return 7;
   if (n == 13 || n == 14 || n == 18 || n == 19)return 8;
   if (n == 17)return 9;
   if (n == 1000)return 11;
   if (n == 100)return 10;
   if (n > 20 && n<100)
   {
       int rx = 0;
       int ry = 0;
       int x = n / 10 * 10;//十位
       int y = n % 10;//个位
       if (x == 20 || x == 30 || x == 80||x==90 )rx = 6;
       if (x == 40 || x == 50 || x == 60)rx = 5;
       if (x == 70)rx = 7;
       if (y == 1 || y == 2 || y == 6)ry = 3;
       if (y == 4 || y == 5 || y == 9)ry = 4;
       if (y == 3 || y == 7 || y == 8)ry =5;
       return rx + ry;
   }
   if (n > 100 && n < 1000)
   {
       int w1 = n / 100;//百位
       int w2 = n / 10 % 10 * 10;//十位
       int w3 = n % 10;//个位
       int r1 = 0, r2 = 0, r3 = 0;
       if (w1 == 1 || w1 == 2 || w1 == 6)r1 = 13;
       if (w1 == 4 || w1 == 5 || w1 == 9)r1 = 14;
       if (w1 == 3 || w1 == 7 || w1 == 8)r1 = 15;
       if (w2 == 20 || w2 == 30 || w2 == 80||w2==90 )r2 = 6;
       if (w2 == 40 || w2 == 50 || w2 == 60)r2 = 5;
       if (w2 == 70)r2 = 7;
       if (w2 == 0 && w3 == 0)
       {
           if (w1 == 1 || w1 == 2 || w1 == 6)return 10;
           if (w1 == 4 || w1 == 5 || w1 == 9)return 11;
           if (w1 == 3 || w1 == 7 || w1 == 8)return 12;
       }
       if (w2 == 10)
       {
           w2 = n % 100;
           if (w2 == 11 || w2 == 12)r2=6;
           if (w2 == 15 || w2 == 16 )r2= 7;
           if (w2 == 13 || w2 == 14 || w2 == 18 || w2 == 19)r2= 8;
           if (w2 == 17)r2= 9;
           if (w3 == 0)
           {
               r2 = 3;
               r3 = 0;
           }
       }
       else
       {
           if (w3 == 1 || w3 == 2 || w3 == 6)r3 = 3;
           if (w3 == 4 || w3 == 5 || w3 == 9)r3 = 4;
           if (w3 == 3 || w3 == 7 || w3 == 8)r3 = 5;
       }
       return r1 + r2 + r3;
   }
}
int main()
{
   int sum = 0;
   int i;
   for (i = 1; i <= 1000; ++i)
   {
       sum += letter(i);
   }
   cout << sum << endl;
   system("pause");
}