[关闭]
@jtahstu 2015-09-07T12:22:49.000000Z 字数 36385 阅读 4896

AKOJ Problem1000-1099 C#代码汇总

C# ACM Code

有代码的都是AC了的，没AC的只有个题目，以后假如AC了再把代码加上去

1000 A+B Problem

  1. using System;
  2.  class Acm1000
  3.  {
  4.   static void Main()
  5.   {
  6.      string[] ss = Console.ReadLine().Split();
  7.       Console.WriteLine(long.Parse(ss[0]) + long.Parse(ss[1]));  
  8.  }
  9. }

1001 ACM"水题"

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1001 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string sb;
  10.             while ((sb = Console.ReadLine()) != null) {
  11.                 string[] s = sb.Split();
  12.                 int a = int.Parse(s[0]), b = int.Parse(s[1]);
  13.                 if (a == 0 && b == 0) break;
  14.                 long ans = (a + b) * (b - a + 1) / 2;
  15.                 Console.WriteLine(ans);
  16.             }
  17.         }
  18.     }
  19. }

1002 手机靓号

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1002 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string sb;
  10.             int jtahstu = 0;
  11.             while ((sb = Console.ReadLine()) != null) {
  12.                 int count = 0;
  13.                 for (int k = 0; k < 11; k++) {
  14.                     if (sb[k] == '6' || sb[k] == '8')
  15.                         count++;
  16.                     if (sb[k] == '4') { count = 0; break; }
  17.                 }
  18.                 if (count > 4) {
  19.                     Console.WriteLine(sb);
  20.                     jtahstu++;
  21.                 }
  22.             }
  23.             Console.WriteLine(jtahstu);
  24.             //Console.ReadLine();
  25.         }
  26.     }
  27. }

1003 计算N!

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1003 {
  7.     /// <summary>
  8.     /// 大数阶乘
  9.     /// 本代码参考老赵以前写过的大数阶乘代码
  10.     /// </summary>
  11.     class Program {
  12.         static void Main(string[] args) {
  13.             string sb;
  14.             int i, j, temp, start, sc, N = 1200;
  15.             while ((sb = Console.ReadLine()) != null) {
  16.                 int n = int.Parse(sb);
  17.                 int[] a = new int[N];
  18.                 for (a[0] = 1, i = 1; i <= n; i++)
  19.                     for (sc = 0, j = 0; j < N; j++) {
  20.                         temp = a[j] * i + sc;//当前这一位的数乘上i,然后加上后面来的进位
  21.                         sc = temp / 10;//sc代表进位
  22.                         a[j] = temp % 10;//本位保留模后的结果
  23.                     }
  24.                 //数据是倒着存的，即1*2*3*4=24，存是是按420000000...保存的，一直有N=1200位
  25.                 for (start = N - 1; a[start] == 0; --start) ;//这里是确定从后面哪一位开始输出，从后向前输出
  26.                 for (; start >= 0; --start)
  27.                     Console.Write(a[start]);
  28.                 Console.WriteLine();
  29.             }
  31.         }
  32.     }
  33. }

1004 “顺”序列

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1004 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             int n = int.Parse(Console.ReadLine());
  10.             while (n-- > 0) {
  11.                 string[] sb = Console.ReadLine().Split();
  12.                 int m = int.Parse(sb[0]);
  13.                 int[] a = new int[105];
  14.                 for (int i = 1; i <= m; i++)
  15.                     a[i] = int.Parse(sb[i]);
  16.                 Array.Sort(a, 1, m);
  17.                 int d = a[2] - a[1];
  18.                 bool flag = true;
  19.                 for (int i = 3; i <= m; i++)
  20.                     if (a[i] - a[i - 1] != d) {
  21.                         flag = false;
  22.                         Console.WriteLine("no");
  23.                         break;
  24.                     }
  25.                 if (flag)
  26.                     Console.WriteLine("yes");
  27.             }
  28.         }
  29.     }
  30. }

1005 构造表达式

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1005 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             int n = int.Parse(Console.ReadLine());
  10.             while (n-- > 0) {
  11.                 string[] sb = Console.ReadLine().Split();
  12.                 int a = int.Parse(sb[0]), b = int.Parse(sb[1]), c = int.Parse(sb[2]);
  13.                 int min = a;
  14.                 int max = a;
  15.                 if (b < min) min = b;
  16.                 if (b > max) max = b;
  17.                 if (max / min == c)
  18.                     Console.WriteLine("{0}/{1}={2}", max, min, c);
  19.                 else if (max - min == c)
  20.                     Console.WriteLine("{0}-{1}={2}", max, min, c);
  21.                 else if (max + min == c)
  22.                     Console.WriteLine("{0}+{1}={2}", max, min, c);
  23.                 else if (max * min == c)
  24.                     Console.WriteLine("{0}*{1}={2}", max, min, c);
  25.                 else
  26.                     Console.WriteLine("None");
  27.             }
  28.         }
  29.     }
  30. }

1006 5个数求最值

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1006 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string[] s = Console.ReadLine().Split();
  10.             int min = 10000000, max = -10000000;
  11.             for (int i = 0; i < 5; i++) {
  12.                 int temp = int.Parse(s[i]);
  13.                 if (temp > max) max = temp;
  14.                 if (temp < min) min = temp;
  15.             }
  16.             Console.WriteLine("{0} {1}", min, max);
  17.         }
  18.     }
  19. }

1007 Fibonacci 数

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1007 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             int[] fib = new int[25];
  10.             fib[1] = 1; fib[2] = 1;
  11.             for (int i = 3; i < 21; i++)
  12.                 fib[i] = fib[i - 1] + fib[i - 2];
  13.             int n = int.Parse(Console.ReadLine());
  14.             while (n-- > 0) {
  15.                 int x = int.Parse(Console.ReadLine());
  16.                 Console.WriteLine(fib[x]);
  17.             }
  19.         }
  20.     }
  21. }

1008 大小写互换

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1008 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             int n = int.Parse(Console.ReadLine());
  10.             while (n-- > 0) {
  11.                 string s = Console.ReadLine();
  12.                 for (int i = 0; i < s.Length; i++) {
  13.                     if (s[i] >= 'a' && s[i] <= 'z')
  14.                         Console.Write(s[i].ToString().ToUpper());
  15.                     else
  16.                         Console.Write(s[i].ToString().ToLower());
  17.                 }
  18.                 Console.WriteLine();
  19.             }
  20.         }
  21.     }
  22. }

1009 公约数和公倍数

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1009 {
  7.     class Program {
  8.         static int gcd(int a, int b) {
  9.             return b == 0 ? a : gcd(b, a % b);
  10.         }
  11.         static int lcm(int a, int b) {
  12.             return a / gcd(a, b) * b;
  13.         }
  14.         static void Main(string[] args) {
  15.             int n = int.Parse(Console.ReadLine());
  16.             while (n-- > 0) {
  17.                 string[] sb = Console.ReadLine().Split();
  18.                 int a = int.Parse(sb[0]), b = int.Parse(sb[1]);
  19.                 Console.WriteLine("{0} {1}", gcd(a, b), lcm(a, b));
  20.             }
  21.         }
  22.     }
  23. }

