code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <stdio.h>
#include <math.h>
int main()
{
double x1, x2, x3, y1, y2, y3, xp, yp;
double s, s1, s2, s3;
while(scanf("%lf %lf %lf %lf %lf %lf %lf %lf",&x1,&y1,&x2,&y2,&x3,&y3,&xp,&yp) != EOF){
s = ((x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1)) / 2.0;
s1 = ((xp - x1) * (y2 - y1) - (y... | #include <stdio.h>
int main(void)
{
int n, x ;
int karigoukei ;
int i, j, k, h ;
while(1){
h = 0;
scanf("%d %d\n", &n, &x);
if(n == 0 && x == 0 ){
break;
} else {
for(i = 1 ; i <= (n-2); i++ ){
for(j= (i+1) ; j <= (n-1) ; j++ ){
for(k = (j+1) ; k <= (n) ; k++ ){
karigoukei = i +... | 0 | 98,789,137 |
#include <stdio.h>
double cr(double x1, double y1, double x2, double y2) {
return x1*y2-x2*y1;
}
int main()
{
for(;;) {
double x[4], y[4];
if (scanf("%lf %lf %lf %lf %lf %lf %lf %lf",
x, y, x+1, y+1, x+2, y+2, x+3, y+3)==EOF) {
return 0;
}
else {
double cr1 = cr(x[3]-x[0], y[3]-y[0], x[3]-x[1], y[3... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
using Graph = vector<vector<ll>>;
ll inf=300000000000000000;
const double PI = 3.14159... | 0 | 57,814,160 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m,a,b;
int h[100010];
vector<int > v[100010];
cin >> n >> m;
for(int i = 1; i <= n; i++){
cin >> h[i];
}
for(int i = 0; i < m; i++){
cin >> a >> b;
v[a].push_back(b);
v[b].push_back(a);
}
int cnt = 0;
for(int i = 1; i <= n; i++){
if(v[i... | #include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9+7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE cout << ((n) ? "POSSIBLE\n"... | 0 | 16,851,617 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+5;
int n,f[N],si[N];
struct node
{
ll x;
int id;
bool operator<(const node&o)const
{
return x<o.x;
}
}a[N];
unordered_map<ll,int>mp;
vector<pair<int,int> >v;
int tot,fa[N],head[N],nex[N<<1],to[N<<1];
void add(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 0 | 79,559,184 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
#define all(obj) (obj).begin(), (obj).end()
static const int dx[4] = {0, 1, 0, -1};
static const int dy[4] = {1, 0, -1, 0};
static const char dir[4] = {'u', 'r', 'd', 'l'};
static... | #include <bits/stdc++.h>
#include<chrono>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int N, P;
cin >> N >> P;
vector<ll> ans0(N);
vector<ll> ans1(N);
rep(i, N) {
int A... | 0 | 52,008,686 |
#include <iostream>
#define rep(S, L) for (int i = S; i < L; ++i)
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = a * b - (a + b - 1);
cout << ans << endl;
return 0;
} | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vect... | 0 | 100,645,211 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
struct edge{
int to,weight;
edge(int to,int weight):to(to),weight(weight){}
};
using Graph = vector<vector<int>> ;
using GraphEdge = vector<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | 0 | 39,833,026 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#define MOD 1000000007
typedef long long ll;
using namespace std;
pair<ll,ll> dp[300030];
int main(){
int n;
cin>>n;
int m=pow(2,n);
ll A[m+1]={};
for... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
const int N = 100;
int merg(int x,int y);
int Find(int x);
int a[N][N];
const int inf = 0x3f3f3f3f;
int main()
{
int n;
while(scanf("%d", &n),n!=0)
{
for(int i=0;i<=15;i++)
{
... | 0 | 37,951,985 |
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#include <iostream>
using namespace std;
int main() {
int a[3];
int swp;
cin >> a[0] >> a[1] >> a[2];
if (a[0] > a[1]) {
... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#include <string>
int main(){
int s;cin >> s;
int arr[1000000];
int ex;
int cnt = 0;
bool isEnd = false;
for(int i=1;i<=1000000;i++){
if(i==1){
ex = s;
}else if(ex%2==0){
ex = ex/2;
}e... | 0 | 14,759,256 |
#include<cstdio>
int ans[1024];
int w,h,k;
bool b[22][22];
int d(int,int);
int main(void){
int i,j;
char c[20][20];
int p,q;
k =0;
while(true){
scanf("%d%d",&w,&h);
if(w==0 && h==0)break;
for(i=0;i<h;i++){
scanf("%s",c[i]);
}
for(i=0;i<h;i++){
for(j=0;j<w;j++){
if(c[i][j... | #include <iostream>
#define N_MAX 200000
using namespace std;
int main(){
int N;
int diff_max = 0;
int min_b = 1000000001;
int diff_max_index;
long sum = 0;
int A[N_MAX], B[N_MAX];
cin >> N;
for(int i = 0; i < N; i++){
cin >> A[i] >> B[i];
sum += A[i];
}
for(int i... | 0 | 77,959,980 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstdio>
#include <stack>
#include <queue>
#include <list>
#include <numeric>
#include <fstream>
#include <cassert>
using namespace std;
#define TEST
#ifdef TEST
#define dout... | 0 | 79,307,207 |
#include <bits/stdc++.h>
#define ll long long
#define pb(x) push_back((x))
#define line() cerr << "DEBUG @" << __LINE__ << endl;
#define debug(x) \
cerr << "DEBUG @" << __LINE__ << " -> " << #x << " = " << x << endl;
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s, t;... | #include<iostream>
#include<vector>
#include<algorithm>
#define REP(i,n) for(int i=0;i<(n);i++)
using namespace std;
char field[20][20];
int w, h;
int cnt = 0;
int dfs(int x, int y){
field[x][y] = '#';
cnt++;
for(int dx=-1; dx<=1; dx++){
for(int dy=-1; dy<=1; dy++){
if(dx!=0 && dy!=0) co... | 0 | 36,174,600 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int x;
cin >> x;
if (x < 100) {
cout << 0 << '\n';
return 0;
}
int cnt = x / 100;
cout << (x % 100 <= 5 * cnt) << '\n';
} | #include <iostream>
#include <vector>
#include <array>
#include <algorithm>
namespace
{
static std::array<int, 1000001> ng_nums = {};
static std::array<int, 1000001> num_count = {};
}
namespace ABC170
{
class D
{
public:
D() = default;
~D() = default;
void Run()
{
int N;
std::cin >... | 0 | 7,850,802 |
#include <iostream>
#include <vector>
#include <utility>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <string.h>
#include <deque>
#define REP(i,j,n) for(int i=j;i<n;i++)
#define SORT(x) sort(x.begin(),x.end())
using namespace std;
int main() {
int n,a=100000;
cin >> n;
REP(i, 0... | #include <iostream>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <time.h>
#include <stdlib.h>
#include <string>
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <sstream>
#include <stack>
#include <iomanip>
using namespace std;
#define... | 0 | 19,604,303 |
#include <iostream>
#include <string>
#include <unordered_map>
#include <cstring>
#include <chrono>
#include <vector>
#include <map>
#include <random>
#include <set>
#include <algorithm>
#include <math.h>
#include <cstdio>
#include <stdio.h>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <deque>
#includ... | #include <iostream>
#include <stdio.h>
#include <string>
#define MAX 100000000
#define INFTY (1<<30)
int n, H[MAX];
void maxHeap(int i) {
int left = i * 2;
int right = i * 2 + 1;
if (left > n) return;
int max = left;
if (right <= n) max = H[left] >= H[right] ? left : right;
max = H[i] >= H[max] ... | 0 | 68,947,949 |
#include <cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<set>
#include<bitset>
#include<iomanip>
#include<stack>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
ll n, m;
int p[100005];
class union_find {
... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <math.h>
#include <complex>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <functional>
#include <assert.h>
#define int long
#def... | 0 | 11,216,127 |
#include <iostream>
using namespace std;
int main(void){
int m, f, r;
while (1) {
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1) break;
if (m == -1 || f == -1) cout << "F" << endl;
else if (80 <= m + f) cout << "A" << endl;
else if (65 <= m + f) cout << "B" << end... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool ch... | 0 | 54,941,522 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.14... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using ... | 0 | 2,880,584 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector<vector<int>>
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000007;
struct SegmentTree{
int n;
vector<int> value;
int SIJK;
Segm... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 66,843,523 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string s;
cin >> s;
vector<bool> app(26);
rep(i, s.size()) app[s[i] - 'a'] = true;
rep(i, 26) if(!app[i]) {
printf("%c\n", char(i + 'a'));
retur... | #define _CRT_SECURE_NO_WARINGS
#include <iostream>
#include <iomanip>
#include <map>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <fstream>
#include <map>
#include <unordered_map>
using namespace st... | 0 | 76,704,918 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main(){
string s;
int w;
cin>>s>>w;
rep(i,s.size()) if(i%w==0)cout<<s[i];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,s,n) for(int i = s;i<n;i++)
#define repe(i,s,n) for(int i = s;i<=n;i++)
#define rrep(i,s,n) for(int i = (n)-1;i>=(s);i--)
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define fi first
#define se second
typedef long long ll;
t... | 0 | 40,760,666 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define ll long long
#define pii pair<int,int>
void test_case()
{
ll k,n;
cin>>k>>n;
ll a[n];
for(ll i=0;i<n;i++)
cin>>a[i];
ll maxgap=0;
for(in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> p(n), c(n);
for (int i = 0; i < n; i++) { cin >> p.at(i); }
for (int i = 0; i < n; i++) { cin >> c.at(i); }
for (int i = 0; i < n; i++) { p.at(i)--; }
ll ans = -1e18;
for (int si = 0; s... | 0 | 78,649,150 |
#include <iostream>
#include <vector>
const int INF = 1001001001;
int main(){
int n, m, x;
std::cin >> n >> m >> x;
std::vector<int> c(n);
std::vector<std::vector<int>> a(n, std::vector<int>(m));
for (int i = 0; i < n; i++)
{
std::cin >> c[i];
for (int j = 0; j < m; j++)
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int X, Y;
cin >> X >> Y;
vector<int> x(N);
vector<int> y(M);
for(int n=0; n<N; n++) {
cin >> x[n];
}
for(int m=0; m<M; m++) {
cin >> y[m];
}
s... | 0 | 823,747 |
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long Int;
Int n, k, sum, res;
Int a[108000];
int main(){
while(true){
cin >> n >> k;
if(n == 0 && k == 0)break;
for(int i = 0;i < n;i++){
cin >> a[i];
}
sum = 0;
for(int i = 0;i < k;i++){
sum += a[i];
}
res = sum;
for(int i... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001;... | 0 | 5,347,385 |
#include <iostream>
#include <deque>
using namespace std;
int main()
{
string s , t;
cin >>s >> t;
int n = s.size();
for (int i = 0 ; i< n;i++){
if (s==t){
cout<<"Yes"<<endl;
return 0 ;
}
s = s.back()+s;
s.pop_back();
}
cout<<"No"<<endl;
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi 3.141592653589793238
#define eb emplace_back
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define zip(i,a,b) for(int i=a;i<b;i++)
#define r... | 0 | 12,845,092 |
#include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <vector>
#include <map>
#include<cstdio>
#include<functional>
#include <bitset>
#include <iomanip>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#d... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 368,161 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <cmath>
#include <functional>
using namespace std;
typedef long long int LL;
typedef vector<int... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
const int last_days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31,... | 0 | 99,854,015 |
#include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
int n, m;
cin >> n >> m;
int *a = new int[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
}
int cnt = 0;... | 0 | 91,645,227 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = int64_t;
using P = pair<ll,ll>;
ll INF = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
... | 0 | 44,740,270 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9+7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long ans = 0;
for (int i... | #include <bits/stdc++.h>
using namespace std;
int main(){
int64_t N,ans=0,sum=0,che=0;
cin>>N;
vector <int64_t>A(N+1),B(N+1),S(N+2);
for(int i=0;i<=N;i++){
cin>>A[i];
B[i]=0;
sum+=A[i];
}
int64_t s=1,p,q;
S[0]=1;
for(int i=N;i>=0;i--){
if(i==N) B[i]=A[i];
... | 0 | 27,468,082 |
#include<math.h>
#include<iostream>
using namespace std;
int main()
{
int x1,y1,x2,y2;
double d,x,y;
cin >> x1 >> y1 >> x2 >> y2;
x = (x2-x1)*(x2-x1);
y = (y2-y1)*(y2-y1);
d = sqrt((x+y));
cout << d << endl ;
return 0;
} | #include<iostream>
#include<cstdio>
#include<math.h>
#include<string>
#include<algorithm>
#include<functional>
#include<vector>
#include<set>
#include<map>
#include<queue>
#define INF 999999
#define EPS 1.0e-6
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> PP;
int main()
{
in... | 0 | 8,798,067 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
ll d, a;
cin >> n >> d >> a;
vector<P> p(n);
rep(i, n){
cin >> p[i].first >> p[i].second;
}
sort(p.begin(), p.end());
d = d*2;
ll tot = 0;... | #include<iostream>
#include<algorithm>
int main () {
int k, s;
std::cin >> k >> s;
long long ans = 0;
for (int x = 0; x <= k; x++)
{
for (int y = 0; y <= k; y++) {
int z = s - x - y;
if(z >= 0 && z <= k) {
ans++;
}
}
}
std::... | 0 | 85,688,457 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 1000000000 + 7;
int main(){
cout << setprecision(10);
ll INF = 10000000000000000;
ll A,B;
cin >> A >> B;
ll ans = 0;
ll tmp1,tmp2,tmp3,tmp4;
tmp1 = 1 + (-B-(-A)) + 1;
tmp1 = (tmp1 >= 0 ? tmp1 : ... | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
using Graph = vector<vector<int> >;
Graph G;
void dfs(int v, vector<bool> &seen, int &res){
bool end = true;
rep(i, seen.size()){
if(!seen.at(i) && i != v) end = false;
}
if(end){
res++;
return;... | 0 | 66,363,670 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 100005
ll in[N];
void solve() {
ll ret = 0;
int n;scanf("%d",&n);
for(int i=0;i<n;++i) {
scanf("%lld",&in[i]);
ret ^=in[i];
}
for(int i=0;i<n;++i) {
ll tmp = in[i]&ret;
in[i] -= tmp;
}
... | 0 | 94,042,318 |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int main() {
int a, b, c; cin >> a >> b >> c;
int cnt = 0;
for (int i = 1; i*i <= c; i++) {
if (c%i == 0) {
if (a <= i&&i <= b)cnt++;
if (i != c / i&&a <= c / i&&c / i <= b)cnt++;
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/agc009_a.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cou... | 0 | 77,691,720 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
int main() {
int a, b, c, d, x, y;
cin >> a >> b >> c >> d;
if (a >= b)
x = b;
else
x = a;
if (c >= d)
y = d;
else
y = c;
cout << x + y << "\n";
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vecto... | 0 | 20,641,558 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<set>
#include<map>
#include<queue>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef pair<int,int> p;
int n,m;
int xx[10]={1,0,-1,0},yy[10]={0,1,0,-1};
int x[20],y[20];
char a[1100][1100];
int b[1100][1100];
bool d[1100]... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long N,loop;
cin >> N;
string S;
cin >> S;
long long ans,K;
if(S[0]=='W'){
ans=0;
}else{
ans=1;
K=1;
for(loop=1;loop<N*2;loop++){
if(K%2){
if(S[loop]=='W'){
K++;
}else{
ans=(ans*K)%1000... | 0 | 19,638,010 |
#include<bits/stdc++.h>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
#define mod 1000000007
#define inf 1e18+42
#define endl "\n"
#define pi 3.1415926535897932384626433832795028841971693993751058
#defi... | #include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
using namespace std;
int main(int, char**){
int n;
vector<int> ret;
while(true){
int n,buf;
vector<int> scores;
cin >> n;
if(n == 0) break;
for(int i = 0; i < n; ++i){
cin >> buf;
scores.push_back(buf);
}
scores.erase(m... | 0 | 31,090,816 |
#include<bits/stdc++.h>
using namespace std;
#define mx 1000000000000000000
#define ll long long int
int main()
{
ll n,i,a[100000],count,sum=0;
cin>> n >> count ;
for(i=0;i<count;i++)
{
cin>> a[i];
sum+=a[i];
}
if(sum>=n)
cout << "Yes" << endl;
else
cout << "N... | #include <cstdio>
#include <iostream>
#include <algorithm>
#define F first
#define S second
using namespace std;
int n;
long long m;
int d;
int p;
pair<int,int> a[11111];
int main(void){
while(cin >> n >> m){
if(!n) break;
for(int i = 0; i < n; i++){
cin >> d >> p;
a[i] = make_pair(p,d);
}
... | 0 | 29,408,645 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define ull unsigned long long
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define FOR(i,start,sto... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
vector<pair<int, int>> vp;
... | 0 | 47,194,507 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
double N, K;
cin >> N >> K;
double ans = 0;
for (double i = 1; i <= N; ++i) {
if (i >= K) {
ans += 1.0;
} else {
... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite)... | 0 | 83,629,965 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI acos(-1.0)
#define test() int t; cin>>t; while(t--)
#define ll long long int
int mod = 1e9 + 7;
int main()
{
IOS;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", st... | #include <iostream>
#include <string>
bool Find(const std::string& S, const std::string& partial) {
int current_index = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == partial[current_index]) {
current_index++;
}
if (current_index == 3) {
return true;
}
}
return false;
}
int main... | 0 | 58,476,197 |
#include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
#include<map>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end... | 0 | 82,746,344 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
using namespace std;
typedef long long ll;
template <class T> inline bool dpmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool dpmax(T &a, T b) {
if ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double real;
typedef pair<int, int> duo;
#define TT template<typename T>
TT T sq(T x){ return x*x; }
TT int ubnd(vector<T>& v,T x){ return upper_bound(v.begin(), v.end(), x) - v.begin(); }
TT int lbnd(vector<T>& v,T x){ return lower_b... | 0 | 55,003,496 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#de... | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
const ll mod = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int i... | 0 | 73,813,995 |
#include <stdio.h>
#include <iostream>
#include <queue>
using namespace std;
int main(void)
{
priority_queue<int> que;
while (1) {
char cmd[8] = "\0";
int key;
cin >> cmd;
if (cmd[2] == 'd') break;
if (cmd[2] == 's') {
cin >> key;
que.push(key);
}
else if (cmd[2] == 't') {
cout << que.top() << ... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int h,w,d;
cin >> h >> w >> d;
int x[90001];
int y[90001];
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
int a;
cin >> a;
x[a]=i;
y[a]=j;
}
}
int dis[90... | 0 | 10,664,795 |
#include <iostream>
#include <bits/stdc++.h>
#include <string>
#include <ctype.h>
#include <algorithm>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
const int INF = 1e9;
using namespace std;
int main() {
stringstream result;
while(1) {
string str;
int m;
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF 1<<30
#define LINF 1LL<<60
class WarshallFloyd{
public:
ll V;
vector<vector<ll>> d;
WarshallFloyd(ll V):V(V){
d.assign(V, vector<ll>(V,LINF));
for(int i = 0; i < V;i++){
d[i][i] = 0;
}
}
... | 0 | 67,032,671 |
#include <vector>
#include <iostream>
#include <functional>
using namespace std;
struct edge {
int to, cost;
};
int main() {
int N, M;
cin >> N >> M;
vector<vector<edge> > G(N);
for (int i = 0; i < M; ++i) {
int L, R, D;
cin >> L >> R >> D; --L, --R;
G[L].push_back(edge{ R, D });
G[R].push_back(edge{ L, -D... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vii... | 0 | 67,613,968 |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int f[50];
int main() {
int n; scanf("%d", &n);
f[0] = f[1] = 1;
for (int i = 2; i <= n; i++)f[i] = f[i - 2] + f[i - 1];
printf("%d\n", f[n]);
} | #include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9+7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE cout << ((n) ? "POSSIBLE\n"... | 0 | 55,184,026 |
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
using P = pair<ll, int>;
struct Edge{
ll to,cost... | 0 | 72,171,494 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s, t;
cin >> s >> t;
cout << (s == t.substr(0, s.size())? "Yes" : "No") << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a.at(i);
int num = 1, cnt = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) == num) {
num++;
} else {
cnt++;
}
}
i... | 0 | 18,022,862 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inl... | #include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define FPEN freopen("in.txt", "r", stdin);
#define TEST(...) \
{ printf("! "), printf(__VA_ARGS__); }
#else
#define TEST(...)
#define FPEN
#endif
const int maxn = 200009;
typedef long long i64;
t... | 0 | 51,531,176 |
#include <bits/stdc++.h>
using namespace std;
#define r(i,n) for(auto i=0;i<n;i++)
#define s(c) static_cast<int>((c).size())
int main(){
int n;
scanf("%d", &n);
int min = 2000000, t, A[10001]{};
r(i, n){
scanf("%d", &t);
if(t < min) min = t;
A[t]++;
}
A[min]--;
cout << min;
for(int i = min; i < 10001; i++... | #include <cstdlib>
#include <iostream>
#include <stdio.h>
class Node
{
int key;
Node *prev, *next;
public:
void setKey(const int key) {
this->key = key;
}
void setPrev(Node *prev) {
this->prev = prev;
}
void setNext(Node *next) {
this->next = next;
}
int getKey() {
return this->key;
}
Node* getPrev()... | 0 | 98,945,053 |
#include<bits/stdc++.h>
using namespace std;
#define fo(i,a,b) for(register int (i)=(a);(i)<=(b);++(i))
#define rd read()
#define maxn 1000001
#define gc getchar()
#define mem(a,b) memset(a,b,sizeof(a))
#define mp make_pair
#define ll long long
#define ull unsigned ll
#define pb push_back
#define db double
int read()... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<ll> A(N), B(N), D(N);
for (auto &e : A) cin >> e;
for (auto &e : B) cin >> e;
ll del = 0;
bool b = true;
for (ll i = 0; i < N; i++) {
D[i] = B[i]-A[i];
if (D[i] != 0) b = false;
del += D... | 0 | 8,757,891 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
int count=0;
for(int i=0;i<s.size();i++){
if(s.at(i)=='x'){
count++;
}
}
if(count<=7){
cout<<"YES"<<endl;
}
else{
cout<<"NO"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
const int nil = -1;
const int MAX = 100001;
struct Node{int parent,left_child,right_brother;};
Node node_array[MAX];
int depth_array[MAX];
void set_depth(int node_number,int depth){
depth_array[node_number] = depth;
int r = node_array[node_number].right_brother;
... | 0 | 100,687,999 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
int main() {
string s,t;
cin>>s>>t;
sort(s.begin(),s.end());
sort(t.begin(),t.end(),greater<int>());
if(s<t)cout<<"Yes";
else cout<<"No";
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
vector<string> arr(n);
for (int i=0; i<n; i++) {
cin >> arr[i];
}
sort(arr.begin(), arr.end());
string res = "";
for (string str : arr) {
res += str;
}
cout << res;
} | 0 | 74,916,674 |
#include <iostream>
using namespace std;
int main(){
int k, s;
cin >> k >> s;
int ans = 0;
for(int x=0; x<k+1; x++){
for(int y=0; y<k+1; y++){
int z = s - x - y;
if(0<=z && z<=k) ans++;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
typedef struct{
int x,y,t;
} acord_t;
int main(void)
{
int N;
cin >> N;
acord_t point[N];
for(int i=0; i<N; i++){
cin >> point[i].t;
cin >> point[i].x;
cin >> point[i].y;
}
for(int j=0; j<N; j++){
int x_... | 0 | 65,051,756 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string A, B, S;
cin >> A >> B >> S;
cout << ((regex_match(S, regex("\\d{" + A + "}-\\d{" + B + "}"))) ? "Yes" : "No") << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, k; scanf("%d %d", &n, &k);
int c = (n-1)*(n-2)/2-k;
if(c < 0) printf("%d",-1);
else{
printf("%d\n",c+(n-1));
for(int i=1; i<=n-1; i++) printf("%d %d\n",i,n);
for(int i=1; i<=n-1; i++) for(int j=i+1; j<=n-1; j++){
... | 0 | 35,209,559 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=100000,INF=(1<<30)-1;
int n,m,sk,a[N+9],b[N+9];
int main(){
scanf("%d%d%d",&n,&m,&sk);
int mn0=INF,mn1=INF;
for (int i=1;i<=n;++i){
scanf("%d",&a[i]);
mn0=min(mn0,a[i]);
}
for (int i=1;i<=m;++i){
scanf("%d",&b[i]);
mn1=min(mn1,... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
using namespace std;
#define intmax INT_MAX
#define lma... | 0 | 10,797,628 |
#include<iostream>
int main(){
int n;
int temp,max,a;
while(1){
std::cin >> n;
if(n==0){
break;
}
int a[n];
for(int i=0;i<n;i++){
std::cin >> a[i];
}
max = a[0];
for(int i=0;i<n;i++){
temp = a[i];
if(max < temp){
max = temp;
}
for(int j=i... | #include <bits/stdc++.h>
using namespace std;
typedef int_fast32_t int32;
typedef int_fast64_t int64;
const int32 inf = 1e9+7;
const int32 MOD = 1000000007;
const int64 llinf = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE(n) cout << ((n) ? "P... | 0 | 11,004,481 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 100005;
int n;
ll ans = 1, nodes;
ll l[N], r[N];
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin >> n;
vector<ll> a(n + 1);
for (auto& i : a) cin >> i;
for (int i = n; i > 0; --i) {
if (i == n) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long... | 0 | 59,291,902 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using LL = long long;
using P = pair<int,int>;
int main(){
string S;
cin >> S;
if(S[0]==S[1]&&S[1]==S[2]) cout << "No" << endl;
else cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE") << endl
#define Possible(n) cout <<... | 0 | 93,153,421 |
#include <bits/stdc++.h>
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ones(x) (ll) __builtin_popcount(x)
#define fs first
#define sc second
#define pb push_bac... | #include<bits/stdc++.h>
#define ll long long
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
using namespace std;
int main()
{
fast_io
ll i,x,alp[26]={0},cnt=0;
string s;
cin>>s;
for(i=0; s[i]; i++)
{
x=s[i]-'A';
alp[x]++;
... | 0 | 78,125,552 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
string s,t;cin>>s>>t;
int n=s.length(),c,p=0;
char x[n+1],y[n+1];
strcpy(x,s.c_str());
strcpy(y,t.c_str());
while(p<n-1){
for(int i=0;i<n;i++){
if(x[i]!=y[i])
break;
if(i==(n-1)){
cout<<"Yes"<<endl;return 0;
}}
for(int i=0;i<n;i++)... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | 0 | 69,033,301 |
#include<iostream>
using namespace std;
#include<stdio.h>
int main() {
char p[101], s[101];
int pl, sl, i, j, r, sum;
r = 0;
for (sl = 0; sl < 101; sl++) {
scanf("%c", &s[sl]);
if (s[sl] == '\n') break;
}
for (pl = 0; pl < 101; pl++) {
... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 1000000007
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i-... | 0 | 99,943,907 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include <iomanip>
using namespace std;
#define intmax INT_MAX
#define lmax LONG... | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
string S;
cin >> S;
map<char, int>d;
bool kotonaru = true;
for (int i=0; i<S.size(); i++) {
if (d.count(S[i]) > 0) {
kotonaru = false;
break;
} else {
... | 0 | 92,523,766 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin >> A;
cin >> B;
A %= 500;
if(A <= B){
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 86,957,220 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin(),... | #include<bits/stdc++.h>
using namespace std;
int n,a,b;
bool test(int num)
{
int total=0;
while (num)
{
total = total +num%10;
num = num/10;
}
if(total >=a&&total<=b)
{
return true;
}
else
{
return false;
}
}
int main()
{
cin>>n>>a>>b;
int ... | 0 | 67,521,334 |
#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
void initial(string &a, string &b){
while (a.size()<b.size())a = '0' + a;
while (b.size()<a.size())b = '0' + b;
}
void findMax(string &a, string &b){
string tmp;
if (a<b){
tmp = b;
b = a;
a = tmp;
}
}
bool del(string &a){
if (a[0] ==... | #include<iostream>
#include<vector>
#include<queue>
using namespace std;
void calc(const vector<vector<int> >& G, vector<int>& D) {
queue<int> Q;
D[1] = 0;
Q.push(1);
while (!Q.empty()) {
int i = Q.front();
Q.pop();
for (int j = 1; j < G[i].size(); j++) {
if (G[i][j] ... | 0 | 1,621,349 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
#define _GLIBCXX_DEBUG
#define IO_STREAM cin.tie(0);ios::sync_with_stdio(false)
#define all(x) x.begin(),x.end()
#define rep(i,sta,end) for(ll i=sta;i<end;++i)
#define lcm(a,b) (a)/__gcd((a),(b))*(b)
#de... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, d, ans = 0, sn, sqsn;
vector<vector<int>> x(10, vector<int>(10));
cin >> n >> d;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < d; j++)
cin >> x[i][j];
}
for (int i = 0; i < n - 1; i++)
{
for (int j = i + 1; j < n; j++)
... | 0 | 96,660,539 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <math.h>
using namespace std;
const int MAXN = 1e5 + 10;
int N;
int cnt = 1, Head[MAXN], Next[MAXN << 1], To[MAXN << 1];
int d[MAXN];
int ans;
inline void add_edge(int x, int y) {
Next[++cnt] = Head[x], To[cnt] = y, Head[x] = cnt;
}
... | #include<cstdio>
#include<cstring>
int main(){
char X[10000];
while(1){
int i,y=0;
scanf("%s",X);
if((X[0] == '0')&&(X[1] == '\0')) break;
for(i=0; i<10000; i++){
if(X[i] == '\0') break;
y += X[i] - '0';
}
printf("%d\n",y);
}
return 0;
} | 0 | 46,982,715 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll n = 0;
cin >> n;
ll res = 0;
res = pow(10,18);
for(int i = 1;i <= sqrt(n)... | #include <bits/stdc++.h>
using namespace std;
#define long long long
#define INF 2e18
#define MOD (long) (1e9 + 7)
#define umap unordered_map
int main()
{
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
long t = 1;
while (t--) {
long n;
cin >> n;
vector<long> a(n);
... | 0 | 73,639,002 |
#include<cstdio>
using namespace std;
int main(){
int n, i;
scanf("%d%d", &n, &i);
printf("%d\n", n + 1 - i);
} | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
typedef pair<int,int> ... | 0 | 1,105,835 |
#include<bits/stdc++.h>
#define rep(i,j,n) for(ll i=(ll)(j);i<(ll)(n);i++)
#define REP(i,j,n) for(ll i=(ll)(j);i<=(ll)(n);i++)
#define per(i,j,n) for(ll i=(ll)(j);(ll)(n)<=i;i--)
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(ll)(key)))
#define disl... | #include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <queue>
#include <algorithm>
#include <math.h>
#include <map>
#include <set>
#define DEBUG 0
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 10000000... | 0 | 69,268,019 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n,m,a[100];
cin>>n>>m;
int popu=0; double sum_a=0;
rep(i,n){
int A;
cin>>A;
a[i]=A;
sum_a+=a[i];
}
rep(i,n){
if(a[i] >= sum_a/(4*m)){
popu++;
... | #include <bits/stdc++.h>
using namespace std;
int getCost(int *arr, int index, vector<int>& mem){
if(mem[index] != -1) return mem[index];
int cost = INT_MAX;
if(index+1 < mem.size())
cost = min(cost, abs(arr[index] - arr[index+1])+ getCost(arr, index+1, mem));
if(index+2 < mem.size())
co... | 0 | 16,540,969 |
#include <iostream>
#include <locale>
#include <sstream>
int main(int argc, char const *argv[]) {
std::string FromStr = "fAIR, LATER, OCCASIONALLY CLOUDY.";
std::string ToStr;
unsigned short NumberOfCharacters = 0;
std::ostringstream oss;
while (true) {
getline(std::cin, FromStr);
NumberOfCharacters =... | #include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
#ifndef bhupixb
#define var(...)
#define stl(...)
#endif
#define rep(i,a,b) for (int i = a; i <= (int)b; ++i)
#define f first
#define s second
#define single_test
constexpr int mod = 1e9 + 7;
struct M {
unsigned v;
M(long long a = 0)... | 0 | 17,437,081 |
#include<iostream>
int main(){
int yamikin,i,n;
std::cin>>n;
yamikin=100000;
for(i=0;i<n;i++){
yamikin=yamikin*1.05;
if(yamikin%1000!=0){
yamikin=yamikin-(yamikin%1000)+1000;
}
}
std::cout<<yamikin<<std::endl;
return 0;
} | #include <iostream>
#include <deque>
using namespace std;
const int MAX = 1e5;
int gcd(int a, int b) {
if (a < b) swap(a, b);
while(b != 0) {
int tmp = a % b;
a = b;
b = tmp;
}
return a;
}
int div2(int n) {
if (n == 0) return 0;
if (n < 0) n *= -1;
int ans = 0;
while((n & 1) == 0) {
ans+... | 0 | 65,193,435 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
int main(){
string s;
string target="keyence";
cin >>s;
int n=s.size();
bool a=false;
int cnnt=0;
if(s==target)a=true;
rep(i,n){
for(int j=i;... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
int main(){
ll n;
ll k;
cin >> n >> k;
ll inp;
vector<ll> a(n);
vector<ll> perm(n);
for(ll i = 0; i < n; i++){
cin >> inp;
a.at(i) = inp;
if(i < n - k) perm.at(i) = 0;
... | 0 | 22,919,358 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
int main(){
char b;
cin >> b;
if(b == 'A') cout << "T" << endl;
else if(b == 'T') cout << "A" << endl;
else if(b == 'C') cout << "G" << endl;
else if(b == 'G'... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<mem... | 0 | 67,858,481 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >>N;
int r=0;
int m=N;
while(m>0){
r+=m%10;
m/=10;
}
if(N%r==0) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <iterator>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <map>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main() {
int N;
m... | 0 | 76,771,375 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep2(i,s,n) for(int i = (s); i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) v.begin(),v.end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
ll f(ll n)
{
ll r=n%4;
... | #include <bits/stdc++.h>
#define MAXN 2010
#define pii pair<int,int>
#define ff first
#define ss second
#define ll long long
#define in_range(x, y, n) (x >= 0 and x<n and y >=0 and y<n)
using namespace std;
const ll mod = 1e9 + 7;
ll n, m, ps[MAXN][MAXN];
int main (){
ios_base::sync_with_stdio(false);
cin >> n ... | 0 | 27,233,981 |
#include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
int d = (a==b)?c:(a==c?b:a);
std::cout << d << std::endl;
return 0;
} | #include <bits/stdc++.h>
#define long long long
using namespace std;
const int N = 1e3+5;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'L', 'D', 'R', 'U'};
int n, X[N], Y[N];
int main() {
scanf("%d", &n);
for(int i = 1; i <= n; i++) scanf("%d %d", X + i, Y + i);
bool chk = (X... | 0 | 54,343,911 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
using namespace std;
#define pie 3.141592653589793238462643383279
#... | #include <iostream>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
void solve(std::string S){
bool ans = true;
string tmp = S.substr(2, S.size() - 3);
int countC = 0;
REP(i, tmp.size())
if (tmp[i] == 'C') countC++;
if (S[0] != 'A') ans = false;
else if (countC != 1)... | 0 | 14,133,206 |
#include <iostream>
#include <string>
using namespace std;
long long solve(string S) {
long long cnt = 0, ret = 0;
for (int i = 0; i < S.size(); i++) {
cnt++;
if (i == (int)S.size() - 1 || S[i] != S[i + 1]) {
ret += cnt / 2;
cnt = 0;
}
}
return ret;
}
int main() {
string T; cin >> T;
long long K; cin ... | #include<bits/stdc++.h>
typedef long long ll;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pb push_back
#define ff first
#define ss second
#defin... | 0 | 74,576,436 |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef long double ld;
int main(){
ll n;
cin >> n;
cout << (n-2)*180 << endl;
cin >> n;
} | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
static const int MAX=101;
vector<int> Adjacency[MAX];
int dt[MAX];
bool Visited[MAX];
void bfs(int i)
{
queue<int> Q;
dt[i]=0;Q.push(i);
Visited[i]=true;
int d=0;
while(!Q.empty())
{
int p=Q.front();Q.pop();d=dt[... | 0 | 24,081,908 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <set>
#include <vector>
#define FOR(i, l, r) for (i = (l); i < r; i++ )
using namespace std;
typedef long long ll;
#define MAX_N (2000010)
#define MAX_K (10010)
int A[MAX_N];
int C[... | #pragma region header
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#de... | 0 | 96,549,466 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll N, A, B;
cin >> N >> A >> B;
int ans = 0;
for (int i = 1; i <= N; ++i) {
int sum = 0;
int M = i;
while (M > 0) {
... | 0 | 62,550,402 |
#include <iostream>
#include <cstdio>
#include <string>
using namespace std;
int main() {
string s; cin >> s;
for(int i = s.size()-1; i >= 0; i--) printf("%c", s[i]);
cout << endl;
} | #include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <cmath>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <iostream>
#include <random>
#include <map>
#include <iomanip>
#include <stdlib.h>
#inclu... | 0 | 31,644,098 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
int n, m;
cin >> n >> m;
vector<int> ans(n+1);
vector<bool> flag(n+1, true);
vector<vector<int>> g(n+1);
for(int i = 0; i < m; i++){
int a, b;
cin >> a >> b;
g[a].push_back(b);
g[b... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int ... | 0 | 22,456,849 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string x,y,l,n;
cin>>x;
int z=0;
y=x;
l=x;
n=x;
int o,j,a,s;
o=x.size()-1;
j=x.size()-1;
a=(x.size()-1)/2-1;
s=(x.size()+3)/2-1;
for(int i=0;i<j;i++){
swap(x[j],x[i]);
j--;
}
if(x==y){
z++;}
for(int i=0;i<=a;i++){
if(a==1){
... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
int main(){
int n;
vector<int> mat[100];
cin >> n;
for(int i=0;i<n;i++){
int u,k;
cin >> u >> k;
for(int j=0;j<k;j++){
int v;
cin >> v;
mat[i].push_back(v-1);
}
}
int d[100];
for(int i=0;i<n;i++) ... | 0 | 32,712,571 |
#include <bits/stdc++.h>
#define N 101
using namespace std;
int A[N];
int mem[N][N],used[N][N];
int dfs(int l,int r){
if(l == r) return 0;
if(r - l == 1) return A[l]*A[r]*A[r+1];
if(used[l][r]++) return mem[l][r];
int res = 1e9;
for(int i=l;i<r;i++){
int a = dfs(l,i);
int b = dfs(i+1,r);
int c =... | #include <vector>
#include <iostream>
#include <vector>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
using ll = long long ;
int main() {
int n,h ;
cin >> n >> h ;
int a[n],b[n] ;
int amax = -1 ;
for(int i=0;i<n;i++){
cin >> a[i] >> b[i] ;
amax = max(a[i],amax) ;... | 0 | 9,673,635 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MAX_H = 1000;
const int MAX_W = 1000;
const int MAX_N = 9;
const int INF = 100000000;
char maze[MAX_H][MAX_W + 1];
int d[MAX_H][MAX_W];
int H, W, N;
int sx, sy;
int gx, ... | #include <bits/stdc++.h>
using namespace std;
#define ALPHABET (26)
#define INF INT_MAX
#define MOD (1000000007LL)
using LL = long long;
int main() {
std::ios::sync_with_stdio(false);
int h, w;cin >> h >> w;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
string s;cin >> ... | 0 | 99,999,926 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
long long int res = 0;
unordered_map<string, int> um;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (... | 0 | 63,668,156 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
while(b--){
int x;
cin>>x;
if((a-=x)<=0){
cout<<"Yes";
return 0;
}
}
cout<<"No";
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int main()
{
int w, h, n;
cin >> w >> h >> n;
int l = 0, r = w, d = 0, u = h;
rep(i,n)
{
int x, y, a;
cin >> x >> y >> a;
if(a == 1)
{
l =... | 0 | 677,886 |
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n;
long long s,i,k,a,b;
scanf("%d",&n);
while(n--)
{
cin>>a>>b;
if(a==b) {cout<<(a-1)*2<<"\n";continue;}
s=a*b-1;
i=sqrt(s);
k=... | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long int
#define mod 1000000007
bool isPrime[1000001];
ll power(ll a,ll b)
{
ll result = 1;
while(b>0)
{
if(b%2)
{
result = (a*result)%mod;
}
a = (a*a)%mod;
b = b/2;
}
return re... | 0 | 77,495,128 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
int main() {
int a,b;
cin >> a >> b;
a--;
b--;
cout << a*b << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
string s;
cin >> s;
int n=s.size();
set<char> chk;
bool c=true;
rep(i,n){
if(chk.count(s.at(i))... | 0 | 93,865,215 |
#include <iostream>
using namespace std;
int main()
{
int n;
scanf("%d", &n);
printf("%d", n/3);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long lol;
#define REP(i,n) for(lol i=0;i<lol(n);i++)
#define REPD(i,n) for(lol i=n-1;i>=0;i--)
#define FOR(i,a,b) for(lol i=a;i<=lol(b);i++)
#define FORD(i,a,b) for(lol i=a;i>=lol(b);i--)
#define VL vector<lol>
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ... | 0 | 12,266,990 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, n;
cin >> N;
n = N;
for (int i = 0; i < 9; i++) {
int x;
x += n % 10;
n /= 10;
if (i == 8){
if ( N % x == 0){
cout << "Yes" << endl;}
else{
cout << "No" << endl;}
}
}
} | #include <cstdio>
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <algorithm>
#define ALL(c) (c).begin(), (c).end()
#define DUMP(x) std::cerr << #x << ':' << x << '\n';
typedef long long ll;
template<typename T,typename U>inline bool chmax(T&x,U a){if(x>=a)return 0;x=a;r... | 0 | 42,049,224 |
#include <iostream>
#define REP(i,n) for(int i=0;i<n;i++)
using namespace std;
int main() {
REP(i,9)
REP(j,9)
cout << i+1 << 'x' << j+1 << '=' << (i+1)*(j+1) << '\n';
} | #include<iostream>
#include<stdio.h>
#include<string>
#include<stdlib.h>
using namespace std;
long long n;
long long *T;
void insert(long long a){
for(long long i = 0; i < n; i++){
long long j = (((a % n) + i * (1 + a % (n - 1))) % n);
if(T[j] == '\0'){
T[j] = a;
break;
}
}
}
string findx(lo... | 0 | 33,365,842 |
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
vector<int> p(N);
for (int i = 0; i < N; ++i)
cin >> p[i];
vector<int> a(N), b(N);
for (int i = 0; i < N; ++i) {
a[i] = 20020 * (i + 1);
b[i] = 20020 * (N - i);
}
for (int i = 0; i < N;... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
ll n;
cin >> n;
vec x(n),y(n);
for(ll i=0;i<n;i++) cin >> x[i] >> y[i];
ll ans=0;
for(ll i=0;i<n;i++) {
for(... | 0 | 63,018,838 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.