Beecrowd solution-1

Beecrowd Solution/URI Solution

Online Judge (BOJ) is a platform for programming contests and challenges. Here are some good things about BOJ:

1. Large community: BOJ has a large community of programmers and enthusiasts who participate in challenges and competitions, providing opportunities for learning and collaboration.
2. Variety of programming languages: BOJ supports a wide range of programming languages, including popular ones like C++, Java, Python, and more.
3. Detailed feedback: BOJ provides detailed feedback on submissions, including runtime and memory usage, as well as error messages, helping users to learn and improve their programming skills.
4. Customizable settings: BOJ allows users to customize their settings, including language preferences and compiler options, making it a flexible platform for individual needs.

URI 1161-Factorial Solution with CPP

#include<iostream>
using namespace std;
int main() {
long long int m,n,f=1,f1=1;
while(cin>>m>>n){
for(int i=1;i<=m;i++)
{
f=f*i; } for(int j=1;j<=n;j++) { f1=f1*j;//
}
long long int sum=f+f1;
cout<<sum<<endl;
f=f1=1;
}
return 0;
cout<<endl;
}

1177-Array Fill II solution with c//Beecrowd solution

#include<stdio.h>

int main() {

int a[1000],i,j,n;
scanf("%d",&n);
for(i=0,j=0;i<1000;i++){

    printf("N[%d] = %d\n",i,j);
    j++;
   if(n==j) j=0;
    }

return 0;

}

Beecrowd solution//URI New Solution:

BEECROWD 1176 – Fibonacci Array solution

Learn how to solve BEECROWD 1074 Even or Odd Solution in C,C++,Python

Beecrowd 1026 To Carry or not to Carry Solution

URI Beecrowd 1116 Dividing X by Y Solution

URI Bee Crowd 1095 How to Solve the Sequence IJ-1 Problem

Beecrowd 1178 Array Fill III Solution 

Beecrowd 1113 Ascending and Descending Solution

Beecrowd 1161 Factorial Sum Solution

Beecrowd 1177 Array Fill II solution

Beecrowd 1176 Fibonacci Array Solution

Beecrowd 1073 Even Square Problems Solution

in C++, C, and Python

Beecrowd 1071 Sum of Consecutive Odd Numbers I Solution

Beecrowd 1070 Six Odd Numbers Solution

Beecrowd 1175 – Array change I Solution

Beecrowd 1174 – Array Selection I Solution in C/Cpp

Beecrowd 1173 – Array fill I solution in C/CPP

Beecrowd 1172 – Array Replacement I solution in C/Cpp

Beecrowd 1099 – Sum of Consecutive Odd Numbers II solution in C/Cpp

Beecrowd 1159 – Sum of Consecutive Even Numbers solution in C/CPP

Beecrowd 1094 – Experiments solution in C/CPP

Beecrowd 1048 – Salary Increase solution in C/CPP

Beecrowd -1044 Multiples Solution in C & C++

Beecrowd-1043-triangle-solution

Beecrowd -1042 Simple Sort Solution 

Beecrowd1041 – Coordinates of a Point Solution

Beecrowd 1016 -Distance solution

Beecrowd 1015-Distance Between Two Points solution

BEECROWD 1014 – Consumption Solution

Beecrowd 1013- The Greatest solution

Beecrowd 1012-Area solution

BEECROWD 1002 – Area of a Circle solution

Beecrowd1009 – Salary with Bonus solution

URI online judge solution1011 Sphere solution

Codeforces problem solution