Search:

its nt the code of prime number

here it showing segmentation fault....how can i allocate 10^9 memory location


#include<cmath>
#include<stdlib.h>
#include<stdio.h>
//#define MAXSIZE 1000000000
int flag=0;
int flag1=0;...

where can we find acm solution...programming contest

means???
i just wanna know...tool exit or not

is there any tool that can check the similar codes???

#include<stdio.h>
#include<stdlib.h>
typedef struct Node
{
char data[10];
struct Node *next;
}node;

void insertnode(char str1,node *head);
int main()

#include<stdio.h>
#include<stdlib.h>
int main()
{
char str1[10];
typedef struct Node
{
char data[10];
struct Node *next;
}node;

how to take user input stringand store it in array

what is the prob in this


#include<stdio.h>
int main()
{
int a[1000],b[1000],c[1000],new1[1000];
int temp=0,n,q,m,i,j,s,sum=0,flag=0,k,r,flag1=0,sum1=0,count=0,flag2=0;
...

hey if i remove one by one digits then its nt applicable to the number lyk 5320 ...here we will have to remove the 5 and 2 both so how to proceed....for removal of two digits at a same tym

i have my own idea ...but trying to get some more ways to solve the problem so that i can choose a optimal one...thats it....and for the other problems first i gave the algorithm...
anyways thanku...

Given a M × M array of positive and negative integers, find the sub-rectangle with the largest sum. A sub-rectangle is any contiguous sub-array of size 1 × 1 or greater located within the whole...

ohh..yes ...forgot!!!
thanks

#include <string.h>
#include<stdlib.h>
#include<stdio.h>
int main()
{
char str[] = "now is good men";
char delims[] = " ";
char *result[10];
char *result2[10];
int i=0,j=0,k,m;

@nonoob
we'll first sort the input integer then only sum up and if the resultant sum is nt divisible by 3 only then we have toremove one smallest integer and as i told its sorted so finding the...

first get the input string1 and string2
then tokenize the first string and store the tokenized words in array
then
use for loop that will traverse the whole first string and will compare the word...

if one string is permutation of other ....
how to solve it???

thanx ...it works...ur logic ...sum and add...

Output
5554443330
approach-> i sort the given integer for example if 11 integers are given like
33453545440
then first i will apply the sorting that will give
55544443330
next i will divide...

You are given a set of digits, your task is to find the maximum integer that you can make from these digits. The made number must be divisible by 2, 3, 5 without a residue. It is permitted to use...

@phantomotap.
i need it urgently...i have to submit this today...kindly help.

m using ubuntu Os ...but programming in C...

hey i ahve assigned to implement a shell...implementing it in C language.but now got stuck on pipelinig...kindly help me guys...
if possible send the code so that i can get some idea for example...