dhyuti-n/xlcost-variable-roles huggingface dataset:
C# program:
using System ; using System . Collections . Generic ; public class GFG { static List < int > PrimeFactors ( int n ) { List < int > v = new List < int > ( ) ; int x = n ; for ( int i = 2 ; i * i <= n ; i ++ ) { if ( x % i == 0 ) { v . Add ( i ) ; while ( x % i == 0 ) x /= i ; } } if ( x > 1 ) v . Add ( x ) ; return v ; } static int GoodNumber ( int n ) { List < int > v = new List < int > ( PrimeFactors ( n ) ) ; int ans = 1 ; for ( int i = 0 ; i < v . Count ; i ++ ) ans *= v [ i ] ; return ans ; } public static void Main ( String [ ] args ) { int n = 12 ; Console . WriteLine ( GoodNumber ( n ) ) ; } }

Index/key variables: i
Accumulator variables: ans, i, x
Iterator variables: i
Class/struct names: GFG
C# program:
using System ; class GFG { static bool checkSpecialPrime ( bool [ ] sieve , int num ) { while ( num != 0 ) { if ( ! sieve [ num ] ) { return false ; } num /= 10 ; } return true ; } static void findSpecialPrime ( int N ) { bool [ ] sieve = new bool [ N + 10 ] ; for ( int i = 0 ; i < N + 10 ; i ++ ) sieve [ i ] = true ; sieve [ 0 ] = sieve [ 1 ] = false ; for ( int i = 2 ; i <= N ; i ++ ) { if ( sieve [ i ] ) { for ( int j = i * i ; j <= N ; j += i ) { sieve [ j ] = false ; } } } while ( true ) { if ( checkSpecialPrime ( sieve , N ) ) { Console . WriteLine ( N ) ; break ; } else N -- ; } } public static void Main ( ) { findSpecialPrime ( 379 ) ; findSpecialPrime ( 100 ) ; } }

Index/key variables: i, j, num
Accumulator variables: N, i, j, num
Iterator variables: i, j
Class/struct names: GFG
C# program:
using System . Collections . Generic ; class GFG { static int MAX = 1000000 ; static List < int > arr = new List < int > ( ) ; static bool [ ] sprime = new bool [ MAX ] ; static void computeSemiPrime ( ) { for ( int i = 0 ; i < MAX ; i ++ ) sprime [ i ] = false ; for ( int i = 2 ; i < MAX ; i ++ ) { int cnt = 0 ; int num = i ; for ( int j = 2 ; cnt < 2 && j * j <= num ; ++ j ) { while ( num % j == 0 ) { num /= j ; ++ cnt ; } } if ( num > 1 ) ++ cnt ; if ( cnt == 2 ) { sprime [ i ] = true ; arr . Add ( i ) ; } } } static bool checkSemiPrime ( int n ) { int i = 0 ; while ( arr [ i ] <= n / 2 ) { if ( sprime [ n - arr [ i ] ] ) { return true ; } i ++ ; } return false ; } public static void Main ( ) { computeSemiPrime ( ) ; int n = 30 ; if ( checkSemiPrime ( n ) ) System . Console . WriteLine ( " YES " ) ; else System . Console . WriteLine ( " NO " ) ; } }

Index/key variables: MAX, i
Accumulator variables: i, num
Iterator variables: i, j
Class/struct names: GFG
C# program:
using System ; class GFG { static float heightCalculate ( int H , int n , int m ) { float N = ( float ) ( n * 1.0 ) ; float M = ( float ) ( m * 1.0 ) ; float h = H * ( float ) Math . Sqrt ( N / ( N + M ) ) ; return h ; } public static void Main ( ) { int H = 10 , n = 3 , m = 4 ; Console . WriteLine ( heightCalculate ( H , n , m ) ) ; } }

