n
n+1
n+2
n+3
n+4
A single number, such as 3461018, does not make a pattern.
He's at the top of HadesIsle, accessible from the outside, only during N1. There are five questions, which are relatively easy. To make life easier, save before starting his quiz, and through trial and error you'll get the N1 FolderA, which is widely regarded as the best N1 ExtraFolder for the N1 quarterfinals.
They are reverse operations, in the sense that if y is the square of x then x is a square root of y. Remember though, that in the above scenario, -x is also a square root of y.
#include<stdio.h> int main(){ int n1,n2; printf("\nEnter two numbers:"); scanf("%d %d",&n1,&n2); while(n1!=n2){ if(n1>=n2) n1=n1-n2; else n2=n2-n1; } printf("\nGCD=%d",n1); return 0; }
P(x=n1,y=n2) = (n!/n1!*n2!*(n-n1-n2)) * p1^n1*p2^n2*(1-p1-p2) where n1,n2=0,1,2,....n n1+n2<=n
the value of the exponent n1
the value of the exponent n1
#include<stdio.h> int main(){ int n1,n2; printf("\nEnter two numbers:"); scanf("%d %d",&n1,&n2); while(n1!=n2){ if(n1>=n2-1) n1=n1-n2; else n2=n2-n1; } printf("\nGCD=%d",n1); return 0; }
37
Electricity supply commission of south afirca
void main() { int i; float n1,n2; abc: printf("Enter two nos "); scanf("%f%f",&n1,&n2); printf("\n %f + %f = %f " ,n1,n2,n1+n2); printf("\n %f - %f = %f " ,n1,n2,n1-n2); printf("\n %f x %f = %f " ,n1,n2,n1*n2); printf("\n %f / %f = %f " ,n1,n2,n1/n2); printf("\npress 5 to make another calculation"); scanf("%d",&i); if (i==5) goto abc; }
The sum of the first 10 positive integers, using the formula N1 + (N1 + 1) + ... + N2 = N2 * (N2 + 1) / 2 - (N1 - 1) * N1 / 2 is: 55