OJ Board

#include<cstdio>
#include<cmath>
#define max 1004

int prime[max+1];
int twin[max];

void sieve()
{
int i,j;
for(i=2; i <= max; i++)
prime = 1;
for(i=2; i <= sqrt(max);)
{
for(j = 2*i; j <= max; j += i)
{
prime[j]=0;
}
i++;
for(; !prime ; i++);
}
prime[1] = 1;
prime[2] = 1;
prime[0 ...

Thank You Bro

why we sort
the array?
if we sort this

3
911
97625999
91125426

then it becomes

119
25679999
11224569

answer should be "Yes"
please anyone describe this.

Thanks in advance

To Mr. Sohel Hafiz

You said,
"The smallest one can be found by sorting in ascending order.. but there could be a case of leading 0. By swapping the smallest non zero digit with the first zero, this can be handled."

my Question is why we are using this logic?
is there any kind of rule for this ...

Where is the problem in my code
It is showing compiler error

#include<iostream>
#include<String>
using namespace std;
int main()
{
string line;
int i;
while(cin >> line)
{

for(i =0; line != '\0' ; ++i)
{
if((line >= 'H' && line <= 'Z') || (line >= 'h' && line <= 'z'))
putchar(line - 7 ...