Class/struct names: GFG
C# program:
using System ; class GFG { static bool isprime ( int x ) { for ( int i = 2 ; i * i <= x ; i ++ ) if ( x % i == 0 ) return false ; return true ; } static bool isNSqMinusnMSqPrime ( int m , int n ) { if ( n - m == 1 && isprime ( m + n ) ) return true ; else return false ; } public static void Main ( ) { int m = 13 , n = 16 ; if ( isNSqMinusnMSqPrime ( m , n ) ) Console . Write ( " YES " ) ; else Console . Write ( " NO " ) ; } }

Accumulator variables: i
Iterator variables: i
Class/struct names: GFG
C# program:
using System ; class GFG { static void findsolution ( long n , long x , long y ) { if ( ( y - n + 1 ) * ( y - n + 1 ) + n - 1 < x y < n ) { Console . WriteLine ( " No ▁ solution " ) ; return ; } Console . WriteLine ( y - n + 1 ) ; while ( n -- > 1 ) Console . WriteLine ( "1" ) ; } static public void Main ( ) { long n , x , y ; n = 5 ; x = 15 ; y = 15 ; findsolution ( n , x , y ) ; } }

Accumulator variables: n
Class/struct names: GFG
C# program:
using System ; class GFG { static int findPosition ( int n , int f , int b ) { return n - Math . Max ( f + 1 , n - b ) + 1 ; } public static void Main ( ) { int n = 5 , f = 2 , b = 3 ; Console . WriteLine ( findPosition ( n , f , b ) ) ; } }

Class/struct names: GFG
C# program:
using System ; class GFG { static int nthOdd ( int n ) { return ( 2 * n - 1 ) ; } public static void Main ( ) { int n = 10 ; Console . WriteLine ( nthOdd ( n ) ) ; } }

Class/struct names: GFG
C# program:
using System ; class GFG { static int nthEven ( int n ) { return ( 2 * n ) ; } public static void Main ( ) { int n = 10 ; Console . WriteLine ( nthEven ( n ) ) ; } }

Class/struct names: GFG
C# program:
using System ; class GFG { static int nthTerm ( int n ) { return 2 * ( int ) Math . Pow ( n , 2 ) + n - 3 ; } public static void Main ( ) { int N = 4 ; Console . Write ( nthTerm ( N ) ) ; } }

Class/struct names: GFG
C# program:
using System ; class GFG { static int nthTerm ( int n ) { return 5 * ( int ) Math . Pow ( n , 2 ) - 5 * n ; } public static void Main ( ) { int N = 4 ; Console . Write ( nthTerm ( N ) ) ; } }

Class/struct names: GFG
C# program:
using System ; class GFG { static int nthTerm ( int n ) { return 3 * ( int ) Math . Pow ( n , 2 ) + n - 2 ; } public static void Main ( ) { int N = 4 ; Console . Write ( nthTerm ( N ) ) ; } }

Class/struct names: GFG
C# program:
using System ; class GFG { static int nthTerm ( int n ) { return 2 * ( int ) Math . Pow ( n , 2 ) + 4 * n - 2 ; } public static void Main ( ) { int N = 4 ; Console . Write ( nthTerm ( N ) ) ; } }

Class/struct names: GFG
C# program:
using System ; class GFG { static int nthTerm ( int n ) { return 3 * ( int ) Math . Pow ( n , 2 ) + 2 * n - 5 ; } public static void Main ( ) { int N = 4 ; Console . WriteLine ( nthTerm ( N ) ) ; } }

Class/struct names: GFG
C# program:
using System ; class GFG { static int nthTerm ( int n ) { return 2 * ( int ) Math . Pow ( n , 2 ) + 3 * n - 5 ; } public static void Main ( ) { int N = 4 ; Console . WriteLine ( nthTerm ( N ) ) ; } }

Class/struct names: GFG
C# program:
using System ; class GFG { static int nthTerm ( int n ) { return 4 * ( int ) Math . Pow ( n , 2 ) - 3 * n + 2 ; } public static void Main ( ) { int N = 4 ; Console . WriteLine ( nthTerm ( N ) ) ; } }