1010 青蛙的约会

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1010 {
  7.     /// <summary>
  8.     /// 貌似叫扩展欧几里得定理，题目我都没看，代码已看不懂
  9.     /// WA了，以后再来改吧
  10.     /// </summary>
  11.     class Program {
  12.         static long x, y, m, n, l;
  13.         static long ect_gcd(long a, long b, long x, long y) {
  14.             long tmp, ret;
  15.             if (b == 0) {
  16.                 x = 1; y = 0;
  17.                 return a;
  18.             }
  19.             ret = ect_gcd(b, a % b, x, y);
  20.             tmp = x; x = y; y = tmp - a / b * y;
  21.             return ret;
  22.         }
  23.         static void Main(string[] args) {
  24.             string s;
  25.             while ((s = Console.ReadLine()) != null) {
  26.                 string[] sb = s.Split();
  27.                 x = long.Parse(sb[0]); y = long.Parse(sb[1]); m = long.Parse(sb[2]); n = long.Parse(sb[3]); l = long.Parse(sb[4]);
  28.                 long a = n - m, b = l, c = x - y;
  29.                 long d = ect_gcd(a, b, x, y);
  30.                 if (c % d != 0) {
  31.                     Console.WriteLine("Impossible");
  32.                     continue;
  33.                 }
  34.                 x = (x * c / d) % (b / d);
  35.                 if (x < 0) x += b / d;
  36.                 Console.WriteLine(x);
  37.             }
  38.         }
  39.     }
  40. }

1011 RLE解码

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1011 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             int n = int.Parse(Console.ReadLine());
  10.             int[] ans = new int[n * n + n + 10];
  11.             string s;
  12.             int k = 1;
  13.             while ((s = Console.ReadLine()) != null) {
  14.                 string[] ss = s.Split();
  15.                 int a = int.Parse(ss[0]);
  16.                 int b = int.Parse(ss[1]);
  17.                 for (int i = 0 ; i < b ; i++)
  18.                     ans[k++] = a;
  19.             }
  20.             for (int i = 1 ; i <= n * n ; i++) {
  21.                 Console.Write(ans[i] + " ");
  22.                 if (i % n == 0)
  23.                     Console.WriteLine();
  24.             }
  25.             //Console.ReadLine();
  26.         }
  27.     }
  28. }

1012 机器指令

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1012 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string s;
  10.             string[] str = { "0000" , "0001" , "0010" , "0011" , "0100" , "0101" , "0110" , "0111" , "1000" , "1001" , "1010" , "1011" , "1100" , "1101" , "1110" , "1111" };
  11.             while ((s = Console.ReadLine()) != null) {
  12.                 for (int i = 0 ; i < s.Length ; i++) {
  13.                     if (s[i] >= '0' && s[i] <= '9')
  14.                         Console.Write(str[s[i] - '0']);
  15.                     else
  16.                         Console.Write(str[s[i] - 'A' + 10]);
  17.                 }
  18.                 Console.WriteLine();
  19.             }
  20.         }
  21.     }
  22. }
  23. //long n = Convert.ToInt64(s , 16);
  24. //string ans = Convert.ToString(n , 2);
  25. //Console.WriteLine(ans);

1013 分糖果

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1013 {
  7.     class Program {
  8.         static int gcd(int a, int b) {
  9.             return b == 0 ? a : gcd(b, a % b);
  10.         }
  11.         static int lcm(int a, int b) {
  12.             return a / gcd(a, b) * b;
  13.         }
  14.         static void Main(string[] args) {
  15.             string s;
  16.             while ((s = Console.ReadLine()) != null) {
  17.                 string[] a = s.Split();
  18.                 int a1 = int.Parse(a[0]), b1 = int.Parse(a[1]), a2 = int.Parse(a[2]), b2 = int.Parse(a[3]);
  19.                 for (int i = 1; i <= lcm(a1, a2); i++)//实际这样写我感觉是不合理的，但是AC了，怎么能求最小公倍数呢，i don't know!
  20.                     if (i % a1 == b1 && i % a2 == b2) { Console.WriteLine(i); break; }
  21.             }
  22.         }
  23.     }
  24. }

1014 哥德巴赫猜想

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1014 {
  7.     class Program {
  8.         static bool prime(int n)//判断素数
  9.         {
  10.             if (n == 1) return false;
  11.             if (n == 2) return true;
  12.             for (int i = 2; i * i <= n; i++)
  13.                 if (n % i == 0) return false;
  14.             return true;
  15.         }
  16.         static void Main(string[] args) {
  17.             string sb;
  18.             while ((sb = Console.ReadLine()) != null) {
  19.                 int n = int.Parse(sb);
  20.                 for (int i = n / 2; i > 0; i--) {
  21.                     if (prime(i) && prime(n - i)) {
  22.                         Console.WriteLine("{0} {1}", i, n - i);
  23.                         break;
  24.                     }
  25.                 }
  26.             }
  27.         }
  28.     }
  29. }

1015 最简单的编程语言

1016 连接电脑

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1016 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string jt;
  10.             while ((jt = Console.ReadLine()) != null) {
  11.                 string[] s = jt.Split();
  12.                 int n = int.Parse(s[0]), m = int.Parse(s[1]);
  13.                 if (m + n == 0) break;
  14.                 if (m == 0 && n != 0) { Console.WriteLine(n - 1); continue; }
  15.                 string[] b = Console.ReadLine().Split();
  16.                 int[] a = new int[205];
  17.                 int count = 1;
  18.                 a[int.Parse(b[0])] = count;
  19.                 a[int.Parse(b[1])] = count;
  20.                 for (int i = 1; i < m; i++) {
  21.                     string[] sb = Console.ReadLine().Split();
  22.                     int p = int.Parse(sb[0]), q = int.Parse(sb[1]);
  23.                     if (a[p] != 0) a[q] = count;
  24.                     else if (a[q] != 0) a[p] = count;
  25.                     else {
  26.                         count++;
  27.                         a[p] = count;
  28.                         a[q] = a[p];
  29.                     }
  30.                 }
  31.                 for (int i = 1; i <= n; i++)
  32.                     if (a[i] == 0)
  33.                         count++;
  34.                 Console.WriteLine(count - 1);
  35.             }
  37.         }
  38.     }
  39. }

1017 神奇的立方数

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1017 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string sb;
  10.             while ((sb = Console.ReadLine()) != null) {
  11.                 int n = int.Parse(sb);
  12.                 bool flag = false;
  13.                 for (int i = -1400; i <= 1400; i++) {
  14.                     if (i * i * i == n) {
  15.                         flag = true;
  16.                         break;
  17.                     }
  18.                 }
  19.                 if (flag)
  20.                     Console.WriteLine("YES");
  21.                 else
  22.                     Console.WriteLine("NO");
  23.                 //if (n < 0) n = -n;
  24.                 //int x = (int)Math.Pow(n, 1.0/3);
  25.                 ////x = Math.Floor(x);
  26.                 ////Console.WriteLine(x);
  27.                 //if (x * x * x == n)
  28.                 //    Console.WriteLine("YES");
  29.                 //else
  30.                 //    Console.WriteLine("NO");
  31.             }
  32.         }
  33.     }
  34. }

1018 最长平台

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1018 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string sb;
  10.             while ((sb = Console.ReadLine()) != null) {
  11.                 int n = int.Parse(sb);
  12.                 int[] a = new int[10005];
  13.                 string[] s = Console.ReadLine().Split();
  14.                 for (int i = 0; i < n; i++)
  15.                     a[i] = int.Parse(s[i]);
  16.                 int count = 1;
  17.                 for (int i = 1; i < n; i++) {
  18.                     if (a[i] == a[i - count])
  19.                         count++;
  20.                 }
  21.                 Console.WriteLine(count);
  22.             }
  23.         }
  24.     }
  25. }

1019 还有多少桌面
1020 严格递增序列
1021 最后的胜利者
1022 快乐指数
1023 DNA Sorting

1024 A+B Problem

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1024 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string sb;
  10.             while ((sb = Console.ReadLine()) != null) {
  11.                 string[] s = sb.Split();
  12.                 int a = int.Parse(s[0]), b = int.Parse(s[1]);
  13.                 if (a == 0 && b == 0) break;
  14.                 else Console.WriteLine(a + b);
  15.             }
  16.         }
  17.     }
  18. }

