├── .gitignore ├── AR-VR ├── aryanxsri_Aryan_2125cs1102_2 │ ├── GettingStarted │ │ ├── fibtillN.java │ │ ├── hello world.txt │ │ ├── benjaminBulbs.java │ │ ├── inverse.java │ │ ├── printdigits.java.txt │ │ ├── reverse.java.txt │ │ └── countdigits.java.txt │ └── Patterns │ │ └── pattern14.java ├── Shubhipandey21_ShubhiPandey_2125csit1169_2 │ ├── patterns │ │ ├── pattern1.cpp │ │ ├── pattern2.cpp │ │ └── pattern3.cpp │ └── GettingStarted │ │ └── printZ.cpp ├── ShahnawazDev_Shahnawaz_2025CSE1115_2 │ ├── GettingStarted │ │ ├── PrintZ.cpp │ │ ├── CountDigitsInANumber.cpp │ │ ├── ReverseANumber.cpp │ │ ├── TheCuriousCaseOfBenjaminBulbs.cpp │ │ ├── PrintFibonacciNumbersTillN.cpp │ │ └── DigitsOfANumber.cpp │ ├── Patterns │ │ ├── pattern14.cpp │ │ ├── pattern1.cpp │ │ ├── pattern2.cpp │ │ ├── pattern11.cpp │ │ ├── pattern7.cpp │ │ ├── pattern4.cpp │ │ ├── pattern3.cpp │ │ ├── pattern8.cpp │ │ ├── pattern9.cpp │ │ └── pattern20.cpp │ ├── FunctionAndArrays │ │ ├── DigitFrequency.cpp │ │ ├── DecimalToAnyBase.cpp │ │ └── AnyBaseToDecimal.cpp │ └── 2DArrays │ │ └── 2dArraysDemo.cpp ├── GitHubaartiRai_AartiRai_2125csme1047_2 │ └── GettingStarted │ │ └── PrintZ.cpp ├── mrigyasahai_MrigyaSahai_2025it1094_2 │ ├── GettingStarted │ │ ├── Print Z.cpp │ │ ├── Reverse A Number.cpp │ │ ├── Count Digits In A Number.cpp │ │ └── Inverse Of A Number.cpp │ ├── Patterns │ │ ├── Pattern 1.cpp │ │ ├── Pattern 2.cpp │ │ ├── Pattern 8.cpp │ │ ├── Pattern 4.cpp │ │ ├── Pattern 7.cpp │ │ ├── Pattern 9.cpp │ │ └── Pattern 3.cpp │ └── FunctionAndArrays │ │ └── Digit Frequency.cpp ├── saumyasinha31_SaumyaSinha_2125cse1144_2 │ └── GettingStarted │ │ ├── Print Z.cpp │ │ └── Count Digits In A Number.cpp ├── shivangi2213b_ShivangiTripathi_2025cse1087_2 │ └── GettingStarted │ │ └── PrintZ.java ├── Nandini-Maheshwari_NandiniMaheshwari_2125CSE1037_2 │ ├── GettingStarted │ │ ├── NumOfDigs.cpp │ │ └── Fibonacci.cpp │ ├── Patterns │ │ ├── Pattern1.cpp │ │ ├── Pattern2.cpp │ │ ├── Pattern7.cpp │ │ ├── Pattern8.cpp │ │ ├── Pattern4.cpp │ │ └── Pattern3.cpp │ └── FunctionAndArrays │ │ └── FnA_1.cpp ├── kapilsingh2003_KapilKumarSingh_2125cs1169_2 │ ├── GettingStarted │ │ ├── Print_Z.java │ │ ├── Count_Digits_in_number.java │ │ ├── Reverse_A_Number.java │ │ └── Fibonacci_till_N.java │ └── Patterns │ │ ├── Pattern_Type-2.java │ │ └── Pattern_Type_1.java └── Samikshagp_SamikshaGupta_2125cse1177_2 │ ├── GettingStarted │ └── printz.cpp.txt │ └── Patterns │ └── pattern8.java ├── Android ├── pranjal-raj_PranjalRaj_2125CSE1043_2 │ └── GettingStarted │ │ ├── countDigits.java │ │ ├── digitOfficial.java │ │ ├── digitsReverse.java │ │ ├── primeFactorizationOfficial.java │ │ ├── printZ.java │ │ └── fibonacciTillN.java ├── ayush27prasad_AyushPrasad_2125en1011_2 │ └── GettingStarted │ │ ├── HelloWorld.java │ │ ├── PrintZ.java │ │ ├── Reverse_A_Number.java │ │ ├── Digits_Of_A_Number.java │ │ └── Count_Digits_In_A_Number.java ├── tiwari-aditi_AditiTiwari_2125ec1138_2 │ ├── GettingStarted │ │ ├── PrintZ.cpp │ │ ├── Loops.cpp │ │ ├── CountDigitsInANumber.cpp │ │ ├── ReverseANumber.cpp │ │ ├── PrintFibonacciNumbersTillN.cpp │ │ └── InverseOfANumber.cpp │ ├── Patterns │ │ ├── Pattern1.cpp │ │ ├── Pattern2.cpp │ │ ├── Pattern11.cpp │ │ ├── Pattern7.cpp │ │ ├── Pattern9.cpp │ │ ├── Pattern8.cpp │ │ ├── Pattern3.cpp │ │ └── Pattern4.cpp │ └── FunctionandArrays │ │ └── DigitFrequency.cpp ├── Garima0812S_GarimaShukla_2125ec1114_2 │ ├── GettingStarted │ │ ├── SmallerThanTheCurrent.exe │ │ ├── PrintZ.java │ │ ├── CountDigits.java │ │ ├── inverseofaNumber.java │ │ └── ReverseANumber.java │ ├── FunctionAndArrays │ │ ├── DecimalToAnyBase.cpp │ │ ├── AnyBaseToArrays.cpp │ │ └── FindElementInAnArray.cpp │ ├── Pattern │ │ ├── pattern14.java │ │ ├── pattern7.java │ │ ├── pattern8.java │ │ └── pattern11.java │ └── 2DArray │ │ └── 2dArraydemo.cpp ├── khushi1502_KhushiSachdev_2125cse1077_2 │ ├── gettingStarted │ │ └── printZ.cpp │ └── GettingStarted │ │ ├── ReverseANumber.cpp │ │ ├── InverseOfANumber.cpp │ │ ├── PrintFibonaccitillN.cpp │ │ ├── Primefactorisation.cpp │ │ └── PrintAllPrimesTillN.cpp ├── Harshitmishra1106_Harshitmishra_2125cs1158_2 │ ├── Patterns │ │ ├── pattern_14.cpp │ │ ├── pattern_1.cpp │ │ ├── pattern_2.cpp │ │ ├── pattern_9.cpp │ │ ├── pattern_7.cpp │ │ ├── pattern_11.cpp │ │ ├── pattern_4.cpp │ │ ├── pattern_3.cpp │ │ └── pattern_8.cpp │ ├── GettingStarted │ │ ├── DigitsofaNumber.cpp │ │ ├── reverseofN.cpp │ │ ├── countDigits.cpp │ │ ├── inverseOfN.cpp │ │ └── GradingSystem.cpp │ └── FunctionAndArrays │ │ ├── ReverseAnArrayOfficial.cpp │ │ ├── FindAnElementInArrayOfficial.cpp │ │ └── DigitFrequencyOfficial.cpp ├── Cyclotron17_SambhrantTiwari_2125csai1011_2 │ └── GettingStarted │ │ └── PrintZ.java ├── decode08_SnehaAggarwal_2125it1071_2 │ ├── GettingStarted │ │ ├── printZ.java │ │ ├── BenjaminBulbs.java │ │ ├── no. of digits.java │ │ ├── Reverse.java │ │ └── primeFactorisation.java │ └── Patterns │ │ ├── pattern7.java │ │ ├── pattern1.java │ │ ├── pattern2.java │ │ └── pattern8.java ├── Ananya3632_AnanyaSrivastava_2125cs1114_2 │ └── GettingStarted │ │ ├── PrintZ.java │ │ ├── reverseno.java │ │ ├── CountDigits.java │ │ └── FibonacciNo.java ├── TheNPDev_HarshSingh_2125CSIT1050_2 │ └── GettingStarted │ │ └── printZ.java ├── sukritoberoi_SukritKaurOberoi_2125cse1065_2 │ └── GettingStarted │ │ ├── PrintZ.java │ │ ├── ReverseANumber.java │ │ └── CountDigitsInANumber.java └── aryanmishra29_AryanMishra_2125csme1029_2 │ ├── GettingStarted │ ├── Reverse_A_Number.java │ ├── Count_Digits_in_a_Number.java │ └── Inverse_Of_A_Number.java │ └── Patterns │ ├── Pattern_14.java │ ├── Pattern_1.java │ ├── Pattern_7.java │ ├── Pattern_8.java │ ├── Pattern_2.java │ └── Pattern_11.java ├── Guide └── GitHubUsername_RealName_LibraryID_Year │ ├── Patterns │ └── CountDigitsInaNumber.cpp │ └── GettingStarted │ └── CountDigitsInaNumber.cpp ├── IOT ├── Shrutichoudhary99_Shruti_2125en1048_2 │ ├── GettingStarted │ │ ├── hello.txt.txt │ │ ├── PrintZ.cpp │ │ ├── ReverseANumber.cpp │ │ ├── PrintFibonacciTillN.cpp │ │ └── GcdAndLcm.cpp │ └── Patterns │ │ ├── Pattern1.cpp │ │ └── Pattern2.cpp ├── Captain2234_Bhavishya_2125it1064_2 │ ├── GettingStarted │ │ ├── competitive.cpp │ │ ├── Digitcount.cpp │ │ ├── reverseanumber.cpp │ │ ├── fibonacciseries.cpp │ │ ├── PrintZ.cpp │ │ └── isanumberprime.cpp │ ├── Patterns │ │ ├── Pattern11.cpp │ │ ├── Pattern8.cpp │ │ ├── Pattern9.cpp │ │ ├── Pattern1.cpp │ │ ├── Pattern2.cpp │ │ ├── Pattern4.cpp │ │ └── Pattern7.cpp │ └── FunctionAndArrays │ │ ├── DigitFrequency.cpp │ │ ├── DecimalToAnyBase.cpp │ │ ├── AnyBaseToDecimal.cpp │ │ └── FindElementInAnArray.cpp ├── eclos-2002_shiv_2125csit1121_2 │ └── GettingStarted │ │ ├── patterns1.cpp │ │ ├── span_of_array.cpp │ │ └── reverse_an_array.cpp ├── ritikgupta88_RitikGupta_2125csit1163_2 │ ├── Patterns │ │ ├── Pattern14.cpp │ │ ├── Pattern2.cpp │ │ ├── Pattern1.cpp │ │ ├── Pattern7.cpp │ │ ├── Pattern8.cpp │ │ ├── Pattern9.cpp │ │ ├── Pattern4.cpp │ │ ├── Pattern3.cpp │ │ └── Pattern11.cpp │ ├── GettingStarted │ │ ├── TheCuriousCaseOfBenjaminBulbs.cpp │ │ ├── PrintZ.cpp │ │ ├── CountDigitsInANumber.cpp │ │ ├── ReverseANumber.cpp │ │ ├── PrimeFactorizationOfANumber.cpp │ │ ├── InverseOfANumber.cpp │ │ ├── PrintFibonacciNumbersTillN.cpp │ │ └── GcdAndLcm.cpp │ └── FunctionAndArrays │ │ └── DigitFrequency.cpp ├── tansin25_TanmaySingh_2125csit1072_2 │ ├── Patterns │ │ ├── Pattern14.cpp │ │ ├── Pattern1.cpp │ │ ├── Pattern2.cpp │ │ ├── Pattern11.cpp │ │ ├── Pattern3.cpp │ │ ├── Pattern4.cpp │ │ ├── Pattern8.cpp │ │ ├── Pattern9.cpp │ │ └── Pattern7.cpp │ └── GettingStarted │ │ ├── ReverseANumber.cpp │ │ ├── CountDigitsInANumber.cpp │ │ ├── PrintZ.cpp │ │ ├── PrintFibonacciNumbersTillN.cpp │ │ ├── PrintAllPrimesTillN.cpp │ │ └── IsANumberPrime.cpp ├── gurpreetk12_gurpreetkaur_2125cs1094_2 │ ├── Patterns │ │ ├── Pattern14.cpp │ │ ├── Pattern2.cpp │ │ ├── Pattern1.cpp │ │ ├── Pattern7.cpp │ │ ├── Pattern8.cpp │ │ ├── Pattern11.cpp │ │ ├── Pattern3.cpp │ │ ├── Pattern4.cpp │ │ └── Pattern9.cpp │ ├── Gettingstarted │ │ ├── countdigitsinanumber.cpp │ │ ├── count digits in a number.cpp │ │ ├── reverse number.cpp │ │ ├── reversenumber.cpp │ │ ├── digitsofanumber.cpp │ │ ├── digits of a number.cpp │ │ ├── Grading system.cpp │ │ └── Gradingsystem.cpp │ └── FunctionandArrays │ │ └── ReverseAnArray.cpp ├── chaudharykapil_KapilChaudhary_2125cs1050_2 │ └── GettingStarted │ │ ├── CoutDigits.cpp │ │ ├── DigitOfANumber.cpp │ │ └── PrintZ.java ├── Nivedita-R_NiveditaRai_2125it1079_2 │ ├── Patterns │ │ ├── Pattern14.cpp │ │ ├── Pattern11.cpp │ │ ├── Pattern1.cpp │ │ ├── Pattern2.cpp │ │ ├── Pattern7.cpp │ │ ├── Pattern8.cpp │ │ ├── Pattern3.cpp │ │ ├── Pattern4.cpp │ │ ├── Pattern9.cpp │ │ └── Pattern13.cpp │ ├── GettingStarted │ │ ├── ReverseANumber.cpp │ │ ├── CountDigitsInANumber.cpp │ │ ├── PrintFibonacciNumbersTillN.cpp │ │ ├── PrintAllPrimesTillN.cpp │ │ └── GcdAndLcm.cpp │ └── FunctionandArrays │ │ ├── FindElementInAnArray.cpp │ │ └── AnyBaseToDecimal.cpp ├── ManavGora_manavgora_2125cse1182_2 │ └── GettingStarted │ │ └── Printz.cpp └── seriouslyanuj_AnujGupta_2125it1096_2 │ ├── GettingStarted │ ├── printz.java │ ├── CountsDigitsInANumber.java │ └── reverseanumberofficial.java │ └── patterns │ └── pattern-type-1-official.java ├── Web ├── 1010varun_varunagarwal_2125csai1023_2 │ ├── GettingStarted │ │ ├── helloWorld.cpp.txt │ │ ├── noOfDigits.cpp │ │ ├── primeTillN.cpp │ │ ├── printZ.cpp │ │ ├── lcm_gcf.cpp │ │ ├── primeFactors.cpp │ │ ├── prime.cpp │ │ └── gradingSystem.cpp │ └── Pattern │ │ ├── pattern_2.cpp │ │ ├── pattern_1.cpp │ │ └── pattern_3.cpp ├── nag2028_NehaMaurya_2125csit1004_2 │ ├── GettingStarted │ │ ├── DigitsOfANumber.py │ │ ├── ReverseOfANumber.py │ │ ├── CountDigitsInANumber.py │ │ ├── PrintZ.py │ │ ├── PrintFibonacciTillN.py │ │ ├── GradingSystem.py │ │ ├── PrintAllPrimesTillN.py │ │ └── IsANumberPrime.py │ └── Patterns │ │ ├── Pattern1.py │ │ └── Pattern2.py ├── QMiNt_AdityaAgarwal_2125IT1163_2 │ ├── GettingStarted │ │ ├── CountDigitsInANumber.cpp │ │ ├── ReverseANumber.cpp │ │ ├── TheCuriousCaseOfBenjaminBulbs.cpp │ │ ├── GcdAndLcm.cpp │ │ ├── PrintFibonacciNumbersTillN.cpp │ │ ├── GradingSystem.cpp │ │ ├── InverseOfANumber.cpp │ │ ├── PrimeFactorizationOfANumber.cpp │ │ ├── DigitsOfANumber.cpp │ │ └── PrintZ.cpp │ └── Patterns │ │ ├── Pattern1.cpp │ │ ├── Pattern2.cpp │ │ ├── Pattern3.cpp │ │ ├── Pattern9.cpp │ │ ├── Pattern4.cpp │ │ ├── Pattern7.cpp │ │ └── Pattern8.cpp ├── alisha0903_AlishaRaghav_2125cse1189_02 │ ├── Patterns │ │ ├── pattern14.cpp │ │ ├── pattern1.cpp │ │ ├── pattern2.cpp │ │ ├── pattern11.cpp │ │ ├── ques13.cpp │ │ ├── pattern7.cpp │ │ ├── pattern8.cpp │ │ ├── pattern3.cpp │ │ ├── pattern4.cpp │ │ ├── pattern9.cpp │ │ ├── pattern17.cpp │ │ ├── pattern18.cpp │ │ ├── pattern20.cpp │ │ └── pattern19.cpp │ ├── GettingStarted │ │ ├── CountDigitsInANumber.cpp │ │ ├── TheCuriousCaseOfBenjaminBulbs.cpp │ │ ├── ReverseANumber.cpp │ │ ├── RotateANumber.cpp │ │ ├── InverseOfANumber.cpp │ │ ├── DigitsOfANumber.cpp │ │ ├── GradingSystem.cpp │ │ ├── PrintAllPrimeTillN.cpp │ │ ├── IsANumberPrime.cpp │ │ └── PrintZ.cpp │ ├── 2DArrays │ │ └── ques1.cpp │ └── FunctionAndArrays │ │ ├── digitFrequency.cpp │ │ ├── anyToDEc.cpp │ │ └── dedcToAny.cpp ├── kashish12_kashishalikhan_2125cse1133_02 │ ├── GettingStarted │ │ ├── printz.cpp │ │ ├── benjamin-bulbs.cpp │ │ ├── reverseanumber.cpp │ │ ├── countdigits.cpp │ │ ├── inverseofanumber.cpp │ │ ├── digitsofanumber.cpp │ │ └── gcdandlcm.cpp │ ├── Patterns │ │ ├── pattern14.cpp │ │ ├── pattern2.cpp │ │ ├── pattern1.cpp │ │ ├── pattern11.cpp │ │ ├── pattern8.cpp │ │ ├── pattern3.cpp │ │ ├── pattern13.cpp │ │ ├── pattern4.cpp │ │ └── pattern9.cpp │ └── FunctionAndArrays │ │ ├── digitfrequency.cpp │ │ └── decimaltoanybase.cpp ├── Vaishnavi-Singh20002_VaishnaviSingh_2125ec1060_02 │ ├── GettingStarted │ │ ├── printz.cpp │ │ ├── reverse-a-number.cpp │ │ ├── countdigits.cpp │ │ └── fibonaccitilln.cpp │ ├── Patterns │ │ ├── pattern14.cpp │ │ ├── pattern2.cpp │ │ ├── pattern1.cpp │ │ ├── pattern4.cpp │ │ ├── pattern7.cpp │ │ ├── pattern3.cpp │ │ └── pattern11.cpp │ └── FunctionAndArrays │ │ └── digitsfrequency.cpp ├── Divyanshu-Vareshney_divyanshuvarshney_2125it1075_2 │ ├── GettingStarted │ │ ├── Print Z.cpp │ │ ├── Count Digits In A Number.cpp │ │ ├── Reverse A Number.cpp │ │ ├── Inverse Of A Number.cpp │ │ └── Gcd And Lcm.cpp │ └── patterns │ │ ├── pattern1.cpp │ │ ├── pattern2.cpp │ │ ├── pattern11.cpp │ │ ├── pattern4.cpp │ │ └── pattern3.cpp ├── ShreyashSriv_ShreyashSrivastava_2125csme1051_2 │ ├── Patterns │ │ ├── Pattern7.cpp │ │ ├── Pattern8.cpp │ │ ├── Pattern1.cpp │ │ ├── Pattern2.cpp │ │ ├── Pattern9.cpp │ │ ├── Pattern4.cpp │ │ ├── Pattern3.cpp │ │ └── Pattern5.cpp │ └── GettingStarted │ │ ├── TheCuriousCaseOfBenjaminBulbs.cpp │ │ ├── CountDigitsInANumber.cpp │ │ ├── GradingStystem.cpp │ │ ├── InverseOfANumber.cpp │ │ ├── PrintFibonacciNumbersTillN.cpp │ │ └── IsANumberPrime.cpp ├── rishu15_HrishikDwivedi_2125ec1006_02 │ ├── patterns │ │ ├── pattern1.cpp │ │ ├── pattern2.cpp │ │ ├── pattern11.cpp │ │ └── pattern13.cpp │ └── gettingStarted │ │ ├── reveseDigit.cpp │ │ └── numDigits.cpp ├── riyasinghsirohi_Riyasinghsirohi_2125en1103_2 │ ├── gettingStarted │ │ ├── ReverseANumber.cpp │ │ ├── PrintFibonacciTillN.cpp │ │ ├── TheCuriousCaseOfBenjaminBulbs.cpp │ │ └── GcdAndLcm.cpp │ ├── Patterns │ │ ├── Pattern1.cpp │ │ ├── Pattern2.cpp │ │ ├── Pattern11.cpp │ │ └── Pattern3.cpp │ ├── 2DArrays │ │ └── 2dArraysDemo.cpp │ └── FunctionAndArrays │ │ └── DigitFrequency.cpp ├── Tushar-sahani_TusharSahani_2125cs1072_2 │ ├── Patterns │ │ ├── Patttern14.java │ │ └── Pattern1.java │ └── GettingStarted │ │ ├── ReverseANumber.java │ │ ├── CountDigitInaNumber.java │ │ └── TheCuriousCaseOfBenjaminBulbs.java ├── Macabre908_AbhishekDubey_2125cse1175_2 │ └── GettingStarted │ │ ├── reverseANum.java │ │ └── countDigits.java └── EvaMittal_EvaMittal_2125cs1187_2 │ └── Patterns │ ├── Pattern1.java │ └── Pattern2.java └── ML ├── rachitavya_RachitavyaSharma_2125cs1053_2 ├── GettingStarted │ ├── name.txt │ ├── printz.java │ ├── countdigits.java │ └── reverse.java └── Patterns │ ├── pattern1.java │ └── pattern2.java ├── vibhuti-k_VibhutiKumar_2125csit1029_2 └── GettingStarted │ └── HelloWorld.java ├── KeplerInCoding_ShreyaSharma_2125cse1170_2 ├── GettingStarted │ ├── CountDigits.cpp │ ├── ReverseANumber.cpp │ ├── InverseOfANumber.cpp │ ├── PrimeFactorisation.cpp │ ├── DigitsOfANumber.cpp │ ├── GcdAndLcm.cpp │ └── PrintZ.txt ├── Patterns │ ├── PatternType14.cpp │ ├── PatternType1.cpp │ ├── PatternType2.cpp │ ├── PatternType11.cpp │ ├── PatternType3.cpp │ ├── PatternType4.cpp │ └── PatternType5.cpp └── FunctionAndArrays │ ├── AnyBaseToDecmal.cpp │ ├── DecimalToAnyBase.cpp │ └── DigitFrequency.cpp └── Nansri108_NancySrivastava_2125cs1103_2 └── GettingStarted └── printZ.cpp.txt /.gitignore: -------------------------------------------------------------------------------- 1 | README.md 2 | PendingStudents.md 3 | **/.DS_Store -------------------------------------------------------------------------------- /AR-VR/aryanxsri_Aryan_2125cs1102_2/GettingStarted/fibtillN.java: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /Android/pranjal-raj_PranjalRaj_2125CSE1043_2/GettingStarted/countDigits.java: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /Android/pranjal-raj_PranjalRaj_2125CSE1043_2/GettingStarted/digitOfficial.java: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /Android/pranjal-raj_PranjalRaj_2125CSE1043_2/GettingStarted/digitsReverse.java: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /Guide/GitHubUsername_RealName_LibraryID_Year/Patterns/CountDigitsInaNumber.cpp: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /IOT/Shrutichoudhary99_Shruti_2125en1048_2/GettingStarted/hello.txt.txt: -------------------------------------------------------------------------------- 1 | shruti -------------------------------------------------------------------------------- /Guide/GitHubUsername_RealName_LibraryID_Year/GettingStarted/CountDigitsInaNumber.cpp: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /Android/pranjal-raj_PranjalRaj_2125CSE1043_2/GettingStarted/primeFactorizationOfficial.java: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /AR-VR/aryanxsri_Aryan_2125cs1102_2/GettingStarted/hello world.txt: -------------------------------------------------------------------------------- 1 | artic monkey, neighbourhood>>>>>>>>>>> -------------------------------------------------------------------------------- /Web/1010varun_varunagarwal_2125csai1023_2/GettingStarted/helloWorld.cpp.txt: -------------------------------------------------------------------------------- 1 | my name is varun agarwal -------------------------------------------------------------------------------- /ML/rachitavya_RachitavyaSharma_2125cs1053_2/GettingStarted/name.txt: -------------------------------------------------------------------------------- 1 | hello my name is rachitavya sharma 2 | -------------------------------------------------------------------------------- /Web/nag2028_NehaMaurya_2125csit1004_2/GettingStarted/DigitsOfANumber.py: -------------------------------------------------------------------------------- 1 | n=int(input()) 2 | s=str(n) 3 | for i in s: 4 | print(i) -------------------------------------------------------------------------------- /Web/nag2028_NehaMaurya_2125csit1004_2/GettingStarted/ReverseOfANumber.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | s=(str(n)[::-1]) 3 | for i in s: 4 | print(i) -------------------------------------------------------------------------------- /Web/nag2028_NehaMaurya_2125csit1004_2/GettingStarted/CountDigitsInANumber.py: -------------------------------------------------------------------------------- 1 | n=int(input("")) 2 | c=0 3 | while n != 0: 4 | n //= 10 5 | c += 1 6 | print(c) -------------------------------------------------------------------------------- /IOT/Captain2234_Bhavishya_2125it1064_2/GettingStarted/competitive.cpp: -------------------------------------------------------------------------------- 1 | # include 2 | using namespace.std :: 3 | 4 | int main(){ 5 | 6 | cout< 2 | using namespace std; 3 | int main(){ 4 | cout<<"*****\n * \n * \n * \n*****\n"; 5 | return 0; 6 | } -------------------------------------------------------------------------------- /AR-VR/Shubhipandey21_ShubhiPandey_2125csit1169_2/patterns/pattern1.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/InnogeeksOrganization/coderspree2/HEAD/AR-VR/Shubhipandey21_ShubhiPandey_2125csit1169_2/patterns/pattern1.cpp -------------------------------------------------------------------------------- /AR-VR/Shubhipandey21_ShubhiPandey_2125csit1169_2/patterns/pattern2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/InnogeeksOrganization/coderspree2/HEAD/AR-VR/Shubhipandey21_ShubhiPandey_2125csit1169_2/patterns/pattern2.cpp -------------------------------------------------------------------------------- /AR-VR/Shubhipandey21_ShubhiPandey_2125csit1169_2/patterns/pattern3.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/InnogeeksOrganization/coderspree2/HEAD/AR-VR/Shubhipandey21_ShubhiPandey_2125csit1169_2/patterns/pattern3.cpp -------------------------------------------------------------------------------- /Android/Garima0812S_GarimaShukla_2125ec1114_2/GettingStarted/SmallerThanTheCurrent.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/InnogeeksOrganization/coderspree2/HEAD/Android/Garima0812S_GarimaShukla_2125ec1114_2/GettingStarted/SmallerThanTheCurrent.exe -------------------------------------------------------------------------------- /Android/ayush27prasad_AyushPrasad_2125en1011_2/GettingStarted/PrintZ.java: -------------------------------------------------------------------------------- 1 | public class PrintZ { 2 | 3 | public static void main (String[] args) { 4 | 5 | System.out.println("*****\n * \n * \n * \n*****"); 6 | 7 | } 8 | } -------------------------------------------------------------------------------- /Android/tiwari-aditi_AditiTiwari_2125ec1138_2/GettingStarted/Loops.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(){ 5 | int i; 6 | for(i=1; i<=10; i++){ 7 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | cout<<"*****"<<" *"< 2 | using namespace std; 3 | int main() 4 | { 5 | int n,c=0; 6 | cin>>n; 7 | while(n!=0) 8 | { 9 | c++; 10 | n=n/10; 11 | } 12 | cout< 2 | int main(){ 3 | int n; 4 | std::cin>>n; 5 | for(int j=0;j 2 | using namespace std; 3 | int main(int agrc, char** argv){ 4 | int n; 5 | cin >> n; 6 | for(int i=1;i<=10;i++){ 7 | cout< 2 | using namespace std; 3 | int main() 4 | { 5 | int n,i; 6 | cin>>n; 7 | for(i=1;i<=10;i++) 8 | cout<=0 or j<=4) or (i+j==4) ): 5 | z+="*" 6 | else: 7 | z+=" " 8 | z+="\n" 9 | print(z) -------------------------------------------------------------------------------- /IOT/ritikgupta88_RitikGupta_2125csit1163_2/GettingStarted/TheCuriousCaseOfBenjaminBulbs.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main(int argc, char**argv){ 4 | int n; 5 | cin>>n; 6 | for(int i=1; i*i<=n;i++){ 7 | cout< 2 | int main() 3 | { 4 | int n; 5 | scanf("%d",&n); 6 | int count= 0; 7 | while(n) 8 | { 9 | count++; 10 | n=n/10; 11 | } 12 | printf("%d",count); 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /ML/KeplerInCoding_ShreyaSharma_2125cse1170_2/Patterns/PatternType14.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n; 5 | scanf("%d",&n); 6 | for(int i=1; i<=10; i++) 7 | { 8 | printf("%d * %d = %d\n",n, i, 3*i); 9 | } 10 | return 0; 11 | } -------------------------------------------------------------------------------- /Web/QMiNt_AdityaAgarwal_2125IT1163_2/GettingStarted/ReverseANumber.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main() 4 | { 5 | int m,n,c=0; 6 | cin>>n; 7 | m=n; 8 | while(m!=0) 9 | { 10 | cout< 2 | using namespace std; 3 | int main() { 4 | cout<<"*****\n"; 5 | cout<<" * \n"; 6 | cout<<" * \n"; 7 | cout<<" * \n"; 8 | cout<<"*****\n"; 9 | return 0; 10 | } -------------------------------------------------------------------------------- /Web/alisha0903_AlishaRaghav_2125cse1189_02/GettingStarted/CountDigitsInANumber.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main () 4 | { 5 | int n,c=0; 6 | cin>>n; 7 | while(n>0) 8 | { 9 | c++; 10 | n/=10; 11 | } 12 | cout< 2 | using namespace std; 3 | int main() 4 | { 5 | int i,n; 6 | cin>>n; 7 | for(i=1;i*i<=n;i++) 8 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char **argv){ 6 | int n; 7 | cin >> n; 8 | 9 | cout<<(int)log10(n)+1; 10 | return 0; 11 | } -------------------------------------------------------------------------------- /IOT/Shrutichoudhary99_Shruti_2125en1048_2/GettingStarted/PrintZ.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main(int argc, char** agrc) { 4 | cout<<"*****"< 2 | using namespace std; 3 | int main(int argc, char** agrc) { 4 | cout<<"***"< 2 | using namespace std; 3 | int main(int agrc, char** argv){ 4 | int n; 5 | cin >> n; 6 | 7 | for(int i=1;i<11;i++) 8 | cout< 2 | using namespace std; 3 | int main(int argc, char** agrc) { 4 | cout << "*****" << endl; 5 | cout << " *" << endl; 6 | cout << " *" << endl; 7 | cout << " *" << endl; 8 | cout << "*****" << endl; 9 | } -------------------------------------------------------------------------------- /IOT/tansin25_TanmaySingh_2125csit1072_2/Patterns/Pattern14.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main(int agrc, char** argv){ 4 | int n,c=1; 5 | cin >> n; 6 | while(c<=10) 7 | {cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n,c; 6 | cin >> n; 7 | while(n!=0){ 8 | c=n%10; 9 | cout< 2 | using namespace std; 3 | int main(int argc, char** agrc) { 4 | cout<<"*****"< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n,i=0; 6 | cin >> n; 7 | while(n!=0) 8 | { 9 | n=n/10; 10 | i++; 11 | }cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n,count=0; 6 | cin >> n; 7 | while(n!=0){ 8 | n=n/10; 9 | count++;} 10 | cout< 2 | using namespace std; 3 | int main() { 4 | //write your code here 5 | cout<<"*****\n"; 6 | cout<<" *\n"; 7 | cout<<" *\n"; 8 | cout<<" *\n"; 9 | cout<<"*****\n"; 10 | return 0; 11 | 12 | } -------------------------------------------------------------------------------- /Android/tiwari-aditi_AditiTiwari_2125ec1138_2/GettingStarted/CountDigitsInANumber.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(){ 5 | int n,count=0; 6 | cin>>n; 7 | while(n!=0){ 8 | n = n/10; 9 | count++; 10 | } 11 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int n,dig; 6 | cin>>n; 7 | while(n!=0){ 8 | dig = n%10; 9 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | int c = 0; 8 | while(n){ 9 | c++; 10 | n/=10; 11 | } 12 | cout << c; 13 | } -------------------------------------------------------------------------------- /IOT/gurpreetk12_gurpreetkaur_2125cs1094_2/Gettingstarted/count digits in a number.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n,i=0; 6 | cin >> n; 7 | while(n!=0) 8 | { 9 | n=n/10; 10 | i++; 11 | }cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n,k; 6 | cin >> n; 7 | while(n!=0){ 8 | n=n/10; 9 | k++; 10 | } 11 | cout< 2 | using namespace std; 3 | int main(int argc, char** agrc) { 4 | cout<<("*****")< 2 | using namespace std; 3 | int main(int argc, char** agrc) { 4 | 5 | cout << "*****" << endl; 6 | cout << " *" << endl; 7 | cout << " *" << endl; 8 | cout << " *" << endl; 9 | cout << "*****" << endl; 10 | } -------------------------------------------------------------------------------- /Web/nag2028_NehaMaurya_2125csit1004_2/GettingStarted/GradingSystem.py: -------------------------------------------------------------------------------- 1 | m = int(input("")) 2 | if(m>90): 3 | print("excellent") 4 | elif(80 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | while(n) 9 | { 10 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n,count=0; 6 | cin >> n; 7 | 8 | while(n!=0){ 9 | count++; 10 | n=n/10; 11 | } 12 | cout< 2 | using namespace std; 3 | int main(int agrc, char** argv){ 4 | int n; 5 | cin >> n; 6 | int i,j,k; 7 | for(i=1;i<=10;i++) 8 | { 9 | cout << n << " * " << i << " = " < 2 | using namespace std; 3 | int main(int agrc, char** argv){ 4 | int n; 5 | cin >> n; 6 | for(int i = 1;i <= 10; i++){ 7 | cout< 1: 5 | for j in range(2, i): 6 | if (i % j) == 0: 7 | break 8 | else: 9 | print(i) 10 | -------------------------------------------------------------------------------- /Android/tiwari-aditi_AditiTiwari_2125ec1138_2/Patterns/Pattern1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(){ 5 | int n,i,j; 6 | cin >> n; 7 | for(i=1;i<=n;i++){ 8 | for(j=1;j<=i;j++){ 9 | cout<<"*\t"; 10 | } 11 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int n,i,j; 6 | cin >> n; 7 | for(i=n;i>=1;i--){ 8 | for(j=1;j<=i;j++){ 9 | cout<<"*\t"; 10 | } 11 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n,a; 6 | cin >> n; 7 | while(n!=0) 8 | { 9 | a=n%10; 10 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n,a; 6 | cin >> n; 7 | while(n!=0) 8 | { 9 | a=n%10; 10 | cout< 2 | using namespace std; 3 | int main(int argc, char** agrc) { 4 | //write your code here 5 | cout<<"*****\n"; 6 | cout<<" *\n"; 7 | cout<<" *\n"; 8 | cout<<" *\n"; 9 | cout<<"*****\n"; 10 | 11 | 12 | } -------------------------------------------------------------------------------- /Web/alisha0903_AlishaRaghav_2125cse1189_02/Patterns/pattern1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main() 4 | { 5 | int n,i,j; 6 | cin>>n; 7 | for(i=1;i<=n;i++) 8 | { 9 | for(j=1;j<=i;j++) 10 | cout<<"* "; 11 | cout< 2 | using namespace std; 3 | int main() 4 | { 5 | int n,i,j; 6 | cin>>n; 7 | for(i=n;i>=1;i--) 8 | { 9 | for(j=1;j<=i;j++) 10 | cout<<"* "; 11 | cout< 2 | using namespace std; 3 | int main(int argc, char** agrc) { 4 | //write your code here 5 | cout<<"*****"< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | for(int i=1;i<=n;i++){ 9 | for(int j=1;j<=i;j++){ 10 | cout<<"*\t"; 11 | }cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin >> n; 7 | 8 | for(int i=1;i<=n;i++){ 9 | for(int j=1;j 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin >> n; 7 | 8 | for(int i=n;i>=1;i--){ 9 | for(int j=1;j 2 | using namespace std; 3 | int main(int agrc, char** argv){ 4 | int n; 5 | cin >> n; 6 | for(int i=1;i<=10;i++){ 7 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n,rem; 6 | cin >> n; 7 | 8 | while(n!=0){ 9 | rem=n%10; 10 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char** argv){ 5 | int n,i=1; 6 | cin>>n; 7 | 8 | while(i*i 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | 8 | cout<<"*****"< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | for(int i=0;i 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | for(int i=n;i>=1;i--){ 8 | for(int j=1;j<=i;j++){ 9 | cout<<"*\t"; 10 | }cout< 2 | using namespace std; 3 | #define ll long long 4 | 5 | int main(int argc, char **argv){ 6 | ll n, total = 0; 7 | cin >> n; 8 | while(n > 0){ 9 | total ++; 10 | n /= 10; 11 | } 12 | cout << total; 13 | } -------------------------------------------------------------------------------- /IOT/gurpreetk12_gurpreetkaur_2125cs1094_2/Patterns/Pattern2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin >> n; 7 | for(int i=0;i=1+i;j--) 10 | { 11 | cout<<"*\t"; 12 | }cout< 2 | using namespace std; 3 | int main(int argc, char const *argv[]) 4 | { 5 | int r; 6 | cin>>r; 7 | for (int i = 1; i*i < r; i++) 8 | { 9 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin >> n; 7 | for (int i = n; i >= 1; --i) { 8 | for (int j = 1; j <= i; ++j) { 9 | cout<<"*\t"; 10 | } 11 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | int i, j; 8 | for(i=0;i 2 | using namespace std; 3 | int main(int agrc, char** argv){ 4 | int n;//to print tables 5 | cin >> n; 6 | for(int i=1;i<=10;i++){ 7 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | //write your code here 9 | for(int i=1;i<=n;i++){ 10 | for(int j=1;j<=n;j++){ 11 | cout<<"*"<<"/t"; 12 | } 13 | } 14 | } -------------------------------------------------------------------------------- /Android/tiwari-aditi_AditiTiwari_2125ec1138_2/Patterns/Pattern11.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(){ 5 | int n,i,j,start=1; 6 | cin>>n; 7 | for(i=1;i<=n;i++){ 8 | for(j=1;j<=i;j++){ 9 | cout< 2 | using namespace std; 3 | int main() { 4 | int n,a,m=0,k=2147483647; 5 | cin>>n; 6 | for(int i=0;i>a; 8 | if(a>m) 9 | m=a; 10 | if(a 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | for(int i=1;i<=n;i++) 8 | { 9 | for(int j=1;j<=i;j++) 10 | { 11 | cout<<"*\t"; 12 | }cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv) 5 | { 6 | int n,a=0,b=1,c; 7 | cin >> n; 8 | for(int i=0;i 2 | using namespace std; 3 | int main() 4 | { 5 | int n; 6 | cin>>n; 7 | for (int i = 0; i < n; i++) 8 | { 9 | for (int j = 0; j<=i; j++) 10 | { 11 | cout<<"*\t"; 12 | } 13 | cout< 2 | using namespace std; 3 | int main() 4 | { 5 | int n; 6 | cin>>n; 7 | for (int i = 0; i < n; i++) 8 | { 9 | for (int j = n; j>i; j--) 10 | { 11 | cout<<"*\t"; 12 | } 13 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n,count=0; 6 | cin >> n; 7 | 8 | while(n){ 9 | count++; 10 | n=n/10; 11 | 12 | } 13 | cout<=0;i--) 8 | System.out.println(s.charAt(i)); 9 | } 10 | } 11 | -------------------------------------------------------------------------------- /Web/1010varun_varunagarwal_2125csai1023_2/Pattern/pattern_2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | for(int i = n; i > 0; i--){ 8 | for(int j = i; j > 0; j--){ 9 | cout << "*" << " "; 10 | } 11 | cout << endl; 12 | } 13 | } -------------------------------------------------------------------------------- /Web/riyasinghsirohi_Riyasinghsirohi_2125en1103_2/gettingStarted/ReverseANumber.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | int rem; 8 | while(n!=0) 9 | { 10 | int rem; 11 | rem=n%10; 12 | n=n/10; 13 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | int i, j; 8 | for(i=0;i 2 | #include 3 | using namespace std; 4 | int main(int argc, char const *argv[]) 5 | { 6 | long int n,a,b; 7 | cin>>n; 8 | if(n>=1){while(n!=0){ 9 | a=n%10;b=n-a;n=b/10;cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | for(int i = 0; i < n; i++){ 8 | for(int j = 0; j <= i; j++){ 9 | cout << "*" << " "; 10 | } 11 | cout << endl; 12 | } 13 | } -------------------------------------------------------------------------------- /Web/Vaishnavi-Singh20002_VaishnaviSingh_2125ec1060_02/GettingStarted/reverse-a-number.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(){ 5 | int n,d; 6 | cin >> n; 7 | while(n!=0) 8 | { 9 | d=n%10; 10 | n=n/10; 11 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | for(int i=1;i<=n;i++) 9 | { 10 | for(int j=1;j<=i;j++) 11 | { 12 | cout<<"*\t"; 13 | } 14 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n, r; 6 | cin >> n; 7 | 8 | while(n>0){ 9 | r = n % 10; 10 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n,i,j; 6 | cin >> n; 7 | 8 | for(i=1;i<=n;i++) 9 | { 10 | for(j=1;j<=i;j++) 11 | { 12 | cout<<"*\t"; 13 | } 14 | cout<<"\n"; 15 | } 16 | } -------------------------------------------------------------------------------- /IOT/chaudharykapil_KapilChaudhary_2125cs1050_2/GettingStarted/DigitOfANumber.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | void printn(int n){ 4 | if(n == 0){ 5 | return; 6 | } 7 | printn(n/10); 8 | cout << n%10 <> n; 13 | printn(n); 14 | 15 | } -------------------------------------------------------------------------------- /IOT/eclos-2002_shiv_2125csit1121_2/GettingStarted/reverse_an_array.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main() { 4 | int n; 5 | cin>>n; 6 | int a[n], b[n]; 7 | for(int i=0;i>a[i]; 9 | for(int i=0;i 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | for(int i=0;i 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin >> n; 7 | int p; 8 | while(n != 0){ 9 | p = n % 10; 10 | cout< 2 | using namespace std; 3 | int main() 4 | { 5 | int n,i,j; 6 | cin>>n; 7 | for(i= 1;i<=n;i++) 8 | { 9 | for(j=1;j<=i;j++) 10 | { 11 | cout<<"*\t"; 12 | } 13 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | int k=1; 8 | for(int i=1;i<=n;i++){ 9 | for(int j=1;j<=n;j++) 10 | { 11 | if(j<=i){ 12 | cout< 2 | 3 | int main(int argc, char **argv){ 4 | int n; 5 | scanf("%d",&n); 6 | 7 | for(int i=0; i 2 | 3 | int main(int argc, char **argv){ 4 | int n; 5 | scanf("%d",&n); 6 | 7 | for(int i=0; i 2 | using namespace std; 3 | int main(int argc, char **argv){ 4 | int n; 5 | cin >> n; 6 | for(int i=0;i 2 | 3 | using namespace std; 4 | 5 | int main(int argc, char **argv){ 6 | int n; 7 | cin >> n; 8 | //Write your code here 9 | 10 | while (n != 0){ 11 | int digit = n % 10; 12 | n = n / 10; 13 | cout << digit << endl; 14 | } 15 | } 16 | -------------------------------------------------------------------------------- /IOT/Nivedita-R_NiveditaRai_2125it1079_2/GettingStarted/ReverseANumber.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | int n; 7 | cin >> n; 8 | 9 | int d; 10 | while(n != 0) 11 | { 12 | d = n % 10; 13 | cout << d << endl; 14 | n = n / 10; 15 | } 16 | return 0; 17 | 18 | } -------------------------------------------------------------------------------- /IOT/gurpreetk12_gurpreetkaur_2125cs1094_2/Patterns/Pattern7.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | for(int i=0;i 2 | using namespace std; 3 | int main() 4 | { 5 | int k; 6 | cin >> k; 7 | int n=0,m=1; 8 | int t=n; 9 | for(int i=0;k>i;i++) 10 | { 11 | t=n; 12 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin>>n; 7 | 8 | for(int i=0; i 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin>>n; 7 | 8 | for(int i=n; i>0; i--) 9 | { 10 | for(int j=0; j 2 | using namespace std; 3 | 4 | int main(){ 5 | int n,k=1; 6 | cin >> n; 7 | for(int i = 1; i <= n; i++){ 8 | for(int j = 1; j <= i; j++){ 9 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin >> n; 7 | int i,k; 8 | for(i=1;i<=n;i++){ 9 | for(k=n-1;k>=i;k--){ 10 | cout<<"\t"; 11 | } 12 | cout<<"*"; 13 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | //write your code here 9 | 10 | int c = 0; 11 | while(n!=0){ 12 | c++; 13 | n = n/10; 14 | } 15 | cout << c << endl; 16 | } -------------------------------------------------------------------------------- /AR-VR/kapilsingh2003_KapilKumarSingh_2125cs1169_2/GettingStarted/Print_Z.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class Main { 4 | 5 | public static void main(String[] args) { 6 | System.out.println("*****"); 7 | System.out.println(" *"); 8 | System.out.println(" *"); 9 | System.out.println(" *"); 10 | System.out.println("*****"); 11 | 12 | } 13 | } -------------------------------------------------------------------------------- /Android/decode08_SnehaAggarwal_2125it1071_2/GettingStarted/BenjaminBulbs.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class Main{ 4 | 5 | public static void main(String[] args) { 6 | Scanner scn = new Scanner(System.in); 7 | int n= scn.nextInt(); 8 | int i; 9 | for(i=1; i*i<=n; i++){ 10 | 11 | System.out.println(i*i); 12 | } 13 | 14 | } 15 | } -------------------------------------------------------------------------------- /IOT/Nivedita-R_NiveditaRai_2125it1079_2/Patterns/Pattern11.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n,i,j,k=1; 6 | cin >> n; 7 | for(i=1;i<=n;i++) 8 | { 9 | for(j=1;j<=i;j++) 10 | { 11 | cout<< k<<"\t"; 12 | k++; 13 | } 14 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv) 5 | { 6 | int n; 7 | cin >> n; 8 | for(int i=n;i>=1;i--) 9 | { 10 | for(int j=1;j 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | 9 | for(int i=0;i 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | for(int i=0;i 2 | #include 3 | using namespace std; 4 | int main(int argc, char const *argv[]) 5 | { 6 | long int n,a,b,s=0; 7 | cin>>n; 8 | if(n>=1){while(n!=0){ 9 | a=n%10;b=n-a; 10 | n=b/10;s=10*s+a; 11 | } 12 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | int n; 7 | cin >> n; 8 | if(n>=1 && n<=pow(10.0,9.0)){ 9 | int d=0; 10 | while(n!=0) 11 | { 12 | n=n/10; 13 | d++; 14 | } 15 | cout< 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int n,j=1; 8 | cin>>n; 9 | for(int i=1;i<=n;i++) 10 | { 11 | for(int k=1;k<=i;k++) 12 | { 13 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin >> n; 7 | for(int i=n;i>=1;i--){ 8 | for(int j=1;j<=i;j++){ 9 | cout<<"*\t"; 10 | } 11 | cout< 2 | using namespace std; 3 | int main() { 4 | // Write your code here. 5 | int n,m; 6 | cin>>n>>m; 7 | int a[n][m]; 8 | for(int i=0;i>a[i][j]; 13 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | for(int i=1; i<=n; i++) { 8 | for(int j = i; j < n; j++) { 9 | cout<<"\t"; 10 | } 11 | for(int j=1; j<=i; j++) { 12 | cout<<"*\t"; 13 | } 14 | cout<<"\n"; 15 | } 16 | 17 | } -------------------------------------------------------------------------------- /Web/rishu15_HrishikDwivedi_2125ec1006_02/gettingStarted/reveseDigit.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | # define ll long long 4 | int main(int argc, char **argv){ 5 | ll n; 6 | cin >> n; 7 | 8 | //write your code here 9 | ll temp = n; 10 | while(temp>0){ 11 | ll r = temp%10; 12 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | for(int i=0;i 2 | using namespace std; 3 | 4 | int main(){ 5 | int n, a=0 ,b=1,i,c; 6 | 7 | cin>>n; 8 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv) 5 | { 6 | int n; 7 | cin >> n; 8 | for(int i=1;i<=n;i++){ 9 | for(int j=1;j<=n;j++){ 10 | if(j==(n+1)-i) 11 | cout<<"* "; 12 | else 13 | cout<<"\t"; 14 | } 15 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv) 5 | { 6 | int n; 7 | cin >> n; 8 | 9 | int a=0,b=1,c; 10 | for(int i=0;i 2 | #include 3 | using namespace std; 4 | int main(int argc, char const *argv[]) 5 | { 6 | long int n,a,b,d=0; 7 | cin>>n; 8 | if(n>=1){while(n!=0){ 9 | a=n%10; 10 | b=n-a; 11 | n=b/10; 12 | d++; 13 | }} 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /Android/decode08_SnehaAggarwal_2125it1071_2/GettingStarted/no. of digits.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class Main{ 4 | 5 | public static void main(String[] args) { 6 | Scanner scn =new Scanner(System.in) ; 7 | int n = scn.nextInt(); 8 | int d=0; 9 | while(n!=0){ 10 | n=n/10; 11 | d++; 12 | } 13 | System.out.println(d); 14 | } 15 | } -------------------------------------------------------------------------------- /IOT/Captain2234_Bhavishya_2125it1064_2/GettingStarted/fibonacciseries.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv) 5 | { 6 | int n; 7 | cin >> n; 8 | int t1=0,t2=1,t3; 9 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv) 5 | { 6 | int n; 7 | cin >> n; 8 | for(int i=1;i<=n;i++){ 9 | for(int j=1;j<=n;j++){ 10 | if(j==(n+1)-i||j==i) 11 | cout<<"*\t"; 12 | else 13 | cout<<"\t"; 14 | } 15 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n,i,j,m; 6 | cin >> n; 7 | m=n; 8 | for(i=1;i<=n;i++) 9 | { 10 | for(j=1;j<=m;j++) 11 | { 12 | cout<<"*\t"; 13 | } 14 | m--; 15 | cout<<"\n"; 16 | 17 | } 18 | } -------------------------------------------------------------------------------- /IOT/ritikgupta88_RitikGupta_2125csit1163_2/Patterns/Pattern7.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | for(int i=0;i 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | for(int i=0;i 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | //write your code here 9 | int d=0; 10 | while(n>0){ 11 | n=n/10; 12 | d++; 13 | } 14 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | //write your code here 9 | for(int i=1;i<=n;i++){ 10 | for(int j=1;j<=i;j++){ 11 | cout<<"*"<<"\t"; 12 | } 13 | cout<<"\n"; 14 | } 15 | 16 | } -------------------------------------------------------------------------------- /Web/Divyanshu-Vareshney_divyanshuvarshney_2125it1075_2/patterns/pattern2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | //write your code here 9 | for(int i=1;i<=n;i++){ 10 | for(int j=i;j<=n;j++){ 11 | cout<<"*"<<"\t"; 12 | } 13 | cout<<"\n"; 14 | } 15 | 16 | } -------------------------------------------------------------------------------- /Web/riyasinghsirohi_Riyasinghsirohi_2125en1103_2/gettingStarted/PrintFibonacciTillN.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv) 5 | { 6 | int n; 7 | cin >> n; 8 | 9 | int a=0,b=1,c; 10 | for(int i=0;i 2 | using namespace std; 3 | int main(int argc, char**argv){ 4 | int n; 5 | cin>>n; 6 | 7 | for(int i=1;i*i<=n;i++) 8 | { 9 | if(i*i<=n) 10 | { 11 | 12 | cout< 2 | using namespace std; 3 | int digFreq(int n, int d) { 4 | int f=0; 5 | while(n) 6 | { 7 | if(d==(n%10)) 8 | f++; 9 | n/=10; 10 | } 11 | return f; 12 | } 13 | int main() { 14 | int n, d; 15 | cin >> n >> d; 16 | int res = digFreq(n, d); 17 | cout << res << endl; 18 | } -------------------------------------------------------------------------------- /Android/Harshitmishra1106_Harshitmishra_2125cs1158_2/GettingStarted/inverseOfN.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int n,num=0,face=1; 8 | cin>>n; 9 | while(n>0){ 10 | int a=n%10; 11 | num = num+(face*pow(10,a-1)); 12 | n=n/10; 13 | face++; 14 | } 15 | cout<0){ 10 | d=n%10; 11 | System.out.println(d); 12 | n=n/10; 13 | } 14 | } 15 | } -------------------------------------------------------------------------------- /IOT/ritikgupta88_RitikGupta_2125csit1163_2/GettingStarted/PrimeFactorizationOfANumber.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main(int argc, char **argv){ 4 | int n; 5 | cin >> n; 6 | int i=2; 7 | while(n!=1){ 8 | if(n%i==0){ 9 | cout< 2 | 3 | using namespace std; 4 | 5 | int main(int argc, char **argv){ 6 | int n; 7 | cin >> n; 8 | 9 | //write your code here 10 | int i; 11 | while(n>0){ 12 | i=n%10; 13 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin >> n; 7 | int count=0; 8 | while(n!=0) 9 | { 10 | 11 | count++; 12 | n=n/10; 13 | } 14 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin >> n; 7 | int p,count = 0; 8 | while(n != 0){ 9 | p = n % 10; 10 | count ++; 11 | n = n / 10; 12 | } 13 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | //write your code here 9 | int temp = n; 10 | int d=0; 11 | while(temp!=0){ 12 | int r=temp%10; 13 | d++; 14 | temp/=10; 15 | } 16 | cout< 2 | using namespace std; 3 | // xyz 4 | int main(){ 5 | int n; 6 | cin >> n; 7 | 8 | //write your code here 9 | 10 | for(int i = 1; i<=n; i++){ 11 | for(int j = i; j>0; j--){ 12 | cout << "*\t"; 13 | } 14 | cout << "\n"; 15 | } 16 | return 0; 17 | } -------------------------------------------------------------------------------- /AR-VR/kapilsingh2003_KapilKumarSingh_2125cs1169_2/GettingStarted/Count_Digits_in_number.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class Main{ 4 | 5 | public static void main(String[] args) { 6 | Scanner scn = new Scanner(System.in); 7 | int n = scn.nextInt(); 8 | int d=0; 9 | while(n>0){ 10 | n=n/10; 11 | d++; 12 | } 13 | System.out.println(d); 14 | } 15 | } -------------------------------------------------------------------------------- /Android/Harshitmishra1106_Harshitmishra_2125cs1158_2/FunctionAndArrays/ReverseAnArrayOfficial.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main(){ 4 | int n,i; 5 | cin>>n; 6 | int arr[10000],arr1[10000]; 7 | for(i=0;i>arr[i]; 9 | for(i=0;i0){ 10 | n/=10; 11 | c++; 12 | } 13 | System.out.println(c); 14 | } 15 | } 16 | -------------------------------------------------------------------------------- /IOT/ritikgupta88_RitikGupta_2125csit1163_2/Patterns/Pattern9.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | for(int i=0;i 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n,a=1; 6 | cin >> n; 7 | for(int i=1;i<=n;i++){ 8 | for(int j=1;j<=i;j++){ 9 | cout< 2 | int main() 3 | { 4 | int n; 5 | scanf("%d",&n); 6 | int a[20]; 7 | int count=0; 8 | while(n) 9 | { 10 | ++count; 11 | a[count-1]=n%10; 12 | n=n/10; 13 | } 14 | for(int i=0; i 2 | using namespace std; 3 | int main() 4 | { 5 | int n; 6 | cin>>n; 7 | if(n>90) 8 | cout<<"excellent"; 9 | else if(n>80) 10 | cout<<"good"; 11 | else if(n>70) 12 | cout<<"fair"; 13 | else if(n>60) 14 | cout<<"meets expectations"; 15 | else 16 | cout<<"below par"; 17 | } -------------------------------------------------------------------------------- /Web/QMiNt_AdityaAgarwal_2125IT1163_2/GettingStarted/InverseOfANumber.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int power(int n,int i) 4 | { 5 | int t=1; 6 | while(i--) 7 | { 8 | t*=n; 9 | } 10 | return t; 11 | } 12 | int main() 13 | { 14 | int t,c=0,a=0; 15 | cin>>t; 16 | while(t) 17 | { 18 | a=a+((c+1)*power(10,t%10-1)); 19 | t=t/10; 20 | c++; 21 | } 22 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin>>n; 7 | if (n>90) cout<<"excellent"; 8 | else if (n>80) cout<<"good"; 9 | else if (n>70) cout<<"fair"; 10 | else if (n>60) cout<<"meets expectations"; 11 | else cout<<"below par"; 12 | return 0; 13 | } -------------------------------------------------------------------------------- /Web/Vaishnavi-Singh20002_VaishnaviSingh_2125ec1060_02/Patterns/pattern1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | for(int i=1;i<=n;i++){ 8 | for(int j=1;j<=i;j++){ 9 | cout<<"*\t"; 10 | } 11 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin >> n; 7 | 8 | 9 | for(int i=0;i 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | //write your code here 9 | for(int i=n;i>=1;i--){ 10 | for(int j=i;j>=1;j--){ 11 | cout<<"*"; 12 | cout<<"\t"; 13 | } 14 | cout<<"\n"; 15 | } 16 | 17 | } -------------------------------------------------------------------------------- /Web/riyasinghsirohi_Riyasinghsirohi_2125en1103_2/Patterns/Pattern2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | for(int i=n;i>=1;i--) 9 | { 10 | for(int j=1;j<=i;j++) 11 | { 12 | cout<<"*\t"; 13 | } 14 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin >> n; 7 | 8 | //write your code here 9 | 10 | for(int i = n; i>0; i--){ 11 | for(int j = i; j>0; j--){ 12 | cout << "*\t"; 13 | } 14 | cout << "\n"; 15 | } 16 | return 0; 17 | } -------------------------------------------------------------------------------- /AR-VR/mrigyasahai_MrigyaSahai_2025it1094_2/GettingStarted/Count Digits In A Number.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | int rem, digit; 9 | 10 | while(n!=0){ 11 | rem = n % 10; 12 | digit++; 13 | n = n / 10; 14 | } 15 | cout << digit; 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /Android/sukritoberoi_SukritKaurOberoi_2125cse1065_2/GettingStarted/PrintZ.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class Main { 4 | 5 | public static void main(String[] args) { 6 | // Write your code here 7 | System.out.println("*****"); 8 | System.out.println(" * "); 9 | System.out.println(" * "); 10 | System.out.println(" * "); 11 | System.out.println("*****"); 12 | } 13 | } -------------------------------------------------------------------------------- /Android/tiwari-aditi_AditiTiwari_2125ec1138_2/Patterns/Pattern7.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(){ 5 | int n,i,j; 6 | cin>>n; 7 | for(i=1;i<=n;i++){ 8 | for(j=1;j<=n;j++){ 9 | if(i+j == 2*i){ 10 | cout<<"*"< 2 | using namespace std; 3 | 4 | int main(){ 5 | int n,i,j; 6 | cin>>n; 7 | for(i=1;i<=n;i++){ 8 | for(j=1;j<=n;j++){ 9 | if(i+j==2*i || i+j==n+1) 10 | cout<<"*\t"; 11 | else 12 | cout<<"\t"; 13 | } 14 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char **argv){ 6 | int n,i=1,c,sum=0; 7 | cin >> n; 8 | while(n!=0){ 9 | c=n%10; 10 | 11 | sum = sum + i*pow(10,c-1) ; 12 | n=n/10; 13 | i++; 14 | } 15 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | for(int i=0;i=2*i) 10 | cout<<"*\t"; 11 | else 12 | cout<<"\t"; 13 | 14 | } 15 | cout< 2 | int main() 3 | { 4 | int n; 5 | scanf("%d",&n); 6 | int a[20]; 7 | int count=0; 8 | while(n) 9 | { 10 | ++count; 11 | a[n%10-1]=count; 12 | n=n/10; 13 | } 14 | for(int i=0; i 2 | using namespace std; 3 | int p(int n,int i) 4 | { 5 | int t=1; 6 | while(i--) 7 | { 8 | t*=n; 9 | } 10 | return t; 11 | } 12 | int main() 13 | { 14 | int t,c=0,a=0; 15 | cin>>t; 16 | while(t) 17 | { 18 | a=a+((c+1)*p(10,t%10-1)); 19 | t=t/10; 20 | c++; 21 | } 22 | cout< 2 | using namespace std; 3 | #include 4 | int main() 5 | { 6 | int n,r,num=0,c=0,n1; 7 | cin>>n; 8 | n1=n; 9 | while(n1>0) 10 | { 11 | r=n1%10; 12 | c++; 13 | num+=pow(10,r-1)*c; 14 | n1/=10; 15 | } 16 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | //write your code here 9 | 10 | for(int i = 1; i<=n; i++){ 11 | for(int j = 1; j 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | int count=0; 9 | for(int i=0;i 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | long num=0,num2=0; 7 | int n,base,arr[20],i=0; 8 | cin>>n>>base; 9 | while(n) 10 | { 11 | arr[i++]= n%base ; 12 | n=n/base; 13 | } 14 | for(int j=i-1;j>=0;j--) 15 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | for(int i=1;i<=n;i++){ 9 | for(int j=1;j<=n;j++){ 10 | if(j<=i) 11 | cout<<"*\t"; 12 | else 13 | cout<<" "; 14 | } 15 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | for(int i=1;i<=n;i++){ 9 | for(int j=n;j>=1;j--){ 10 | if(j>=i) 11 | cout<<"*\t"; 12 | else 13 | cout<<" "; 14 | } 15 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | int i,j,k; 8 | for(i=0;i 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | for(int i=0;i=n-1) 10 | cout<<"*\t"; 11 | else 12 | cout<<"\t"; 13 | } 14 | cout< 2 | #include 3 | int main() 4 | { 5 | int n, b; 6 | scanf("%d%d", &n, &b); 7 | int index=0; 8 | int sum=0; 9 | while(n) 10 | { 11 | sum=sum+ (n%10* pow(b,index)); 12 | index++; 13 | n=n/10; 14 | } 15 | printf("%d",sum); 16 | 17 | return 0; 18 | } -------------------------------------------------------------------------------- /ML/rachitavya_RachitavyaSharma_2125cs1053_2/GettingStarted/printz.java: -------------------------------------------------------------------------------- 1 | public class printz { 2 | 3 | public static void main(String[] args) { 4 | // Write your code here 5 | for(int i=1;i<=5;i++) 6 | { 7 | for(int j=1;j<=5;j++) 8 | { 9 | System.out.print((i==1 || i==5)?"*":((j==6-i)?"*":" ")); 10 | } 11 | System.out.println(); 12 | } 13 | 14 | } 15 | } -------------------------------------------------------------------------------- /Web/Vaishnavi-Singh20002_VaishnaviSingh_2125ec1060_02/Patterns/pattern4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin >> n; 7 | for(int i=1;i<=n;i++) 8 | { 9 | for(int j=1;ji;j--){ 13 | cout<<"*\t"; 14 | } 15 | cout< 2 | using namespace std; 3 | int main() 4 | { 5 | int i,j,n; 6 | cin>>n; 7 | for(i=1;i<=n;i++) 8 | { 9 | for(j=1;j<=n;j++) 10 | { 11 | if(i==j) 12 | cout<<"* "; 13 | else cout<<" "; 14 | } 15 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | int val = 1; 9 | for (int i = 1; i <= n; i++){ 10 | for (int j = 1; j <= i; j++){ 11 | cout << (val) << "\t"; 12 | val++; 13 | } 14 | cout << endl; 15 | } 16 | } -------------------------------------------------------------------------------- /AR-VR/kapilsingh2003_KapilKumarSingh_2125cs1169_2/GettingStarted/Reverse_A_Number.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class Main{ 4 | 5 | public static void main(String[] args) { 6 | Scanner scn = new Scanner(System.in); 7 | int n = scn.nextInt(); 8 | int rem, d=0; 9 | while(n>0){ 10 | rem = n%10; 11 | n=n/10; 12 | System.out.println(rem); 13 | } 14 | } 15 | } -------------------------------------------------------------------------------- /IOT/Captain2234_Bhavishya_2125it1064_2/GettingStarted/PrintZ.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main(int argc, char** agrc) { 4 | 5 | for(int i=1;i<=5;i++){ 6 | for(int j=1;j<=5;j++){ 7 | if(i==1||i==5) 8 | cout<<"*"; 9 | else if(j==6-i) 10 | cout<<"*"; 11 | else 12 | cout<<" "; 13 | } 14 | cout<<"\n"; 15 | } 16 | return 0; 17 | 18 | } -------------------------------------------------------------------------------- /IOT/Nivedita-R_NiveditaRai_2125it1079_2/Patterns/Pattern2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | int i,j,k; 8 | for(i=0;i=0;j--) 11 | { 12 | if(j>=i) 13 | { 14 | cout<<"*\t"; 15 | } 16 | 17 | 18 | } 19 | cout << endl; 20 | } 21 | 22 | } -------------------------------------------------------------------------------- /IOT/tansin25_TanmaySingh_2125csit1072_2/Patterns/Pattern3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | for(int i=1;i<=n;i++) 8 | { 9 | for(int j=1;j<=n;j++) 10 | { 11 | if(j>=n+1-i) 12 | cout<<"* "; 13 | else 14 | cout<<" "; 15 | } 16 | cout< 2 | 3 | int main() 4 | { 5 | int n, m; 6 | scanf("%d",&n); 7 | m=n; 8 | for(int i=2; i0;num/=10) 11 | c++; 12 | System.out.print(c); 13 | sc.close(); 14 | } 15 | } -------------------------------------------------------------------------------- /Web/1010varun_varunagarwal_2125csai1023_2/GettingStarted/primeTillN.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | #define ll long long 4 | int main(int argc, char **argv){ 5 | ll low, high; 6 | cin >> low >> high; 7 | for(ll i = low; i <= high; i++){ 8 | ll prime = 0; 9 | for(ll j = 1; j <= i/2; j++)if(i%j == 0)prime ++; 10 | if(prime == 1)cout << i << endl; 11 | } 12 | } -------------------------------------------------------------------------------- /Web/1010varun_varunagarwal_2125csai1023_2/GettingStarted/printZ.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main() { 4 | for(int i = 0; i < 5; i++)cout << "*"; 5 | cout << endl; 6 | int i = 3; 7 | while(i > 0){ 8 | for(int j = 0; j < i; j++)cout << " "; 9 | cout << "*" << endl; 10 | i--; 11 | } 12 | for(int i = 0; i < 5; i++)cout << "*"; 13 | 14 | } 15 | 16 | -------------------------------------------------------------------------------- /Web/Tushar-sahani_TusharSahani_2125cs1072_2/Patterns/Patttern14.java: -------------------------------------------------------------------------------- 1 | package coderspear.pattern; 2 | import java.util.*; 3 | public class Patttern14 { 4 | public static void main(String[] args) { 5 | Scanner scn = new Scanner(System.in); 6 | int n = scn.nextInt(); 7 | for(int i=1;i<=10;i++){ 8 | System.out.println(n+ " * "+i+" = "+n*i); 9 | } 10 | 11 | } 12 | } 13 | -------------------------------------------------------------------------------- /Web/alisha0903_AlishaRaghav_2125cse1189_02/FunctionAndArrays/digitFrequency.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int digFreq(int n, int d) { 4 | 5 | int c=0; 6 | while(n>0) 7 | { 8 | if(n%10==d) 9 | c++; 10 | n/=10; 11 | } 12 | return c; 13 | 14 | } 15 | int main() { 16 | int n, d; 17 | cin >> n >> d; 18 | int res = digFreq(n, d); 19 | cout << res << endl; 20 | } -------------------------------------------------------------------------------- /Web/alisha0903_AlishaRaghav_2125cse1189_02/Patterns/pattern8.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main() 4 | { 5 | int i,j,n; 6 | cin>>n; 7 | for(i=1;i<=n;i++) 8 | { 9 | for(j=1;j<=n;j++) 10 | { 11 | if((i+j-1)==n) 12 | cout<<"* "; 13 | else cout<<" "; 14 | } 15 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv) 5 | { 6 | int n; 7 | cin >> n; 8 | 9 | int t1=0, t2=1, temp; 10 | for(int i=0;i 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | int count,r; 8 | while(n!=0){ 9 | r=n%10; 10 | 11 | count++; 12 | n=n/10; 13 | 14 | } 15 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | for(int i=1;i<=n;i++){ 8 | for(int j=1;j<=n;j++){ 9 | if(j==i||j==n-i+1) cout<<" *"; 10 | else cout<<" "; 11 | } cout<<"\n";} 12 | //write your code here 13 | return 0; 14 | } -------------------------------------------------------------------------------- /Android/tiwari-aditi_AditiTiwari_2125ec1138_2/Patterns/Pattern8.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(){ 5 | int n,i,j; 6 | cin>>n; 7 | for(i=1;i<=n;i++){ 8 | for(j=1;j<=n;j++){ 9 | if(i+j == n+1){ 10 | cout<<"*\t"; 11 | break; } 12 | else 13 | cout<<"\t"; 14 | } 15 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv) 5 | { 6 | int n,c; 7 | cin >> n; 8 | int a=0,b=1; 9 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | int i,j,k; 8 | for(i=0;i 2 | using namespace std; 3 | int main() 4 | { 5 | int n,i,j; 6 | cin>>n; 7 | for(i=n;i>=1;i--) 8 | { 9 | for(j=1;j<=n;j++) 10 | { 11 | if(j 2 | using namespace std; 3 | int main() 4 | { 5 | int n,i,j; 6 | cin>>n; 7 | for(i=1;i<=n;i++) 8 | { 9 | for(j=1;j<=n;j++) 10 | { 11 | if(j 2 | using namespace std; 3 | int main() 4 | { 5 | int i,j,n; 6 | cin>>n; 7 | for(i=1;i<=n;i++) 8 | { 9 | for(j=1;j<=n;j++) 10 | { 11 | if(i==j||(i+j-1)==n) 12 | cout<<"* "; 13 | else cout<<" "; 14 | } 15 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv) 5 | { 6 | int n; 7 | cin >> n; 8 | 9 | //write your code here 10 | 11 | for(int i = 0; i0; j--){ 13 | cout << "\t"; 14 | } 15 | cout << "*" << endl; 16 | } 17 | 18 | } -------------------------------------------------------------------------------- /AR-VR/aryanxsri_Aryan_2125cs1102_2/GettingStarted/benjaminBulbs.java: -------------------------------------------------------------------------------- 1 | //HAD TO LOOK UP FOR THE SOLUTION 2 | 3 | import java.util.*; 4 | 5 | public class Main{ 6 | 7 | public static void main(String[] args) { 8 | Scanner sc=new Scanner(System.in); 9 | int n=sc.nextInt(); 10 | 11 | for(int x=1;x*x<=n;x++) 12 | System.out.println(x*x); 13 | // write your code here 14 | } 15 | } -------------------------------------------------------------------------------- /Android/Harshitmishra1106_Harshitmishra_2125cs1158_2/Patterns/pattern_7.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | for(int i=0;i 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | int n,i,j; 7 | cin >> n; 8 | for(i=1;i<=n;i++){ 9 | for(j=1;j<=n;j++){ 10 | if(i+j<=n) 11 | cout<<"\t"; 12 | else 13 | cout<<"*\t"; 14 | } 15 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | int n,i,j; 7 | cin >> n; 8 | for(i=1;i<=n;i++){ 9 | for(j=1;j<=n;j++){ 10 | if(j-i>=0) 11 | cout<<"*\t"; 12 | else 13 | cout<<"\t"; 14 | } 15 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | int i,j,k; 8 | for(i=0;i=0;j--) 11 | { 12 | if(j==i) 13 | cout<<"*\t"; 14 | else 15 | cout << "\t"; 16 | 17 | 18 | } 19 | cout << "\n"; 20 | } 21 | 22 | } -------------------------------------------------------------------------------- /Web/Macabre908_AbhishekDubey_2125cse1175_2/GettingStarted/reverseANum.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class reverseANum { 4 | public static void main(String args[]){ 5 | Scanner sc = new Scanner(System.in); 6 | long n = sc.nextInt(); 7 | while(n > 0){ 8 | long d = n % 10; 9 | System.out.println(d); 10 | n = n / 10; 11 | } 12 | sc.close(); 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /Web/kashish12_kashishalikhan_2125cse1133_02/Patterns/pattern13.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin >> n; 7 | for (int i = 0; i < n; i++ ) 8 | { 9 | int a = 1; 10 | for (int j = 0; j <= i; j++) { 11 | cout< 2 | using namespace std; 3 | int main(){ 4 | int a[10000000],n,d,k=0; 5 | cin>>n; 6 | for(int i=0;i>a[i]; 8 | cin>>d; 9 | for(int i=0;i 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n,count=1; 6 | cin >> n; 7 | for(int i=1;i<=n;i++){ 8 | for(int j=1;j<=i;j++){ 9 | cout<0){ 9 | System.out.println(n%10); 10 | n=n/10; 11 | } 12 | } 13 | 14 | } 15 | -------------------------------------------------------------------------------- /IOT/Captain2234_Bhavishya_2125it1064_2/FunctionAndArrays/DigitFrequency.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int digFreq(int n, int d) { 4 | int count=0; 5 | while(n!=0){ 6 | int rem=n%10; 7 | if(d==rem){ 8 | count++; 9 | } 10 | n=n/10; 11 | } 12 | return count; 13 | } 14 | int main() { 15 | int n, d; 16 | cin >> n >> d; 17 | int res = digFreq(n, d); 18 | cout << res << endl; 19 | } -------------------------------------------------------------------------------- /IOT/gurpreetk12_gurpreetkaur_2125cs1094_2/Gettingstarted/digitsofanumber.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n,arr[100],i=0,q; 6 | cin >> n; 7 | while(n!=0) 8 | { 9 | q=n%10; 10 | n=n/10; 11 | arr[i]=q; 12 | i++; 13 | } 14 | for(int j=i-1;j>=0;j--) 15 | { 16 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | for(int i=n;i>=1;i--) 9 | { 10 | for(int j=1;j<=n;j++) 11 | { 12 | if(j>=n+1-i) 13 | cout<<"* "; 14 | else 15 | cout<<" "; 16 | } 17 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char **argv){ 6 | int n; 7 | cin>>n; 8 | int power=1,digit,inverted; 9 | while(n>0){ 10 | digit=n%10; 11 | inverted=inverted+power*pow(10,(digit-1)); 12 | n=n/10; 13 | power++; 14 | } 15 | cout< 2 | using namespace std; 3 | int main(int argc, char const *argv[]) 4 | { 5 | int n; 6 | cin>>n; 7 | for (int i=2;n!=1;i++) 8 | { 9 | if(n%i==0) 10 | { 11 | cout< 2 | using namespace std; 3 | int main() 4 | { 5 | int i,j,n; 6 | cin>>n; 7 | for(i=1;i<=n;i++) 8 | { 9 | for(j=1;j<=n;j++) 10 | { 11 | if(i==j||(i+j-1)==n) 12 | cout<<"*\t"; 13 | else cout<<"\t"; 14 | } 15 | cout< 2 | using namespace std; 3 | void DecToAny(int n, int b) { 4 | int a[1000],i=1; 5 | while(n!=0){ 6 | int rem=n%b; 7 | a[i]=rem; 8 | i++; 9 | n=n/b; 10 | } 11 | for(int k=i-1;k>=1;k--){ 12 | cout<> n; 19 | cin >> b; 20 | DecToAny(n, b); 21 | 22 | } -------------------------------------------------------------------------------- /IOT/Nivedita-R_NiveditaRai_2125it1079_2/FunctionandArrays/FindElementInAnArray.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | int main() { 5 | int x, n,i,j,el,k=-1; 6 | cin >>n; 7 | int *arr ; 8 | arr = (int*)malloc(n*sizeof(int)); 9 | for (x = 0; x < n; x++) { 10 | cin >> arr[x]; 11 | } 12 | cin >> el; 13 | for(i=0;i 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n,arr[100],i=0,q; 6 | cin >> n; 7 | while(n!=0) 8 | { 9 | q=n%10; 10 | n=n/10; 11 | arr[i]=q; 12 | i++; 13 | } 14 | for(int j=i-1;j>=0;j--) 15 | { 16 | cout< 2 | int main() 3 | { 4 | int n; 5 | printf("enter="); 6 | scanf("%d",&n); 7 | int a[20]; 8 | int count=0; 9 | while(n) 10 | { 11 | ++count; 12 | a[count-1]=n%10; 13 | n=n/10; 14 | } 15 | for(int i=0; i 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | //write your code here 9 | int i,j,c=1; 10 | for(i=1;i<=n;i++){ 11 | for(j=1;j<=i;j++){ 12 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | for(int i=0;i 2 | using namespace std; 3 | int main() 4 | { 5 | int n,rev=0,r; 6 | cin>>n; 7 | while(n>0) 8 | { 9 | r=n%10; 10 | rev=rev*10+r; 11 | n/=10; 12 | } 13 | while(rev>0) 14 | { 15 | r=rev%10; 16 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | int n, r, num = 0, c = 0, a; 7 | cin>>n; 8 | a = n; 9 | while(a > 0) 10 | { 11 | r = a % 10; 12 | c++; 13 | num += pow(10, r - 1) * c; 14 | a /= 10; 15 | } 16 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | int a=1; 9 | for(int i=1;i<=n;i++) 10 | { 11 | for(int j=1;j<=i;j++) 12 | { 13 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | for(int i=1;i<=n;i++) 8 | { 9 | for(int j=n;j>i;j--) 10 | { 11 | cout<<"\t"; 12 | } 13 | for(int j=1;j<=i;j++) 14 | { 15 | cout<<"*\t"; 16 | }cout< 2 | using namespace std; 3 | int digFreq(int n, int d) { 4 | int p,k=0; 5 | while(n!=0){ 6 | p=n%10; 7 | if(p==d) 8 | k++; 9 | n=n/10; 10 | } 11 | return k; 12 | //write your code here 13 | } 14 | int main() { 15 | int n, d; 16 | cin >> n >> d; 17 | int res = digFreq(n, d); 18 | cout << res << endl; 19 | } -------------------------------------------------------------------------------- /ML/KeplerInCoding_ShreyaSharma_2125cse1170_2/Patterns/PatternType11.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int n; 6 | scanf("%d",&n); 7 | int c=0; 8 | 9 | for(int i=0; i0;num/=10) 10 | { 11 | d=num%10; 12 | System.out.println(d); 13 | } 14 | 15 | sc.close(); 16 | } 17 | } -------------------------------------------------------------------------------- /Web/1010varun_varunagarwal_2125csai1023_2/GettingStarted/lcm_gcf.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | #define ll long long 4 | 5 | int main(int argc, char **argv){ 6 | ll num1, num2, hcf, lcm, small; 7 | cin >> num1 >> num2; 8 | small = (num1 < num2)?num1:num2; 9 | for(int i = 1; i <= small; i++){ 10 | if(num1%i == 0 && num2%i == 0)hcf = i; 11 | } 12 | cout << hcf << endl << (num1*num2)/hcf; 13 | } -------------------------------------------------------------------------------- /Web/1010varun_varunagarwal_2125csai1023_2/GettingStarted/primeFactors.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | #define ll long long 4 | int main(int argc, char **argv){ 5 | ll n, factor = 2; 6 | cin >> n; 7 | while(n > 1){ 8 | if(n%factor == 0){ 9 | n /= factor; 10 | cout << factor << " "; 11 | } 12 | else{ 13 | factor ++ ; 14 | } 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /Web/ShreyashSriv_ShreyashSrivastava_2125csme1051_2/Patterns/Pattern4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin >> n; 7 | for(int i=0;i 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | for (int i = 0; i < n; i++){ 9 | int val = 1; 10 | for (int j = 0; j <= i; j++){ 11 | cout << val << ("\t"); 12 | val = (val * (i - j)) / (j + 1); 13 | } 14 | cout << endl; 15 | } 16 | } -------------------------------------------------------------------------------- /AR-VR/aryanxsri_Aryan_2125cs1102_2/GettingStarted/inverse.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | public class Main{ 3 | 4 | public static void main(String[] args) { 5 | Scanner sc = new Scanner(System.in); 6 | int n=sc.nextInt(); 7 | int m=0; 8 | int x=1; 9 | while(n>0){ 10 | int temp=n%10; 11 | n=n/10; 12 | m+=x*Math.pow(10,temp-1); 13 | x++; 14 | } 15 | System.out.println(m); 16 | } 17 | 18 | } -------------------------------------------------------------------------------- /Android/Ananya3632_AnanyaSrivastava_2125cs1114_2/GettingStarted/CountDigits.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class Main{ 4 | 5 | public static void main(String[] args) { 6 | Scanner scn = new Scanner(System.in); 7 | int n = scn.nextInt(); 8 | 9 | 10 | int digit = 0; 11 | 12 | while (n != 0) 13 | { 14 | n = n / 10; 15 | digit++; 16 | } 17 | 18 | System.out.println(digit); 19 | } 20 | } -------------------------------------------------------------------------------- /Android/aryanmishra29_AryanMishra_2125csme1029_2/Patterns/Pattern_14.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class Pattern_14 { 4 | 5 | public static void main(String[] args) { 6 | Scanner scn = new Scanner(System.in); 7 | int x = scn.nextInt(); 8 | int m=1; 9 | while(m<=10){ 10 | System.out.printf("%d * %d = %d\n",x,m,x*m++); 11 | } 12 | // write ur code here 13 | 14 | } 15 | } -------------------------------------------------------------------------------- /IOT/Captain2234_Bhavishya_2125it1064_2/Patterns/Pattern4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | for(int i=1;i<=n;i++){ 9 | for(int j=1;j<=n;j++){ 10 | if(j>=i) 11 | cout<<"*\t"; 12 | else 13 | cout<<"\t"; 14 | } 15 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | for(int i=1;i<=n;i++){ 9 | for(int j=1;j<=n;j++){ 10 | if(j==i){ 11 | cout<<"* "; 12 | } 13 | else 14 | cout<<"\t"; 15 | } 16 | cout< 2 | #include 3 | using namespace std; 4 | int AnyToDec(int n, int b) { 5 | int d,r,s=0,i=0,t; 6 | while(n!=0){ 7 | t=pow(b,i); 8 | r=n%10; 9 | s=s+(r*t); 10 | i++; 11 | n=n/10;} 12 | return s; 13 | } 14 | int main() { 15 | int n; 16 | int b; 17 | cin >> n; 18 | cin >> b; 19 | int res = AnyToDec(n, b); 20 | cout << res << endl; 21 | } -------------------------------------------------------------------------------- /ML/KeplerInCoding_ShreyaSharma_2125cse1170_2/FunctionAndArrays/DecimalToAnyBase.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n, b; 5 | scanf("%d%d", &n, &b); 6 | int a[10]; 7 | int count=0; 8 | while(n) 9 | { 10 | a[count]=n%b; 11 | n=n/b; 12 | count++; 13 | } 14 | for(int i=0; i 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n, j, k; 6 | cin >> n; 7 | for(int i = n; i > 0; i--){ 8 | for(j = 1; j <= i-1; j++){ 9 | cout << " "; 10 | } 11 | for(k = 0; k <= n-j; k++){ 12 | cout << "*" << " "; 13 | } 14 | cout << endl; 15 | } 16 | } -------------------------------------------------------------------------------- /Web/alisha0903_AlishaRaghav_2125cse1189_02/GettingStarted/GradingSystem.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main() 4 | { 5 | int n; 6 | cin>>n; 7 | if(n>90) 8 | cout<<"excellent"; 9 | else if (n>80&&n<=90) 10 | cout<<"good"; 11 | else if(n>70&&n<=80) 12 | cout<<"fair"; 13 | else if(n>60&&n<=70) 14 | cout<<"meets expectations"; 15 | else 16 | cout<<"below par"; 17 | return 0; 18 | } -------------------------------------------------------------------------------- /Web/alisha0903_AlishaRaghav_2125cse1189_02/GettingStarted/PrintAllPrimeTillN.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main() 4 | { 5 | int low,high,i,c,j; 6 | cin>>low>>high; 7 | for(i=low;i<=high;i++) 8 | { 9 | c=0; 10 | for(j=2;j 2 | using namespace std; 3 | int digFreq(int n, int d) { 4 | int p,r = 0; 5 | while( n != 0){ 6 | p = n % 10; 7 | if(p == d){ 8 | r++; 9 | } 10 | n = n / 10; 11 | } 12 | return r; 13 | } 14 | int main() { 15 | int n, d; 16 | cin >> n >> d; 17 | int res = digFreq(n, d); 18 | cout << res << endl; 19 | } -------------------------------------------------------------------------------- /Web/kashish12_kashishalikhan_2125cse1133_02/GettingStarted/digitsofanumber.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin >> n; 7 | int p,r = 0,q; 8 | while(n != 0){ 9 | p = n % 10; 10 | r = r * 10 + p; 11 | n = n / 10; 12 | } 13 | while(r != 0){ 14 | q = r % 10; 15 | r = r / 10; 16 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | for(int i=0;i=i) 10 | cout<<"* "; 11 | else 12 | cout<<" "; 13 | } 14 | cout< 2 | using namespace std; 3 | int main(int argc, char **argv){ 4 | int num1, num2,gcd,lcm,rn1,rn2; 5 | cin >> num1 >> num2; 6 | rn1=num1; 7 | rn2=num2; 8 | int rem; 9 | while(num1 % num2!=0) 10 | { 11 | rem=num1%num2; 12 | num1=num2; 13 | num2=rem; 14 | } 15 | gcd=num2; 16 | lcm=(rn1*rn2)/gcd; 17 | cout< 2 | using namespace std; 3 | 4 | void reverse(int* arr, int n){ 5 | for(int i=n-1;i>=0;i--) 6 | { 7 | cout<>n; 14 | 15 | int* arr = new int[n]; 16 | for(int i = 0 ; i < n; i++){ 17 | cin>>arr[i]; 18 | } 19 | reverse(arr,n); 20 | } -------------------------------------------------------------------------------- /ML/KeplerInCoding_ShreyaSharma_2125cse1170_2/GettingStarted/GcdAndLcm.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main(int argc, char **argv){ 4 | int num1, num2; 5 | cin >> num1 >> num2; 6 | 7 | int n1=num1; 8 | int n2= num2; 9 | 10 | while(n1%n2!=0) 11 | { 12 | int temp=n2; 13 | n2= n1%n2; 14 | n1= temp; 15 | } 16 | printf("%d\n%d", n2, (num1*num2)/n2); 17 | return 0; 18 | } -------------------------------------------------------------------------------- /Web/EvaMittal_EvaMittal_2125cs1187_2/Patterns/Pattern1.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | public class Pattern1 { 3 | public static void main(String[] args) { 4 | Scanner scn = new Scanner(System.in); 5 | int n = scn.nextInt(); 6 | int i,j; 7 | for(i=1;i<=n;i++) 8 | { 9 | for(j=1;j<=i;j++) 10 | System.out.print("*\t"); 11 | System.out.println(); 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /Web/QMiNt_AdityaAgarwal_2125IT1163_2/Patterns/Pattern3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main() 4 | { 5 | int n; 6 | cin>>n; 7 | for (int i = 0; i < n; i++) 8 | { 9 | for (int j = 0; j<=n-i-2; j++) 10 | { 11 | cout<<"\t"; 12 | } 13 | for (int j = 0; j<=i; j++) 14 | { 15 | cout<<"*\t"; 16 | } 17 | cout< 2 | using namespace std; 3 | int main() 4 | { 5 | int n; 6 | cin>>n; 7 | for (int i = 1; i <= n; i++) 8 | { 9 | for (int j = 1; j <= n; j++) 10 | { 11 | if (i == j || i + j == n + 1) 12 | { 13 | cout<<"*\t"; 14 | } 15 | else 16 | cout<<"/t"; 17 | } 18 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin>>n; 7 | 8 | for(int i=1; i<=n; i++) 9 | { 10 | for(int j=i; j 2 | using namespace std; 3 | int DecToAny(int n, int b) { 4 | int p=1,num=0; 5 | while(n) 6 | { 7 | num=num+ p*(n%b); 8 | n/=b; 9 | p*=10; 10 | } 11 | return num; 12 | } 13 | int main() { 14 | int n; 15 | int b; 16 | cin >> n; 17 | cin >> b; 18 | int res = DecToAny(n, b); 19 | cout << res << endl; 20 | } -------------------------------------------------------------------------------- /AR-VR/kapilsingh2003_KapilKumarSingh_2125cs1169_2/GettingStarted/Fibonacci_till_N.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class Main{ 4 | 5 | public static void main(String[] args) { 6 | Scanner scn = new Scanner(System.in); 7 | int n = scn.nextInt(); 8 | int a=0, b=1, sum=0; 9 | 10 | for(int i=0; i 2 | using namespace std; 3 | int digFreq(int n, int d) { 4 | int a,b,freq=0; 5 | while(n>0){ 6 | a=n%10; 7 | n=n/10; 8 | if(a==d) 9 | freq++; 10 | } 11 | return freq; 12 | } 13 | int main() { 14 | int n, d; 15 | cin >> n >> d; 16 | int res = digFreq(n, d); 17 | cout << res << endl; 18 | return 0; 19 | } -------------------------------------------------------------------------------- /Android/sukritoberoi_SukritKaurOberoi_2125cse1065_2/GettingStarted/CountDigitsInANumber.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class Main{ 4 | 5 | public static void main(String[] args) { 6 | // write your code here 7 | Scanner sc=new Scanner(System.in); 8 | int n=sc.nextInt(); 9 | int d=0; 10 | while(n!=0) 11 | { 12 | n=n/10; 13 | d++; 14 | } 15 | System.out.println(d); 16 | } 17 | } 18 | 19 | -------------------------------------------------------------------------------- /IOT/Nivedita-R_NiveditaRai_2125it1079_2/Patterns/Pattern3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | int i,j,k; 8 | for(i=0;i=0;j--) 11 | { 12 | if(j>i) 13 | { 14 | cout<<"\t"; 15 | } 16 | else 17 | cout <<"*\t"; 18 | 19 | 20 | } 21 | cout << endl; 22 | } 23 | 24 | } -------------------------------------------------------------------------------- /IOT/Nivedita-R_NiveditaRai_2125it1079_2/Patterns/Pattern4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | int i,j,k; 8 | for(i=0;i=i) 13 | { 14 | cout<<"*\t"; 15 | } 16 | else 17 | cout <<"\t"; 18 | 19 | 20 | } 21 | cout << endl; 22 | } 23 | 24 | } -------------------------------------------------------------------------------- /IOT/gurpreetk12_gurpreetkaur_2125cs1094_2/Patterns/Pattern4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | for(int i=0;i 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n,k=1; 6 | cin >> n; 7 | for(int i=0;i 2 | using namespace std; 3 | int main(int argc, char** agrc) { 4 | for(int i=0; i<5; i++) 5 | { 6 | for(int j=0; j<5; j++) 7 | { 8 | if(i==0||i==4||(i+j)==4) 9 | { 10 | cout<<"*"; 11 | } 12 | else 13 | cout<<" "; 14 | } 15 | cout<<"\n"; 16 | } 17 | 18 | } 19 | 20 | 21 | 22 | -------------------------------------------------------------------------------- /Web/alisha0903_AlishaRaghav_2125cse1189_02/FunctionAndArrays/anyToDEc.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | int AnyToDec(int n, int b) { 5 | int num=0,c=0; 6 | while(n>0) 7 | { 8 | num=num+pow(b,c)*(n%10); 9 | c++; 10 | n/=10; 11 | } 12 | return num; 13 | 14 | } 15 | int main() { 16 | int n; 17 | int b; 18 | cin >> n; 19 | cin >> b; 20 | int res = AnyToDec(n, b); 21 | cout << res << endl; 22 | } -------------------------------------------------------------------------------- /Web/alisha0903_AlishaRaghav_2125cse1189_02/FunctionAndArrays/dedcToAny.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | int DecToAny(int n, int b) { 5 | int num=0,c=0; 6 | while(n>0) 7 | { 8 | num=num + (n%b)*pow(10,c); 9 | c++; 10 | n/=b; 11 | } 12 | return num; 13 | } 14 | int main() { 15 | int n; 16 | int b; 17 | cin >> n; 18 | cin >> b; 19 | int res = DecToAny(n, b); 20 | cout << res << endl; 21 | } -------------------------------------------------------------------------------- /Web/alisha0903_AlishaRaghav_2125cse1189_02/GettingStarted/IsANumberPrime.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main() 4 | { 5 | int t,n,i,c; 6 | cin>>t; 7 | while(t--) 8 | { 9 | cin>>n; 10 | c=0; 11 | for(i=2;i 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char **argv){ 6 | int n; 7 | cin >> n; 8 | vector v; 9 | while(n) 10 | { 11 | v.push_back(n%10); 12 | n/=10; 13 | } 14 | for(auto it=v.end()-1;it>=v.begin();it--) 15 | { 16 | cout<<*it< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | for(int i=0;i 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char **argv){ 6 | int n; 7 | int flag = 0, dig = 1, r; 8 | cin >> n; 9 | 10 | while(n>0){ 11 | r = n % 10; 12 | flag = flag + dig*pow(10,r-1); 13 | dig++; 14 | n = n / 10; 15 | } 16 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv) 5 | { 6 | int n; 7 | cin >> n; 8 | 9 | int i, j; 10 | int a1=n-1,a2=1; 11 | for(i=1;i<=n;i++){ 12 | for(j=1;j<=a1;j++){ 13 | cout<<"\t"; 14 | } 15 | cout<<"*\t"; 16 | a1--; 17 | cout< 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int n,m,i,j; 7 | cin>>n>>m; 8 | int arr[n][m]; 9 | for(i=0;i>arr[i][j]; 12 | for(i=0;i 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | for(int i=0;i=n-i-1) 10 | cout<<"* "; 11 | else 12 | cout<<" "; 13 | } 14 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | int start=1,n,dig,i =0,mult; 7 | cin>>n; 8 | 9 | while(n!=0){ 10 | dig = n%10; 11 | dig--; 12 | mult = pow(10,dig); 13 | i+= start*mult; 14 | n= n/10; 15 | start++; 16 | } 17 | 18 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | int i,j,k; 8 | k = n-1; 9 | for(i=0;i 2 | using namespace std; 3 | int main() 4 | { 5 | int n; 6 | cin>>n; 7 | for (int i = 0; i < n; i++) 8 | { 9 | for (int j = 0; ji; j--) 14 | { 15 | cout<<"*\t"; 16 | } 17 | 18 | cout< 2 | using namespace std; 3 | int main(int argc, char **argv){ 4 | int num1, num2,gcd,lcm,rn1,rn2; 5 | cin >> num1 >> num2; 6 | rn1=num1; 7 | rn2=num2; 8 | int rem; 9 | while(num1 % num2!=0) 10 | { 11 | rem=num1%num2; 12 | num1=num2; 13 | num2=rem; 14 | } 15 | gcd=num2; 16 | lcm=(rn1*rn2)/gcd; 17 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | for(int i=0;i=i) 13 | cout<<"*\t"; 14 | else 15 | cout<<"\t"; 16 | } 17 | cout<0) 11 | { 12 | c++; 13 | n=n/10; 14 | } 15 | System.out.println(c); 16 | } 17 | } -------------------------------------------------------------------------------- /Android/Garima0812S_GarimaShukla_2125ec1114_2/Pattern/pattern7.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class Pattern_7 { 4 | 5 | public static void main(String[] args) { 6 | Scanner scn = new Scanner(System.in); 7 | int n = scn.nextInt(); 8 | for(int i=0;i 2 | using namespace std; 3 | 4 | int digFreq(int n, int d) { 5 | int rem,count=0; 6 | while(n!=0){ 7 | rem = n%10; 8 | n = n/10; 9 | if(rem==d) 10 | count++; 11 | } 12 | return count; 13 | } 14 | 15 | int main() { 16 | int n, d; 17 | cin >> n >> d; 18 | int res = digFreq(n, d); 19 | cout << res << endl; 20 | } -------------------------------------------------------------------------------- /IOT/Captain2234_Bhavishya_2125it1064_2/GettingStarted/isanumberprime.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { int t; 7 | cin>>t; 8 | while(t--){ 9 | int n,i; 10 | cin>>n; 11 | for ( i = 2; i <=n; i++) { 12 | if (n % i == 0) 13 | break; 14 | } 15 | if(i==n||n==1) 16 | cout << "prime"< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | for(int i = 1; i <= n; i++) { 9 | for(int j =1; j <= n; j++) { 10 | if(i+j== n+1) { 11 | cout<<("*\t"); 12 | } 13 | else{ 14 | cout<<("\t"); 15 | } 16 | } 17 | cout<<("\n"); 18 | } 19 | 20 | return 0; 21 | } -------------------------------------------------------------------------------- /IOT/tansin25_TanmaySingh_2125csit1072_2/Patterns/Pattern9.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | for(int i = 1; i <= n; i++) { 9 | for(int j =1; j <= n; j++) { 10 | if(i==j||i+j== n+1) { 11 | cout<<("*\t"); 12 | } 13 | else{ 14 | cout<<("\t"); 15 | } 16 | } 17 | cout<<("\n"); 18 | } 19 | 20 | return 0; 21 | } -------------------------------------------------------------------------------- /ML/KeplerInCoding_ShreyaSharma_2125cse1170_2/Patterns/PatternType3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(int argc, char **argv){ 4 | int n; 5 | scanf("%d",&n); 6 | 7 | for(int i=0; i=1;i--) 10 | { 11 | for(int j=1;j<=i;j++) 12 | System.out.print("* "); 13 | System.out.println(); 14 | } 15 | 16 | } 17 | } 18 | -------------------------------------------------------------------------------- /Web/EvaMittal_EvaMittal_2125cs1187_2/Patterns/Pattern2.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | public class Pattern2 { 3 | public static void main(String[] args) { 4 | Scanner scn = new Scanner(System.in); 5 | int n = scn.nextInt(); 6 | int i,j; 7 | for(i=n;i>=1;i--) 8 | { 9 | for(j=1;j<=i;j++) 10 | System.out.print("*\t"); 11 | System.out.println(); 12 | } 13 | 14 | } 15 | } 16 | -------------------------------------------------------------------------------- /Web/ShreyashSriv_ShreyashSrivastava_2125csme1051_2/GettingStarted/PrintFibonacciNumbersTillN.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv) 5 | { 6 | int n; 7 | cin >> n; 8 | int a=0,b=1,c; 9 | n-=2; 10 | cout< 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int n; 7 | cin >> n; 8 | int a=0,b=1; 9 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin >> n; 7 | for(int i=1;i<=n;i++) 8 | { 9 | for(int j=i;j 2 | using namespace std; 3 | int main() 4 | { 5 | int i,j,n; 6 | cin>>n; 7 | for(i=1;i<=n;i++) 8 | { 9 | for(j=1;j<=n;j++) 10 | { 11 | if(i==1||i==n||(i+j)==n) 12 | cout<<"*"; 13 | else 14 | cout<<" "; 15 | 16 | } 17 | cout< 2 | using namespace std; 3 | int main() 4 | { 5 | int n; 6 | cin>>n; 7 | for(int i=1;i<=n;i++) 8 | { 9 | for(int j=1;j<=n;j++) 10 | { 11 | if(i==n/2+1||j==n/2+1||(j>n/2&&j-n/2<=i&&i<=n/2)||(i>n/2&&j>n/2&&n-i+1>=j-n/2)) 12 | cout<<"* "; 13 | else cout<<" "; 14 | } 15 | cout< 2 | using namespace std; 3 | int main() 4 | { 5 | int n; 6 | cin>>n; 7 | for(int i=1;i<=n;i++) 8 | { 9 | for(int j=1;j<=n;j++) 10 | { 11 | if(i==1||i==n||(i==j)||i+j==n+1||(i>n/2&&(i>=j&&i+j>=n+1))) 12 | cout<<"* "; 13 | else cout<<" "; 14 | } 15 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin >> n; 7 | int p = 0, t = n; 8 | for (int i = 1; i <= n; i++) { 9 | for (int j = 1; j <= p; j++) { 10 | cout<<" "; 11 | } 12 | for (int j = 1; j <= t; j++){ 13 | cout<<"* "; 14 | } 15 | p++; 16 | t--; 17 | cout< 2 | using namespace std; 3 | int main() { 4 | 5 | int n,m; 6 | cin>>n>>m; 7 | int A[n][m]; 8 | for(int i=0;i>A[i][j]; 11 | for(int i=0;i 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | for(int i=0;i=n-1) 13 | cout<<"*\t"; 14 | else 15 | cout<<"\t"; 16 | } 17 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv) 5 | { 6 | int n; 7 | cin >> n; 8 | 9 | for(int i=0;i 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | long long n; 8 | int base,arr[15],i=0,num=0; 9 | cin>>n>>base; 10 | while(n) 11 | { 12 | arr[i++]=n%10; 13 | n/=10; 14 | } 15 | for(int j=0;j 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char **argv){ 6 | int n; 7 | cin >> n; 8 | //write your code here 9 | 10 | int i=0,j=1,dig; 11 | 12 | while (n>0){ 13 | dig = n % 10; 14 | n = n / 10; 15 | i += j * pow(10, dig - 1); 16 | j++; 17 | } 18 | 19 | cout << (i) << endl; 20 | } -------------------------------------------------------------------------------- /Android/pranjal-raj_PranjalRaj_2125CSE1043_2/GettingStarted/fibonacciTillN.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | 4 | public class fibonacciTillN { 5 | 6 | public static void main(String[] args) { 7 | Scanner scn = new Scanner(System.in); 8 | int n = scn.nextInt(); 9 | 10 | int a = 0; 11 | int b = 1; 12 | for (int i = 0; i < n; i++) { 13 | System.out.println(a); 14 | int c = a + b; 15 | a = b; 16 | b = c; 17 | } 18 | } 19 | } -------------------------------------------------------------------------------- /IOT/seriouslyanuj_AnujGupta_2125it1096_2/GettingStarted/reverseanumberofficial.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | 3 | public class Main{ 4 | 5 | public static void main(String[] args) { 6 | Scanner sc=new Scanner(System.in); 7 | int n=sc.nextInt(); 8 | while(n!=0) 9 | { 10 | int d=n%10; 11 | n = n / 10; 12 | System.out.println(d); 13 | } 14 | // write your code here 15 | } 16 | } -------------------------------------------------------------------------------- /IOT/tansin25_TanmaySingh_2125csit1072_2/Patterns/Pattern7.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | for(int i = 1; i <= n; i++) { 9 | for(int j = 1; j <= i; j++) { 10 | if(j != i) { 11 | cout<<("\t"); 12 | } 13 | else if(j == i){ 14 | cout<<("*"); 15 | } 16 | } 17 | cout<<("\n"); 18 | } 19 | 20 | return 0; 21 | } -------------------------------------------------------------------------------- /Web/Divyanshu-Vareshney_divyanshuvarshney_2125it1075_2/patterns/pattern4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | //write your code here 9 | for(int i=1;i<=n;i++){ 10 | for(int j=1;j<=i-1;j++){ 11 | cout<<"\t"; 12 | } 13 | for(int j=n;j>=i;j--){ 14 | cout<<"*"<<"\t"; 15 | } 16 | cout<<"\n"; 17 | } 18 | 19 | } -------------------------------------------------------------------------------- /Web/QMiNt_AdityaAgarwal_2125IT1163_2/Patterns/Pattern7.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | int main() 5 | { 6 | int n; 7 | cin>>n; 8 | for (int i = 1; i <= n; i++) 9 | { 10 | for (int j = 1; j <= n; j++) 11 | { 12 | if (i == j) 13 | printf("*\t"); 14 | else 15 | printf("\t"); 16 | } 17 | cout< 2 | #include 3 | using namespace std; 4 | int main() 5 | { 6 | int n; 7 | cin>>n; 8 | for (int i = 1; i <= n; i++) 9 | { 10 | for (int j = 1; j <= n; j++) 11 | { 12 | if (i+j==n+1) 13 | printf("*\t"); 14 | else 15 | printf("\t"); 16 | } 17 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin >> n; 7 | int number=1; 8 | int s=1; 9 | for(int i=1;i<=n;i++){ 10 | for(int j=1;j<=s;j++){ 11 | cout< 2 | using namespace std; 3 | int main() 4 | { 5 | int n; 6 | cin>>n; 7 | for(int i=1;i<=n;i++) 8 | { 9 | 10 | for(int j=1;j<=n;j++) 11 | { 12 | if(j==1||j==n||(i>n/2&&(i==j))||(i>n/2&&(i+j==n+1))) 13 | cout<<"* "; 14 | else cout<<" "; 15 | } 16 | cout< 2 | using namespace std; 3 | int digFreq(int n, int d) { 4 | //write your code here 5 | int c = 0, r; 6 | while(n != 0){ 7 | r = n%10; 8 | if(r == d){ 9 | c++; 10 | } 11 | n = n/10; 12 | } 13 | return c; 14 | } 15 | int main() { 16 | int n, d; 17 | cin >> n >> d; 18 | int res = digFreq(n, d); 19 | cout << res << endl; 20 | } -------------------------------------------------------------------------------- /AR-VR/ShahnawazDev_Shahnawaz_2025CSE1115_2/Patterns/pattern9.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | for(int i=0;ii; j--){ 11 | System.out.print("*\t"); 12 | } 13 | System.out.println(); 14 | 15 | } 16 | } 17 | } -------------------------------------------------------------------------------- /Android/Garima0812S_GarimaShukla_2125ec1114_2/GettingStarted/inverseofaNumber.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class Main{ 4 | 5 | public static void main(String[] args) { 6 | // write your code here 7 | Scanner sc=new Scanner(System.in); 8 | int n=sc.nextInt(); 9 | int i=0; 10 | int p=1; 11 | while(n>0) 12 | { 13 | int dig=n%10; 14 | n=n/10; 15 | i+=p*Math.pow(10,dig-1); 16 | p++; 17 | } 18 | System.out.println(i); 19 | } 20 | } -------------------------------------------------------------------------------- /Android/Garima0812S_GarimaShukla_2125ec1114_2/Pattern/pattern11.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class Pattern_11 { 4 | 5 | public static void main(String[] args) { 6 | int i; 7 | Scanner scn = new Scanner(System.in); 8 | int n = scn.nextInt(); 9 | int count=1; 10 | for(i=0;i 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char **argv){ 6 | int n; 7 | cin >> n; 8 | //write your code here 9 | 10 | int i=0,j=1,dig; 11 | 12 | while (n>0){ 13 | dig = n % 10; 14 | n = n / 10; 15 | i += j * pow(10, dig - 1); 16 | j++; 17 | } 18 | 19 | cout << (i) << endl; 20 | } -------------------------------------------------------------------------------- /IOT/Captain2234_Bhavishya_2125it1064_2/FunctionAndArrays/AnyBaseToDecimal.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | int AnyToDec(int n, int b) { 5 | int c=0,add=0; 6 | while(n!=0){ 7 | int rem=n%10; 8 | add=add+rem*pow(b,c); 9 | c++; 10 | n=n/10; 11 | } 12 | return add; 13 | } 14 | int main() { 15 | int n; 16 | int b; 17 | cin >> n; 18 | cin >> b; 19 | int res = AnyToDec(n, b); 20 | cout << res << endl; 21 | } -------------------------------------------------------------------------------- /ML/KeplerInCoding_ShreyaSharma_2125cse1170_2/Patterns/PatternType4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(int argc, char **argv){ 4 | int n; 5 | scanf("%d",&n); 6 | 7 | for(int i=0; i 2 | using namespace std; 3 | #define ll long long 4 | int main(int argc, char **argv){ 5 | int t; 6 | cin >> t; 7 | while(t--){ 8 | ll n; 9 | cin >> n; 10 | int prime = 0; 11 | for(ll i = 1; i <= n/2; i++)if(n%i == 0)prime ++; 12 | if(prime == 1)cout << "prime" << endl; 13 | else cout << "not prime" << endl; 14 | } 15 | 16 | } -------------------------------------------------------------------------------- /Web/Macabre908_AbhishekDubey_2125cse1175_2/GettingStarted/countDigits.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class countDigits { 4 | public static void main(String[] args) { 5 | Scanner sc = new Scanner(System.in); 6 | int n = sc.nextInt(); 7 | sc.close(); 8 | int count = 0; 9 | while(n != 0){ 10 | count++; 11 | n = n / 10; 12 | } 13 | 14 | System.out.println(count); 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /Web/Tushar-sahani_TusharSahani_2125cs1072_2/GettingStarted/ReverseANumber.java: -------------------------------------------------------------------------------- 1 | package coderspear; 2 | import java.util.*; 3 | public class Reverseanumber { 4 | public static void main(String[] args) { 5 | Scanner sc = new Scanner(System.in); 6 | int n = sc.nextInt(); 7 | while(n>0){ 8 | int x = n%10; 9 | System.out.println(x); 10 | n = n/10; 11 | } 12 | sc.close(); 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /AR-VR/ShahnawazDev_Shahnawaz_2025CSE1115_2/FunctionAndArrays/AnyBaseToDecimal.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | int AnyToDec(int n, int b) { 5 | int p=0,num=0; 6 | while(n) 7 | { 8 | num= num+(n%10)*pow(b,p); 9 | n/=10; 10 | p++; 11 | } 12 | return num; 13 | } 14 | int main() { 15 | int n; 16 | int b; 17 | cin >> n; 18 | cin >> b; 19 | int res = AnyToDec(n, b); 20 | cout << res << endl; 21 | } -------------------------------------------------------------------------------- /AR-VR/mrigyasahai_MrigyaSahai_2025it1094_2/Patterns/Pattern 4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | int i, j; 9 | for(i=0;i=i){ 12 | cout<<"*\t"; 13 | } 14 | else{ 15 | cout<<"\t"; 16 | } 17 | } 18 | cout<=1; i--){ 10 | for(int j=n-i; j>=1; j--){ 11 | System.out.print("\t"); 12 | } 13 | System.out.println("*"); 14 | } 15 | 16 | } 17 | } -------------------------------------------------------------------------------- /IOT/gurpreetk12_gurpreetkaur_2125cs1094_2/Gettingstarted/Grading system.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main(int argc, char**argv){ 4 | int marks; 5 | cin>>marks; 6 | if(marks>90) 7 | cout<<"excellent"; 8 | else if(marks>80&&marks<=90) 9 | cout<<"good"; 10 | else if(marks>70&&marks<=80) 11 | cout<<"fair"; 12 | else if(marks>60&&marks<=70) 13 | cout<<"expectations"; 14 | else 15 | cout<<"below par"; 16 | 17 | } -------------------------------------------------------------------------------- /IOT/gurpreetk12_gurpreetkaur_2125cs1094_2/Gettingstarted/Gradingsystem.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main(int argc, char**argv){ 4 | int marks; 5 | cin>>marks; 6 | if(marks>90) 7 | cout<<"excellent"; 8 | else if(marks>80&&marks<=90) 9 | cout<<"good"; 10 | else if(marks>70&&marks<=80) 11 | cout<<"fair"; 12 | else if(marks>60&&marks<=70) 13 | cout<<"expectations"; 14 | else 15 | cout<<"below par"; 16 | 17 | } -------------------------------------------------------------------------------- /IOT/tansin25_TanmaySingh_2125csit1072_2/GettingStarted/PrintAllPrimesTillN.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main(int argc, char **argv){ 4 | int low, high,i,j,c; 5 | cin >> low >> high; 6 | for(i=low;i<=high;i++) 7 | { 8 | if(i==1||i==0) 9 | continue; 10 | c=1; 11 | for(j=2;j<=i/2;j++) 12 | { 13 | if(i%j==0) 14 | { 15 | c=0; 16 | break; 17 | } 18 | } 19 | if(c==1) 20 | cout< 2 | using namespace std; 3 | int power(int n,int i) 4 | { 5 | int t=1; 6 | while(i--) 7 | { 8 | t*=n; 9 | } 10 | return t; 11 | } 12 | int main() 13 | { 14 | int m,n,c=0; 15 | cin>>n; 16 | m=n; 17 | while(m!=0) 18 | { 19 | m=m/10; 20 | c++; 21 | } 22 | int j; 23 | while(--c) 24 | { 25 | j=power(10,c); 26 | cout< 2 | using namespace std; 3 | int digFreq(int n, int d) { 4 | //write your code here 5 | int c=0; 6 | while(n>0){ 7 | int number=n%10; 8 | if(number==d){ 9 | c++; 10 | } 11 | n=n/10; 12 | } 13 | return c; 14 | } 15 | int main() { 16 | int n, d; 17 | cin >> n >> d; 18 | int res = digFreq(n, d); 19 | cout << res << endl; 20 | } -------------------------------------------------------------------------------- /Web/kashish12_kashishalikhan_2125cse1133_02/FunctionAndArrays/decimaltoanybase.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int DecToAny(int n, int b){ 4 | int r = 0, m = 1, p; 5 | while(n != 0){ 6 | p = n % b; 7 | r = r + p * m; 8 | n = n / b; 9 | m *= 10; 10 | } 11 | return r; 12 | } 13 | int main() { 14 | int n; 15 | int b; 16 | cin >> n; 17 | cin >> b; 18 | int res = DecToAny(n, b); 19 | cout << res << endl; 20 | } -------------------------------------------------------------------------------- /Web/riyasinghsirohi_Riyasinghsirohi_2125en1103_2/Patterns/Pattern3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | int sp=n-1,st=1; 8 | 9 | for(int i=1;i<=n;i++) 10 | { 11 | for(int j=1;j<=sp;j++) 12 | { 13 | cout<<"\t"; 14 | } 15 | for(int j=1;j<=st;j++) 16 | { 17 | cout<<"*\t"; 18 | } 19 | sp--; 20 | st++; 21 | cout<<"\n"; 22 | } 23 | 24 | } -------------------------------------------------------------------------------- /AR-VR/mrigyasahai_MrigyaSahai_2025it1094_2/Patterns/Pattern 7.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | int i, j; 9 | int a1=0,a2=1; 10 | for(i=1;i<=n;i++){ 11 | for(j=1;j<=a1;j++){ 12 | cout<<"\t"; 13 | } 14 | for(j=1;j<=a2;j++){ 15 | cout<<"*\t"; 16 | } 17 | a1++; 18 | cout<0){ 10 | d++; 11 | n/=10; 12 | } 13 | System.out.println(d); 14 | } 15 | } -------------------------------------------------------------------------------- /Android/khushi1502_KhushiSachdev_2125cse1077_2/GettingStarted/Primefactorisation.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main(int argc, char **argv){ 4 | int n; 5 | cin >> n; 6 | 7 | //write your code here 8 | for(int div=2 ; div*div<=n ; div++) 9 | { 10 | while ( n % div == 0) 11 | { 12 | n=n/div; 13 | cout<<(div)<<" "; 14 | } 15 | } 16 | if(n!=1){ 17 | cout<<(n); 18 | } 19 | 20 | } -------------------------------------------------------------------------------- /IOT/Nivedita-R_NiveditaRai_2125it1079_2/GettingStarted/PrintAllPrimesTillN.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | int main(int argc, char **argv){ 5 | int low, high, i,j,c=0; 6 | cin >> low >> high; 7 | for(i=low;i<=high;i++) 8 | {c=0; 9 | for(j=2;j<=sqrt(i);j++) 10 | { 11 | if(i%j==0) 12 | c++; 13 | } 14 | if(c==0) 15 | cout< 2 | using namespace std; 3 | int fibo(int n); 4 | 5 | int main(int argc, char **argv) 6 | { 7 | int n; 8 | cin >> n; 9 | for(int i=0;i 2 | using namespace std; 3 | int main(int argc, char**argv){ 4 | int marks; 5 | cin>>marks; 6 | 7 | if(marks > 90)cout << "excellent"; 8 | else if(marks > 80 && marks <= 90)cout << "good"; 9 | else if(marks > 70 && marks <= 80)cout << "fair"; 10 | else if(marks > 60 && marks <= 70)cout << "meets expectation"; 11 | else cout << "below par"; 12 | 13 | 14 | } -------------------------------------------------------------------------------- /Web/Divyanshu-Vareshney_divyanshuvarshney_2125it1075_2/GettingStarted/Gcd And Lcm.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main(int argc, char **argv){ 4 | int num1, num2; 5 | cin >> num1 >> num2; 6 | 7 | //write your code here 8 | int t1=num1,t2=num2,rem,gcd,lcm; 9 | while(num1%num2!=0){ 10 | rem=num1%num2; 11 | num1=num2; 12 | num2=rem; 13 | } 14 | gcd=num2; 15 | lcm=(t1*t2/gcd); 16 | cout< 2 | using namespace std; 3 | int main() 4 | { 5 | int n; 6 | n=5; 7 | for(int i=0;i 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int n; 7 | cin>>n; 8 | for(int i=0; i0) { 10 | d++; 11 | n=n/10; 12 | } 13 | System.out.println(d); 14 | sc.close(); 15 | } 16 | } -------------------------------------------------------------------------------- /Web/riyasinghsirohi_Riyasinghsirohi_2125en1103_2/FunctionAndArrays/DigitFrequency.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int digFreq(int n, int d) { 4 | int counter = 0; 5 | 6 | while (n > 0) 7 | { 8 | int temp = n % 10; 9 | n = n / 10; 10 | if (temp == d) 11 | counter++; 12 | } 13 | return counter; 14 | } 15 | int main() { 16 | int n, d; 17 | cin >> n >> d; 18 | int res = digFreq(n, d); 19 | cout << res << endl; 20 | } -------------------------------------------------------------------------------- /AR-VR/Nandini-Maheshwari_NandiniMaheshwari_2125CSE1037_2/Patterns/Pattern4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | //write your code here 9 | 10 | for(int i = n; i>0; i--){ 11 | for(int k = n-i; k>0; k--){ 12 | cout << "\t"; 13 | } 14 | for(int j = i; j>0; j--){ 15 | cout << "*\t"; 16 | } 17 | cout << endl; 18 | } 19 | } -------------------------------------------------------------------------------- /Android/Garima0812S_GarimaShukla_2125ec1114_2/FunctionAndArrays/FindElementInAnArray.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | 5 | int main(){ 6 | int n; 7 | cin>>n; 8 | int a[n],i,d,found=0; 9 | for(i=0;i>a[i]; 11 | cin>>d; 12 | for(i=0;i 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char **argv) 6 | { 7 | int n; 8 | cin >> n; 9 | for(int i=1;i<=n;i++){ 10 | for(int j=1;j<=n-i+1;j++){ 11 | if(j==n-i+1) 12 | cout<<"*"; 13 | else cout<<" "; 14 | } 15 | cout<<"\n"; 16 | } 17 | //write your code here 18 | return 0; 19 | } -------------------------------------------------------------------------------- /Android/khushi1502_KhushiSachdev_2125cse1077_2/GettingStarted/PrintAllPrimesTillN.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main() { 4 | int low, high; 5 | cin>>low>>high; 6 | 7 | for (int n = low; n <= high; n++) { 8 | int count = 0; 9 | for (int div = 2; div * div <= n; div++) { 10 | if (n % div == 0) { 11 | count++; 12 | break; 13 | } 14 | } 15 | 16 | if (count == 0) { 17 | cout< 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int n1, n2, i; 7 | int gcd = 1, lcm = 1; 8 | 9 | 10 | cin >> n1 >> n2; 11 | for ( i = 1; i < 1000; i++) 12 | { if ((n1 % i == 0) && (n2 % i == 0)) 13 | { 14 | gcd = i; 15 | } 16 | } 17 | 18 | lcm = (n1 * n2) / gcd; 19 | cout << gcd << endl << lcm < 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | for (int i = 1; i <= n; i++){ 9 | for (int j = 1; j <= n; j++){ 10 | if ((i == j) || (i + j == n + 1)){ 11 | cout << ("*\t"); 12 | }else{ 13 | cout << ("\t"); 14 | } 15 | } 16 | cout << endl; 17 | } 18 | } -------------------------------------------------------------------------------- /ML/KeplerInCoding_ShreyaSharma_2125cse1170_2/FunctionAndArrays/DigitFrequency.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n, d; 5 | scanf("%d%d", &n, &d); 6 | int a[10]; 7 | int count=0; 8 | while(n) 9 | { 10 | a[count]=n%10; 11 | n=n/10; 12 | count++; 13 | } 14 | int flag=0; 15 | for(int i=0; i 2 | #include 3 | 4 | int main() 5 | { 6 | int n; 7 | scanf("%d",&n); 8 | for(int i=0; i 2 | using namespace std; 3 | int main() 4 | { 5 | int n,i,j; 6 | cin>>n; 7 | for(i=1;i<=n;i++) 8 | { 9 | for(j=1;j<=n;j++) 10 | { 11 | if((i==1&&j<=n/2+1)||(i==n&&j>n/2)||(j==1&&i>n/2)||(j==n&&i<=n/2+1)||j==n/2+1||i==n/2+1) 12 | cout<<"* "; 13 | else 14 | cout<<" "; 15 | } 16 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin >> n; 7 | for(int i = 1;i <= n; i++){ 8 | for(int j = 1; j<= n; j++){ 9 | if(i == j || i + j == n + 1) 10 | { 11 | cout<<"*\t"; 12 | } 13 | else{ 14 | cout<<"\t"; 15 | } 16 | } 17 | cout< 2 | using namespace std; 3 | 4 | int main(int argc, char **argv) 5 | { 6 | int n; 7 | cin >> n; 8 | 9 | //write your code here 10 | 11 | int f[n] = {0}; 12 | f[0] = 0; 13 | f[1] = 1; 14 | cout << f[0] << endl << f[1] << endl; 15 | for(int i = 2; i 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | //write your code here 9 | 10 | for(int i = n; i>0; i--){ 11 | for(int j = i-1; j>0; j--){ 12 | cout << "\t"; 13 | } 14 | for(int k = n-i+1; k>0; k--){ 15 | cout << "*\t"; 16 | } 17 | cout << "\n"; 18 | } 19 | } -------------------------------------------------------------------------------- /AR-VR/mrigyasahai_MrigyaSahai_2025it1094_2/FunctionAndArrays/Digit Frequency.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int digFreq(int n, int d) { 4 | int temp = n; 5 | int r, count = 0; 6 | while(n!=0) 7 | { 8 | r = n % 10; 9 | if(r == d) 10 | { 11 | count++; 12 | } 13 | n = n / 10; 14 | } 15 | return count; 16 | } 17 | int main() { 18 | int n, d; 19 | cin >> n >> d; 20 | int res = digFreq(n, d); 21 | cout << res << endl; 22 | } 23 | -------------------------------------------------------------------------------- /AR-VR/mrigyasahai_MrigyaSahai_2025it1094_2/Patterns/Pattern 9.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | int i, j; 9 | for(i=1;i<=n;i++){ 10 | for(j=1;j<=n;j++){ 11 | if(i==j||i+j==n+1){ 12 | cout<<"*\t"; 13 | } 14 | else{ 15 | cout<<"\t"; 16 | } 17 | } 18 | cout<=1; i--){ 10 | for(int j=1; j<=i; j++){ 11 | System.out.print("*\t"); 12 | } 13 | System.out.println(""); 14 | } 15 | 16 | 17 | } 18 | } -------------------------------------------------------------------------------- /Android/decode08_SnehaAggarwal_2125it1071_2/Patterns/pattern8.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class Main { 4 | 5 | public static void main(String[] args) { 6 | Scanner scn = new Scanner(System.in); 7 | int n=scn.nextInt(); 8 | 9 | for(int i=n; i>=1; i--){ 10 | 11 | for(int j=1; j<=i-1; j++){ 12 | System.out.print("\t"); 13 | } 14 | System.out.println("*"); 15 | } 16 | 17 | } 18 | } -------------------------------------------------------------------------------- /Web/kashish12_kashishalikhan_2125cse1133_02/GettingStarted/gcdandlcm.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main(){ 4 | int num1, num2; 5 | cin >> num1 >> num2; 6 | int t1,t2,gcd,lcm; 7 | t1=num1; 8 | t2=num2; 9 | while (num1 % num2 != 0) 10 | { 11 | int remainder = num1 % num2; 12 | num1 = num2; 13 | num2 = remainder; 14 | } 15 | gcd = num2; 16 | lcm = (t1 * t2) / gcd; 17 | cout< 2 | using namespace std; 3 | int main(int argc, char**argv){ 4 | int n; 5 | cin >> n; 6 | 7 | for(int i=0;in/2)||(i+j==n-1&&j<=n/2)) 12 | cout<<"*\t"; 13 | else 14 | cout<<"\t"; 15 | } 16 | cout< 2 | using namespace std; 3 | 4 | 5 | int main(int argc, char **argv){ 6 | int n; 7 | cin >> n; 8 | 9 | int i, j; 10 | for(i=n-1;i>=0;i--){ 11 | for(j=0;j=i){ 13 | cout<<"*\t"; 14 | } 15 | else{ 16 | cout<<"\t"; 17 | } 18 | } 19 | cout<0) 11 | { 12 | c=n%10; 13 | System.out.println(c); 14 | n=n/10; 15 | } 16 | 17 | } 18 | } -------------------------------------------------------------------------------- /Android/Harshitmishra1106_Harshitmishra_2125cs1158_2/GettingStarted/GradingSystem.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main(){ 4 | int marks; 5 | cin>>marks; 6 | if(marks>90) 7 | cout<<"excellent"; 8 | else if(marks>80&&marks<=90) 9 | cout<<"good"; 10 | else if(marks>70&&marks<=80) 11 | cout<<"fair"; 12 | else if(marks>60&&marks<=70) 13 | cout<<"meets expectations"; 14 | else if(marks<=60) 15 | cout<<"below par"; 16 | return 0; 17 | } -------------------------------------------------------------------------------- /Android/aryanmishra29_AryanMishra_2125csme1029_2/GettingStarted/Inverse_Of_A_Number.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | public class Inverse_Of_A_Number { 3 | 4 | public static void main(String[] args) { 5 | Scanner sc = new Scanner(System.in); 6 | int n=sc.nextInt(); 7 | int m=0; 8 | int x=1; 9 | while(n>0){ 10 | int temp=n%10; 11 | n=n/10; 12 | m+=x*Math.pow(10,temp-1); 13 | x++; 14 | } 15 | System.out.println(m); 16 | } 17 | 18 | } 19 | 20 | -------------------------------------------------------------------------------- /IOT/Captain2234_Bhavishya_2125it1064_2/FunctionAndArrays/FindElementInAnArray.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | 5 | int main(){ 6 | int n; 7 | cin>>n; 8 | int a[n],index=-1; 9 | for(int i=0;i>a[i]; 11 | } 12 | int d; 13 | cin>>d; 14 | for(int i=0;i 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | int i,j,k,l; 9 | for ( i=0; i 2 | using namespace std; 3 | int main(int argc, char **argv){ 4 | int num1, num2; 5 | cin >> num1 >> num2; 6 | int low,k=0; 7 | if(num1>num2) 8 | low=num2; 9 | else 10 | low=num1; 11 | int gcd[low/2]; 12 | for(int i=1;i<=low;i++){ 13 | if(num1%i==0 && num2%i==0){ 14 | gcd[k]=i; 15 | k++; 16 | } 17 | } 18 | cout< 2 | using namespace std; 3 | int main(int argc, char **argv){ 4 | int t,n; 5 | cin >> t; 6 | for (int i = 0; i < t; i++){ 7 | cin >> n; 8 | int c = 2; 9 | while (c*c <= n){ 10 | if (n%c == 0) 11 | break; 12 | c++; 13 | } 14 | if (c * c > n){ 15 | cout << "prime" << endl; 16 | } 17 | else{ 18 | cout << "not prime" << endl; 19 | } 20 | } 21 | } -------------------------------------------------------------------------------- /Web/Divyanshu-Vareshney_divyanshuvarshney_2125it1075_2/patterns/pattern3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char **argv){ 5 | int n; 6 | cin >> n; 7 | 8 | //write your code here 9 | int i,j,k; 10 | for(i=1;i<=n;i++){ 11 | for(j=i+1;j<=n;j++){ 12 | cout<<"\t"; 13 | } 14 | for(k=1;k<=i;k++){ 15 | cout<<"*"<<"\t"; 16 | } 17 | cout<<"\n"; 18 | 19 | } 20 | 21 | } -------------------------------------------------------------------------------- /Web/ShreyashSriv_ShreyashSrivastava_2125csme1051_2/GettingStarted/IsANumberPrime.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(){ 5 | int t; 6 | cin>>t; 7 | while(t--){ 8 | int n,count=0; 9 | cin>>n; 10 | for(int i=1;i<=n/2;i++){ 11 | if(n%i==0) count++; 12 | else continue; 13 | } 14 | if(count>1) cout<<"not prime"<