Class/struct names: GFG
C# program:
using System ; class GFG { static double PI = 3.1415926535 ; static double findAnglesA ( double a , double b , double c ) { double A = Math . Acos ( ( b * b + c * c - a * a ) / ( 2 * b * c ) ) ; return A * 180 / PI ; } static double findAnglesB ( double a , double b , double c ) { double B = Math . Acos ( ( a * a + c * c - b * b ) / ( 2 * a * c ) ) ; return B * 180 / PI ; } static void printAngles ( int a , int b , int c ) { double x = ( double ) a ; double y = ( double ) b ; double z = ( double ) c ; double A = findAnglesA ( x , y , z ) ; double B = findAnglesB ( x , y , z ) ; Console . WriteLine ( " Angles ▁ are ▁ A ▁ = ▁ " + A + " , ▁ B ▁ = ▁ " + B + " , ▁ C ▁ = ▁ " + 90 ) ; } static void printOtherSides ( int n ) { int b = 0 , c = 0 ; if ( ( n & 1 ) > 0 ) { if ( n == 1 ) Console . WriteLine ( - 1 ) ; else { b = ( n * n - 1 ) / 2 ; c = ( n * n + 1 ) / 2 ; Console . WriteLine ( " Side ▁ b ▁ = ▁ " + b + " , ▁ Side ▁ c ▁ = ▁ " + c ) ; } } else { if ( n == 2 ) Console . WriteLine ( - 1 ) ; else { b = n * n / 4 - 1 ; c = n * n / 4 + 1 ; Console . WriteLine ( " Side ▁ b ▁ = ▁ " + b + " , ▁ Side ▁ c ▁ = ▁ " + c ) ; } } printAngles ( n , b , c ) ; } public static void Main ( ) { int a = 12 ; printOtherSides ( a ) ; } }

Class/struct names: GFG
C# program:
using System ; class GFG { static int calculateSum ( int n ) { return n * ( n + 1 ) / 2 + n * ( n + 1 ) * ( 2 * n + 1 ) / 6 ; } public static void Main ( ) { int n = 3 ; Console . WriteLine ( " Sum ▁ = ▁ " + calculateSum ( n ) ) ; } }

Class/struct names: GFG
C# program:
using System ; class GFG { static int nthTerm ( int n ) { return 2 * ( int ) Math . Pow ( n , 2 ) - n - 1 ; } static public void Main ( ) { int N = 4 ; Console . Write ( nthTerm ( N ) ) ; } }

Class/struct names: GFG
C# program:
using System ; class GFG { static int nthTerm ( int n ) { return 4 * ( int ) Math . Pow ( n , 2 ) - 7 * n + 3 ; } static public void Main ( ) { int N = 4 ; Console . Write ( nthTerm ( N ) ) ; } }

Class/struct names: GFG
C# program:
using System ; class GFG { static void checkIfPowerIsolated ( int num ) { int input = num ; int count = 0 ; int [ ] factor = new int [ num + 1 ] ; if ( num % 2 == 0 ) { while ( num % 2 == 0 ) { ++ count ; num /= 2 ; } factor [ 2 ] = count ; } for ( int i = 3 ; i * i <= num ; i += 2 ) { count = 0 ; while ( num % i == 0 ) { ++ count ; num /= i ; } if ( count > 0 ) factor [ i ] = count ; } if ( num > 1 ) factor [ num ] = 1 ; int product = 1 ; for ( int i = 0 ; i < num + 1 ; i ++ ) { if ( factor [ i ] > 0 ) product = product * factor [ i ] * i ; } if ( product == input ) Console . Write ( " Power - isolated ▁ Integer STRNEWLINE " ) ; else Console . Write ( " Not ▁ a ▁ Power - isolated ▁ Integer STRNEWLINE " ) ; } static void Main ( ) { checkIfPowerIsolated ( 12 ) ; checkIfPowerIsolated ( 18 ) ; checkIfPowerIsolated ( 35 ) ; } }