1025 487-3279

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1025 {
  7.     class Program {
  8.         static string convert(string s) {
  9.             string ans = "22233344455566670778889990";
  10.             char[] ss = new char[50];
  11.             int k = 0;
  12.             for (int i = 0; i < s.Length; i++) {
  13.                 if (s[i] >= '0' && s[i] <= '9') { ss[k++] = s[i]; }
  14.                 if (s[i] >= 'A' && s[i] <= 'Z') { ss[k++] = ans[s[i] - 'A']; }
  15.             }
  16.             string st = new string(ss);
  17.             return st.Substring(0, 3) + "-" + st.Substring(3, 4);
  18.         }
  19.         static void Main(string[] args) {
  20.             int n = int.Parse(Console.ReadLine());
  21.             string[] s = new string[n + 5];
  22.             for (int i = 0; i < n; i++)
  23.                 s[i] = convert(Console.ReadLine());
  24.             Array.Sort(s, 0, n);
  25.             //for (int i = 0; i < n; i++)
  26.             //    Console.WriteLine(s[i]);
  27.             int j = 0;
  28.             string[] ans = new string[n];
  29.             int[] an = new int[n];
  30.             ans[0] = s[0];
  31.             an[0] = 1;
  32.             for (int i = 1; i < n; i++) {
  33.                 if (s[i] != s[i - 1]) {
  34.                     j++;
  35.                     ans[j] = s[i];
  36.                     an[j]++;
  37.                 } else {
  38.                     an[j]++;
  39.                 }
  40.             }
  41.             for (int i = 0; i < j; i++) {
  42.                 if (an[i] > 1) {
  43.                     Console.WriteLine(ans[i] + " " + an[i]);
  44.                 }
  45.             }
  46.             //Console.ReadLine();
  47.         }
  48.     }
  49. }

1026 被3、5整除的数

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1026 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string[] s = Console.ReadLine().Split();
  10.             int m = int.Parse(s[0]), n = int.Parse(s[1]);
  11.             int count = 0;
  12.             for (int i = m; i <= n; i++)
  13.                 if (i % 15 == 0)
  14.                     count++;
  15.             Console.WriteLine(count);
  16.         }
  17.     }
  18. }

1027 Lucky Word

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1027 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             long n = long.Parse(Console.ReadLine());
  10.             long sum = 0, temp = n;
  11.             while (n > 0) {
  12.                 sum += n % 10;
  13.                 n /= 10;
  14.             }
  15.             if (temp % sum == 0)
  16.                 Console.WriteLine("Lucky Word");
  17.             else
  18.                 Console.WriteLine("No Answer");
  19.         }
  20.     }
  21. }

1028 单词分隔

1029 括号配对问题

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1029 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             int n = int.Parse(Console.ReadLine());
  10.             char[] stack = new char[10005];
  11.             while (n-- > 0) {
  12.                 string s = Console.ReadLine();
  13.                 int i, l = s.Length, j = 0, flag = 1;
  14.                 for (i = 0; i < l; i++) {
  15.                     if (s[i] == '(' || s[i] == '[')
  16.                         stack[j++] = s[i];
  17.                     if (s[i] == ')') {
  18.                         if (stack[j - 1] == '(') {
  19.                             j--;
  20.                             flag = 1;
  21.                         } else
  22.                             flag = 0;
  23.                     }
  24.                     if (s[i] == ']') {
  25.                         if (stack[j - 1] == '[') {
  26.                             j--;
  27.                             flag = 1;
  28.                         } else
  29.                             flag = 0;
  30.                     }
  31.                     if (flag == 0) break;
  32.                 }
  33.                 if (flag == 1 && j == 0)
  34.                     Console.WriteLine("Yes");
  35.                 else
  36.                     Console.WriteLine("No");
  37.             }
  38.         }
  39.     }
  40. }

1030 ASCII码排序

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1030 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             int n = int.Parse(Console.ReadLine());
  10.             while (n-- > 0) {
  11.                 string s = Console.ReadLine();
  12.                 int[] a = new int[3];
  13.                 for (int i = 0; i < 3; i++)
  14.                     a[i] = s[i] - 'a';
  15.                 Array.Sort(a);
  16.                 Console.WriteLine("{0} {1} {2}", (char)(a[0] + 'a'), (char)(a[1] + 'a'), (char)(a[2] + 'a'));
  17.             }
  18.         }
  19.     }
  20. }

1031 素数求和问题

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1031 {
  7.     class Program {
  8.         static bool prime(int n) {
  9.             if (n == 1) return false;
  10.             if (n == 2) return true;
  11.             for (int i = 2; i * i <= n; i++)
  12.                 if (n % i == 0)
  13.                     return false;
  14.             return true;
  15.         }
  16.         static void Main(string[] args) {
  17.             int n = int.Parse(Console.ReadLine());
  18.             while (n-- > 0) {
  19.                 int m = int.Parse(Console.ReadLine());
  20.                 string[] s = Console.ReadLine().Split();
  21.                 int sum = 0;
  22.                 for (int i = 0; i < m; i++)
  23.                     if (prime(int.Parse(s[i])))
  24.                         sum += int.Parse(s[i]);
  25.                 Console.WriteLine(sum);
  26.             }
  27.             //Console.ReadLine();
  28.         }
  29.     }
  30. }

1032 水仙花数

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1032 {
  7.     class Program {
  8.         static bool jtahstu(int n) {
  9.             int x = n % 10, y = n / 10 % 10, z = n / 100;
  10.             if (x * x * x + y * y * y + z * z * z == n) return true;
  11.             return false;
  12.         }
  13.         static void Main(string[] args) {
  14.             string sb;
  15.             while ((sb = Console.ReadLine()) != null) {
  16.                 int n = int.Parse(sb);
  17.                 if (n == 0) break;
  18.                 if (jtahstu(n))
  19.                     Console.WriteLine("Yes");
  20.                 else
  21.                     Console.WriteLine("No");
  22.             }
  23.         }
  24.     }
  25. }

1033 鸡兔同笼

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1033 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             int t = int.Parse(Console.ReadLine());
  10.             while (t-- > 0) {
  11.                 string[] sb = Console.ReadLine().Split();
  12.                 int n = int.Parse(sb[0]), m = int.Parse(sb[1]);
  13.                 int x = 2 * n - m / 2, y = m / 2 - n;
  14.                 if (x + y == n && 2 * x + 4 * y == m && x >= 0 && y >= 0)
  15.                     Console.WriteLine("{0} {1}", x, y);
  16.                 else
  17.                     Console.WriteLine("No answer");
  18.             }
  19.         }
  20.     }
  21. }

1034 梯形

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1034 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string[] sb = Console.ReadLine().Split();
  10.             double x = double.Parse(sb[0]), y = double.Parse(sb[1]), z = double.Parse(sb[2]);
  11.             double area = (x + y) * z / 2;
  12.             double perimeter = x + y + Math.Sqrt(4 * z * z + (y - x) * (y - x));
  13.             Console.WriteLine(area.ToString("0.00"));
  14.             Console.WriteLine(perimeter.ToString("0.00"));
  15.         }
  16.     }
  17. }

1035 回声壁

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1035 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string sb;
  10.             while ((sb = Console.ReadLine()) != null) {
  11.                 Console.WriteLine(sb);
  12.             }
  13.         }
  14.     }
  15. }

1036 中文系素素的困惑

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1036 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             int n = int.Parse(Console.ReadLine());
  10.             while (n-- > 0) {
  11.                 int m = int.Parse(Console.ReadLine());
  12.                 int[] a = new int[32];
  13.                 int i = 0;
  14.                 while (m > 0) {
  15.                     a[i] = m % 2;
  16.                     m /= 2;
  17.                     i++;
  18.                 }
  19.                 for (int j = 31; j >= 0; j--)
  20.                     Console.Write(a[j]);
  21.                 Console.WriteLine();
  22.             }
  23.         }
  24.     }
  25. }

