Problem link: 1178 - Trapezium
Explanation: math-only-math.com
Code:
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
...
Showing posts with label LightOJ. Show all posts
Showing posts with label LightOJ. Show all posts
1118 - Incredible Molecules
Problem link: 1118 - Incredible Molecules
Topic: Geometry
Resources:
Robert Eisele
Matrix.Code
Code:
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals...
Pick’s Theorem
Problem link: 1418 - Trees on My Island / (UVA – 10088)
topic: picks theorem
Implementation:
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode...
1112 - Curious Robin Hood
1112 - Curious Robin Hood
Topic: BIT
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional...
1049 - One Way Roads
1049 - One Way Roads
Topic: DFS
concept: কস্টকে ডিরেক্টটেড ধরবো তারপর আনডিক্টটেড গ্রাফ এ ডিএফএস চালাবো.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals...
1263 - Equalizing Money
1263 - Equalizing Money
Topic: BFS
Concept: সব গুলা কম্পোনেন্ট এ চেক করবো সমান পরিমান টাকা আছে কিনা।
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden...
1002 - Country Roads
1002 - Country Roads
Topic: dijkstra
solution 01:
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about...
1005 - Rooks
1005 - Rooks
Topic: combinatorics + Binomial Coefficient
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn...
1067 - Combinations
1067 - Combinations
Topic: Counting.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode...
1387 - Setu
1387 - Setu
solution :
//copy
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
#include<bits/stdc++.h>
using namespace std;
int main()
{
// freopen("in.txt", "r", stdin);
int T;
cin >> T;
for(int cs = 1; cs <= T; ++cs){
long long ans = 0;
int n;
...
1225 - Palindromic Numbers (II)
1225 - Palindromic Numbers (II)
Solution:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll Max = 100005;
void palindrome(ll n, int cs)
{
ll test = n;
ll ans = 0;
while(n)
...
1202 - Bishops
1202 - Bishops
#include<bits/stdc++.h>using namespace std;#define MAX 2000100typedef long long ll;int main(){ #ifndef ONLINE_JUDGE freopen("in.txt", "r", stdin); freopen("out.txt", "w", stdout); #endif //double start_time = clock(); int T; ...
1014 - Ifter Party
1014 - Ifter Party
Topic: Divisor
Code:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
set<int>V;
int main()
{
//double start_time = clock();
#ifndef ONLINE_JUDGE
...
1182 - Parity
1182 - Parity
//copy
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
for(int cs = 1; cs <= t; cs++){
int x;
cin >> x;
...
1133 - Array Simulation
1133 - Array Simulation
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//map<int , int>M;
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
int t;
...
1116 - Ekka Dokka
1116 - Ekka Dokka
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
for(int cs = 1; cs <= t; cs++){
long long w;
cin >> w;
if(w&1){
...
1113 - Discover the Web
1113 - Discover the Web
Solution:
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
for(int cs = 1; cs <= t; cs++)
{
stack<string>f,b,st;
string s;
cout...
1109 - False Ordering
1109 - False Ordering
Solution 01:
#include<bits/stdc++.h>
using namespace std;
void Sieve(int n, bool prime[], bool primesqure[], int a[])
{
for(int i = 2; i <= n; i++)
prime[i] = true;
for(int i = 0; i <= (n*n + 1); i++)
primesqure[i] =...