Index/key variables: i, num
Accumulator variables: i, num
Iterator variables: i
Class/struct names: GFG
C# program:
using System ; class GFG { static long getNthTerm ( long N ) { return ( ( int ) Math . Pow ( N , 2 ) + N + 1 ) ; } static public void Main ( ) { long N = 11 ; Console . Write ( getNthTerm ( N ) ) ; } }

Class/struct names: GFG
C# program:
using System ; class GFG { static long findSum ( int n ) { long sum2 , sum5 , sum10 ; sum2 = ( ( n / 2 ) * ( 4 + ( n / 2 - 1 ) * 2 ) ) / 2 ; sum5 = ( ( n / 5 ) * ( 10 + ( n / 5 - 1 ) * 5 ) ) / 2 ; sum10 = ( ( n / 10 ) * ( 20 + ( n / 10 - 1 ) * 10 ) ) / 2 ; return sum2 + sum5 - sum10 ; } public static void Main ( ) { int n = 5 ; Console . WriteLine ( findSum ( n ) ) ; } }

Class/struct names: GFG
C# program:
using System ; using System . Collections . Generic ; class GFG { static bool isPrime ( int n ) { if ( n <= 1 ) return false ; if ( n <= 3 ) return true ; if ( n % 2 == 0 n % 3 == 0 ) return false ; for ( int i = 5 ; i * i <= n ; i = i + 6 ) if ( n % i == 0 || n % ( i + 2 ) == 0 ) return false ; return true ; } static List < List < int > > v = new List < List < int > > ( ) ; static void factors ( int N ) { for ( int i = 2 ; i < N ; i ++ ) { for ( int j = 1 ; j * j <= i ; j ++ ) { if ( i % j == 0 ) { if ( i / j == j ) v [ i ] . Add ( j ) ; else { v [ i ] . Add ( j ) ; v [ i ] . Add ( i / j ) ; } } } v [ i ] . Sort ( ) ; } } static int product ( int n ) { v . Clear ( ) ; for ( int i = 0 ; i < n + 100 ; i ++ ) v . Add ( new List < int > ( ) ) ; factors ( n + 100 ) ; if ( n % 4 == 0 ) { int x = n / 4 ; x *= x ; return x * x ; } else { if ( isPrime ( n ) ) return - 1 ; else { int ans = - 1 ; if ( v [ n ] . Count > 2 ) { int fac = v [ n ] [ v [ n ] . Count - 3 ] ; for ( int i = v [ n ] . Count - 1 ; i >= 0 ; i -- ) { for ( int j = v [ n ] . Count - 1 ; j >= 0 ; j -- ) { if ( ( fac * 2 ) + ( v [ n ] [ j ] + v [ n ] [ i ] ) == n ) ans = Math . Max ( ans , fac * fac * v [ n ] [ j ] * v [ n ] [ i ] ) ; } } return ans ; } } } return 0 ; } public static void Main ( String [ ] args ) { int n = 24 ; Console . WriteLine ( product ( n ) ) ; } }

Index/key variables: i, j, n
Accumulator variables: i, j, x
Iterator variables: i, j
Class/struct names: GFG
C# program:
using System ; class Nth { float CalculateRatio ( float m , float n ) { return ( 2 * m - 1 ) / ( 2 * n - 1 ) ; } public static void Main ( ) { float m = 6 , n = 2 ; Nth a = new Nth ( ) ; Console . WriteLine ( a . CalculateRatio ( m , n ) ) ; } }

Class/struct names: Nth
C# program:
using System ; class GFG { static int calculateSum ( int n ) { return ( int ) Math . Pow ( n * ( n + 1 ) / 2 , 2 ) ; } public static void Main ( ) { int n = 4 ; Console . WriteLine ( calculateSum ( n ) ) ; } }

