August 18, 2019 SER14 #include <stdio.h> int main() { int n,i,f,c,a[1000]; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&a[i]); } scanf("%d",&f); for(i=0;i<n;i++) { if(a[i]==f) { c=i; break; } } if(c>0) { printf("%d",c); } else { printf("-1"); } return 0; } Share Get link Facebook X Pinterest Email Other Apps Share Get link Facebook X Pinterest Email Other Apps Comments
August 20, 2019 SORT 14 #include<stdio.h> int main() { int a[1001]; int n,i,j,t,swap,temp,k,m,s,r,x=1,ss=1,c=1,f=0; scanf("%d", &t); while(t--) { swap=0; scanf("%d %d %d", &m,&s,&n); for(i=0; i<n; i++){ scanf("%d", &a[i]); } for(i=0; i<n-1; i++){ //temp=i; for(j=0;j<n-i-1;j++){ //temp=a[j]; if(a[j]>a[j+1]){ temp=a[j]; a[j]=a[j+1]; a[j+1]=temp; ... Read more
DS August 20, 2019 SORT 3 #include <iostream> using namespace std; void printArr(int arr[], int size) { for(int i=0;i<size;i++) { cout<<arr[i]<<" "; } cout<<endl; } void sort(int a[],int n) { for(int i=0;i<n-1;i++) { for(int j=0;j<n-i-1;j++) { if(a[j]>a[j+1]) { int temp=a[j]; a[j]=a[j+1]; a[j+1]=temp; } } if(i==2) printArr(a,n); } } int main() { int n; cin>>n; int a[n]; for(int i=0;i<n;i++) { cin>>a[i]; } sort(a,n); cout<<"Sorted array:"; printArr(a,n); return 0; } Read more
August 20, 2019 SORT 10 #include<iostream> using namespace std; int MEGA_SALE(int [],int ,int ) ; void bubble_sort(int [],int ) ; int minof(int ,int ) ; int main() { int t,arr[100],no,i,k ; cin>>t ; while(t--) { cin>>no ; cin>>k ; for(i=0;i<no;i++) cin>>arr[i] ; no=MEGA_SALE(arr,no,k) ; cout<<abs(no)<<endl ; } return 0; } int MEGA_SALE(int arr[],int no,int k) { int i ; bubble_sort(arr,no) ; int sum=0 ; for(i=0;i<k;i++) sum=minof(sum,sum+arr[i]) ; return sum ; } void bubble_sort(int arr[],int no) { int i,j,temp ; for(i=0;i<no-1;i++) { ... Read more
Comments
Post a Comment