1037 八皇后问题

1038 不吉利的数字

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1038 {
  7.     class Program {
  8.         static bool judge(int n)//判断数字是否包含0
  9.         {
  10.             if (n == 0) return true;
  11.             while (n > 0) {
  12.                 if (n % 10 == 0) return true;
  13.                 n /= 10;
  14.             }
  15.             return false;
  16.         }
  17.         static int fuck(int n)//十进制转九进制
  18.         {
  19.             int sum = 0, i = 1;
  20.             while (n > 0) {
  21.                 sum = sum + n % 10 * i;
  22.                 n /= 10;
  23.                 i *= 9;
  24.             }
  25.             return sum;
  26.         }
  27.         static void Main(string[] args) {
  28.             string sb;
  29.             while ((sb = Console.ReadLine()) != null) {
  30.                 int n = int.Parse(sb);
  31.                 if (judge(n))
  32.                     Console.WriteLine("Unlucky");
  33.                 else
  34.                     Console.WriteLine(fuck(n));
  35.             }
  36.         }
  37.     }
  38. }

1039 单目标0/1背包问题
1040 用动态规划求解矩阵乘法链问题

1041 找零钱

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1041 {
  7.     /// <summary>
  8.     /// 哈哈，这个方法就问你6不6
  9.     /// </summary>
  10.     class Program {
  11.         static void Main(string[] args) {
  12.             int n = int.Parse(Console.ReadLine());
  13.             int x1, x2, x3, x4, x5, x6, x7;
  14.             x1 = n / 100;
  15.             n = n % 100;
  16.             x2 = n / 50;
  17.             n = n % 50;
  18.             x3 = n / 20;
  19.             n = n % 20;
  20.             x4 = n / 10;
  21.             n = n % 10;
  22.             x5 = n / 5;
  23.             n = n % 5;
  24.             x6 = n / 2;
  25.             n = n % 2;
  26.             x7 = n;
  27.             for (int i = 0; i < x1; i++)
  28.                 Console.WriteLine("100");
  29.             for (int i = 0; i < x2; i++)
  30.                 Console.WriteLine("50");
  31.             for (int i = 0; i < x3; i++)
  32.                 Console.WriteLine("20");
  33.             for (int i = 0; i < x4; i++)
  34.                 Console.WriteLine("10");
  35.             for (int i = 0; i < x5; i++)
  36.                 Console.WriteLine("5");
  37.             for (int i = 0; i < x6; i++)
  38.                 Console.WriteLine("2");
  39.             for (int i = 0; i < x7; i++)
  40.                 Console.WriteLine("1");
  41.         }
  42.     }
  43. }

1042 二进制计算

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1042 {
  7.     class Program {
  8.         static long f(long a)//2进制转换成10进制
  9.         {
  10.             long s = 0, j = 1;
  11.             while (a > 0) {
  12.                 s += (a % 10) * j;
  13.                 a = a / 10;
  14.                 j = j * 2;
  15.             }
  16.             return s;
  17.         }
  19.         static long g(long s)//10进制转换成2进制
  20.         {
  21.             long j = 1, n = 0;
  22.             while (s > 0) {
  23.                 n += (s % 2) * j;
  24.                 s = s / 2;
  25.                 j *= 10;
  26.             }
  27.             return n;
  28.         }
  29.         static void Main(string[] args) {
  30.             string sb;
  31.             while ((sb = Console.ReadLine()) != null) {
  32.                 string[] s = sb.Split();
  33.                 long a = long.Parse(s[0]), b = long.Parse(s[2]);
  34.                 if (s[1] == "+")
  35.                     Console.WriteLine(g(f(a) + f(b)));
  36.                 else
  37.                     Console.WriteLine(g(f(a) - f(b)));
  38.             }
  39.         }
  40.     }
  41. }

1043 n个人的工作分配
1044 用分枝定界法求解TSP问题

1045 删除重复

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1045 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             int n = int.Parse(Console.ReadLine());
  10.             string[] s = Console.ReadLine().Split();
  11.             int[] a = new int[210];
  12.             for (int i = 0; i < n; i++)
  13.                 a[i] = int.Parse(s[i]);
  14.             Array.Sort(a, 0, n);
  15.             Console.WriteLine(a[0]);
  16.             for (int i = 1; i < n; i++)
  17.                 if (a[i] != a[i - 1])
  18.                     Console.WriteLine(a[i]);
  19.             //Console.ReadLine();
  20.         }
  21.     }
  22. }

1046 单词统计问题

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1046 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string s = Console.ReadLine();
  10.             string[] ss = s.Split();
  11.             Console.WriteLine(ss.Length);
  12.             Array.Sort(ss, 0, ss.Length);
  13.             int j = 0;
  14.             string[] ans = new string[ss.Length];
  15.             int[] an = new int[ss.Length];
  16.             ans[0] = ss[0];
  17.             an[0] = 1;
  18.             for (int i = 1; i < ss.Length; i++) {
  19.                 if (ss[i] != ss[i - 1]) {
  20.                     j++;
  21.                     ans[j] = ss[i];
  22.                     an[j]++;
  23.                 } else {
  24.                     an[j]++;
  25.                 }
  26.             }
  27.             for (int i = 0; i <= j; i++)
  28.                 Console.WriteLine(ans[i] + ":" + an[i]);
  29.             //Console.ReadLine();
  30.         }
  31.     }
  32. }

1047 排序

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1047 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             int n = int.Parse(Console.ReadLine());
  10.             int jt = int.Parse(Console.ReadLine());
  11.             string[] s = Console.ReadLine().Split();
  12.             int[] a = new int[1005];
  13.             for (int i = 0; i < n; i++)
  14.                 a[i] = int.Parse(s[i]);
  15.             Array.Sort(a, 0, n);
  16.             if (jt == 0) {
  17.                 for (int i = 0; i < n; i++)
  18.                     Console.WriteLine(a[i]);
  19.             } else {
  20.                 for (int i = n - 1; i >= 0; i--)
  21.                     Console.WriteLine(a[i]);
  22.             }
  23.             //Console.ReadLine();
  24.         }
  25.     }
  26. }

1048 求某一整数序列的全排列问题

1049 矩阵翻转

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1049 {
  7.     class Program {
  8.         static int[,] a = new int[101, 101];
  9.         static void f(int n)//翻转90度
  10.         {
  11.             for (int j = n - 1; j >= 0; j--) {
  12.                 for (int i = 0; i < n; i++) {
  13.                     Console.Write("{0} ", a[i, j]);
  14.                 }
  15.                 Console.WriteLine();
  16.             }
  17.         }
  18.         static void g(int n)//翻转180度
  19.         {
  20.             for (int i = n - 1; i >= 0; i--) {
  21.                 for (int j = n - 1; j >= 0; j--) {
  22.                     Console.Write("{0} ", a[i, j]);
  23.                 }
  24.                 Console.WriteLine();
  25.             }
  26.         }
  27.         static void h(int n)//翻转270度
  28.         {
  29.             for (int i = 0; i < n; i++) {
  30.                 for (int j = n - 1; j >= 0; j--) {
  31.                     Console.Write("{0} ", a[j, i]);
  32.                 }
  33.                 Console.WriteLine();
  34.             }
  35.         }
  36.         static void Main(string[] args) {
  37.             int n = int.Parse(Console.ReadLine());
  38.             int m = int.Parse(Console.ReadLine());
  39.             for (int i = 0; i < n; i++) {
  40.                 string[] s = Console.ReadLine().Split();
  41.                 for (int j = 0; j < n; j++) {
  42.                     a[i, j] = int.Parse(s[j]);
  43.                 }
  44.             }
  45.             if (m == 1)
  46.                 f(n);
  47.             if (m == 2)
  48.                 g(n);
  49.             if (m == 3)
  50.                 h(n);
  51.             //Console.ReadLine();
  52.         }
  53.     }
  54. }