Class/struct names: GFG
C# program:
class GFG { static int digSum ( int n ) { if ( n == 0 ) return 0 ; return ( n % 9 == 0 ) ? 9 : ( n % 9 ) ; } static int powerDigitSum ( int a , int n ) { int res = 1 ; while ( n > 0 ) { if ( n % 2 == 1 ) { res = res * digSum ( a ) ; res = digSum ( res ) ; } a = digSum ( digSum ( a ) * digSum ( a ) ) ; n /= 2 ; } return res ; } static void Main ( ) { int a = 9 , n = 4 ; System . Console . WriteLine ( powerDigitSum ( a , n ) ) ; } }

Accumulator variables: n
Class/struct names: GFG
C# program:
using System ; class GFG { static int totEdge ( int n ) { int result = 0 ; result = ( n * ( n - 1 ) ) / 2 ; return result ; } public static void Main ( ) { int n = 6 ; Console . Write ( totEdge ( n ) ) ; } }

Class/struct names: GFG
C# program:
using System ; using System . Collections . Generic ; using System . Linq ; class GFG { static int MAX = 1000005 ; static List < Boolean > prime = new List < Boolean > ( MAX ) ; static void vecIni ( ) { for ( int i = 0 ; i < MAX ; i ++ ) { prime . Add ( true ) ; } } static void sieve ( int N ) { prime . Insert ( 0 , false ) ; prime . Insert ( 1 , false ) ; for ( int i = 2 ; i <= N ; i ++ ) { if ( prime [ i ] ) { for ( int j = 2 ; i * j <= N ; j ++ ) { prime . Insert ( i * j , false ) ; } } } } static int countLogNeeded ( int N ) { int count = 0 ; sieve ( N ) ; for ( int i = 1 ; i <= N ; i ++ ) { if ( prime [ i ] ) { count ++ ; } } return count ; } public static void Main ( ) { vecIni ( ) ; int N = 6 ; Console . Write ( countLogNeeded ( N ) ) ; } }

Index/key variables: i
Accumulator variables: count, i, j
Iterator variables: i, j
Class/struct names: GFG
C# program:
using System ; class GFG { static int coin ( int totalRupees , int X , int Y , int Z ) { float one = 0 , fifty = 0 , twentyfive = 0 , result = 0 , total = 0 ; one = X * 1 ; fifty = ( ( Y * 1 ) / 2 ) ; twentyfive = ( ( Z * 1 ) / 4 ) ; total = one + fifty + twentyfive ; result = ( ( totalRupees ) / total ) ; return ( int ) result ; } public static void Main ( ) { int totalRupees = 1800 ; int X = 1 , Y = 2 , Z = 4 ; int Rupees = coin ( totalRupees , X , Y , Z ) ; Console . WriteLine ( "1 ▁ rupess ▁ coins ▁ = ▁ " + Rupees * 1 ) ; Console . WriteLine ( "50 ▁ paisa ▁ coins ▁ = ▁ " + Rupees * 2 ) ; Console . WriteLine ( "25 ▁ paisa ▁ coins ▁ = ▁ " + Rupees * 4 ) ; } }

Class/struct names: GFG
C# program:
using System ; class GFG { static float sumOfSeries ( int x , int k ) { float y = ( float ) ( ( ( float ) ( x ) / 81 ) * ( 9 * k - 1 + Math . Pow ( 10 , ( - 1 ) * k ) ) ) ; return y ; } public static void Main ( ) { int x = 9 ; int k = 20 ; Console . Write ( sumOfSeries ( x , k ) ) ; } }

