SER15

-
#include <stdio.h>
    #include <math.h>
     
    int main()
    {
        long int n,i,x,root,val,flag=0;
        scanf("%ld",&n);
        for(i=1;i<=100000;i++)
        {
            val=(i*(i+1))/2;
            if(val>n/2)
            break;
            x=(n-val)*2;
            root=sqrt(x);
            if(x==(root*(root+1)))
            {
                flag=1;
                break;
            }
        }
        if(flag==1)
        printf("YES");
        else
        printf("NO");
        return 0;
    }

Comments

Post a Comment

Popular posts from this blog

SORT15

-
QUESTION DESCRIPTION  Given an array of distinct positive numbers, the task is to calculate the minimum number of subsets (or subsequences) from the array such that each subset contains consecutive numbers. Mandatory variables are "int n and int t" Input: The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each test case contains an integer N, denoting the length of the array. Next line contains N space seperated integers of the array. Output: For each test case output a new line denoting count of number of such subset's that contains consecutive numbers. Constraints: 1<=T<=100 1<=N<=50 TEST CASE 1  INPUT 2 11 100 56 5 6 102 58 101 57 7 103 5 3 10 100 105 OUTPUT 4 3 TEST CASE 2  INPUT 5 12 12 23 85 11 65 22 87 24 10 86 64 63 5 1 5 3 2 6 7 6 8 1 7 2 5 4 10 45 21 74 44 72 20 4 73 5 46 8 4 2 9 5 3 7 8 1 OUTPUT 4 2 2 4 2 #include <stdio.h> int i,count=0,j; void sort(int a[],int n) { int i,j,t...
Read more

AR15

-
QUESTION DESCRIPTION  Ramar has set of numbers and somu has set of numbers. Now the class instructor is asking to add to sorted arrays. The task is to merge them in a sorted manner. Mandatory method should be "void mergeArrays(int arr1[], int arr2[], int n1,int n2, int arr3[])" TEST CASE 1  INPUT 5 4 1 2 4 9 15 2 3 7 8 OUTPUT 1 2 2 3 4 7 8 9 15 TEST CASE 2  INPUT 5 6 1 2 4 9 15 2 3 7 8 18 20 OUTPUT 1 2 2 3 4 7 8 9 15 18 20 #include <stdio.h> void mergeArrays(int arr1[], int arr2[], int n1,int n2, int arr3[]) { int i,j; for(i=0;i<(n1+n2);i++) { if(i<n1) arr3[i]=arr1[i]; else arr3[i]=arr2[i-n1]; } for(i=0;i<n1+n2-1;i++) { for(j=0;j<n1+n2-1-i;j++) { if(arr3[j]>arr3[j+1]) { int temp=arr3[j]; arr3[j]=arr3[j+1]; arr3[j+1]=temp; } } }//sorting completed for(i=0;i<n1+n2;i++) printf("%d ",arr3[i]); } int main() { int n1, n2,i,j; sc...
Read more

SER12

-
QUESTION DESCRIPTION  There is a classroom which has M M rows of benches in it. Also, N N students will arrive one-by-one and take a seat. Every student has a preferred row number(rows are numbered 1 1 to M M and all rows have a maximum capacity K K. Now, the students come one by one starting from 1 1 to N N and follow these rules for seating arrangements: Every student will sit in his/her preferred row(if the row is not full). If the preferred row is fully occupied, the student will sit in the next vacant row. (Next row for N will be 1) If all the seats are occupied, the student will not be able to sit anywhere. Monk wants to know the total number of students who didn't get to sit in their preferred row. (This includes the students that did not get a seat at all) Mandatory to use loop condition as "while(x!=y)" Input First line contains 3 integers N N, M M and K K. N N - Number of students and M M - Number of rows and K K - maximum capacity of a row. Next line contains...
Read more