SPOJ | Solved SPOJ problems | Learning library

I'm trying to get the job done MOHIBPIZ - PIZZA (https://www.spoj.com/problems/MOHIBPIZ/). I'm already sitting on it the second day, I've tried everything I can and found on the internet. The last chance before giving up is to ask you guys For recudces time I'm using InputOutput class created by davidsekar (https://github.com/davidsekar/C-sharp-Programming-IO/blob/master/ConsoleInOut/InputOutput.cs) but still I have time "time limit exceeded". :(

I tried with two loops, but the method with the function seems more optimal to me. Thanks in advance for all the hints, suggestions and answers.

This is code (link on ideone: https://ideone.com/):

I'm a beginner in c# and I'm training on codeforces and SPOJ to learning how to solve problems, the problem with me is when the loop is break doesn't print all the input it's just end the program without printing

please can someone tell me what is the mistake in these 2 codes that i write >

the Input: 1,2,88,42 ,99 Output: 1,2,88

I was solving

https://www.spoj.com/problems/BEADS/

above question at SPOJ. I have stated the relevant information below:

Problem Statement: The description of the necklace is a string A = a1a2 ... am specifying sizes of the particular beads, where the last character am is considered to precede character a1 in circular fashion. The disjoint point i is said to be worse than the disjoint point j if and only if the string aiai+1 ... ana1 ... ai-1 is lexicografically smaller than the string ajaj+1 ... ana1 ... aj-1. String a1a2 ... an is lexicografically smaller than the string b1b2 ... bn if and only if there exists an integer i, i <= n, so that aj=bj, for each j, 1 <= j < i and ai < bi.

Output: For each test case, print exactly one line containing only one integer -- number of the bead which is the first at the worst possible disjoining, i.e. such i, that the string A[i] is lexicographically smallest among all the n possible disjoinings of a necklace. If there are more than one solution, print the one with the lowest i.

Now the solution is using SUFFIX ARRAY. Input string s, and concat with itself, s'=s+s ,since I have to sort cyclic suffixes of array. Then create a suffix array on s', and output the smallest index that points to a suffix of original s, i.e., index < len(s).

But there is a problem I face. I was appending '$' character to get SA, but I was getting wrong answer. After looking online, I found 1 solution that had appended '}' to string. I found that ascii('$') < ascii('a') < ascii('z') < ascii('}')

But i don't understand how this will make a difference, why this is accepted answer and haven;t found a case where this will make a difference. The solution (AC) can be found here:

Link to Code

I am trying to solve the SPOJ problem DIVFACT where we need to find the factorial of a number. Though I used the correct formulae and at the same time I also checked the special case of 0 and 1,still I am getting wrong answer and it's really difficult for me to figure out what's wrong with my code. Can someone please help me figure out the problem? For reference I am providing the link to the problem:- Link of the problem

Using pandas/python, I want to calculate the longest increasing subsequence of tuples for each DTE group, but efficiently with 13M rows. Right now, using apply/iteration, takes about 10 hours.

Here's roughly my problem:

I am solving task on spoj platform - count number of digits in factorial. I found Kamenetsky Formula and implemented it:

I tried a problem from SPOJ called The next palindrome. The problem statement is given as

A positive integer is called a palindrome if its representation in the decimal system is the same when read from left to right and from right to left. For a given positive integer K of not more than 1000000 digits, write the value of the smallest palindrome larger than K to output. Numbers are always displayed without leading zeros.

Here is my code

I'm trying to submit this code on spoj https://www.spoj.com/problems/PALIN which is asking to find next smallest palindrome of a given number n, but as this code works, it is slow therefor it exceeds the time limit (2-9 seconds). is there another way to solve this exercise in a faster way?

The first line contains integer t, the number of test cases. Integers K are given in the next t lines.

code:

The following code gets TLE (time limit exceeded) if the standard output is not flushed.