Class/struct names: GFG
C# program:
using System ; using System . Collections . Generic ; class GFG { static void findfactors ( int n ) { Dictionary < int , int > mpp = new Dictionary < int , int > ( ) ; List < int > v = new List < int > ( ) , v1 = new List < int > ( ) ; for ( int i = 1 ; i <= ( int ) Math . Sqrt ( n ) ; i ++ ) { if ( n % i == 0 ) { v . Add ( i ) ; if ( i != ( n / i ) && i != 1 ) v . Add ( n / i ) ; } } int s = v . Count ; int maxi = - 1 ; int [ ] mp1_first = new int [ n + 5 ] ; int [ ] mp1_second = new int [ n + 5 ] ; for ( int i = 0 ; i < s ; i ++ ) { for ( int j = i ; j < s ; j ++ ) { if ( v [ i ] + v [ j ] < n ) { v1 . Add ( v [ i ] + v [ j ] ) ; mp1_first [ v [ i ] + v [ j ] ] = v [ i ] ; mp1_second [ v [ i ] + v [ j ] ] = v [ j ] ; mpp . Add ( v [ i ] + v [ j ] , 1 ) ; } } } s = v1 . Count ; for ( int i = 0 ; i < s ; i ++ ) { int el = n - ( v1 [ i ] ) ; if ( mpp . ContainsKey ( el ) ) { int a = mp1_first [ v1 [ i ] ] ; int b = mp1_second [ v1 [ i ] ] ; int c = mp1_first [ n - v1 [ i ] ] ; int d = mp1_second [ n - v1 [ i ] ] ; maxi = Math . Max ( a * b * c * d , maxi ) ; } } if ( maxi == - 1 ) Console . WriteLine ( " Not ▁ Possible " ) ; else { Console . WriteLine ( " The ▁ maximum ▁ product " + " ▁ is ▁ " + maxi ) ; } } public static void Main ( String [ ] args ) { int n = 50 ; findfactors ( n ) ; } }

Index/key variables: i, j
Accumulator variables: i, j
Iterator variables: i, j
Class/struct names: GFG
C# program:
using System ; using System . Collections . Generic ; class GFG { static List < int > factors = new List < int > ( 10 ) ; static void findFactors ( int n ) { for ( int i = 1 ; i * i <= n ; i ++ ) { if ( n % i == 0 ) { if ( ( n / i ) == i ) { factors . Insert ( factors . Count , i ) ; } else { factors . Insert ( factors . Count , n / i ) ; factors . Insert ( factors . Count , i ) ; } } } } static int findProduct ( int n ) { int product = - 1 ; int si = factors . Count ; for ( int i = 0 ; i < si ; i ++ ) { for ( int j = 0 ; j < si ; j ++ ) { for ( int k = 0 ; k < si ; k ++ ) { for ( int l = 0 ; l < si ; l ++ ) { int s = factors [ i ] + factors [ j ] + factors [ k ] + factors [ l ] ; if ( s == n ) { int p = factors [ i ] * factors [ j ] * factors [ k ] * factors [ l ] ; if ( p > product ) { product = p ; } } } } } } return product ; } public static void Main ( String [ ] args ) { int n = 10 ; findFactors ( n ) ; Console . WriteLine ( findProduct ( n ) ) ; } }

Index/key variables: i, j, k, l
Accumulator variables: i, j, k, l
Iterator variables: i, j, k, l
Class/struct names: GFG
C# program:
using System ; public class GFG { static int modExp ( int a , int b ) { int result = 1 ; while ( b > 0 ) { if ( b == 1 ) result = result * a ; a = a * a ; b /= 2 ; } return result ; } static int check ( int num ) { if ( num == 1 num < 3 ) return - 1 ; else if ( num % 4 == 0 ) return modExp ( num / 4 , 4 ) ; else if ( num % 6 == 0 ) return modExp ( num / 3 , 2 ) * modExp ( num / 6 , 2 ) ; else if ( num % 10 == 0 ) return modExp ( num / 5 , 2 ) * ( num / 10 ) * ( num / 2 ) ; else return - 1 ; } static public void Main ( ) { int num = 10 ; Console . WriteLine ( check ( num ) ) ; } }

Accumulator variables: b
Class/struct names: GFG
C# program:
using System ; class GFG { static bool isDivisible ( long n ) { while ( n / 100 > 0 ) { long d = n % 10 ; n /= 10 ; n -= d * 5 ; } return ( n % 17 == 0 ) ; } public static void Main ( ) { long n = 19877658 ; if ( isDivisible ( n ) ) Console . Write ( " Yes " ) ; else Console . Write ( " No " ) ; } }

