UVa problem solution 11470 - Square Sums

problem link:

Discuss: if you know the 2D. then the problem may pretty for you. how i did it first calculate all corner index value.then just increase the value of i and j. and you may trouble how to choose the corner point as it change then use them and analyse  ara[i][j], ara[j][n-1-i], ara[n-1-i][n-1-j], ara[n-1-j][i]  first traverse till n/2 and second loop traverse till n-1-i; examine it . it traverse all the square of the grid. then just print it..


try yourself, before see the code

UVa problem solution 12243 - Flowers Flourish from France

problem link:

Discuss: this is simple implementation problem.you can solve it with just one loop.

try yourself before see the code

UVa problem solution 12527 - Different Digits

problem link:


Discuss: this is simple implementation problem.you can use a bool array to check repeat number.as the range is not so big so you can check every integer individually.

try yourself, before see the code

UVa problem solution 12592 - Slogan Learning of Princess

problem link:

Discuss: this is simple implementation problem.you can do it with map as well as structure.be careful when taking input. you can use 'getline(cin,string_name)'. and also be careful enough memory declare when use structure else there is run time error.

try yourself,before see the code

UVa problem solution 10812 - Beat the Spread!

problem link:


Discuss: just do the class eight problem.no tricky part in this problem.

try yourself,before see the code

UVa problem solution 11988 - Broken Keyboard (a.k.a. Beiju Text)

problem link:

Discuss: this is simple list implementation problem.if you know list then you can it without any trouble. just input the line in a string and then if  '[' in string then change the iterator of string in begin and if you found ']' then change the iterator of string in end.  and else just insert the element in the list.

try your self before see the code

UVa problem solution 10258 - Contest Scoreboard

problem link:

Discuss: though it's a implementation problem.i think pupil coder at least think for some time how to implement. however, you can solve the problem using nested structure.just take input and store in structure and then sort the structure.you can use bubble sort. there is no tricky part in this problem


try yourself,before see the code