1050 C语言合法标识符

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1050 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             int n = int.Parse(Console.ReadLine());
  10.             while (n-- > 0) {
  11.                 string str = Console.ReadLine();
  12.                 int s = 0, s1 = 0;
  13.                 for (int i = 0; i < str.Length; i++) {
  14.                     if (str[i] == '_') s++;
  15.                     if (str[i] >= '0' && str[i] <= '9' && i != 0 || str[i] >= 'a' && str[i] <= 'z' || str[i] >= 'A' && str[i] <= 'Z')
  16.                         s1++;
  17.                 }
  18.                 if (s + s1 == str.Length)
  19.                     Console.WriteLine("yes");
  20.                 else
  21.                     Console.WriteLine("no");
  22.             }
  23.         }
  24.     }
  25. }

1051 首字母变大写

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1051 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string sb;
  10.             while ((sb = Console.ReadLine()) != null) {
  11.                 Console.Write(sb[0].ToString().ToUpper());
  12.                 for (int i = 1; i < sb.Length; i++)
  13.                     if (sb[i - 1] == ' ')
  14.                         Console.Write(sb[i].ToString().ToUpper());
  15.                     else
  16.                         Console.Write(sb[i]);
  17.                 Console.WriteLine();
  18.             }
  19.         }
  20.     }
  21. }

1052 字符串统计

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1052 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             int n = int.Parse(Console.ReadLine());
  10.             while (n-- > 0) {
  11.                 string sb = Console.ReadLine();
  12.                 int count = 0;
  13.                 for (int i = 0; i < sb.Length; i++)
  14.                     if (sb[i] >= '0' && sb[i] <= '9')
  15.                         count++;
  16.                 Console.WriteLine(count);
  17.             }
  18.         }
  19.     }
  20. }

1053 大数阶乘

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1053 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string sb;
  10.             int i, j, temp, start, sc, N = 1200;
  11.             while ((sb = Console.ReadLine()) != null) {
  12.                 int n = int.Parse(sb);
  13.                 int[] a = new int[N];
  14.                 for (a[0] = 1, i = 1; i <= n; i++)
  15.                     for (sc = 0, j = 0; j < N; j++) {
  16.                         temp = a[j] * i + sc;//当前这一位的数乘上i,然后加上后面来的进位
  17.                         sc = temp / 10;//sc代表进位
  18.                         a[j] = temp % 10;//本位保留模后的结果
  19.                     }
  20.                 //数据是倒着存的，即1*2*3*4=24，存是是按420000000...保存的，一直有N=1200位
  21.                 for (start = N - 1; a[start] == 0; --start) ;//这里是确定从后面哪一位开始输出，从后向前输出
  22.                 for (; start >= 0; --start)
  23.                     Console.Write(a[start]);
  24.                 Console.WriteLine();
  25.             }
  26.         }
  27.     }
  28. }

1054 求逆序数
1055 矩阵乘法

1056 三点顺序

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1056 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string s;
  10.             while ((s = Console.ReadLine()) != null) {
  11.                 string[] b = s.Split();
  12.                 int[] a = new int[6];
  13.                 for (int i = 0; i < 6; i++)
  14.                     a[i] = int.Parse(b[i]);
  15.                 if (a[0] + a[1] + a[2] + a[3] + a[4] + a[5] == 0) break;
  16.                 int c = a[2] - a[0], d = a[3] - a[1], e = a[4] - a[2], f = a[5] - a[3];
  17.                 if (c * f - d * e > 0)
  18.                     Console.WriteLine("0");
  19.                 else
  20.                     Console.WriteLine("1");
  21.             }
  22.         }
  23.     }
  24. }

1057 评委打分

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1057 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string sb;
  10.             while ((sb = Console.ReadLine()) != null) {
  11.                 string[] s = sb.Split();
  12.                 int n = int.Parse(s[0]);
  13.                 double max = -100000000, min = 10000000, sum = 0;
  14.                 for (int i = 1; i <= n; i++) {
  15.                     sum += double.Parse(s[i]);
  16.                     if (double.Parse(s[i]) > max) max = double.Parse(s[i]);
  17.                     if (double.Parse(s[i]) < min) min = double.Parse(s[i]);
  18.                 }
  19.                 double average = (sum - max - min) / (n - 2);
  20.                 Console.WriteLine(average.ToString("0.00"));
  21.             }
  23.         }
  24.     }
  25. }

1058 货币兑换

1059 Picture

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1059 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string sb;
  10.             while ((sb = Console.ReadLine()) != null) {
  11.                 string[] s = sb.Split();
  12.                 int n = int.Parse(s[0]), m = int.Parse(s[1]);
  13.                 Console.Write("+");//第一行
  14.                 for (int i = 0; i < n; i++)
  15.                     Console.Write("-");
  16.                 Console.WriteLine("+");
  17.                 for (int i = 0; i < m; i++)//中间的|和空格
  18.                 {
  19.                     Console.Write("|");
  20.                     for (int j = 0; j < n; j++)
  21.                         Console.Write(" ");
  22.                     Console.WriteLine("|");
  23.                 }
  24.                 Console.Write("+");//最后一行，和第一行一样
  25.                 for (int i = 0; i < n; i++)
  26.                     Console.Write("-");
  27.                 Console.WriteLine("+");
  28.                 Console.WriteLine();
  29.             }
  30.         }
  31.     }
  32. }

1060 取个标题好难

1061 最小公倍数

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1061 {
  7.     class Program {
  8.         static int gcd(int a, int b) {
  9.             return b == 0 ? a : gcd(b, a % b);
  10.         }
  11.         static int lcm(int a, int b) {
  12.             return a / gcd(a, b) * b;
  13.         }
  14.         static void Main(string[] args) {
  15.             string s;
  16.             while ((s = Console.ReadLine()) != null) {
  17.                 string[] sb = s.Split();
  18.                 int n = int.Parse(sb[0]);
  19.                 int sum = 1;
  20.                 for (int i = 1; i <= n; i++)
  21.                     sum = lcm(sum, int.Parse(sb[i]));
  22.                 Console.WriteLine(sum);
  23.             }
  25.         }
  26.     }
  27. }

1062 最左边一位数

1063 发奖学金咯^_^

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1063 {
  7.     class Program {
  8.         static int f(int n)//该函数由Problem_1041改编而来
  9.         {
  10.             int[] b = { 100, 50, 10, 5, 2, 1 }; //开数组，储存币种
  11.             int kk;
  12.             int count = 0;
  13.             for (int i = 0; i < 6; i++) {
  14.                 kk = n / b[i];//除即可得kk张面值为a[i]的零钱
  15.                 n %= b[i];
  16.                 count += kk;
  17.             }
  18.             return count;
  19.         }
  20.         static void Main(string[] args) {
  21.             string sb;
  22.             while ((sb = Console.ReadLine()) != null) {
  23.                 int n = int.Parse(sb);
  24.                 if (n == 0) break;
  25.                 string[] s = Console.ReadLine().Split();
  26.                 int sum = 0;
  27.                 for (int i = 0; i < n; i++) {
  28.                     int x = int.Parse(s[i]);
  29.                     sum += f(x);
  30.                 }
  31.                 Console.WriteLine(sum);
  32.             }
  33.         }
  34.     }
  35. }

1064 A+B(1)

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1064 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string sb;
  10.             while ((sb = Console.ReadLine()) != null) {
  11.                 string[] s = sb.Split();
  12.                 int x = int.Parse(s[0]), y = int.Parse(s[1]);
  13.                 Console.WriteLine(x + y);
  14.             }
  15.         }
  16.     }
  17. }

