C Manual Pract
C Manual Pract
Loops 3)
#include<stdio.h>
int main()
int a,b,sum;
a=1;
sum=0;
while(b>=0){
a=a+1;
scanf("%d\n",&b);
if(b<0){
break;
sum=sum+b;
Loops5)
#include <stdio.h>
int main() {
scanf("%d", &b);
if (b < 0) {
break;
sum = 0;
rev = 0;
while (b > 0) {
r = b % 10;
sum += r;
rev = rev * 10 + r;
b /= 10;
r = rev % 10;
switch (r) {
rev /= 10;
printf("\n");
return 0;
Array(2)
#include<stdio.h>
int main()
int n,i,max,min;
scanf("%d",&n);
int a[n];
for(i=0;i<=n-1;i++){
scanf("%d",&a[i]);
max=a[0];
for(i=0;i<=n-1;i++){
if(max<a[i]){
max=a[i];
min=a[0];
for(i=0;i<=n-1;i++){
if(min>a[i]){
min=a[i];
Array(3):
#include<stdio.h>
int main()
int i, n;
scanf("%d",&n);
int a[n];
for(i=0;i<=n-1;i++){
scanf("%d",&a[i]);
for(i=n-1;i>=0;i--){
printf("%d",a[i]);
Array(4)
#include<stdio.h>
int main(){
int i, n,swap;
scanf("%d",&n);
int a[n];
swap=0;
for(i=0;i<=n-1;i++){
scanf("%d",&a[i]);
for(i=0;i<=n-1;i++){
printf("%d",a[i]);
for(i=0;i<=n-1;i+=2){
swap=a[i];
a[i]=a[i+1];
a[i+1]=swap;
for(i=0;i<=n-1;i++){
printf("%d",a[i]);
Array(5):
#include<stdio.h>
#include<math.h>
int main()
int i,n;
int a[n];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
for(i=0;i<n;i++){
if(a[i]%2==0){
printf("%d",a[i]*a[i]);
else{
printf("%d",a[i]*a[i]*a[i]);
}
//sorting
#include<stdio.h>
int main(){
int i,pos,n,swap,j;
scanf("%d",&n);
int a[n];
for(i=0;i<=n-1;i++){
scanf("%d",&a[i]);
for(i=0;i<=n-2;i++){
pos=i;
for(j=i+1;j<=n-1;j++){
if(a[j]<a[pos]){
pos=j;
if(pos!=i){
swap=a[i];
a[i]=a[pos];
a[pos]=swap;
for(i=0;i<n;i++){
printf("%d",a[i]);
}
}
2D arrays:
#include<stdio.h>
int main(){
int i,j,n,m;
scanf("%d",&n);
scanf("%d",&m);
int a[n][m];
for(i=0;i<n;i++)
for(j=0;j<m;j++)
scanf("%d",&a[i][j]);
for(i=0;i<n;i++)
for(j=0;j<m;j++)
printf("%d ",a[i][j]);
printf("\n");
Addition:
#include<stdio.h>
int main(){
int m,n,i,j;
scanf("%d",&m);
scanf("%d",&n);
int a[m][n],p[m][n],q[m][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++){
scanf("%d",&p[i][j]);
for(i=0;i<m;i++){
for(j=0;j<n;j++){
q[i][j]=a[i][j]+p[i][j];
for(i=0;i<m;i++){
for(j=0;j<n;j++){
printf("%d ",q[i][j]);
printf("\n");
Diagonal elements
#include<stdio.h>
int main(){
int m,n,i,j;
scanf("%d",&m);
scanf("%d",&n);
int a[m][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++){
if(i==j){
printf("%d",a[i][i]);
}printf("\n");
Transpose:
#include<stdio.h>
int main(){
int m,n,i,j;
scanf("%d",&m);
scanf("%d",&n);
int a[m][n];
for(i=0;i<m;i++){
for(j=0;j<n;j++){
scanf("%d",&a[i][j]);
for(i=0;i<n;i++){
for(j=0;j<m;j++){
printf("%d",a[j][i]);
}printf("\n");
}
}
Trace:
#include<stdio.h>
int main(){
int m,n,i,j,sum;
scanf("%d",&m);
scanf("%d",&n);
int a[m][n];
sum=0;
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++){
if(i==j){
sum=sum+a[i][i];
printf("%d",sum);
}
Reverse of a string:
#include<stdio.h>
int main(){
int i,rev,r,z;
scanf("%d",&r);
while (r>0){
z=r%10;
rev=rev*10+z;
r=r/10;
Factorial:
#include<stdio.h>
int main(){
int i,r,fact;
scanf("%d",&r);
fact=1;
for(i=1;i<=r;i++){
fact=fact*i;
printf("%d",fact);
Factorial:
#include<stdio.h>
int main(){
int i,j,r,l;
scanf("%d",&r);
for(i=1;i<=r;i++){
if(r%i==0){
printf("%d ",i);
Prime
#include<stdio.h>
int main(){
int i,j,k,r,sum;
sum=0;
scanf("%d",&r);
for(i=1;i<=r;i++){
if(r%i==0){
sum=sum+1;
if(sum==2){
printf("Prime");
else{
printf("Composite");
Perfect No.
#include<stdio.h>
int main(){
int i,r,sum;
sum=0;
scanf("%d",&r);
for(i=1;i<r;i++){
if(r%i==0){
sum=sum+i;
}if(sum==r){
printf("Perfect No.");
else{