Posts

Showing posts with the label code

CODECHEF - ACT2

Problem Code : ATC2 Problem : Harry And N-th Number Platform : Codechef Type : Online Language : C Link : CODECHEF //submitted //https://www.codechef.com/CODH2018/problems/ATC2 #include <stdio.h> #include <stdlib.h> #include <string.h> #include <math.h> void func(long long int arr[]) { int n; scanf("%d",&n); printf("%lld\n",arr[n]); return; } int main() { int cases; scanf("%d",&cases); long long int *arr; arr=(long long int *)malloc(700005*sizeof(long long int)); long long int i; arr[1]=1; for(i=2;i<700002;i++) { arr[i]=arr[i-1]+sqrt(i); } while(cases--) { func(arr); } return 0; }

CODECHEF - L56GAME

Problem Code : L56GAME Problem : Chef and Game with Sequence Platform : Codechef Type : Lunch Time Language : C Link : CODECHEF 1: //working 2: //no option to submit 3: //https://www.codechef.com/LTIME56/problems/L56GAME 4: #include <stdio.h> 5: #include <string.h> 6: #include <stdlib.h> 7: void func() 8: { 9: int n; 10: scanf("%d",&n); 11: int i; 12: int odd=0; 13: int even=0,temp; 14: for(i=0;i<n;i++) 15: { 16: scanf("%d",&temp); 17: if(temp%2==0) 18: { 19: even++; 20: } 21: else 22: { 23: odd++; 24: } 25: } 26: int ans=0; 27: ans=ans+ (odd%2); 28: even = even+ (odd/2); 29: if(even>0) 30: { 31: ans++; 32: } 33: pri...

CODECHEF - RECTANGL

Problem Code : RECTANGL Problem : Rectangle Platform : Codechef Type : Online Language : C Link : CODECHEF 1: //submitted 2: //https://www.codechef.com/JAN18/problems/RECTANGL 3: #include <stdio.h> 4: void func() 5: { 6: int arr[4]; 7: scanf("%d",&arr[0]); 8: scanf("%d",&arr[1]); 9: scanf("%d",&arr[2]); 10: scanf("%d",&arr[3]); 11: int i,j,temp; 12: for(i=0;i<=2;i++) 13: { 14: for(j=0;j<=2-i;j++) 15: { 16: if(arr[j]<arr[j+1]) 17: { 18: temp=arr[j]; 19: arr[j]=arr[j+1]; 20: arr[j+1]=temp; 21: } 22: } 23: } 24: //printf("%d-%d-%d-%d--\n",arr[0],arr[1],arr[2],arr[3]); 25: if(arr[0]==arr[1] && arr[2]==ar...

CODECHEF - CIELAB

Problem Code : CIELAB Problem : Ciel and A-B Problem Platform : Codechef Language : C Level : Easy Link : CODECHEF 1: //submitted 2: //https://www.codechef.com/problems/CIELAB 3: #include <stdio.h> 4: #include<stdlib.h> 5: #include <string.h> 6: void func() 7: { 8: int a,b; 9: scanf("%d",&a); 10: scanf("%d",&b); 11: int ans=a-b; 12: //for +1 13: if((ans+1)%10!=0) 14: { 15: printf("%d\n",ans+1 ); 16: return; 17: } 18: //for -1 19: printf("%d\n",ans-1 ); 20: } 21: int main() 22: { 23: int cases=1; 24: // scanf("%d",&cases); 25: while(cases--) 26: { 27: func(); 28: } 29: return 0; 30: }

CODECHEF - MAXSC

Problem Code : MAXSC Problem : Maximum Score Platform : Codechef Language : C Link : CODECHEF //submitted https://www.codechef.com/JAN18/problems/MAXSC #include <stdio.h> #include <stdlib.h> void func() { int n; scanf("%d",&n); int **arr; arr=(int **)malloc(sizeof(int*)*n); int i,j; for(i=0;i<n;i++) { arr[i]=(int*)malloc(sizeof(int)*n); } for(i=0;i<n;i++) { for(j=0;j<n;j++) { scanf("%d",&arr[i][j]); } } /*for(i=0;i<n;i++) { for(j=0;j<n;j++) { printf("%d ",arr[i][j]); } printf("\n"); }*/ long long int sum=0; int maxasofnow=1000000001; int flag=1; int localmax=-1; for(i=n-1;i...