1065 A+B(2)

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1065 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             int n = int.Parse(Console.ReadLine());
  10.             while (n-- > 0) {
  11.                 string[] sb = Console.ReadLine().Split();
  12.                 int x = int.Parse(sb[0]), y = int.Parse(sb[1]);
  13.                 Console.WriteLine(x + y);
  14.             }
  15.         }
  16.     }
  17. }

1066 A+B(3)

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1066 {
  7.     /// <summary>
  8.     /// 表示这条道题我很郁闷，又是一直RE
  9.     /// what's a fuck
  10.     /// </summary>
  11.     class Program {
  12.         static void Main(string[] args) {
  13.             string sb;
  14.             while ((sb = Console.ReadLine()) != null) {
  15.                 string[] s = sb.Split();
  16.                 int n = int.Parse(s[0]);
  17.                 if (n == 0) break;
  18.                 int sum = 0;
  19.                 for (int i = 1; i <= n; i++)
  20.                     sum += int.Parse(s[i]);
  21.                 Console.WriteLine(sum);
  22.             }
  23.         }
  24.     }
  25. }

1067 A+B(4)

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1067 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string sb;
  10.             while ((sb = Console.ReadLine()) != null) {
  11.                 string[] s = sb.Split();
  12.                 int x = int.Parse(s[0]), y = int.Parse(s[1]);
  13.                 if (x == 0 && y == 0) break;
  14.                 Console.WriteLine(x + y);
  15.             }
  16.         }
  17.     }
  18. }

1068 A+B(5)

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1068 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             int n = int.Parse(Console.ReadLine());
  10.             while (n-- > 0) {
  11.                 string[] s = Console.ReadLine().Split();
  12.                 int t = int.Parse(s[0]);
  13.                 int sum = 0, i = 1;
  14.                 while (t-- > 0) {
  15.                     sum += int.Parse(s[i]);
  16.                     i++;
  17.                 }
  18.                 Console.WriteLine(sum);
  19.             }
  21.         }
  22.     }
  23. }

1069 A+B(6)

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1069 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string sb;
  10.             while ((sb = Console.ReadLine()) != null) {
  11.                 string[] s = sb.Split();
  12.                 int n = int.Parse(s[0]);
  13.                 //if (n == 0) break;
  14.                 int sum = 0, i = 1;
  15.                 while (n-- > 0) {
  16.                     sum += int.Parse(s[i]);
  17.                     i++;
  18.                 }
  19.                 Console.WriteLine(sum);
  20.             }
  21.         }
  22.     }
  23. }

1070 A+B(7)

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1070 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string sb;
  10.             while ((sb = Console.ReadLine()) != null) {
  11.                 string[] s = sb.Split();
  12.                 int x = int.Parse(s[0]), y = int.Parse(s[1]);
  13.                 Console.WriteLine(x + y);
  14.                 Console.WriteLine();
  15.             }
  16.         }
  17.     }
  18. }

1071 A+B(8)

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1071 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             int n = int.Parse(Console.ReadLine());
  10.             while (n-- > 0) {
  11.                 string[] s = Console.ReadLine().Split();
  12.                 int t = int.Parse(s[0]);
  13.                 int sum = 0, i = 1;
  14.                 while (t-- > 0) {
  15.                     sum += int.Parse(s[i]);
  16.                     i++;
  17.                 }
  18.                 Console.WriteLine(sum);
  19.                 Console.WriteLine();
  20.             }
  21.         }
  22.     }
  23. }

1072 Sum Problem

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1072 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string sb;
  10.             while ((sb = Console.ReadLine()) != null) {
  11.                 long n = long.Parse(sb);
  12.                 long sum = (1 + n) * n / 2;
  13.                 Console.WriteLine(sum);
  14.             }
  15.         }
  16.     }
  17. }

1073 Let the Balloon Rise

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1073 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string sn;
  10.             while (!(sn = Console.ReadLine()).Equals("0")) {
  11.                 int n = int.Parse(sn);
  12.                 string[] s = new string[n + 5];
  13.                 for (int i = 0 ; i < n ; i++)
  14.                     s[i] = Console.ReadLine();
  15.                 string axb = s[0];
  16.                 Array.Sort(s , 0 , n);
  17.                 int max = 1;
  18.                 int count = 1;
  19.                 int flag = 0;
  20.                 for (int i = 0 ; i < n ; i++) {
  21.                     count = 1;
  22.                     for (int j = i + 1 ; j < n ; j++) {
  23.                         if (s[j].Equals(s[i]))
  24.                             count++;
  25.                         else
  26.                             break;
  27.                     }
  28.                     if (count > max) {
  29.                         max = count;
  30.                         flag = i;
  31.                     }
  32.                 }
  33.                 if (max == 1)//??????????????????????????????????????????????????????????????
  34.                     Console.WriteLine(axb);
  35.                 else
  36.                     Console.WriteLine(s[flag]);
  37.             }
  38.         }
  39.     }
  40. }

1074 人见人爱A^B

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1074 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string sb;
  10.             while ((sb = Console.ReadLine()) != null) {
  11.                 string[] s = sb.Split();
  12.                 int n = int.Parse(s[0]), m = int.Parse(s[1]);
  13.                 if (n + m == 0) break;
  14.                 int ans = 1;
  15.                 for (int i = 1; i <= m; i++) {
  16.                     ans *= n;
  17.                     ans %= 1000;
  18.                 }
  19.                 Console.WriteLine(ans);
  20.             }
  21.         }
  22.     }
  23. }

1075 第几天？

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1075 {
  7.     class Program {
  8.         static bool leapyear(int n) {
  9.             if ((n % 4 == 0 && n % 100 != 0) || n % 400 == 0)
  10.                 return true;
  11.             return false;
  12.         }
  13.         static void Main(string[] args) {
  14.             string sb;
  15.             while ((sb = Console.ReadLine()) != null) {
  16.                 int x = 0, y = 0;//前面这一大串就是要解决输入问题，真尼玛坑
  17.                 for (int i = 0; i < sb.Length; i++) {
  18.                     if (sb[i] == '/' && x == 0)
  19.                         x = i;
  20.                     if (sb[i] == '/' && x != 0)
  21.                         y = i;
  22.                 }
  23.                 int year = int.Parse(sb.Substring(0, x));
  24.                 int month = int.Parse(sb.Substring(x + 1, y - x - 1));
  25.                 int day = int.Parse(sb.Substring(y + 1, sb.Length - y - 1));
  26.                 //Console.WriteLine(year + " " + month + " " + day);
  27.                 int[] a = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };//非闰年
  28.                 int[] b = { 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };//闰年
  29.                 int sum = 0;
  30.                 if (leapyear(year)) {
  31.                     for (int i = 0; i < month - 1; i++)
  32.                         sum += b[i];
  33.                     sum += day;
  34.                 } else {
  35.                     for (int i = 0; i < month - 1; i++)
  36.                         sum += a[i];
  37.                     sum += day;
  38.                 }
  39.                 Console.WriteLine(sum);
  40.             }
  41.         }
  42.     }
  43. }

1076 Encoding

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1076 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             int t = int.Parse(Console.ReadLine());
  10.             while (t-- > 0) {
  11.                 int c = 1;
  12.                 string s = Console.ReadLine();
  13.                 for (int i = 1; i < s.Length; i++) {
  14.                     if (s[i] == s[i - 1]) ++c;
  15.                     else {
  16.                         if (c > 1)
  17.                             Console.Write(c);
  18.                         Console.Write(s[i - 1]);
  19.                         c = 1;
  20.                     }
  21.                 }
  22.                 if (s[s.Length - 1] == s[s.Length - 2])
  23.                     Console.Write("{0}{1}", c, s[s.Length - 2]);
  24.                 else
  25.                     Console.Write(s[s.Length - 1]);
  26.                 Console.WriteLine();
  27.             }
  28.         }
  29.     }
  30. }

