Number 10 Downing Street (Residence of the British Prime Minister)
10 D S
s w i t z e r l a n d
Yes But I Cant Elope 1-Y 2-E 3-S 4-B 5-U 6-T 7-I 8-C 9-A 10-N 11-T 12-E 13-L 14-O 15-P 16-E <3 =D All false equations: 6-L 7-R 5-N 2-A 11-I 8-D 15-A 10-P 13-R 3-D
these letters stand for the months of the year january february march ... the next letters would be s o n d Hope i helped you lol xx:)
S. A. D. has written: 'Samuel Gardner Drake' -- subject(s): Biography, Library, Book collectors, Antiquarian booksellers
A. G. Paspate s has written: 'Vyzantinai meletai topographikai kai historikai meta pleisto n eikono n'
#include<stdio.h> #include<conio.h> main() { int n,s=0,sum=0,i,d; printf("enter the number"); scanf("%d",&n); while(n>0) { d=n%10; s=s+d; n=n/10; } while(s>0) { i=s%10; sum=sum+i; s=s/10; } printf("%d",sum); getch(); }
Void main () { Int n, r, s = 0 ; Printf (" Enter the number") Scanf ("% d", & n); While (n! = 0) { r = n%/10; s = s+r; n = n/10; s = s+r; n = n/10 } Printf ("sun of the dijit of a no. is % d; s)
#include #include void main(){long n,s=0,t,d;clrscr();cout > n;t=n;while(n>0){d=n%10;s=s+d;n=n/10;}cout
#include<stdio.h> #include<conio.h> void main() { clrscr(); int r=0,d,m,n; printf("Enter a value="); scanf("%d",&n); m=n; do { d=m%10; m=m/10; r=(r*10)+d; } while(m!=0); printf("%d is the reverse",r); getch(); }
public class TwistedPrime { public static void main(int n)//Enter a number { int num,s=0,c=0,d; num=n; while(n>0) { d=n%10; s=s*10+d; n=n/10; { for(int i=1;i<s;i++) { if(s%i==0) c++; } } } if(c==1) System.out.print("Number is Twisted Prime"); else System.out.print("Number is not T.P."); } }
/* PROGRAM BY SOUMEN KARMAKAR College of Engineering and Management ,Kolaghat 3rd Year Information Technology Note: Compile the program under Linux environment using gcc. If you want to compile it under turbo c then modify the program */ // Program to solve matrix Minima (Transportation Problem) #include <stdio.h> void input_data(int a[][10],int b[][10],int s[10],int d[10]); void show_data(int a[][10],int b[][10],int s[10],int d[10]); void matrix_min(int a[][10],int b[][10],int s[10],int d[10]); int m,n; int main(void) { int a[10][10],b[10][10],s[10],d[10]; printf("\nEnter the no of supply & demand\n"); scanf("%d %d",&m,&n); input_data(a,b,s,d); show_data(a,b,s,d); matrix_min(a,b,s,d); return (0); } void input_data(int a[][10],int b[][10],int s[10],int d[10]) { int i,j; printf("\nEnter the cost matrix\n"); for(i=0;i<m;i++) { for(j=0;j<n;j++) scanf("%d",&a[i][j]); } for(i=0;i<m;i++) { for(j=0;j<n;j++) b[i][j]=-1; } printf("\nEnter the supply \n"); for(i=0;i<m;i++) scanf("%d",&s[i]); printf("\nEnter the demand\n"); for(i=0;i<n;i++) scanf("%d",&d[i]); } void show_data(int a[][10],int b[][10],int s[10],int d[10]) { int i,j; printf("\n \t\t\tSupply\n"); for(i=0;i<m;i++) { printf("\n"); for(j=0;j<n;j++) { printf("%d (%d) ",a[i][j],b[i][j]); } printf(" | %d",s[i]); } printf("\n------------------------\n"); printf("\nDemand "); printf("%d ",d[i]); } void matrix_min(int a[][10],int b[][10],int s[10],int d[10]) { int i,j,s1,d1,cost,min,t1,t2,sd; int tag[10][10]; s1=0; d1=0; for(i=0;i<m;i++) { s1=s1+s[i]; } printf("\nsupply= %d",s1); for(j=0;j<n;j++) { d1=d1+d[j]; } printf("\ndemand= %d",d1); if(s1!=d1) printf("\nIt is unbalanced\nSo new table is\n\n"); if(s1>d1) { n++; for(i=0;i<m;i++) { a[i][n-1]=0; b[i][n-1]=-1; } d[n-1]=s1-d1; d1=s1; show_data(a,b,s,d); } else if(s1<d1) { m++; for(j=0;j<n;j++) { a[m-1][j]=0; b[m-1][j]=-1; } s[m-1]=d1-s1; s1=d1; show_data(a,b,s,d); } //MAIN CALCULATION for(i=0;i<m;i++) { for(j=0;j<n;j++) { tag[i][j]=-1; } } printf("\nTag matrix \n"); for(i=0;i<m;i++) { printf("\n"); for(j=0;j<n;j++) { printf("%d ",tag[i][j]); } } cost=0; sd=0; while(sd!=s1) { for(i=0;i<m;i++) { for(j=0;j<n;j++) { if(tag[i][j]==-1) { min=a[i][j]; t1=i; t2=j; break; } } } for(i=0;i<m;i++) { for(j=0;j<n;j++) { if(tag[i][j]==-1) { if(min>a[i][j]) { min=a[i][j]; t1=i; t2=j; } } } } printf("\nMin =%d\n",min); if(d[t2]==s[t1]) { cost=cost+a[t1][t2]*s[t1]; b[t1][t2]=s[t1]; sd=sd+s[t1]; d[t2]=0; s[t1]=0; show_data(a,b,s,d); for(j=0;j<n;j++) { if(tag[t1][j]==0) continue; tag[t1][j]=0; } for(i=0;i<m;i++) { if(tag[i][t2]==0) continue; tag[i][t2]=0; } printf("\nTag matrix \n"); for(i=0;i<m;i++) { printf("\n"); for(j=0;j<n;j++) { printf("%d ",tag[i][j]); } } } else if(d[t2]>s[t1]) { cost=cost+a[t1][t2]*s[t1]; b[t1][t2]=s[t1]; sd=sd+s[t1]; d[t2]=d[t2]-s[t1]; s[t1]=0; show_data(a,b,s,d); for(j=0;j<n;j++) { if(tag[t1][j]==0) continue; tag[t1][j]=0; } printf("\nTag matrix \n"); for(i=0;i<m;i++) { printf("\n"); for(j=0;j<n;j++) { printf("%d ",tag[i][j]); } } } else { cost=cost+a[t1][t2]*d[t2]; b[t1][t2]=d[t2]; sd=sd+d[t2]; s[t1]=s[t1]-d[t2]; d[t2]=0; show_data(a,b,s,d); for(i=0;i<m;i++) { if(tag[i][t2]==0) continue; tag[i][t2]=0; } printf("\nTag matrix \n"); for(i=0;i<m;i++) { printf("\n"); for(j=0;j<n;j++) { printf("%d ",tag[i][j]); } } } } printf("\nCost is =%d\n",cost); } // Thank You.........
you need n d n n s n n s n n = nothing s = stick d = diamond
#include<stdio.h> void main() { int *p,n,s=0; printf("Enter Number :"); scanf("%d",&n); for(p=&n;*p>0;p++) { s=s*10+*p%10; *p=*p/10; } printf("Reverse Number=%d",s); }
import java.io.*; public class Jerry { public static void main(String as[]) throws IOException { int k=Integer.parseInt(as[0]); int n=k; int d=0,s=0; while(n>0) { d=n%10; s=s+(d*d*d); n=n/10; } if(k==s) System.out.println("Armstrong number"); else System.out.println("not Armstrong number"); } }
# include<stdio.h> # include<conio.h> void main() { int n; printf("enter the number"); scanf("%d",&n); while(n>0) { s=n%10; printf("%d",s); n=n/10; } getch(); }
#include<stdio.h> #include<conio.h> void main() { int n,s=0,m; clrscr(); printf("enter any no"); scanf("%d",&n); m=n; while(n>0) { r=n%10; s=s*10+r; n=n/10; } if(m==n) printf("the no is palindrome"); else printf("no is not palindrome"); getch(); }
#include<stdio.h> #include<conio.h> main() { int n,s,r,t; clrscr(); printf("enter n"); scanf("%d",&n); s=0;t=0; while(n!=0) { r=n%10; { if(r%2!=0) t=t+r; if(r%2==0) s=s+r; } n=n/10; } printf("sum of even position digits%d\n",s); printf("sum of odd position digits%d\n",t); getch(); }