14 Mar 2013

Money Transformation_solved

/* CODECHEF PROBLEM CODE : MONTRANS */ #include<stdio.h>   int T,a,b,c; void solve() { int step=0,cnt=0; int m=a*100+b; while((a>0||b>=c)&&cnt<10000){ cnt++; if(b<c)a--,b+=100; b-=c; int tmp=a;a=b;b=tmp; int t=a*100+b; if(t>m)m=t,step=cnt; ...

Categories: , , ,

Jurassic Park_solved

/* CODECHEF Problem code: NI01 */ #include<stdio.h> #include<stdlib.h> int n[100002]; int main() { int t,p,r,k,i,m,q,l,c; scanf("%d",&t); while(t--)  { scanf("%d%d%d%d%d%d",&n[0],&m,&q,&p,&r,&k); l=0; for(i=0;i<=k;i++) { if(m&&i&&!(i%r))  ...

Categories: , , ,

Lucky Number_solved

/* CODECHEF PROBLEM CODE :  LUCKY2 */ #include <stdio.h> #include <string.h>   #define siz 1005   int len; int q[siz][siz][4]; char A[siz], B[siz];   char S(int x) { if(!x) return 0; for(;x%10==7||x%10==4; x/=10); return !x; }   int T(int i, int p, int s) { int j, res=0, ob; if(i==-1) return S(p); if(q[i][p][s]!=-1)...

Categories: , , ,

Fire Escape Routes_solved

/* CODECHEF Problem code: FIRESC */ #include<stdio.h> inline int min(int a,int b) { if (a<b) return a; else return b; } int t,n,m,x,y,i,j,id[100002],sz[100002],count,ng; int find(int p) { while (p != id[p]) p = id[p]; return p; } int connected(int p, int q) { if(find(p) == find(q)) return 1; else ...

Categories: , , ,

Transpose matrix

/* program to find a transpose of a matrix..... */ #include <stdio.h> int main() { int a[10][10], trans[10][10], r, c, i, j; printf("Enter rows and column of matrix: "); scanf("%d %d", &r, &c); /* Storing element of matrix entered by user in array a[][]. */ printf("\nEnter elements of matrix:\n"); for(i=0;...

Categories: , ,

Copyright © 2025 UPgradeCODING | Powered by Blogger