1077 The 3n + 1 problem

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1077 {
  7.     /// <summary>
  8.     /// 找一个范围内转换次数最多的次数输出
  9.     /// </summary>
  10.     class Program {
  11.         static int tsy(int a) {
  12.             int count = 1;
  13.             while (a != 1) {
  14.                 if (a % 2 == 1) { a = 3 * a + 1; count++; } else { a /= 2; count++; }
  15.             }
  16.             return count;
  17.         }
  18.         static void Main(string[] args) {
  19.             string sb;
  20.             while ((sb = Console.ReadLine()) != null) {
  21.                 string[] s = sb.Split();
  22.                 int n = int.Parse(s[0]), m = int.Parse(s[1]);
  23.                 int n1 = n, m1 = m;
  24.                 if (n > m) {
  25.                     int temp = m;
  26.                     m = n;
  27.                     n = temp;
  28.                 }
  29.                 int max = -1;
  30.                 for (int i = n; i <= m; i++) {
  31.                     int count = tsy(i);
  32.                     if (count > max) max = count;
  33.                 }
  34.                 Console.WriteLine("{0} {1} {2}", n1, m1, max);
  35.             }
  36.         }
  37.     }
  38. }

1078 n-1位数

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1078 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             int n = int.Parse(Console.ReadLine());
  10.             while (n-- > 0) {
  11.                 string sb = Console.ReadLine();
  12.                 int ans = int.Parse(sb) - (int)Math.Pow(10.0, sb.Length - 1) * (sb[0] - '0');
  13.                 Console.WriteLine(ans);
  14.             }
  15.         }
  16.     }
  17. }

1079 周期串

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1079 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string s;
  10.             while ((s = Console.ReadLine()) != null) {
  11.                 int t = 0;
  12.                 bool falg = true;
  13.                 for (int i = 1; i <= s.Length; i++) {
  14.                     if (s.Length % i == 0 && falg) {
  15.                         string sb = s.Substring(0, i);
  16.                         int j = 0;
  17.                         for (j = i; j < s.Length; j += i) {
  18.                             string temp = s.Substring(j, i);
  19.                             if (temp != sb) {
  20.                                 break;
  21.                             }
  22.                         }
  23.                         if (j == s.Length) { t = i; falg = false; break; }
  24.                     }
  25.                 }
  26.                 Console.WriteLine(t);
  27.             }
  28.         }
  29.     }
  30. }

1080 奇数检测

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1080 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             int t = int.Parse(Console.ReadLine());
  10.             while (t-- > 0) {
  11.                 string[] s = Console.ReadLine().Split();
  12.                 int n = int.Parse(s[0]);
  13.                 int[] a = new int[10001];
  14.                 for (int i = 1; i <= n; i++)
  15.                     a[int.Parse(s[i])]++;
  16.                 for (int i = 0; i < 10001; i++)
  17.                     if (a[i] != 0 && a[i] % 2 == 1) {
  18.                         Console.WriteLine(i);
  19.                         break;
  20.                     }
  21.             }
  22.         }
  23.     }
  24. }

1081 小明A+B(2)

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1081 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string s = Console.ReadLine();
  10.             string b = Console.ReadLine();
  11.             int x = int.Parse(Console.ReadLine());
  12.             int n = (s[s.Length - 1] - '0') + (b[b.Length - 1] - '0');
  13.             if (n % 10 == x)
  14.                 Console.WriteLine("YES");
  15.             else
  16.                 Console.WriteLine("NO");
  17.             //Console.ReadLine();
  18.         }
  19.     }
  20. }

1082 螺旋矩阵

1083 分！分！分! 学生的命根
  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  5. using System.Text.RegularExpressions;
  7. namespace AK1083 {
  8.     class Program {
  9.         struct people {
  10.             public string name;
  11.             public double yin, zheng, shu, zhuan;
  12.             public double zong;
  13.             public double chu;
  14.             public double fu;
  15.         };
  16.         public class MyComparer : IComparer<people> {
  17.             int IComparer<people>.Compare(people x, people y) {
  18.                 if (x.zong == y.zong) {
  19.                     return x.name.CompareTo(y.name);
  20.                 }
  21.                 return x.zong < y.zong ? 1 : -1;
  22.             }
  23.         }
  24.         static void Main(string[] args) {
  25.             string[] s = Console.ReadLine().Split();
  26.             double[] a = new double[5 + 2];
  27.             for (int i = 0; i < 5; i++)
  28.                 a[i] = double.Parse(s[i]);
  29.             string str;
  30.             people[] sql = new people[205];
  31.             int j = 0;
  32.             while ((str = Console.ReadLine()) != null) {
  33.                 string[] ss = Regex.Split(str, @"\s+");
  34.                 sql[j].name = ss[0];
  35.                 sql[j].yin = double.Parse(ss[1]);
  36.                 sql[j].zheng = double.Parse(ss[2]);
  37.                 sql[j].shu = double.Parse(ss[3]);
  38.                 sql[j].zhuan = double.Parse(ss[4]);
  39.                 sql[j].chu = sql[j].yin + sql[j].zheng + sql[j].shu + sql[j].zhuan;
  40.                 sql[j].fu = double.Parse(ss[5]);
  41.                 sql[j].zong = sql[j].chu * 0.6 + sql[j].fu * 0.4;
  42.                 j++;
  43.             }
  44.             Array.Sort(sql, 0, j, new MyComparer());
  45.             int rank = 1;
  46.             for (int i = 0; i < j; i++) {
  47.                 if (sql[i].chu >= a[4] && sql[i].yin >= a[0] && sql[i].zheng >= a[1] && sql[i].shu >= a[2] && sql[i].zhuan >= a[3] && sql[i].fu >= 60)
  48.                     Console.WriteLine("{0} {1} {2} {3} {4}", sql[i].name, sql[i].chu, sql[i].fu, sql[i].zong.ToString("0.0"), rank++);
  49.             }
  50.             Console.ReadLine();
  51.         }
  52.     }
  53. }

1084 找子串

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1084 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string s;
  10.             while ((s = Console.ReadLine()) != null) {
  11.                 int count = 0;
  12.                 string b = Console.ReadLine();
  13.                 for (int i = 0; i < s.Length - b.Length + 1; i++) {
  14.                     string sb = s.Substring(i, b.Length);
  15.                     if (sb.Equals(b))
  16.                         count++;
  17.                 }
  18.                 Console.WriteLine(count);
  19.             }
  20.         }
  21.     }
  22. }

1085 判断奇偶性

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1085 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string sb;
  10.             while ((sb = Console.ReadLine()) != null) {
  11.                 long n = long.Parse(sb);
  12.                 long count = 0;
  13.                 while (n > 0) {
  14.                     count += n % 2;
  15.                     n = n >> 1;
  16.                 }
  17.                 if (count % 2 == 0)
  18.                     Console.WriteLine("even");
  19.                 else
  20.                     Console.WriteLine("odd");
  21.             }
  22.         }
  23.     }
  24. }

1086 逆转一个数中的位

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1086 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string sb;
  10.             while ((sb = Console.ReadLine()) != null) {
  11.                 long n = long.Parse(sb);
  12.                 long i = 1, ans = 0;
  13.                 while (n > 0) {
  14.                     long temp = n % 2;
  15.                     ans = ans * 2 + temp;//摸出来的一次*2即可
  16.                     n = n / 2;
  17.                 }
  18.                 Console.WriteLine(ans);
  19.             }
  20.         }
  21.     }
  22. }

