Problem Solving (Codeforces):

Data type
Problem 1: Area of Circle;
#include<stdio.h>

int main()
{
double r, A;
scanf("%lf",&r);

A= 3.141592653*r*r;
printf("%.9lf\n",A);

return 0;
}
OUTPUT

Problem 2: Summation 1-N;

#include<stdio.h>
int main()
{
long long n, sum;
scanf("%lld",&n);
sum=n*(n+1)/2;
printf("%lld",sum);

return 0;
}
OUTPUT

Problem 3: Digit Summation;

#include<stdio.h>
int main()
{
long long int a, b, x, y;
scanf("%lld %lld", &a, &b);
x=a%10;
y=b%10;
printf("%lld", x+y);

return 0;
}
OUTPUT
 LOOP
Problem 4: A-1 to N;
#include<stdio.h>
int main(){
int i,N;
scanf("%d",&N);
for(i=1; i<=N; i++){
printf("%d\n",i);
}
return 0;

Problem 5: Even Number

#include<stdio.h>
int main(){
int i, n;
scanf("%d",&n);
if(n<2)
printf("-1\n");
for(i=2; i<=n; i+=2){
printf("%d\n",i);
}
return 0;
}
OUTPUT
Problem 6: Even, odd, positive, negative;
#include<stdio.h>
int main(){
int i, n, x, even=0, odd=0, positive=0, negative=0;
scanf("%d",&n);
for(i=0; i<n; i++)
{
scanf("%d",&x);
if(x%2==0)
even++;
if(x%2!=0)
odd++;
if(x>0)
positive++;
if(x<0)
negative++;
}
printf("Even: %d\n", even);
printf("Odd: %d\n", odd);
printf("Positive: %d\n", positive);
printf("Negative: %d\n", negative);
return 0;
}
OUTPUT

Problem 7: Fixed Password;

#include<stdio.h>
int main(){
int x;
scanf("%d",&x);
if(x==1999)
printf("Correct\n");
while(x!=1999)
{
printf("Wrong\n");
scanf("%d",&x);
if(x==1999)
printf("Correct\n");
}
return 0;
}
OUTPUT
Problem 8: Max
#include<stdio.h>
int main(){
int a,n,i,max;
scanf("%d",&n);
for(i=1; i<=n; i++)
{
scanf("%d",&a);
if(i==1)
max=a;
if(max<a)
max=a;
}
printf("%d\n",max);
}
OUTPUT

Problem 9: Multiplication Table

#include<stdio.h>
int main()
{

int x,i;
scanf("%d",&x);
for(i=1; i<=12; i++)
{
printf("%d * %d = %d\n",x,i,i*x);
}
return 0;
}
OUTPUT
Problem 10: Factorial
#include <stdio.h>

int main() {
int n, x, i, j;
long long mul = 1;
scanf("%d", &n);

for (i = 1; i <= n; i++) {

scanf("%d", &x);

for (j = 1; j <= x; j++)

mul = mul * j;

printf("%lld\n", mul);
mul = 1;
}

return 0;
}
OUTPUT

Problem 11: One Prime

#include <stdio.h>

int main() {
int x, i, k = 0;
scanf("%d", &x);

for (i = 2; i < x; i++) {

if (x % i == 0) {
k = 1;
break;
 }
}

if (k == 1)
printf("NO");
else
printf("YES");

return 0;
}
OUTPUT

Problem 12: Divisor;

#include<stdio.h>
int main()
{
int x, i, j;
scanf("%d",&x);
for(i=1; i<=x; i++)
{
if(x%i==0)
{
printf("%d\n",i);
}
}
return 0;
}
OUTPUT

Problem 13: GCD

#include<stdio.h>
int main()
{
int a,b,gcd,i;
scanf("%d%d", &a,&b);
for ( i = 1; i <=a && i<=b; i++)
{
if(a%i==0 && b%i==0)
{
gcd=i;
 }
}
printf("%d\n", gcd);

}
OUTPUT

Problem 14: Pyramid;

#include<stdio.h>
int main()
{
int n, row, col;
scanf("%d",&n);
for(row=1; row<=n; row++)
{
for(col=1; col<=row; col++)
{
printf("*");
}
printf("\n");
}

return 0;
}
OUTPUT