摘要：
判断回文：using System;using System.Collections.Generic;using System.Linq;using System.Text;namespace 判断回文{ class Program { static void Main(string[] args) { string s = Console.ReadLine(); int len=s.Length; int Flag=0; for (int i = 0; i num[... 阅读全文
摘要：
数字颠倒输出：using System;using System.Collections.Generic;using System.Linq;using System.Text;namespace 数字颠倒输出{ class Program { static void Main(string[] args) { int n; String s = Console.ReadLine(); n = int.Parse(s); while (n!=0) ... 阅读全文
摘要：
Wooden Sticks Time Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 5Accepted Submission(s) : 2Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem DescriptionThere is a pile of n wooden sticks. The length and weight of each stick are known in a 阅读全文
摘要：
N皇后问题 Time Limit : 2000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 11Accepted Submission(s) : 3Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem Description在N*N的方格棋盘放置了N个皇后，使得它们不相互攻击（即任意2个皇后不允许处在同一排，同一列，也不允许处在与棋盘边框成45角的斜线上。你的任务是，对于给定的N，求出有多少种合法的放置方法 阅读全文
摘要：
A + B Problem II Time Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 13Accepted Submission(s) : 4Font: Times New Roman | Verdana | Georgia Font Size: ← →Problem DescriptionI have a very simple problem for you. Given two integers A and B, your job is to 阅读全文