Accumulator variables: n
Class/struct names: GFG
C# program:
using System ; public class GFG { static int nextPowerOf2 ( int n ) { int count = 0 ; if ( n != 0 && ( n & ( n - 1 ) ) == 0 ) return n ; while ( n != 0 ) { n >>= 1 ; count += 1 ; } return 1 << count ; } static int removeElement ( int n ) { if ( n == 1 n == 2 ) return 0 ; int a = nextPowerOf2 ( n ) ; if ( n == a n == a - 1 ) return 1 ; else if ( n == a - 2 ) return 0 ; else if ( n % 2 == 0 ) return 1 ; else return 2 ; } public static void Main ( ) { int n = 5 ; Console . Write ( removeElement ( n ) ) ; } }

Accumulator variables: count
Class/struct names: GFG
C# program:
using System ; class GFG { static int bridge_length ( int trainLength , int Speed , int Time ) { return ( ( Time * Speed ) - trainLength ) ; } static void Main ( ) { int trainLength = 120 ; int Speed = 30 ; int Time = 18 ; Console . Write ( " Length ▁ of ▁ bridge ▁ = ▁ " + bridge_length ( trainLength , Speed , Time ) + " ▁ meters " ) ; } }

Class/struct names: GFG
C# program:
using System ; class gfg { public long MOD = 1000000007 ; public long modInv ( long x ) { long n = MOD - 2 ; long result = 1 ; while ( n > 0 ) { if ( ( n & 1 ) > 0 ) result = result * x % MOD ; x = x * x % MOD ; n = n / 2 ; } return result ; } public long getSum ( long n , long k ) { long ans = 1 ; for ( long i = n + 1 ; i > n - k ; i -- ) ans = ans * i % MOD ; ans = ans * modInv ( k + 1 ) % MOD ; return ans ; } } class geek { public static int Main ( ) { gfg g = new gfg ( ) ; long n = 3 , k = 2 ; Console . WriteLine ( g . getSum ( n , k ) ) ; return 0 ; } }

Accumulator variables: i
Iterator variables: i
Class/struct names: geek, gfg
C# program:
class GFG { static void printCombination ( int n ) { System . Console . Write ( 1 + " ▁ " ) ; if ( ( n - 2 ) % 3 == 0 ) System . Console . Write ( 2 + " ▁ " + ( n - 3 ) ) ; else System . Console . Write ( 1 + " ▁ " + ( n - 2 ) ) ; } static void Main ( ) { int n = 233 ; printCombination ( n ) ; } }

Class/struct names: GFG
C# program:
using System ; class GFG { static bool checkPairs ( int l , int r ) { if ( ( l - r ) % 2 == 0 ) return false ; return true ; } static public void Main ( ) { int l = 1 , r = 8 ; if ( checkPairs ( l , r ) ) Console . Write ( " Yes " ) ; else Console . Write ( " No " ) ; } }

Class/struct names: GFG
C# program:
using System ; class GFG { static bool isPalindrome ( int n ) { if ( n % 11 == 0 ) { return true ; } return false ; } public static void Main ( ) { Console . Write ( isPalindrome ( 123321 ) ? " Palindrome " : " Not ▁ Palindrome " ) ; } }

Class/struct names: GFG
C# program:
using System ; class GFG { public static void Main ( ) { int target = 93 ; int [ ] arr = { 1 , 31 , 3 , 1 , 93 , 3 , 31 , 1 , 93 } ; int length = arr . Length ; int totalCount = 0 ; for ( int i = 0 ; i < length - 2 ; i ++ ) { if ( target % arr [ i ] == 0 ) { for ( int j = i + 1 ; j < length - 1 ; j ++ ) { if ( target % ( arr [ i ] * arr [ j ] ) == 0 ) { int toFind = target / ( arr [ i ] * arr [ j ] ) ; for ( int k = j + 1 ; k < length ; k ++ ) { if ( arr [ k ] == toFind ) { totalCount ++ ; } } } } } } Console . Write ( " Total ▁ number ▁ of ▁ triplets ▁ found ▁ : ▁ " + totalCount ) ; } }

