@PPAP_1264589

MMOD29 - CHY

February 24, 2021 · C++
#include <bits/stdc++.h>
using namespace std;
void setFile(){
    ios_base::sync_with_stdio(false);
    cin.tie();
    cout.tie();
    freopen ("MMOD29.inp", "r", stdin);
    freopen ("MMOD29.out", "w", stdout);
}

long long expone(long long a, long long b){

NHAPMON - BAI61

February 19, 2021 · C++
#include <bits/stdc++.h>
using namespace std;

void setFile(){
    ios_base::sync_with_stdio(false);
    cin.tie();
    cout.tie();
    freopen ("inp.txt", "r", stdin);
    freopen ("out.txt", "w", stdout);
}
int main (){

NHAPMON - BAI59

February 19, 2021 · C++
#include <bits/stdc++.h>
using namespace std;

string s;
unsigned int n;

void setFile(){
    ios_base::sync_with_stdio(false);
    cin.tie();
    cout.tie();
    freopen ("inp.txt", "r", stdin);

NHAPMON - BAI67

February 08, 2021 · C++
#include <bits/stdc++.h>
using namespace std;

bool b[1000000001];
int n;
int a[1001];

void setFile(){
    ios_base::sync_with_stdio(false);
    cin.tie();
    cout.tie();

NHAPMON - BAI42

February 06, 2021 · C++
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
pair<int,int> a[7];

int main (){
    ios_base::sync_with_stdio(false);
    cin.tie();
    cout.tie();
    freopen ("inp.txt", "r", stdin);

NHAPMON - BAI11

updated February 01, 2021 · C++
#include <bits/stdc++.h>
using namespace std;
int n;
int a[101][101];
int u,v;
int h[10001];

void Print (){
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= n; j++){
            cout << a[i][j] << " ";

NHAPMON - BAI26

January 29, 2021 · C++
#include <bits/stdc++.h>
using namespace std;

int n;
int a[101], b[101];
int ck[4][4];
string s = "XTD";

int main (){
    freopen ("inp.txt", "r", stdin);
    freopen ("out.txt", "w", stdout);

NHAPMON - BAI17

January 29, 2021 · C++
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;

int n;
pair<int, int> a[1001];

bool comp (pair<int, int> x, pair<int, int> y){
    if (x.s < y.s) return true;
    return false;

NHAPMON - BAI08

January 29, 2021 · C++
#include <bits/stdc++.h>
using namespace std;
int n;
int a[101];
int main (){
    freopen ("inp.txt", "r", stdin);
    freopen ("out.txt", "w", stdout);
    cin >> n;
    for (int i = 1; i <= n; i++){
        cin >> a[i];
    }

NHAPMON - BAI25

January 29, 2021 · C++
#include <bits/stdc++.h>
using namespace std;

int n,p,q,r;
long long LCM (long long x, long long y){
    return (x/__gcd(x,y)*y);
}

long long cal (int x, int y){
    return (n/LCM(x,y));
}

NHAPMON - BAI18

January 25, 2021 · C++
#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i = a; i <= (b); i++)
using namespace std;

struct pos{
    int x1, x2, y1, y2;
    void In(){
        cin >> x1 >> y1 >> x2 >> y2;
    }
};

NHAPMON - BAI20

January 25, 2021 · C++
#include <bits/stdc++.h>

int n;
int x[101];
int y[101];
int r[101];

double sqr (int x){
    return x*x;
}

NHAPMON - BAI10

January 25, 2021 · C++
#include <bits/stdc++.h>
using namespace std;

int n;
bool p[1001];
int b[101];
int a[101];

int main()
{
    freopen ("inp.txt", "r", stdin);

NHAPMON - BAI16

January 25, 2021 · C++
#include <bits/stdc++.h>
using namespace std;

int a[1001];
int s[1001];
int n;

bool check (int d, int c){
    int last = a[c] + a[c-1] + a[c-2];
    int other = s[c] - last - s[d-1];
    if (last < other) return true;

LAZY

January 24, 2021 · C++
#include <bits/stdc++.h>
using namespace std;

int n,k;
pair<int, int> a[100001];
int ans = -1;
int get;

bool custom (const pair<int, int> &p, const pair<int, int> &q){
	if (p.first < q.first) return true;
	return false;

BINARY SEARCH - ZXY

January 24, 2021 · C++
#include <bits/stdc++.h>
using namespace std;
int n,k;
vector<int> a;

bool check (int m){
	int box = 0;
	int cnt = 1;
	for (int i = 0; i < a.size(); i++){
		box += a[i];
		if (box > m){

NHAPMON - BAI15

updated January 25, 2021 · C++
#include <bits/stdc++.h>
using namespace std;
int n,m;
bool check(int a[101][101], int i, int j){
    int t = 0;
    for (int k = i-1; k >= 1; k--){
        if (a[k][j] > a[i][j]) {
            t++;
            break;
        }
    }

NHAPMON - BAI07

January 21, 2021 · C++
#include <bits/stdc++.h>
using namespace std;

int n, a[1005], inteval;
void Input (){
    cin >> n;
    for (int i = 1; i <= n; i++){
        cin >> a[i];
        a[i] = a[i] + a[i-1];
    }
}

NHAPMON - BAI06

January 21, 2021 · C++
#include <bits/stdc++.h>
using namespace std;
int main()
{
    freopen ("inp.txt", "r", stdin);
    freopen ("out.txt", "w", stdout);
    int n,s,k;
    cin >> n >> s >> k;
    vector<int> p;
    p.push_back(0);
    for (int i = 1; i <= n; i++){

NHAPMON - BAI02

January 18, 2021 · C++
#include <bits/stdc++.h>
using namespace std;
short n;
int a[10001];
int main()
{
    freopen ("inp.txt", "r", stdin);
    freopen ("out.txt", "w", stdout);
    cin >> n;
    for (int i = 1; i <= n; i++){
        cin >> a[i];