code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#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() {
string S;
cin >> S;
string ans = "No";
if (S == "abc" || S == "acb" || S == "bca" || S == "bac" || S == "cab" || S == "cba") ans ="Yes";
cout << ans << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long K;
cin >> n >> K;
vector<long long> a(n), b(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i) >> b.at(i);
}
vector<long long> nk = {K};
for (int i = 0; i < 30; i++) {
if (!(K & (1ll << i))) continu... | 0 | 72,804,744 |
#include<iostream>
using namespace std;
int main(){
int W, H, x, y, r;
int a, b, i, j;
cin >> W >> H >> x >> y >> r;
a = x - r;
b = y - r;
i = x + r;
j = y + r;
if( 0<=a && 0<=b){
if( i<=W && j<=H){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
}else{
cout << "No" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int a,b,c;
int h,m,s;
cin >> a >> b >> c;
if(a < b){
if(b < c){
cout << a << " " << b << " " << c << endl;
}else{
if(a < c){
cout << a << " " << c << " " << b << endl;
}else{
cout << c << " " << a << " " << b << endl... | 0 | 45,136,728 |
#include <iostream>
using namespace std;
int P[10010];
void init(int N);
int root(int a);
bool is_same_set(int a,int b);
void unite(int a,int b);
int main() {
int n,q;
cin >> n >> q;
init(n);
for (int i=0;i<q;++i) {
int com,x,y;
cin >> com >> x >> y;
if (com==0) unite(x,y);
else if (com==1) cou... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x)... | 0 | 56,740,999 |
#include<cstdio>
int main(){
unsigned N, K;
scanf("%u %u", &N, &K);
printf("%u\n", (N-2)/(K-1) + 1);
return 0;
} | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 19,297,814 |
#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RRE... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#define LL long long
using namespace std;
int x, y;
int main()
{
cin >> x >> y;
if (x == y) cout << "0\n";
else if (x < y) cout << min(y - x, abs(y + x) + 1) << '\n';
else cout << min(a... | 0 | 66,724,249 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a==b && b==c && a==c ? "Yes" : "No") <<endl;
} | #include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int INF = 1001001001;
const int MOD = 1e9+7;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool ... | 0 | 97,852,842 |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <queue>
#include <math.h>
#include <assert.h>
#include <set>
#include <map>
#include <bitset>
#include <ctime>
#include <time.h>
#include <algorithm>
#include <cstdio>
#include <fstre... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(all... | 0 | 52,632,620 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef pair<ll,int> pli;
typedef pair<int,ll> pil;
typedef pair<ll,ll> pll;
const int N = 18;
ll a[1<<N];
pll res[1<<N];
void merge(int x,int y)
{
if(res[y].second>=res[x].first)
{
res[x].first ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int N,K;
cin>>N>>K;
vector<pair<ll,int>> dt(N);
for(int i=0;i<N;i++){
cin>>dt.at(i).second>>dt.at(i).first;
}
sort(dt.begin(),dt.end());
reverse(dt.begin(),dt.end());
set<int> other;
set<int> l_index;
set<int> neta;
... | 0 | 10,153,104 |
#include <stdio.h>
#include <algorithm>
#include <vector>
int n,m,p[100003],y[100003];std::vector<int> a[100003];
main(){
scanf("%d%d",&n,&m);for(int i=1;i<=m;i++) scanf("%d%d",&p[i],&y[i]),a[p[i]].push_back(y[i]);
for(int i=1;i<=n;i++) std::sort(a[i].begin(),a[i].end());
for(int i=1;i<=m;i++) printf("%012l... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair<int,... | 0 | 36,646,877 |
#include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <list>
#include <cstring>
#include <stack>
using namespa... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
vector<vector<char>> upper(50, vector<char>(100, '.'));
vector<vector<char>> lower(50, vector<char>(100, '#'));
int sx = 0, sy = 0;
for(int i=0; i<b-1; i++){
upper[sx][sy] = '#';
sy += 2;
i... | 0 | 38,772,953 |
#include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
#define rreps(i,n,s) for(int i=s;i>=n;i--)
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<clas... | #include <cassert>
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
class TLcsSolver
{
typedef std::vector<std::vector<int> > TTable;
TTable FTable;
std::string FArray1;
std::string FArray2;
int Count(int i, int j)
{
if(i == 0 || j == 0) return 0;
if(F... | 0 | 23,530,766 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... | #include <bits/stdc++.h>
using namespace std;
int f(int x) {
int ans = 0;
while(x % 2 == 0) {
ans++;
x /= 2;
}
return ans;
}
int g(int64_t x, int64_t y) {
if(x > y) {
return g(y, x);
}
else if(y % x == 0) {
return x;
}
else {
return g(y % x, x);
}
}
int main() {
int N, M;
cin... | 0 | 57,885,978 |
#include<iostream>
using namespace std;
int main() {
char rec;
cin >> rec;
char ans;
if (rec == 'A') {
ans = 'T';
}
else if (rec == 'C') {
ans = 'G';
}
else if (rec == 'G') {
ans = 'C';
}
else {
ans = 'A';
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define repr(i,n) for(ll i=(n-1);i>=0;i--)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end()
#define br cout << endl;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9+7;
using Graph = vector<vecto... | 0 | 59,437,521 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,_3,name,...) name
#defin... | #include <iostream>
#include <cstdlib>
#include <cmath>
using namespace std;
int main(void) {
while (1) {
int n;
cin >> n;
if (n == 0) break;
int a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int mindif = 10000000;
for (int i = 0; i < ... | 0 | 71,050,451 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1000000000 + 7;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
vector<int> even(100000 + 10, 0), odd(100000 + 10, 0);
for (int i = 0; i < n; i += 2) {
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vll = vector<ll> ;
#define all(v) v.begin(),v.end()
int main(){
ll H,W;cin>>H>>W;
if(H%3==0 || W%3==0) cout<<0<<endl;
else{
ll tmp=1e18;
rep(i,W){
ll block1,block2,block3;
... | 0 | 21,904,944 |
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define ll long long
#define pi pair<int,int>
#define pl pair<ll,ll>
#define pd pair<double,double>
#define ld long double
#define pld pair<ld,ld>
#define lg length()
#define sz size()
#define vi vector<int>
#define vl vector<ll>
#define vp ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
string s; cin >> s;
for(int i=0; i<s.size()-1; i++)
if(s[i]==s[i+1])
return cout << i+1 << ' ' << i+2, 0;
for(int i=0; i<s.size()-2; i++)
... | 0 | 12,926,425 |
#include <iostream>
using namespace std;
int graph[101][101];
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
int u,k,v; cin>>u>>k;
for(int j=1;j<=k;j++){
cin>>v;
graph[u][v]=1;
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(j-1) cout<<" ";
cout<<graph[i][j];
... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b)... | 0 | 15,535,920 |
#include<iostream>
#include<queue>
#include<string>
#include<vector>
#include<math.h>
#include<algorithm>
#include<cstdio>
#include<stdio.h>
#include<stack>
#include<sstream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<list>
#include<numeric>
typedef long long ll;
#define pi 3.141592653589793238462... | #include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#define DIV 1000000007
using namespace std;
bool cmp(const pair<int, int>& a, const pair<int, int>& b)
{
return b.second < a.second;
}
int main() {
int N;
cin ... | 0 | 4,133,636 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool chk(ll a,ll b,ll k){
if(b+k>=a*b)return 0;
if(k*(b+1)>=a*b)return 0;
if(b+k+1>=2*k)return 1;
if((b+k+1)*(b+k+1)<4*a*b)return 1;
return 0;
}
void solve(){
ll a,b;cin>>a>>b;
if(a<b)swap(a,b);
ll s=1,e=a-1,ans=0;
w... | 0 | 90,491,332 |
#include <bits/stdc++.h>
using namespace std;
using pp=pair<int,int>;
int main() {
string S, T="";
cin >> S;
for (char c:S) {
if (c=='B') {
if (T.size()==0) {continue;}
else {T.erase(T.size()-1);}
}
else {T.push_back(c);}
}
cout << T << endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int next(int n)
{
n++;
int res = n;
int add = 1;
while(n)
{
if(n%10==4)
{
res -= add*4;
res += add*10;
n+=10;
}
add*=10;
n/=10;
}
return res;
}
int ten(int n)
{
int res = 1;
for(int i = 0;i<n;i++)
{
res*=10;
}
return res;
... | 0 | 12,917,746 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <math.h>
#include <string>
#include <sstream>
using namespace std;
int main() {
vector<int>c(26);
while (true) {
string x;
getline(cin, x);
if (x == "")break;
for (int i = 0; i < x.size(); i++) {
... | #include <bits/stdc++.h>
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(),(v).end()
#define COUNT(a,k) upper_bound(ALL(a),k)-lower_bound(ALL(a),k)
#define BIGGER(a,k) a.end()-upper_bound(ALL(a),k)
#define SMALLER(a,k) lower_bound(ALL(a),k)-a.begin()
#define Vi vector<int>
#define VVi vector<Vi>
#def... | 0 | 79,119,206 |
#include <iostream>
#include <string.h>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
void c_not_so_diverse(void) {
int n, k;
int *a;
cin >> n >> k;
a = (int*)(calloc(n, sizeof(int)));
for (int i = 0; i < n; i++) cin >> a[i];
int* b;
b = (int*)(calloc(n+1, sizeof(int)));
for (int... | #include<bits/stdc++.h>
#define prArr(Arr,n) for(int _=0;_<n;_++) cout<<(Arr)[_]<<" ";
using namespace std;
const int INF=(int)0x3f3f3f3f;
const int MOD=(int)1e9+7;
bool divid[1000006];
int freq[1000006];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,ans=0;
cin>>n;
vecto... | 0 | 14,162,647 |
#include <iostream>
#include <algorithm>
using namespace std;
long long INF = 1001001001001;
long long score(long long a, long long b, long long c) {
return max({a, b, c}) - min({a, b, c});
}
int main() {
long long h, w;
cin >> h >> w;
long long ans = INF;
if (h >= 3) ans = min(ans, (h+2)/3*w - h/3*w);
if (w >= 3... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> VI;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,... | 0 | 77,342,995 |
#include <cstdio>
using namespace std;
int KetanoWa(char ch[])
{
int sum = 0;
for(int i = 0; ch[i]; ++i){
sum += ch[i] - 48;
}
return sum;
}
int main()
{
char ch[1001];
while(true){
scanf("%s", ch);
int sum = KetanoWa(ch);
if(sum == 0) break;
printf("%d\n"... | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
string s;
cin>>s;
if(s[2]==s[3] && s[4]==s[5])
cout<<"Yes\n";
else
cout<<"No\n";
return 0;
} | 0 | 76,901,391 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vecto... | #include <stdio.h>
#include <string.h>
int main(){
char str1[25];
char str2[25];
char str3[25];
scanf("%s %s %s", str1, str2, str3);
if (str1[strlen(str1)-1] == str2[0]){
if (str2[strlen(str2)-1] == str3[0]){
printf("YES\n");
}
else
{
printf("NO\n"... | 0 | 28,561,454 |
#include<stdio.h>
int main()
{
int n;
int ctr[26] = {0}, flag = 1;
scanf("%d", &n);
char str[n + 1];
scanf("%s", &str);
for(int i = 0; str[i] != '\0'; i++){
if(str[i] >= 'a' && str[i] <= 'z'){
++ctr[str[i] - 'a'];
}
}
if(n % 2 != 0){
printf("No\n");
return 0;
}else{
for(int i = 0; i < 26; i++){
... | #include <bits/stdc++.h>
using namespace std;
#define sz(x) int(x.size())
#define pii pair<int, int>
#define All(x) (x).begin(), (x).end()
#define mp make_pair
#define Task "abc"
typedef long long ll;
const int maxn = 1e4 + 10;
const ll mod = 1e9 + 7;
int n, m;
int c[] = {2, 5, 5, 4, 5, 6, 3, 7, 6};
int num[10], cost[1... | 0 | 52,192,551 |
#include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int> > RHEAP;
const int N = 510, M = 1010;
int a, b, n = 100;
char g[N][N];
int main()... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(),(a).end()
#define PI 3.14159265358979
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1e9+7LL;
long long dp0[101][4];
long long dp1[101][4];
int main() {
string N; cin >> N;
i... | 0 | 67,595,876 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define PI 3.1415926535897932
#define MOD 1000000007;
using namespace std;
long long GCD(long long A,long long B){
if(B==0){
return A;
}
else{
return GCD(B,A%B);
}
}
long long LCM(long long A,long long B){
long long g=GCD(A,B);
return A/g*B;
}
long lon... | #include<bits/stdc++.h>
#define pi pair<int,int>
#define mk make_pair
#define f(i,n) for(int i=0;i<n;i++)
#define fo(i,a,n) for(int i=a;i<n;i++)
#define fr(i,a,n) for(int i=a;i>=n;i--)
#define ll long long
#define N 1000000007
using namespace std;
int h,w;
vector<vector<int>> dp(1005,vector<int> (1005,-1));
char grid[1... | 0 | 805,645 |
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int 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++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pcnt(bit) __builtin_popcountll(b... | 0 | 20,013,139 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = 1LL<<60;
int main(int, char**) {
map<char, int> dics;
map<char, int> dict;
string s, t;
cin >> s >> t;
int n = s.size();
int cnt1 = 1;
int cnt2 = 1;
for (int i=0; i<n; i++) {
char c1 = s[i];
int now... | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int len = S.size();
map<char, int>m;
for (int i=0; i < len; i++) {
if (m.count(S[i]) > 0) {
m[S[i]] = m[S[i]] + 1;
} else {
... | 0 | 64,427,255 |
#include<cstdint>
#include<limits>
#include<cstdbool>
#include<cmath>
#include<iostream>
#include<vector>
#include<array>
#include<list>
#include<string>
#include<sstream>
#include<algorithm>
int main(){
int n;
std::cin>>n;
std::cin.get();
std::vector<int> x;
x.reserve(n);
std::string buff;
getline(std::cin,buff... | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a ... | 0 | 48,101,300 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
int main(){
long long a;
string b;
cin >> a >> b;
int aa,bb,cc,dd;
string aaa,bbb,ccc;
aaa=b[0];
bbb=b[2];
ccc=b[3];
aa=stoi(aaa)*100;
bb=stoi(bbb)*10;
cc=stoi(ccc);
dd=aa+bb+cc;
long long ans;
ans=dd*a... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p;
#define ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define RREP(i, x) for (... | 0 | 62,419,524 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s,t;
cin >> s >> t;
for(int i=0; i<s.length(); i++){
if(s.at(i) != t.at(i)){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | #include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include <functional>
#defi... | 0 | 56,734,346 |
#include"iostream"
#include"vector"
using namespace std;
int main()
{
int n;
cin>>n;
vector< vector<int> > matrix (n, vector<int>(n) );
vector<int> visit;
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)matrix[i][j]=0;
int y;
cin>>y;
int num;
cin>>num;
for(int j=0;j<num;j++)... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <deque>
#include <utility>
char S[304][304];
int main(){
int N;
scanf("%d", &N);
... | 0 | 5,380,216 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define PI 3.1415926535897932
#define MOD 1000000007;
using namespace std;
long long GCD(long long A,long long B){
if(B==0){
return A;
}
else{
return GCD(B,A%B);
}
}
long long LCM(long long A,long long B){
long long g=GCD(A,B);
return A/g*B;
}
long lon... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i];
}
long long sum = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i+1; j < n; j++) {
sum += d[i]*d[j];
... | 0 | 25,680,418 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; i++)
static const long long INF = 1000000;
using p = pair<int,int>;
int main(){
char s;
cin >> s;
char ans;
ans = s + 1;
cout << ans << endl;
} | #include "bits/stdc++.h"
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FOR(i, a) for (auto &i : a)
#define ALL(obj) begin(obj), end(obj)
#define MAX(x) *max_element(ALL(... | 0 | 71,073,784 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int table[1001][1001] = {};
int main()
{
string a, b;
cin >> a >> b;
for (int i = 0; i < a.size() + 1; i++)
{
table[i][0] = i;
}
for (int j = 0; j < b.size() + 1; j++)
{
table[0][j] = j;
}
for (int i = 1; i < a.size() + 1; i++)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int INF = 1000000009;
bool isOkmx(ll a,vector<int> v){
rep(i,v.size()){
a /= v[i];
a *= v[i];
}
return a >= 2;
}
bool isOkmin(ll a,vector<int> v){
rep(i,v.size()){
a ... | 0 | 54,336,465 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <stack>
#include <set>
#include <queue>
#include <iomanip>
#include <math.h>
#include <fstream>
using namespace std;
long long mod = 1000000007;
void dfs(int p, int prev, vector<int> &a, vector<int> &dp, int dpl, vector<vector<int>> &v, ... | #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;
cin >> N;
vector<int> H(N);
rep(i,N) cin >> H.at(i);
int ans = 0;
int cnt = 0;
rep(i,N-1) {
if (H.at(i) >= H.at(i+1)) cnt++;... | 0 | 19,984,664 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int ... | #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 | 82,381,911 |
#include <iostream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#include <algorithm>
#include <limits.h>
using namespace std;
typedef vector<int> vi;
typedef vector<pair<int,int> > vp;
int main()
{
while(1)
{
string s;
getline(cin,s);
if(s==".") break;
stack<cha... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h, w;
cin >> h >> w;
vector<vector<char>> data(h,vector<char>(w));
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin >> data.at(i).at(j);
}
}
vector<int> dx={-1,0,1,0};
vector<int> dy={0,1,0,-1};
bool jd = true;
for(int i=0;i<h;i... | 0 | 54,373,299 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<math.h>
using namespace std;
#define N (1000000000+7)
#define INF 1e16
typedef long long ll;
char c[10][10];
int main(void){
c[1][0]='.';
c[1][1]=',';
c[1][2]='!';
... | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#include <vector>
#include <map>
#include <unordered_map>
#include <cstdlib>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
using ll = long long;
template<... | 0 | 11,179,258 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<LL, LL> PLL;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#... | #include <bits/stdc++.h>
using namespace std;
long long Dp(int n , int k,int h[] , bool vis[] , long long dp[]){
if(vis[n]){
return dp[n];
}else{
vector <int> back;
for(int step = 1 ; step <= k ; step++){
if(n - step >= 0){
int x = Dp(n-step,k,h,vis,dp) + abs(... | 0 | 66,290,419 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n, k; cin >> n >> k;
vector<ll> sum(n + 1);
for(int i = 0; i < n; i++) {
int a; cin >> a; sum[i + 1] = sum[i] + a;
}
vector<ll> a;
for(int i = 0; i < n; i++){
for(int j = i + 1; j <= n; j++)a.push... | #include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
#include <cstdint>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph =... | 0 | 68,533,962 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
s1[0] = toupper(s1[0]);
s2[0] = toupper(s2[0]);
s3[0] = toupper(s3[0]);
cout << s1[0] << s2[0] << s3[0];
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main()
{
int n,i;
string out;
cin >> n;
switch(n){
case 1:
out = "1";
break;
case 2:
out = "2";
break;
case 3:
out = "6";
break;
case 4:
out = "24";
break;
case 5:
out = "120"... | 0 | 41,537,297 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template<typename T> using rev_priority_queue = priority_queue<T, vector<T>, greater<T>>;
template<class S, class T> void map_init(map<S, T> &m, S k, T v){if(!m.count(... | 0 | 69,460,792 |
#include<bits/stdc++.h>
using namespace std;
bool comp(pair<long long int,long long int>a,pair<long long int,long long int>b)
{
if(a.first==b.first)
{
if(a.second<=b.second)
return true;
else
return false;
}
if(a.first>b.first)
return true;
else return false;
}
lo... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define countof(a) (sizeof(a)/sizeof((a)[0]))
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i < (n); i++)
#define all(a) begin(a),end(a)
signed main()
{
cin.tie(0); ios::sync_with_stdio(false);
int N,A,B; cin ... | 0 | 97,116,013 |
#include<algorithm>
#include<iostream>
#include<cstdio>
#include<map>
#include<set>
using namespace std;
string s, t;
set<string> S;
void Work()
{
int lens = s.size();
int lent = t.size();
for(int i = 0; i < lens; i++)
{
if(s[i] == '?' || s[i] == t[0])
{
string tmp = s; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define LOG(...) fprintf (stderr, __VA_ARGS__)
#define pb push_back
#define mp make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
const int INF = 0x3f3f3f3f, N = 1005, M = 45;
const LL INFL = 0x3f3f3f3f3f3f3f3fll;
int n, x[... | 0 | 22,827,584 |
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
const long long mod = 1e9+7;
int main() {
int h1, m1, h2, m2, k; cin >> h1 >> m1 >> h2 >> m2 >> k;
int s = h1 * 60 + m1;
int e = h2 * 60 + m2;
cout << max(e - s - k, 0) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
const ll INF = 1L... | 0 | 47,381,605 |
#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, pimp, comp;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
pimp = a.size();
sort(a.begin(), a.end());
a.erase(unique(a.begin(),... | #include<bits/stdc++.h>
using namespace std;
#define lp(i,n) for(int i=0;i<n;i++)
#define lpin(a,i,n) for(int i=0;i<n;i++){cin>>a[i];}
int main(){
while(1){
int n,a,b,c,x;
cin>>n>>a>>b>>c>>x;
if(n==0&&a==0&&b==0&&c==0&&x==0) break;
int ans=0;
int j,i;
for(i=0;i<n;i++){
int rand;
ci... | 0 | 18,875,444 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 0;i<n;++i)
using ll = long long;
using P = pair<int,int>;
int main(){
int a,b,c;
cin >> a >> b >> c;
int x,y;
x = min(min(a,b),c);
y = max(max(a,b),c);
cout << y-x << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,a,b) for(int i=(a);i<(b);i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
using vint=vector<int>;
using pint=pair<int,int>;
u... | 0 | 60,869,259 |
#include<bits/stdc++.h>;
using namespace std;
int main(){
int a[5];
for( int s = 0; s < 5; s++){
cin >> a[s];
}
sort( a, a + 5, greater<int>());
for(int i = 0; i < 5; i++){
if( i < 4 ){
cout << a[i] << " ";
}else{
cout << a[i] << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define forn(i,a,b) for(int i=a;i<b... | 0 | 14,590,393 |
#include <bits/stdc++.h>
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
#define MOD 1000000007
using namespace std;
using ll = long long;
typedef vector<int> vi;
typedef pair<int, int> P;
#define rrep(i,a,b) for(int i=a;i>=b;i--)
template<class T> inline bool chma... | 0 | 50,642,578 |
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<time.h>
#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
#define all(in) in.b... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void){
int n,a[10000],min,max,sum;
long long int sum_ll;
min=1000000;
max=(-1000000);
sum_ll=0;
scanf("%d",&n);
for (int i=0;i<=n-1;i++){
scanf("%d",&a[i]);
if (min>a[i]){
min=a[i];
... | 0 | 38,784,536 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
int n;
cin... | #include<iostream>
#include<map>
using namespace std;
int main(){
long H,W,N;
cin >> H >> W >> N;
long ans[10];
for(int i=0; i<10; i++) ans[i] = 0;
ans[0] = (H-2)*(W-2);
map<pair<int,int>,int> m;
for(int t=0; t<N; t++){
long a, b;
cin >> a >> b;
for(int i = -1; i < 2;... | 0 | 86,048,646 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
template<class TYPE>
struct edge{
TYPE to,cost;
edge(TYPE t,TYPE c){
to = t;
cost = c;
}
};
int main(){
stri... | #include <iostream>
#include <string>
using namespace std;
bool check(int x) {
string S = to_string(x);
auto first = S.begin();
auto last = S.end();
--last;
while (first < last) {
if(*first != *last) {
return false;
}
++first;
--last;
}
return true... | 0 | 87,139,863 |
#include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a) accumulate(all(a), 0LL)
#define REP(i, n) for(int (i)=0; (i)<(n); (i)++)
#define RREP(i, n) for(int (i)=(n)-... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N,M,cnt=0;
cin >> N >> M;
vector<bool> c(N,true);
int tmpl = 1;
int tmpr = N;
for(int i=0; i<M; i++){
int l,r;
cin >> l >> r;
if(l > tmpl){
for(int j=tmpl-1; j<l-1; j++){
c.at(j) = ... | 0 | 93,629,118 |
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begi... | #include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int k,n;
cin>>k>>n;
int mario[n];
long sum=0;
for(int i=0;i<n;i++){
cin>>mario[i];
sum+=mario[i];
}
if(k-sum<0)
puts("-1");
else
cout... | 0 | 84,372,206 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
using namespace std;
typedef long long ll;
int main(){
ll mod = pow(10,9) + 7;
int n = 0;
cin >> n;
string str;
cin >> str;
ll res = 0;
res = 1;
for(int i ... | #include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <bitset>
#include<iomanip>
#include <map>
#include<set>
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <numeric>
using namespace std;
typedef long long ll;
typedef ... | 0 | 98,929,421 |
#include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int main() {
while (true) {
int t; cin >> t;
if (t == 0) break;
int x = 1000 - t;
int cnt = 0;
while (x > 0) {
if (x / 500 > 0) {
cnt += x / 500;
x %= 500;
} else if (x / 100 > 0) {
cnt += x / 1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
ll mod(ll A, ll M) {return (A % M + M) % M;}
const ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return t... | 0 | 59,894,773 |
#include<stdio.h>
int dat[100];
int main(){
int a,b,c,d,e;
while(scanf("%d%d%d%d%d",&a,&b,&c,&d,&e),a){
for(int i=0;i<a;i++)scanf("%d",dat+i);
int now=0;
int frame=-1;
int x=e;
while(frame<=10001&&now<a){
frame++;
if(dat[now]==x){
now++;
x=(x*b+c)%d;
}else{
x=(x*b+c)%d;
}
}
if(fr... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main( )
{
char a, b;
cin >> a >> b;
if (a == 'H') {
cout << b << '\n';
}
else {
if (b == 'H') {
cout << "D\n";
}
else {
cout << "H\n";
}
}
return... | 0 | 99,827,604 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,n) for (int64_t i=0; i<(n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
const vector<int> che={6,9... | #include<iostream>
#include <map>
#include<algorithm>
#include <string>
#include<vector>
#include <set>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, x, m;
cin >> n >> x >> m;
vector<int>r;
map<int, int>ar;
int cur = 0;
for (int i = 0; i < min(n, 200... | 0 | 83,086,385 |
#include <iostream>
using namespace std;
int n, s, cnt;
void dfs(int depth, int num, int sum) {
if (depth == 0 && sum == s) {
cnt++;
return;
}
if (num == 10 || depth == 0) return;
dfs(depth, num + 1, sum);
dfs(depth - 1, num + 1, sum + num);
}
int main() {
while (cin >> n >> s, n | s) {
cnt = 0;... | #include<iostream>
#include<map>
#include<vector>
#include<list>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<climits>
#include<ctime>
#include<cstring>
#define REP(i,p,n) for(int i=p;i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define rep_split(tok,a_str,re) for(char *tok = strtok((... | 0 | 34,854,499 |
#include <stdio.h>
int main(){
int H1, M1, H2, M2, K;
scanf("%d %d %d %d %d",&H1, &M1, &H2, &M2, &K);
int hours = H2 - H1;
int minutes = M2 - M1;
int sum = (hours * 60) + minutes;
int total = sum - K;
printf("%d\n", total);
return 0;
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for(int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
const int INF = (int)1e9;
const LL INFL = (LL)1... | 0 | 95,731,153 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
int main() {
fast_io;
int n,m;
cin>>n>>m;
vector<double> arr;
double total=0;
for(int i=0;i<n;i++) {
double num;
cin>>num;
total... | 0 | 45,653,054 |
#include<iostream>
#include<stack>
#include<cstdlib>
#include<string>
#include <utility>
#include<queue>
#include<algorithm>
#include<list>
using namespace std;
void print_list(const list<int>& dlist){
const list<int>::const_iterator itEnd = dlist.end();
for(list<int>::const_iterator it =dlist.begin();it !=itEnd;++... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
typedef pair<pii, int> piipi;
typedef pair<pii, pii> piipii;
#define mp make_pair
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define e... | 0 | 63,107,092 |
#include<iostream>
using namespace std;
int main(){
long long H,W;
cin >> H >> W;
bool iswrite=false;
int ncases=6;
long long S[ncases];
long long Vline, Hline;
long long Smax, Smin, Smid;
long long Stmp, ans;
if( W%3==0 ){
cout << 0 << endl;
return 0;
}else if( W... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 0 | 21,792,737 |
#pragma comment(linker, "/stack:20000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#include <x86intrin.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <typename T> using ... | #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>;
ll N, M, A, B;
void search(int start, vector<vector<ll>> &path, vector<ll> &dis, vector<ll> &prev) {
priority_queue<P, vector<P>, greater<P>> pq;
dis.at(start) = 0;
pq.... | 0 | 28,767,692 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
int N;
cin >> N;
vector<string> S(N);
rep(i,N) cin >> S[i];
int headB = 0;
int tailA = 0;
int AB = 0;
int other = 0;... | 0 | 7,026,495 |
#include <iostream>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A <= C && C <= B) cout << "Yes" << endl;
else cout << "No" << endl;
r... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N,M,A;
cin>>N>>M;
vector<int> D(N+100,-1000000),Z(0,0);
D[0]=0;
int set[10]={0,2,5,5,4,5,6,3,7,6};
unordered_map<int,int> MtoP;
for(int i=0; i<M; i++){
int A;
cin>>A;
MtoP[set[A]]=max(MtoP[set[A]],A);
Z.push_b... | 0 | 16,060,624 |
#include <iostream>
#include<math.h>
using namespace std;
int main()
{
int x=0,y=0,a=0;
for (a=1;;a++){
cin >> x;
cin >> y;
if ((x == 0)&&(y==0))break;
if (x<=y){
cout << x << " " << y << endl;
}
else{
cout << y << " " << x << endl;
}... | #include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", ... | 0 | 60,080,206 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int grid_n;
int paint_a;
cin >> grid_n >> paint_a;
cout << pow(grid_n, 2) - paint_a << endl;
} | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<lint>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
int ... | 0 | 42,911,908 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int N,K;
vector<pair<ll, ll>>v;
int main(){
cin>>N>>K;
for(int i=0;i<N;i++){
ll x,y;
cin>>x>>y;
v.push_back(make_pair(x,y));
}
sort(v.begin(),v.end());
ll ans=4*1000000000000000000;
for(int i=0;i<v.size()-1;i++){
for(int j=i+1;j<v.size();j... | #include <bits/stdc++.h>
using namespace std;
int main(){
long n,q;cin>>n>>q;
vector<vector<long>> graph(n+1);
for(int i=1;i<n;i++){
long a,b;cin>>a>>b;
graph[a].push_back(b);
graph[b].push_back(a);
}
vector<long> score(n+1,0);
vector<long> scoredp(n+1,0);
for(long i=... | 0 | 70,189,240 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | #include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <algorithm>
#include <cmath>
#include <stack>
#include <set>
using namespace std;
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define FOR(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
#define PUSH(n,v) for(int i=0; i<(n); i++) {int j; cin >>... | 0 | 47,791,501 |
#include <iostream>
#include <bitset>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
int main() {
int N, K; cin >> N >> K;
int a[N];
for (int i = 0; i < N; i++) cin >> a[i];
ll ans = INF;
for (int bit = 0; bit < (1<<N); bit++) {
int t = bitset<15>(bit).count();
if... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <queue>
#include <deque>
#include <list>
#include <set>
#include <functional>
#include <cmath>
#include <numeric>
#include <iomanip>
#define REP(i,n) for(lint i{}, i##_len=(n); i<i##_len; ++i)
#define DREP(i, h, j, w) f... | 0 | 52,871,815 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n, m, p;
while (cin >> n >> m >> p && n) {
int sum = 0;
int dl[n];
rep(i, n) {
cin >> dl[i];
sum += dl[i];
}
if (dl[m - 1... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#defin... | 0 | 57,144,485 |
#include<bits/stdc++.h>
using namespace std;
string s;
int N, K;
long long com(long long n, long long r) {
if(r < 0 || r > n) return 0;
else if(r == 1) return n;
else if(r == 2) return n * (n-1) / 2;
else return n * (n-1) * (n-2) / 6;
}
long long mypow(long long n, long long k) {
long long res = 1;
for(int i = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
map<long long, int> mp;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
long long x;
cin >> x;
mp[x]++;
}
long long a = 0, b = 0;
for (auto it = mp.rbegin(); it != mp.rend(); it++) {
if (it->second > 1) {
if (a == 0) {
a = it->first;
it... | 0 | 2,112,166 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll n,ans=0;
cin>>n;
ans+=n-1;
for(ll i=2;i<n;i++)
{
if(n%i==0)
ans+=(n/i - 1);
else
ans+=(n/i);
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(){
int... | 0 | 3,941,108 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100000 + 5, P = 1e9 + 7;
int n, m, x[N], y[N];
int main() {
scanf("%d%d", &n, &m);
ll ans = 0, psum = 0;
for (int i = 1; i <= n; ++i) {
scanf ("%d", &x[i]);
ans += 1ll * (i - 1) * x[i] - psum;
ans %= P... | #include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;
int main(){
int n,id=1,nv,ch,index,syuryo=1;
scanf("%d\n",&n);
int *A = new int[100040];
bool *B = new bool[100040];
int *C = new int[100040];
string *D = new string[100040];
int st,ed;
for(int i=0;i<=100040;i++){
A[i]=0;
... | 0 | 39,519,722 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
while(getline(cin, s)) {
if(s[0] == '.') break;
bool b = true;
int x = 0, y = 0;
char c[1000];
int top = 0;
for(int i = 0; i < s.size(); i++) {
if(s[i] == '(') {
x++;
c[top] = s[i];
top++;
}
else if(s[i... | #include <stdio.h>
#pragma warning(disable : 4996)
int N, Y, M, D;
int main()
{
scanf("%d", &N);
for (int i = 0; i < N; i++)
{
scanf("%d", &Y);
scanf("%d", &M);
scanf("%d", &D);
if (Y == 0 && M == 0 && D == 0) break;
int ret = 0;
for (int i = 1; i < Y; i++)
{
if (i % 3 == 0)
{
ret += 200;
... | 0 | 93,787,956 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <cctype>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <climits>
#include <iomanip>
using namespace std;
int main() {
int n, m,p;
cin >> n >> m;
vector<int> h(n+1);
for (int i = 0; i < n; i++)cin >... | #include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) for(int i=0;i < (n);i++)
#define ALL(obj) (obj).begin(),(obj).end()
using namespace std;
using P = pair<int,int>;
const long long INF = 1LL << 60;
const int IINF=100000000;
const int MOD = (int)1e9 + 7;
typedef long long ll;
vector<lo... | 0 | 62,428,432 |
#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()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
c... | #include <bits/stdc++.h>
#include <climits>
#include <sstream>
using namespace std;
long long modpow(long long a,long long n,long long mod){
long long res = 1;
while(n > 0){
res = res*a%mod;
n -= 1;
}
return res;
}
int main(){
int N;
cin >> N;
int D[N];
long long mod = 99... | 0 | 43,786,039 |
#include<iostream>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
int c=a*500;
if(c>=b)
cout<< "Yes"<<endl;
if(c<b)
cout<< "No"<<endl;
return 0;
} | #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 | 25,407,658 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long N;cin>>N;
long long A[N],B[N-1];
for(long long i=0;i<N-1;i++){
cin>>B[i];
}
A[0]=B[0];
for(long long i=1;i<N;i++){
if(i==N-1){
A[i]=B[i-1];
}
else{
A[i]=min(B[i],B[... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N, P;
string S;
cin >> N >> P >> S;
int64_t ans = 0;
if(10 % P == 0) {
for(int i=0; i<N; i++) {
if((S[i]-'0') % P == 0) {
ans += i+1;
}
}
} el... | 0 | 74,352,739 |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<iomanip>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1e9 + 7;
const int MAX = 1e9;
const ll LLMAX = 1e18;
const int INF = numeric_limits<int>::max();
const ll LLINF = nu... | #include <bits/stdc++.h>
#define pb push_back
#define fr first
#define sc second
#define MOD 1000000007
#define len(x) x.size()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define all(v) v.begin(), v.end()
#define f(i, a, n) for (int i = a; i < n; i++)
using namespace std;
typedef ve... | 0 | 39,537,927 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
string a,b;cin>>a>>b;
int a1,b1;
if(a[0]=='H')a1=1;
else a1=-1;
if(b[0]=='H')b1=1;
else b1=-1;
if(a1*b1==1)cout<<'H'<<endl;
else cout<<'D'<<endl;
return 0;... | #include<bits/stdc++.h>
#define Mx 1000000000005
#define ll long long
#define pi 3.141592653
#define vi vector<ll>
#define Mo 1000000007
#define mp make_pair
#define M map<ll,ll>
#define fr(i,a,b) for(ll i=a;i<b;i++)
#define vii vector<pair<ll,ll> >
#define fi first
#define se second
#define pb push_back
#define ld... | 0 | 66,579,599 |
#include <iostream>
#include <string>
#include <stdlib.h>
using namespace std;
string s[9]={".,!? ", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
int main(){
int n;
string input;
cin >> n;
for(int i=0; i<n; i++){
char output[76] = "";
cin >> input;
char num = '0';
int kaisu = 0;
... | #include <iostream>
int main() {
int i, j, num, count, min, min_index, temp;
int ary[110];
std::cin >> num;
for (i = 0; i <= num - 1; i++) std::cin >> ary[i];
count = 0;
for (i = 0; i <= num - 2; i++) {
min = ary[i];
min_index = i;
for (j = i; j <= num - 1; j++) {
if (min > ary[j]) {... | 0 | 5,791,410 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
int N, ans = 0;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++){
cin >> A.at(i);
}
... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
using name... | 0 | 4,808,786 |
#include<bits/stdc++.h>
using namespace std;
using p=pair<int,int>;
#define int long long
#define rep(i,N) for(int i=1;i<=N;i++)
signed main(){
int N;
cin>>N;
int ans=0;
rep(i,N){
int yaku=0;
rep(j,i){
if(i%j==0)yaku+=1;
}
if(i%2==1&&yaku==8)ans+=1;
}
cout<<ans<<endl;
return 0;
} | #include<iostream>
using namespace std;
int main(){
int N;
bool judge=false;
cin>>N;
for(int a=0;a<=N/4;++a){
for(int b=0;b<=N/7;++b){
if(4*a+7*b==N){
judge=true;
break;
}
}
}
... | 0 | 40,222,897 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n+1); i++)
int main() {
int A,B,K;
cin>>A>>B>>K;
rep(i,100){
if(A%(100-i)==0&&B%(100-i)==0){
K--;
... | #include<bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define ll long long
#define maxheap priority_queue<int>
#define minheap priority_queue<int,vector<int>,greater<int>>
const long double eps = 1e-2;
const long double pi = acos(-1.0);
using namespace std;
const int N = 1e5 + 1;
const int LO... | 0 | 48,276,648 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep1(i, n) for(int i = 1; i < n+1; i++)
#define all(A) A.begin(),A.end()
typedef long long ll;
int main(){
int x;
cin >> x;
vector<int> kyu={400,600,800,1000,1200,1400,1600,1800,2000};
int ans = 0;
rep(i,9){
... | #include<bits/stdc++.h>
using namespace std ;
int n ;
pair < long long , int > d[100010] ;
int nChild[100010] ;
map < long long , int > f;
vector < pair < int , int > > lis ;
int main(){
#define NAME "example"
ios_base :: sync_with_stdio(false) ;
cin >> n ;
for (int i = 1; i <= n; ++ i) cin >> d[i].firs... | 0 | 66,538,702 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define INIT(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i... | #line 1 "../lib/template.hpp"
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define vi vector<int>
using namesp... | 0 | 87,457,048 |
#include<iostream>
#include<vector>
#include<set>
#include<unordered_map>
using namespace std;
int gcd(int a,int b){
if(a==0||b==0){
return a+b;
}
return gcd(b%a,a);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REP1(i, n) for(int i = 1; i <= (n); i++)
#define REPD(i,a,b) for (int i=(a);i<=(b);i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> ... | 0 | 65,469,059 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
const double PI=3.14159265358979;
const ll INF= pow(10,18);
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
string abc="abcdefghijklmnopqrst... | #include <iostream>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
#include <string.h>
#include <algorithm>
using namespace std;
int main(int argc, char const* argv[])
{
int n,k;
while (cin >> n >> k)
{
if (n == 0 && k==0)
{
break;
}
vector... | 0 | 32,202,432 |
#include <bits/stdc++.h>
#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 FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {
return os << '(' << p.... | 0 | 64,274,410 |
#include <bits/stdc++.h>
using namespace std;
struct dat {
int a,b,c;
};
int G[100][100];
int main() {
int n,m; cin >> n >> m;
for(int i=0;i<n;++i)
for(int j=0;j<n;++j)
G[i][j]=1e9;
for(int i=0;i<n;++i) G[i][i]=0;
vector<dat> abc(m);
for(auto &e:abc) {
cin >> e.a >> e.b >> e.c;
--e.a; --e.b;
G[e.a][e.b... | #include <iostream>
#include <cstdlib>
#include <string>
void alphabetCase(char &moji);
void change(std::string &str);
int main(void) {
std::string target;
std::getline(std::cin, target);
change(target);
std::cout << target << std::endl;
return EXIT_SUCCESS;
}
void alphabetCase(char &c) {
int ... | 0 | 10,211,822 |
#include <bits/stdc++.h>
#define rep(i,N) for(int i = 0; i < N;i++)
#define ALL(a) (a).begin(),(a).end()
#define ll long long int
using namespace std;
ll dig(ll N, ll K) {
ll dig = 0;
while (N) {
dig++;
N /= K;
}
return dig;
}
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a%b);
}
ll lcm(ll a, ll b)... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int n,K; cin>>n>>K;
vector<int> p(n),q(n,0);
rep(... | 0 | 21,027,503 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep0(i, n) for (int i = 0; i <= (n); i++)
#define rep2(a, n) for (int i = a; i < (n); i++)
#define rep3(i, a, n) for (int i = a; i < (n); i++)
#define maxs(x, y) (x = max(x, y))
using namespace std;
using ll = long long;
const ll INF = 1LL... | #include <bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);
int main(){
fastIO;
int N;
cin >> N;
vector<long long> x(N+1,0);
vector<long long> y(N+1,0);
vector<long long> t(N+1,0);
for(int i=1; i<N+1; i++){
cin >> t[i] >> x[i] >> y[i];... | 0 | 75,823,253 |
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 2e5 + 10;
const int INF = 0x3f3f3f3f;
const ... | #include <bits/stdc++.h>
using namespace std;
#define forn(i, x, n) for (int i = int(x); i <= int(n); ++i)
#define for1(i, n, x) for (int i = int(n); i >= int(x); --i)
#define F first
#define S second
#define pb push_back
typedef long long ll;
typedef pair <int, int> pii;
typedef long double ld;
typedef vector <ll> vi;... | 0 | 43,125,946 |
#include<bits/stdc++.h>
using namespace std;
vector<string> ss;
int n;
bool works(int a, int b) {
bool ans = true;
for(int i=0;i<n;i++) {
for(int j=i;j<n;j++) {
int x1 = (i + a) % n;
int y1 = (j + b) % n;
int x2 = (j + a) % n;
int y2 = (i + b) % n;
ans = ans && (ss[x1][y1] == ss[x2... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(int argc, char const *argv[])
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s, t;
cin >> s >> t;
int m = s.length(), n = t.length(), same, ans = 0;
for(int i = 0; i <= m-n; i++)
{
same = 0... | 0 | 36,791,200 |
#include <iostream>
#include <string>
#include <stdio.h>
using namespace std;
int ps,pt;
int sdiff(string sx, string tx)
{
if(sx == tx)
{ps=1; pt=1;}
else if(sx > tx)
{ps=3; pt=0;}
else
{ps=0; pt=3;}
return 0;
}
int main(void)
{
int n,k,is,it;
string s[1001]={},t[1001]={};
cin >> n;
is=0; it... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i < (int)n;++i)
int main() {
int n,m;cin>>n>>m;
pair<ll,ll>a[n];
rep(i,n){
cin>>a[i].first;
cin>>a[i].second;
}
sort(a,a+n);
ll ans = 0;
ll cc = 0;
rep(i,n){
if(cc + a[... | 0 | 77,147,369 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.