#include<bits/stdc++.h>
using namespace std;
int main()
int n,i,sum=0;
cin>>n;
int arr[n];
for(i=0;i<n;i++)
cin>>arr[i];
sort(arr,arr+n);
for(i=0;i<n;i++)
{
int z= arr[n-i-1]-(i+1);
//cout<<z<<" ";
//cout<<abs(z);
sum=sum+abs(z);
}
cout<<sum;
return 0;
cout<<"swap(l,r);
}/******************************************************************************
Md Shajid Hossain
ID:213902074
*******************************************************************************/
#include <stdio.h>
int main()
{
int n, FirstDigit, DigitsCount, LastDigit, a, b, SwapNum;
printf("\n Please Enter any Number that you wish : ");
scanf("%d", & n);
DigitsCount = log10(n);
FirstDigit = Number / pow(10, DigitsCount);
LastDigit = Number % 10;
a = FirstDigit * (pow(10, DigitsCount));
b = Number % a;
Number = b / 10;
SwapNum = LastDigit * (pow(10, DigitsCount)) + ( n * 10 + FirstDigit);
printf(" \n The Number after Swapping First Digit and Last Digit = %d", SwapNum);
return 0
}template<class T>
//swap() will swap the given two nodes
Chain<T> &Chain<T>::Swap(int n1, int n2) {
ChainNode<T> *prevNode1 = NULL, *prevNode2 = NULL, *node1 = first, *node2 = first;
//Checks if list is empty
if (IsEmpty())
throw OutOfBounds();
//If n1 and n2 are equal, then list will remain the same
if (n1 == n2)
throw OutOfBounds();
//Search for node1
while (node1 != NULL && node1->data != n1) {
prevNode1 = node1;
node1 = node1->link;
}
//Search for node2
while (node2 != NULL && node2->data != n2) {
prevNode2 = node2;
node2 = node2->link;
}
if (node1 != NULL && node2 != NULL) {
//If previous node to node1 is not null then, it will point to node2
if (prevNode1 != NULL)
prevNode1->link = node2;
else
first = node2;
//If previous node to node2 is not null then, it will point to node1
if (prevNode2 != NULL)
prevNode2->link = node1;
else
first = node1;
//Swaps the next nodes of node1 and node2
ChainNode<T> *temp = node1->link;
node1->link = node2->link;
node2->link = temp;
} else {
cout << "Swapping is not possible" << endl;
}#include<stdio.h>
#define SIZE 5
void enQueue(int);
void deQueue();
void display();
int queue[10], front = -1, rear = -1;
void main() {
int value, choice;
while(1){
printf("\n\n***** MENU *****\n");
printf("1. Insertion\n2. Deletion\n3. Display\n4. Exit");
printf("\nEnter your choice: ");
scanf("%d",&choice);
switch(choice){
case 1: printf("Enter the value to be insert: ");
scanf("%d",&value);
enQueue(value);
break;
case 2: deQueue();
break;
case 3: display();
break;
case 4: exit(0);
default: printf("\nWrong selection!!! Try again!!!");
}
}}
void enQueue(int value){
if(rear == SIZE-1)
printf("\nQueue is Full!!! Insertion is not possible!!!");
else{
if(front == -1)
front = 0;
rear++;
queue[rear] = value;
printf("\nInsertion success!!!");
}}def search (list1,key):
for i in range (len(list1)):
if key == list1[i]:
print("key element is found")
break
else:
print("element is not found")
list1 = [34,87,65,98,9,56]
print(list1)
key=int(input("enter the key element:"))
search(list1,key)#include <SPI.h>
#include <Ethernet.h>
#include <EthernetUdp.h>
#include <Servo.h>
byte mac[] = {0xDE, 0xAD, 0xBE, 0xEF, 0xFE, 0xED};
byte ip [] = {192, 168, 0, 20};
unsigned int localport=9001;
char packetBuffer[UDP_TX_PACKET_MAX_SIZE];
int packetSize;
EthernetUDP Udp;
Servo myservo;
int pos = 0;
void setup()
{
myservo.attach(9);
}
void loop()
{
for (pos = 0; pos <= 180; pos += 1)
{
myservo.write(pos);
delay(15);
}
for (pos = 180; pos >= 0; pos -= 1)
{
myservo.write(pos);
delay(15);
}
}