Hoang Le

@ei150006tuan

Paraguay, Ha Noi

Joined Nov 2016

World Rank: #117407 (0 points)

Institution: Ha Noi

********NHỚ THAY ĐỔI STYLE CODE NHA MẤY THÍM PLZ****** EIUTesting: class Program { public static StringBuilder Print = new StringBuilder(); public static long Count = 0; static void Main(string[] args) { var N = NextLong(); var A = NextLong(); var B = NextLong(); var Y = NextLong(); long[] array = new long[N]; Count = 0; for (int j = 0; j < N; j++) { if (j == 0) { array[j] = (A * A) % (B + A); } else { array[j] = ((array[j - 1] + A) * A) % (B + A); } } for (int u = 0; u < Y; u++) { var V = NextLong(); var C = NextLong(); Count = 0; foreach(var item in array) { if(item == V) { Count++; } } if (Count == C) { Print.AppendLine("Yes"); } else Print.AppendLine("No"); } Console.Write(Print); Console.ReadLine(); } Thêm hàm Next này kia EIUStore: static void Main(string[] args) { int N = NextInt(), M = NextInt(); int Count = 0; List<int> V = new List<int>(); for (int i = 0; i < N; i++) { V.Add(NextInt()); } V.Sort(); foreach(var item in V) { Console.WriteLine(item); } for (int i = V.Count() - 1; i > 0; i--) { M -= V[i]; if (M >= 0) Count++; else { M += V[i]; M -= V[i - 1]; if (M >= 0) { Count++; } else break; } } Console.WriteLine(Count); Console.ReadKey(); } **NHỚ THAY ĐỔI STYLE CODE NHA MẤY THÍM PLZ

Activity over the last year

Effectiveness

 Problems solved
0
 Solutions submitted
0

Problems

List of solved classical problems: