UVA 438 (The Circumference of the Circle) Solution
Hints: Suppose that the coordinates of the three points are ( a 1 , a 2 ) , ( a 1 , a 2 ) , ( b 1 , b 2 ) , ( b 1 , b 2 ) , and ( c 1...
Hints: Suppose that the coordinates of the three points are ( a 1 , a 2 ) , ( a 1 , a 2 ) , ( b 1 , b 2 ) , ( b 1 , b 2 ) , and ( c 1...
Solve in C: #include<stdio.h> #include<math.h> int main () { long long int n,a,b,c,d,i; while(scanf("%lld...
Solve in C: #include<stdio.h> #include<math.h> int main () { long long int n,s,flag1,flag=0,i,a,j,sum=0; while(s...
Solve in C: #include<stdio.h> int main(){ int n,a,b,i; scanf("%d",&n); for(i=1;i<=n;i++) { scanf("...
Solve in C: #include<stdio.h> int main(){ int n,a,b,i; scanf("%d",&n); for(i=1;i<=n;i++) { scanf(...
Solve in C: #include<stdio.h> #include<math.h> int main() { double p,n,r; while(scanf("%lf%lf",...
Solve in C: #include<stdio.h> #include<math.h> int main() { int i,j,k,m,n,a,b,c,flag,s,count; for(s=1; s<=20...
Solve In C: #include<stdio.h> int main() { long long int sum=0,i,j,n; printf("PERFECTION OUTPUT\n"); wh...
Solve in C: #include<stdio.h> #include<math.h> int main() { long long int i,j,m,n,a,k,count=0; while(scanf(...
Sove in C: #include<stdio.h> #include<math.h> int main(){ double r,a, x,y,z; int i,n; scanf("%d",&n); fo...
Solve in C: #include<stdio.h> int main() { int a; while(scanf("%d",&a)!=EOF) { if(a%6==0) ...
Solve in C: #include<stdio.h> int main() { int i,n,r,x1,x11,y1,y11,x2,x22,y2,y22,w,l; scanf("%d",&n); ...
Solve in C: #include<stdio.h> int main(){ char x[10]; while(gets(x)) puts(x); return 0; }
Solve in C: #include<stdio.h> #include<math.h> int main() { int i,n; double aa,ga,ra,w,r,l; scanf("%d...
Solve in C: #include<stdio.h> int main(){ printf("KABIR\n"); return 0; }
Problem: https://uva.onlinejudge.org/external/119/11984.pdf Solve in C: #include<stdio.h> int main() { int i,n; whil...
Problem: https://uva.onlinejudge.org/external/124/12478.pdf Solve in C: #include<stdio.h> int main(){ printf("KABIR\n...
Solve in C: #include<stdio.h> int main(){ int n; while(scanf("%d",&n)!=EOF) { if(n==0) break; els...
Solve in C: #include<stdio.h> int main() { int a,b,c,d,l,i,count=0,n; while(scanf("%d%d%d%d%d",&a,&b,...
Solving Technique: The problem asks given a number n how many squares are there in n by n grid. The relation can be found out by drawing ...
Solve in C: #include<stdio.h> int main() { int h1,m1,h2,m2,a; while(scanf("%d%d%d%d",&h1,&m1,&h2...
Solve in C: #include<stdio.h> int main() { int h1,m1,h2,m2,a; while(scanf("%d%d%d%d",&h1,&m1,&h2...
Solve in C: #include<stdio.h> int main(){ int m,n,r; while(scanf("%d%d",&m,&n)!=EOF) { r=m^n; pri...
Solve in C: #include<stdio.h> int main() { int n,i,sum=0,mov=0,count=1,avg,ar[100]; while(scanf("%d",&n)...
Solve in C: #include<stdio.h> int main() { char s1,s2,s3,t1,t2,t3; int d1,d2,m1,m2,y1,y2,n,i,age; double year; ...
Solve in C: #include<stdio.h> #include<math.h> int main() { int n,i=1; double u,v,a,s,t,su,sv,s1,t1; while(s...
Solve in C: #include<stdio.h> int main() { char c; while(scanf("%c",&c)!=EOF) { if(c=='A'||c=='B...
Solve in C: #include<stdio.h> int main(){ int n; while(scanf("%d",&n)!=EOF) { if(n==0) break; printf(...
Solve in C: #include<stdio.h> int main(){ long long int a,b,c; int n,i; scanf("%d",&n); { for(i=1;i<=n...
Solve in C : #include<stdio.h> #include<string.h> int main() { int i,len; char s[1000]; while(gets(s)) ...
Solve in C: #include<stdio.h> #include<math.h> int sz=1000000; int vis[1000005]= {0}; void sieve() { int k=sqrt(sz...
Solve in C: #include<stdio.h> #include <math.h> int main() { int i,count=0,f,g,a,b; while(scanf("%d%d"...
RESTful APIs serve as the foundation of modern web development. They follow a set of rules called Representational State Transfer (REST) t...