Index/key variables: i, j, k
Accumulator variables: i, j, k, totalCount
Iterator variables: i, j, k
Class/struct names: GFG
C# program:
using System ; class GFG { static long binomialCoeff ( long n , long k ) { long res = 1 ; if ( k > n - k ) k = n - k ; for ( int i = 0 ; i < k ; ++ i ) { res *= ( n - i ) ; res /= ( i + 1 ) ; } return res ; } static long catalan ( long n ) { long c = binomialCoeff ( 2 * n , n ) ; return c / ( n + 1 ) ; } public static void Main ( String [ ] args ) { int n = 3 ; Console . WriteLine ( catalan ( n ) ) ; } }

Accumulator variables: res
Iterator variables: i
Class/struct names: GFG
C# program:
using System ; class GFG { public static bool isFascinating ( int num ) { int [ ] freq = new int [ 10 ] ; String val = " " + num . ToString ( ) + ( num * 2 ) . ToString ( ) + ( num * 3 ) . ToString ( ) ; for ( int i = 0 ; i < val . Length ; i ++ ) { int digit = val [ i ] - '0' ; if ( freq [ digit ] && digit != 0 > 0 ) return false ; else freq [ digit ] ++ ; } for ( int i = 1 ; i < freq . Length ; i ++ ) { if ( freq [ i ] == 0 ) return false ; } return true ; } static void Main ( ) { int num = 192 ; if ( num < 100 ) Console . WriteLine ( " No " ) ; else { bool ans = isFascinating ( num ) ; if ( ans ) Console . WriteLine ( " Yes " ) ; else Console . WriteLine ( " No " ) ; } } }

Index/key variables: digit, i
Accumulator variables: i
Iterator variables: i
Class/struct names: GFG
C# program:
using System ; class GFG { public static int binomial_coefficient ( int n , int m ) { int res = 1 ; if ( m > n - m ) m = n - m ; for ( int i = 0 ; i < m ; ++ i ) { res *= ( n - i ) ; res /= ( i + 1 ) ; } return res ; } public static int calculate_ways ( int m , int n ) { if ( m < n ) { return 0 ; } int ways = binomial_coefficient ( n + m - 1 , n - 1 ) ; return ways ; } public static void Main ( ) { int m = 7 , n = 5 ; int result = calculate_ways ( m , n ) ; Console . WriteLine ( result . ToString ( ) ) ; } }

Accumulator variables: res
Iterator variables: i
Class/struct names: GFG
C# program:
using System ; class GFG { static int N = 100005 ; static int [ ] phi ; static int [ ] S ; static void computeTotient ( ) { for ( int i = 1 ; i < N ; i ++ ) phi [ i ] = i ; for ( int p = 2 ; p < N ; p ++ ) { if ( phi [ p ] == p ) { phi [ p ] = p - 1 ; for ( int i = 2 * p ; i < N ; i += p ) { phi [ i ] = ( phi [ i ] / p ) * ( p - 1 ) ; } } } } static void CoPrimes ( ) { computeTotient ( ) ; for ( int i = 1 ; i < N ; i ++ ) S [ i ] = S [ i - 1 ] + phi [ i ] ; } public static void Main ( ) { phi = new int [ N ] ; S = new int [ N ] ; CoPrimes ( ) ; int [ ] q = { 3 , 4 } ; int n = q . Length ; for ( int i = 0 ; i < n ; i ++ ) Console . WriteLine ( " Number ▁ of ▁ unordered ▁ coprime STRNEWLINE " + " pairs ▁ of ▁ integers ▁ from ▁ 1 ▁ to ▁ " + q [ i ] + " ▁ are ▁ " + S [ q [ i ] ] ) ; } }

Index/key variables: N, i, p
Accumulator variables: i, p
Iterator variables: i, p
Class/struct names: GFG