1087 图书馆占位

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1087 {
  7.     class Program {
  8.         struct Time {
  9.             public int start;
  10.             public int end;
  11.         }
  12.         public class MyComparer : IComparer<Time> {
  13.             int IComparer<Time>.Compare(Time a , Time b) {
  14.                 return a.end < b.end ? -1 : 1;
  15.             }
  16.         }
  17.         static void Main(string[] args) {
  18.             string s;
  19.             while ((s = Console.ReadLine()) != null) {
  20.                 int n = int.Parse(s);
  21.                 Time[] a = new Time[n + 5];
  22.                 for (int i = 0 ; i < n ; i++) {
  23.                     string[] ss = Console.ReadLine().Split();
  24.                     a[i].start = int.Parse(ss[0]);
  25.                     a[i].end = int.Parse(ss[1]);
  26.                 }
  27.                 Array.Sort(a , 0 , n , new MyComparer());
  28.                 int count = 1 , temp = a[0].end;
  29.                 for (int i = 1 ; i < n ; i++) {
  30.                     if (a[i].start >= temp) {
  31.                         count++;
  32.                         temp = a[i].end;
  33.                     }
  34.                 }
  35.                 Console.WriteLine(count);
  36.             }
  37.         }
  38.     }
  39. }

1088 输出二叉树

1089 寻找幸运数

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1089 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string s;
  10.             while ((s = Console.ReadLine()) != null) {
  11.                 string[] sb = s.Split();
  12.                 int a = int.Parse(sb[0]), b = int.Parse(sb[1]), c = int.Parse(sb[2]);
  13.                 if (a + b + c == -3) break;
  14.                 else {
  15.                     bool flag = false;
  16.                     if (a <= 168) {
  17.                         flag = true;
  18.                         Console.WriteLine("CRASH {0}", a);
  19.                     }
  20.                     if (!flag && b <= 168) {
  21.                         flag = true;
  22.                         Console.WriteLine("CRASH {0}", b);
  23.                     }
  24.                     if (!flag && c <= 168) {
  25.                         flag = true;
  26.                         Console.WriteLine("CRASH {0}", c);
  27.                     }
  28.                     if (!flag)
  29.                         Console.WriteLine("NO CRASH");
  30.                 }
  31.             }
  32.         }
  33.     }
  34. }

1090 简单编码

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1090 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string sb;
  10.             while ((sb = Console.ReadLine()) != null) {
  11.                 if (sb.Equals("END")) break;
  12.                 for (int i = 0; i < sb.Length; i++) {
  13.                     if (sb[i] == 'A' || sb[i] == 'W' || sb[i] == 'F') Console.Write("I");
  14.                     else if (sb[i] == 'C') Console.Write("L");
  15.                     else if (sb[i] == 'M') Console.Write("o");
  16.                     else if (sb[i] == 'S') Console.Write("v");
  17.                     else if (sb[i] == 'D' || sb[i] == 'P' || sb[i] == 'G' || sb[i] == 'B') Console.Write("e");
  18.                     else if (sb[i] == 'L') Console.Write("Y");
  19.                     else if (sb[i] == 'X') Console.Write("u");
  20.                     else Console.Write(sb[i]);
  21.                 }
  22.                 Console.WriteLine();
  23.             }
  24.         }
  25.     }
  26. }

1091 逆反A*B

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1091 {
  7.     class Program {
  8.         static int fuck(int n) {
  9.             int sum = 0;
  10.             while (n > 0) {
  11.                 sum = sum * 10 + n % 10;
  12.                 n /= 10;
  13.             }
  14.             return sum;
  15.         }
  16.         static void Main(string[] args) {
  17.             string s;
  18.             while ((s = Console.ReadLine()) != null) {
  19.                 string[] sb = s.Split();
  20.                 int a = int.Parse(sb[0]), b = int.Parse(sb[1]);
  21.                 Console.WriteLine(fuck(fuck(a) * fuck(b)));
  22.             }
  23.         }
  24.     }
  25. }

1092 整数变换问题

1093 一种排序

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK093 {
  7.     class Program {
  8.         struct Rectangle {
  9.             public int len , wid , bian;
  10.         }
  11.         public class MyComparer : IComparer<Rectangle> {
  12.             int IComparer<Rectangle>.Compare(Rectangle x , Rectangle y) {
  13.                 if (x.bian == y.bian) {
  14.                     if (x.len == y.len)
  15.                         return x.wid < y.wid ? -1 : 1;
  16.                     return x.len < y.len ? -1 : 1;
  17.                 }
  18.                 return x.bian < y.bian ? -1 : 1;
  19.             }
  20.         }
  21.         static void Main(string[] args) {
  22.             int n = int.Parse(Console.ReadLine());
  23.             while (n-- > 0) {
  24.                 int m = int.Parse(Console.ReadLine());
  25.                 Rectangle[] a = new Rectangle[m + 5];
  26.                 for (int i = 0 ; i < m ; i++) {
  27.                     string[] te = Console.ReadLine().Split();
  28.                     a[i].bian = int.Parse(te[0]);
  29.                     a[i].len = Math.Max(int.Parse(te[1]) , int.Parse(te[2]));
  30.                     a[i].wid = Math.Min(int.Parse(te[1]) , int.Parse(te[2]));
  31.                 }
  32.                 Array.Sort(a , 0 , m , new MyComparer());
  33.                 Console.WriteLine(a[0].bian + " " + a[0].len + " " + a[0].wid);
  34.                 for (int i = 1 ; i < m ; i++) {
  35.                     if (a[i].len == a[i - 1].len && a[i].wid == a[i - 1].wid && a[i].bian == a[i - 1].bian)
  36.                         continue;
  37.                     Console.WriteLine(a[i].bian + " " + a[i].len + " " + a[i].wid);
  38.                 }
  39.             }
  40.         }
  41.     }
  42. }

1094 圆柱体的表面积

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1094 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string[] sb = Console.ReadLine().Split();
  10.             double r = double.Parse(sb[0]), h = double.Parse(sb[1]);
  11.             double area = (2 * r * r + 2 * r * h) * Math.PI;
  12.             Console.Write("Area=");
  13.             Console.WriteLine(area.ToString("0.000"));
  14.         }
  15.     }
  16. }

1095 三位数反转

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1095 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             int n = int.Parse(Console.ReadLine());
  10.             Console.WriteLine(n % 10 * 100 + n / 10 % 10 * 10 + n / 100);
  11.         }
  12.     }
  13. }

1096 变量交换

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1096 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string[] sb = Console.ReadLine().Split();
  10.             Console.WriteLine("{0} {1}", sb[1], sb[0]);
  11.         }
  12.     }
  13. }

1097 三整数排序

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1097 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string[] sb = Console.ReadLine().Split();
  10.             int[] a = new int[3];
  11.             a[0] = int.Parse(sb[0]); a[1] = int.Parse(sb[1]); a[2] = int.Parse(sb[2]);
  12.             Array.Sort(a);
  13.             Console.WriteLine("{0} {1} {2}", a[0], a[1], a[2]);
  14.         }
  15.     }
  16. }

1098 计算平均数

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1098 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             string[] sb = Console.ReadLine().Split();
  10.             double x = double.Parse(sb[0]), y = double.Parse(sb[1]), z = double.Parse(sb[2]);
  11.             Console.WriteLine(((x + y + z) / 3).ToString("0.000"));
  12.         }
  13.     }
  14. }

1099 温度转化

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  6. namespace AK1099 {
  7.     class Program {
  8.         static void Main(string[] args) {
  9.             int f = int.Parse(Console.ReadLine());
  10.             double c = 5.0 * (f - 32) / 9;
  11.             Console.WriteLine(c.ToString("0.000"));
  12.         }
  13.     }
  14. }
添加新批注
在作者公开此批注前，只有你和作者可见。
回复批注