Posts
 
Reputation
Joined
Last Seen
0 Reputation Points
Unknown Quality Score

No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.

0 Endorsements
~1K People Reached
Favorite Tags
Member Avatar for iamnot

I am using mysql to fetch this result from the database.I need to caluclate the rank of a prticular user id from this result.What is the easy and smart way of doing it? SELECT a.UserId,d.AreaId,d.SubjectId, SUM( a.Marks ) AS sum, COUNT( a.Marks ) AS count, SUM( a.Marks ) / COUNT( …

Member Avatar for diafol
0
174
Member Avatar for iamnot

I need to store both text and images to be stored in the same field? How can this be implemented in php using a mysql database? I have used BLOB to store images in the past . Which datatype should I use for this problem? And how will this work...? …

Member Avatar for smantscheff
0
186
Member Avatar for iamnot

Sample Input: 20 10 2 5 2 Sample Output: 2 Explanation: An amount of 20 could be made in 2 ways: 10*2 10*1 + 5*2 I want to find out the number of ways a particular amount can be made with given coins.In the sample input 20 is the amount …

Member Avatar for sepp2k
0
132
Member Avatar for iamnot

I am generating the sequence 1,3,8,22,60,.... upto 10^9 the term mod of 10^9+7; However my code is giving inaccurate answers for large value of n. The formula I am using is ((1+Q)^(n+1)-(1-Q)^(n+1))/(4*Q) Here Q is sqrt (3) Here is my code.Can someone point out the error in the code or …

Member Avatar for Ancient Dragon
0
250
Member Avatar for iamnot

This code is give in a data structures book I issued from my library. I am not able to understand how the functions are working. I am aware of the algorithms. Can anyone please explain how qinsert(),qremove(),build(),encode() are working.Please explain in detail [CODE]#include <stdio.h> #include <string.h> typedef struct node_t { …

Member Avatar for Mouche
0
220
Member Avatar for iamnot

[CODE]#include<stdio.h> #include<conio.h> #include<string.h> struct node {struct node * left,*right; int freq; char c; }; typedef struct node node; int front=1; node * q[256]; char * code[128]={0},array[1024]; node * new (int freq,char c,node * a ,node * b) { node * n=(node *)malloc(sizeof(node )); if(freq) {n->c=c; n->freq=freq;} else {n->left=a;n->right=b; n->freq=a->freq+b->freq; } …

Member Avatar for gerard4143
0
187