code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <functional>
#include <bitset>
#include <cmath>
#include <stack>
#include <iomanip>
#include <map>
#include <math.h>
#include <list>
#include <deque>
typedef long long ll;
using namespace std;
template<class T> inline bool chmax(T& a,... | #include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
int count = 0;
for (int i = 0; i <= 9; i++)
for (int j = 0; j <= 9; j++)
for (int k = 0; k <= 9; k++)
for (int l = 0; l <= 9; l++) {
if (i + j + k + l == n) count++;
}
... | 0 | 97,594,629 |
#include <bits/stdc++.h>
using namespace std;
int main(){
constexpr int Nalp= 26;
string S;
cin >> S;
vector<int> data;
bitset<Nalp> appear;
for(auto c:S){
int ord= c- 'a';
data.emplace_back(ord);
appear.set(ord);
}
if(data.size() < Nalp){
int ord_tail= 0;
while(appear.test(ord_tail)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const ll inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
ll n, a, b, c, x;
int main()
{
while (cin >> n >> a >> b >> c >> x)
{
if (n == 0)
return 0;
vector<ll> y(n);
for (int i ... | 0 | 54,000,789 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
#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 x1, y1, x2, y2;
cin >> x1 >> y1 >... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define deb(x) cout<< #x << " " << x << "\n";
#define MAX 9223372036854775807
#define MIN -9223372036854775807
#define PI 3.141592653589
#define setbits(n) __builtin_popcountll(n)
const ll mod=1e9+7;
#includ... | 0 | 38,813,412 |
#include<bits/stdc++.h>
using namespace std;
int d[1000001];
int main()
{
int n;cin>>n;
for(;;n++)if(n%10==((n/10)%10)&& n%10==(n/100)%10){cout<<n<<endl;return 0;}
} | #include<stdio.h>
int make_ans(int n,int x) {
int a,b,c,total=0;
for(a=1;a<=n;a++) {
for(b=a+1;b<=n;b++) {
for(c=b+1;c<=n;c++) {
if(a+b+c==x) total++;
}
}
}
return total;
}
int main() {
int n,x,i=0,k,limit=100,ans[limit];
while(1) {
... | 0 | 7,969,959 |
#include <iostream>
using namespace std;
int main(){
while(true){
string s;
string bottom;
string top;
int m;
int h;
cin >> s;
if(s=="-")break;
cin >> m;
for(int i=0; i<m; i++){
cin >> h;
bottom = s.substr(0, h);
top = s.substr(h, s.length()-h);
for(int i=0;... | #include <list>
#include <cstdio>
#include <iostream>
using namespace std;
int main(){
list<int> L;
int n; scanf("%d",&n);
for(int i=0;i<n;i++){
char com[20];
scanf("%s",com);
if(com[0]=='i'){
int x; scanf("%d",&x);
L.push_front(x);
}else if(com[6]=='F'){
L.pop_front();
}else... | 0 | 81,137,725 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
string s;
cin >> s;
ll n = s.size();
ll sum = 1 + n * (n-1) / 2;
vector<ll> c(26, 0);
rep(i, 0, n) c[s[i] - 'a']++;
rep(i, 0, 26) sum ... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <climits>
#include <math.h>
#include <bitset>
#define P pair
#define X first
#define Y second
#define VSORT(v) sort(v.begin(), v.end())
#define VREV(v) reverse(v.begin(... | 0 | 18,120,631 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
int main(){
int n,k; cin>>n>>k;
cout << !!(n%k)<<endl;
} | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack> ... | 0 | 42,041,611 |
#include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (int)(n); ++... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a; i<b; i++)
#define lli long long
#define pb push_back
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int main()
{
fast
int x,y;
cin>>x>>y;
if(y%2)
cout<<"No";
else{
if(y>=2*x && y<=4*x)
c... | 0 | 66,209,042 |
#include <iostream>
using namespace std;
int main(void){
int n;
cin>>n;
int a[n];
for (int i = 0; i < n; i++)cin>>a[i];
long int scr=1000,cnt=0;
for (int i = 0; i < n-1; i++)
{
cnt=0;
if(a[i]<a[i+1]){
cnt=scr/a[i];
scr+=(a[i+1]-a[i])*cnt;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int mx = 1e6;
vector<int> z(mx + 1);
for (int i = 2; i * i <= mx; i+... | 0 | 73,880,364 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#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)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll n,l,la=2,... | 0 | 19,470,982 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
const ll INF = 1e18;
int main(){
ll n;
cin >> n;
ll a[n];
rep(i,n) cin >> a[i];
ll ans = 0;
while(true) {
bool can = true;
rep(i,n) {
if(a[i] >= n) can = false;
}
if(can... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin>>n;
string str1,str2;
vector<int> ans(n);
cin.ignore();
for(int i=0; i<n; i++){
vector<char> a;
vector<char> b;
getline(cin,str1);
for(int j=0; j<(int)str1.size(); j++){
char ch=str1[j];
a.push_back(c... | 0 | 4,320,000 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n);
int x;
for (int i = 0; i < n; i++) {
cin >> x;
x -= i + 1;
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cerr << #x << " = " << x << endl;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e); ++it)
#define MSET(c, v) memset(c, v, sizeof(c))
const int INF = ... | 0 | 32,661,828 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i= 0;i<(n);++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const long long INF = 1LL << 60;
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)... | #include <bits/stdc++.h>
#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 reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (in... | 0 | 62,647,801 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
int main()
{
std::string s;
std::cin >> s;
int n;
std::cin >> n;
for (int i = 0; i < s.length(); i += n) {
std::cout << s[i];
}
putchar('\n... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int MOD = 1e9+7;
const int mxN = 300005;
int mat[100][100];
int countPairs(int N,int D)
{
int count = 0;
for(int i = 0; i < N - 1; i++)
{
for(int j = i + 1; j < N ; j++)
{
int norm = 0;
... | 0 | 2,446,608 |
#include<bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
string s;
cin >> n >> s >> k;
char c = s[k-1];
for(int i = 0; i < n; i++){
if(s[i] != c) cout << "*";
else cout << c;
}
cout << endl;
return 0;
} | #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 pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;
ll a[100001],b[100001];
int main(){
int n;
ll k;
cin>>n>>k;
rep(i,n) cin>>a[i]>>b[i];
ll mx=0;
rep(i,n... | 0 | 66,762,157 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int N,A,B;
cin>>N>>A>>B;
cout<<max(0LL,(A+B*(N-1))-(A*(N-1)+B)+1)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#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 RREP(i,n) for (int i=(n)-1;i>=0 ;i--)
#define EACH(i,a,b) for (int i=(a) ;i<=(b);i++)
#define ALL(a) ... | 0 | 61,276,154 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<cstring>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<climits>
#include<fstream>
#define MOD (1000000007)
using namespace std;
typedef long long ... | 0 | 46,922,652 |
#include<bits/stdc++.h>
#include <cstdio>
using namespace std;
#define ll long long
#define PB push_back
#define ld long double
#define ff first
#define ss second
# define st(v) (v).begin(),(v).end()
#define pr pair<int,int>
using namespace std::chrono;
const int N = 1e5+4 , M=N,inf=(int)1e9;
const ll mod=1e9+7;
int... | #include<cstdio>
int main(){
int h,w;
scanf("%d %d", &h, &w);
while(h && h){
for(int i = 0; i < h ; i++){
for(int j = 0; j < w; j++){
if(i * j && ((i - h + 1) * (j - w + 1)))
{
printf(".");
}else{
printf("#");
}
}
printf("\n");
}
printf("\n");
scanf("%d %d", &h, &w);
}
} | 0 | 88,706,187 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define printYes() cout << "Yes" << endl;
#define printNo() cout << "No" << endl;
#define printVector(v) rep(i, v.size()) cout << v[i] << endl;
int main()
{
int N;
cin >> N;
vector<int> A(N);
rep(i, N)
{
cin... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse=false, ll num=0){
if(num == 0) num = (ll)v.size();
cout << endl; cout << "i= ";for(ll i=0; i<num; i++) cout << i << " ";cout << endl;
cout << " ";
if(is_reverse) f... | 0 | 32,810,826 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<math.h>
#include<limits>
#include<list>
#include <stdio.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0;i < (n); ++i)
#pragma GCC optimize("Ofast")
int main() {
int n;
cin >> n;
vector<int>d... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | 0 | 64,010,977 |
#include <bits/stdc++.h>
#define slld(longvalue) scanf("%lld", &longvalue)
#define ll long long
#define ull unsigned long long
#define pll pair < long long, long long >
#define fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define bug printf("BUG\n")
#define mxlld LLONG_MAX
#def... | #include"bits/stdc++.h"
using namespace std;
int main() {
string S;
cin >> S;
string s = S.substr(0, 4);
cout << (s == "YAKI" ? "Yes" : "No") << endl;
return 0;
} | 0 | 25,637,496 |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define uint unsigned
#define pii pair<int,int>
#define pll pair<ll,ll>
#define PB push_back
#define fi first
#define se second
#define For(i,j,k) for (int i=(int)(j);i<=(int)(k);i++)
#define Rep(i,j,k) for (int i=(int)(j);i>=(int)(k);i--)
#define CLR... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int h, w;
cin >> w >> h;
vector < pair < int, int > > v;
for(int i = 0; i < w; i++){
int p;
cin >> p;
v.push_back({p, 0});
}
for(int i = 0; i < h; i++)... | 0 | 87,138,815 |
#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>;
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n=1):n(n), f(n+1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i]) continue;
primes.push... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i < n; i++)
#define rep3(i, x, n) for(int i = x; i > n; i--)
long long MOD = 1e9+7;
long long INF = 1e15;
typedef pair<long long, long long> P;
int main(){
int N, M;
cin >> N >> M;
... | 0 | 17,205,257 |
#include <iostream>
using namespace std;
void ABC130(void);
void ABC131(void);
void ABC132(void);
void ABC133(void);
void ABC134(void);
void ABC135(void);
void ABC136(void);
void ABC137(void);
void ABC138(void);
void ABC139(void);
int main(void){
ABC139();
}
void ABC139(){
int i,n=0;
string s,t;
cin>>s>... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 0 | 7,082,206 |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0); cin.tie(0);
int n; string s; cin >> n >> s;
set<string> str;
set<char> c0, c1, c2;
for(int i=0;i<n-2;i++) {
if(c0.size() == 10) break;
else if(c0.count(s[i])) continue;
else {
for(int j=i+1;j<n-1;j++) {
... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
typedef pair<LL, LL... | 0 | 36,010,099 |
#include <iostream>
using namespace std;
long long ans,sum,a[100010],b[100010],n,k,l;
int main(){
int i,j;
cin >> n >> k;
for(i=0;i<n;i++){
cin >> a[i] >> b[i];
if((k | a[i]) == k){
ans += b[i];
}
}
for(j=0;j<=30;j++){
if(k & (1<<j)){
l = (k - (1<<j))|((1<<j)-1);
sum = 0;
for(i=0;i<n;i++){
... | #include <bits/stdc++.h>
using namespace std;
int read();
int n, L, T;
int M(int x) { return x >= L ? x - L : x; }
int x[200005], dire[200005], q[2];
int res[200005];
vector<int> p[2];
int tmp;
int to(int a) {
int rt = M((x[a] + (dire[a] ? 1 : -1) * T) % L + L);
rt += L - tmp;
return rt > L ? rt - L : rt;
}... | 0 | 84,081,608 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin>>N>>K;
vector<int64_t>A(N);
for(int i=0;i<N;i++)
cin>>A.at(i);
vector<int64_t>B(N);
int64_t b=0;
for(int i=0;i<N;i++){
if(0<=A.at(i))b+=A.at(i);
B.at(i)=b;
}vector<int64_t>C(N-K+1);
int64_t c=0;
for(int i=0;i<K;i++)
... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
const int MAX_K=5000;
int main(){
long long N, K;
cin >> N >> K;
long long a[N];
long long sets[MAX_K]={}, sets_next[MAX_K]={};
long long tmp;
long long ans;
long long imax, imin, ii, ians;
bool flag;
for(lo... | 0 | 96,355,246 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1e9+7
#define rep(i,n) for(ll i=0;i<n;i++)
const int maxn = 1000000;
ll mod = INF;
ll gcd(ll a,ll b){
if(a<b)swap(a,b);
if(b==0)return a;
else return gcd(b,a%b);
}
int main(){
ll a,b;
cin >> a>>b;
cout << a*b/gcd... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i =... | 0 | 13,950,259 |
#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,string>;
int main() {
int n,k;
cin >> n >> k;
int s = 1;
rep(i,n){
if(s*2 < s+k) s *= 2;
else s += k;
}
cout << s << endl;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | 0 | 99,997,377 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
int N;
cin >> N;
int a[N+1];
rep(i,N) cin >> a[i+1];
int ans = 0;
for (int i = 1; i <= N; i++) {
if (a[a[i]] == i) ans++;
}
ans /= 2;
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string.h>
#include <stdio.h>
#include <map>
#include <vector>
#include <math.h>
#include <algorithm>
#include <queue>
#include <set>
#include <tuple>
using namespace std;
#define rep(i,a) for(int i=0; i<a; i++)
#define rrep(i,a) for(int i=a; i>=0; i--)
#define rep1(i,a) for(int i=1; i<=a; ... | 0 | 70,610,633 |
#include <iostream>
using namespace std;
int main()
{
int N,M;
cin>>N>>M;
cout<<N*(N-1)/2+M*(M-1)/2<<endl;
return 0;
} | #include <bits/stdc++.h>
int main() {
int first[3][10];
int second[3][10];
int thired[3][10];
int force[3][10];
for(int tk = 0; tk < 3; ++tk) {
for(int num = 0;num < 10; ++num) {
first[tk][num] = 0;
second[tk][num] = 0;
thired[tk][num] = 0;
force[tk][num] = 0;
}
}
int n;
... | 0 | 16,313,749 |
#include <iostream>
using namespace std;
void checkboard(void);
void startmove(void);
int checked(int i,int j);
char board[21][21];
int H,W,now[2];
int main(void){
while(1){
cin >> H >> W ;
if (!H && !W) break;
for(int i=0;i<W;i++){
for(int j=0;j<H;j++){
cin >> board[i][j];
if(board[i][j]=='@'){
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,k,sum=0;
cin>>a>>b>>c>>k;
while(k--)
{
if(a>0)
{
sum=sum+1;
a--;
}
else if(b>0)
{
sum=sum+0;
b--;
}
else if(c>0)
{
... | 0 | 27,018,255 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include <iostream>
#include <string>
using namespace std;
int main(){
int n, taro, hanako;
string a, b;
cin >> n;
taro = 0;
hanako = 0;
for(int i = 0; i < n; i++) {
cin >> a >> b;
if (a > b) {
taro += 3;
}
else if (a < b) {
hanako += 3;
}
else {
taro += 1;
ha... | 0 | 20,566,292 |
#include<cstdio>
#include <algorithm>
using namespace std;
int main(void)
{
int arr[3];
scanf("%d %d %d",&arr[0],&arr[1],&arr[2]);
sort(arr,arr+3);
printf("%d %d %d\n",arr[0],arr[1],arr[2]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
const int MOD = 1000000007;
int main() {
ll x,y;cin >> x >> y;
ll cnt = x;
ll ans = 0;
while(x <= y){
ll a = 2;
while(true){
if(a*x%x=... | 0 | 91,252,356 |
#include <bits/stdc++.h>
#define loop2(i, s, n, a) for (int i = int(s); i < int(n); i += a)
#define loop(i, s, n) loop2(i, s, n, 1)
#define rep(i, n) loop(i, 0, n)
#define pb push_back
#define all(in) in.begin(),in.end()
using ll = long long;
using ull = unsigned long long;
using namespace std;
int main(){
string s... | #include<iostream>
#include<algorithm>
#include<vector>
#include<map>
using namespace std;
int N;
int main(){
cin >> N;
vector<int> primes;
vector<int> table(101, 1);
table[0] = 0;
table[1] = 0;
for(int i = 2; i < 101; i++){
if(table[i] == 0) continue;
int j = 2*i;
while(j < 101){
table[j]... | 0 | 80,726,202 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
long double const pi = std::acos(-1.0L);
int main() {
string a, b;
cin >> a >> b;
if(a.size()==b.size()){
if(a>b) cout << "GREATER" << endl;
else if(a<b) cout << "LESS... | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
struct primegroup{
vector<int> r;
primegroup(int n){
r = vector<int>(1000001, 0);
r[1] = n;
}
void unite(int x){
for(int i=2; i*i<=x; i++){
if(x%i != 0) continue;
... | 0 | 61,024,452 |
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <list>
#include <time.h>
#include <math.h>
#include <random>
#include <deque>
#include <queue>
#include <cassert>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#inc... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<pair<ll, ll>> prime_factorize(ll n) {
vector<pair<ll, ll>> res;
for (ll i = 2; i * i <= n; i++)
{
if (n % i != 0)
{
continue;
}
int num = 0;
while (n % i == 0)
{
... | 0 | 13,472,951 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n,k,t,d;
cin... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define PI acos(-1)
typedef long long ll;
ll gcd(ll x,ll y){
if(y==0) return x;
else return gcd(y,x%y);
}
ll lcm(ll x,ll y){
return x/gcd(x,y)*y;
}
int main(){
int n,m;
cin>>n>>m;
int l=1;
int r=n;
rep(i,m){
... | 0 | 76,393,942 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,x,to) for(int i=x;i<to;i++)
string replace(string trans,int a,int b,string re){
rep(i,a,b+1){
trans[i]=re[i-a];
}
return trans;
}
string print(string trans,int a,int b){
string transs = trans;
trans = trans.substr(a,b-a+1);
cout << trans << endl;
ret... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
sort(&s[0],&s[2]+1);
cout << (s=="abc"?"Yes":"No");
return 0;
} | 0 | 70,524,513 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Map = map<string,ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
ll INF=1LL<<60;
ll MOD=1000000007;
int main(){
ll N;
cin >> N;
vector<ll> A(N,0);
vector<P> B(N);
for(ll i=0;i<N;i++){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1'000'000'007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define rep(i, n) for(ll i=0; i<(ll)(n); i++)
#define repd(i, n) for(ll i=n-... | 0 | 5,822,849 |
#include <iostream>
using namespace std;
int main()
{
int n;
while(cin >> n, n){
char a,b;
char d[1000];
for(int i = 0; i < 1000; i++)
d[i] = -1;
while(n > 0){
n--;
cin >> a >> b;
d[a] = b;
}
cin >> n;
char *s = new char[n+1];
for(int i = 0; i < n; i++){
cin >> a;
if(d[a] != -1)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 998244353
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>b;--i)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pii... | 0 | 37,228,668 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
int N,ans;
typedef pair<int,int> P;
P R[100],B[100];
vector<P> C[100];
map<P,int> used;
int main(void){
cin >> N;
rep(i,N)cin >> R[i].second >> R[i].first;
rep(i,N)cin >> B[i].first >> B[i].second;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
const int N = 2*1e5+5;
ll a[N];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll n; cin >>n;
for(int i = 0; i<n; i++) cin >>a[i];
ll ans = 0;
for(int i = 1; i<n; i++){
if(a[i-1] > a[i]){... | 0 | 75,856,973 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair <ll,ll> P;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define REPR(i, n) for(int i = n-1; i >= 0; i--)
#define FOR(i, n, m) for(int i = n; i < (int)(m); i++)
#define PRINT(x) cout << x << endl
#define ALL(v) v.begin(), v.end()... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | 0 | 10,889,928 |
#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, p;
cin >> n >> p;
vector<int> a(n);
for (int& i : a) cin >> i;
ll c0 = 0, c1 = 0;
for (int i : a) ++(i & 1 ? c1 : c0);
c0 = 1ll <<... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using Graph = vector<vector<int>>;
int c=0;
vector<bool> seen;
vector<vector<int>> s;
void dfs(const Graph &G, int v) {
seen.at(v) = 1;
for(auto nv : G.at(v)) {
if(seen.at(nv))
continue;
s.at... | 0 | 25,596,646 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/gcd((a),(b))
const int maxn = 1e9 + 5;
#define INF 1000000000
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264... | #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <cmath>
#include <complex>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define FOR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#define rep(i,n) FO... | 0 | 7,759,413 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main()
{
int t=1;
while( t-- )
{
int k;
cin>>k;
string s;
cin>>s;
if( s.size()<=k )
cout<<s;
else
{
for( int i=0 ; i<k ; i++ )
... | #include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define testcase int t;cin>>t;while(t--)
#define fast_io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define pb push_back
#define P pair<int,int>
int n,a[1000000][3];
int dp[1000000][3];
int func(int i,int j)
{
if(i==n) return 0;
if(dp[i]... | 0 | 25,959,743 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int t,n;
cin>>t>>n;
int ar[t];
for(int i=0;i<t;++i) cin>>ar[i];
sort(ar,ar+t,greater<int>());... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
c... | 0 | 40,670,140 |
#include <stdio.h>
int
main(void)
{
char line[80];
int a[5000];
int n;
while (fgets(line, sizeof line, stdin)) {
if (sscanf(line, "%d", &n) == 1) {
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
if (fgets(line, sizeof line, stdin) == NULL) {
return 1;
}
if (sscanf(line, "%d", &... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 12,828,154 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
string op;
cin >> A >> op >> B;
char c = op.at(0);
if (c=='+') {
cout << A+B << endl;
}
else {
cout << A-B << endl;
}
} | #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 | 17,853,534 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m,sum=0;
cin>>n>>m;
int arr[m];
for(int i=0;i<m;i++) {
cin>>arr[i];
sum+=arr[i];
}
if(sum>n) cout<<-1<<endl;
else cout<<n-sum<<endl;
} | #include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int A[200010];
int num[N+1] = {0};
for(int i = 0; i < N; i++) {
cin >> A[i];
++num[A[i]];
}
int c = 0;
for(int i = 0; i <= N; i++){
if(num[i] != 0) ... | 0 | 77,912,856 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | #include <bits/stdc++.h>
using namespace std;
#define MAX 100000
struct node{
int p, r, l;
};
node d[MAX+1];
int depth[MAX+1];
int dep(int key, int num){
depth[key] = num;
if(d[key].r != -1) dep(d[key].r, num);
if(d[key].l != -1) dep(d[key].l, num+1);
}
int main(){
int n;
cin >> n;
for(int i = 0; i < n; i... | 0 | 86,642,698 |
#include <iostream>
using namespace std;
int main()
{
string s;
cin >> s;
string tmp = "2019/04/30";
if (s <= tmp) cout << "Heisei" << "\n";
else cout << "TBD" << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;
cin >> n >> m;
vector<int> A(m);
for(int i = 0; i < m; i++){
cin >> A[i];
}
int answer = n;
for(int i = 0; i < m; i++){
answer = answer - A[i];
}
if(answer >= 0){
cout << answer;
} else {
cout << -1;
}
} | 0 | 29,486,883 |
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#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_... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(void){
ll h, w;
cin >> h >> w;
ll a, b, c;
ll mi = 100000000;
for(int i = 1; i < h ; i++){
a = i * w;
b = ceil((h - i) / 2.0) * w;
c = floor((h - i) / 2.0)... | 0 | 94,447,287 |
#include <bits/stdc++.h>
#define arep(a,i,n) for(ll i=(a);i<(n);i++)
#define rep(i,n) for(ll i=0;i<(n);i++)
#define cinf(x,n) for(ll i=0;i<(n);i++)cin>>x[i];
#define coutf(x,n) for(ll i=0;i<(n);i++)cout<<x[i]<<endl;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
int a... | #include <bits/stdc++.h>
using namespace std;
int n;
string s,t;
int main()
{
scanf("%d",&n);
cin >> s >> t;
for(int i=n;i >= 0;i--)
if(s.substr(n-i) == t.substr(0,i))
{
printf("%d\n",2*n-i);
return 0;
}
} | 0 | 21,532,549 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
#define P pair<int, int>
using namespace std;
int main(){
string s;
cin >> s;
ll n = s.size();
ll num = 0;
ll cnt = 0;
for(ll i = n-1... | #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()
{
string s;
cin >> s;
int n = s.size();
bool ok = true;
rep (i, n / 2)
if (s[i] != s[n - 1 - i])
ok = false;
rep (i, (n - 1) / 2 / 2)
if... | 0 | 94,723,805 |
#include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(void) {
vector<int64_t> SIZE(4);
int64_t N;
cin >> SIZE[0] >> SIZE[1] >> SIZE[2] >> SIZE[3] >> N;
int64_t answer = 0;
vector<int64_t> QHSD(4);
int times = 8;
for (int j ... | #include <bits/stdc++.h>
using namespace std;
using tpl = tuple<int, int, int>;
typedef pair<int,int> pii;
typedef long long ll;
void fastStream(){cin.tie(0);std::ios_base::sync_with_stdio(0);}
const int INF = 1 << 29;
vector<pii> G[100010];
int d[100010];
int main(){
int K;
cin >> K;
for(int i = 0; i < K; ... | 0 | 14,906,323 |
#include <algorithm>
#include <cstdio>
#include <climits>
#include <vector>
using namespace std;
int main() {
while(true) {
int n,k; scanf("%d%d", &n, &k);
if(n==0) break;
static int a[100001];
a[0] = 0;
for(int i = 0; i < n; i++) {
int x; scanf("%d", &x);
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 100005
vector<int> adj[N];
ll d[N];
pair<ll,int> in[N];
int sz[N];
int dsz[N];
ll dd[N];
void dfs(int node) {
dsz[node] = 1;
for(int ch : adj[node]) {
dfs(ch);
dsz[node] += dsz[ch];
dd[node] += dd[ch] + dsz[ch];
}
}
bool dfs2... | 0 | 95,333,252 |
#include<iostream>
using namespace std;
int main(void) {
int suma, sumb, tmp;
int i;
suma = 0;
for(i = 0; i < 4; i++) {
cin >> tmp;
suma += tmp;
}
sumb = 0;
for(i = 0; i < 4; i++) {
cin >> tmp;
sumb += tmp;
}
cout << max(suma, sumb) << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <iomanip>
#define intt long long
int main() {
intt N; std::cin >> N;
std::map<std::string, int> MAP;
std::vector<std::string> s(N);
for (auto& r : s) {
std::cin >> r;
++MAP... | 0 | 18,636,685 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int R,G;cin>>R>>G;
int ans=2*G-R;
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | 0 | 40,027,973 |
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
void one_case() {
int n, k;
cin >> n >> k;
map<int, int> mp;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
++mp[a];
}
vector<p... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;
typedef vector<pi> vpi;
#define inf 1000000000
#define mod 1000000007
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define rep1... | 0 | 10,350,992 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int A,B,M;scanf("%d %d %d",&A,&B,&M);
int ans=300000,an=300000;
vector<int> a(A);vector<int> b(B);
for(int i=0;i<A;i++){scanf("%d ",&a[i]);an=min(an,a[i]);}
for(int i=0;i<B;i++){scanf("%d ",&b[i]);ans=min(an+b[i],ans);}
vector<int> x(M);vector<int> y(M);vector<i... | #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)
const ll INF = 999999999999999;
int main(){
ll n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a.at(i);
if( n%2 == 0 ){
for(ll i=n-1;i>=0;--i){
if( (i+1)%2 == 0 ){
... | 0 | 84,640,495 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
typedef pair<int,int> P;
vector<int> num = {0,2,5,5,4,5,6,3,7,6};
int main(){
int N, M; vector<int> A(9);
cin >> N >> M;
rep(i,M) cin... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll H, W;
cin >> H >> W;
vector<string> ... | 0 | 73,652,388 |
#include <iostream>
using namespace std;
int main (int argc, char **argv) {
int *a;
int n;
cin >> n;
a = new int[n];
for (int i=0; i<n; i++) {
cin >> a[i];
}
int min = 1000001;
int max = -1000001;
long sum = 0;
for (int i=0; i<n; i++) {
if (a[i] < min) min = a[i];
if (a[i] > max) max = a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define MIN(a,b) ((a)>(b)? (b): (a))
#define MAX(a,b) ((a)<(b)? (b): (a))
const long long INF = 1LL << 60;
typedef long long ll;
const long long MOD = 1000000000 + 7;
int main(){
int n,m;
cin >> n >> m;
ll a[n]... | 0 | 61,002,155 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
int main(){
int N,M;
cin >> N >> M;
priority_queue<int> A;
rep(i,N) {
in... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,n) for(int i=(a); i<(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int N; cin >> N;
vector<string> A(N);
rep(i, N) cin >> A[i];
int a = 0, ab = 0, b = 0, ba = 0;
rep(i, N) {
if ... | 0 | 75,903,145 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,a,b) for (int i = a; i < (b); ++i)
#define mREP(i,a,b) for (int i = a; i > (b); --i)
#define all(x) (x).begin(),(x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template<class T> inline bool chmax(T& a,... | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ty... | 0 | 44,729,432 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep_lr(i,l,r) for(int i=(l);i<(r);i++)
#define all(x) (x).begin(),(x).end()
#define V vector
typedef V<int> vi;
typedef V<vi> vvi;
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<int, int, int> T;
constexpr int INF ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int64_t n;
cin >> n;
vector<int64_t> t(n + 1), x(n + 1), y(n + 1);
t[0] = x[0] = y[0] = 0;
for (int64_t i = 0; i < n; ++i) {
cin >> t[i + 1] >> x[i + 1] >> y[i + 1];
}
bool can = true;
for (size_t i = 0; i < n; i++) {
... | 0 | 82,988,986 |
#include <iostream>
#include <vector>
#include <algorithm>
#define ALL(a) a.begin(),a.end()
using namespace std;
int main()
{
int n;
cin >> n;
for ( int i = 0; i < n; i++ ) {
vector<int> v;
int t;
for ( int j = 0; j < 3; j++ ) {
cin >> t;
v.push_back( t );
}
sort(ALL(v));
if ( ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define Sort(a) sort(a.begin(), a.end())
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
templa... | 0 | 97,266,403 |
#include<bits/stdc++.h>
using namespace std;
int main() {
string S, T;
int res = 0, loops, temp = 0;
cin >> S >> T;
if(S == T) {
cout << 0 << endl;
return 0;
}
res = T.size();
loops = S.size() - T.size() + 1;
for(int i = 0; i < loops; i++) {
for(int j = 0; j < T.size(); j++) {
if(S[i+j... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
string s;
int t;
string x;
cin>>n;
int tt=0;
int st=0;
bool sleep=0;
vector<string>v(n);
vector<int>vs(n);
for(int i=0; i<n; i++){
cin>>v.at(i)>>t;
vs.at(i)=t;
tt += t;
}
cin>>x... | 0 | 7,269,699 |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5;
int f[N+10];
int sz[N+10];
int find(int x){
return x==f[x]?x:f[x]=find(f[x]);
}
int merge(int u,int v){
int uf=find(u);
int vf=find(v);
if(uf!=vf){
sz[uf]+=sz[vf];
sz[vf]=0;
f[vf]=uf;
}
return sz[uf];
}
int main(){
int n,m;
cin>>n>>m;
for(int ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
if(a==b&&b==c)printf("Yes\n");
else printf("No\n");
} | 0 | 30,248,556 |
#include<stdio.h>
#include<string.h>
typedef struct{
int num[6];
}saikoro;
int num_1,num_2;
saikoro s_1;
void set_s_num(int *a){
int i;
for(i=0;i<6;i++){
s_1.num[i]=a[i];
}
}
void n(saikoro *a){
int tmp;
tmp=a->num[4];
a->num[4]=a->num[0];
a->num[0]=a->num[1];
a->num[1]=a->num[5];
a->num[5]=tmp;
}
void s(sa... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <cstring>
#define ARRAY_LEN(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
typedef long long ll;
int main() {
int N; cin >> N;
float t[N+2]={0}; for (int i=1; i<=N; i++) cin >> t[i];
for (int i=... | 0 | 66,061,913 |
#include <bits/stdc++.h>
int main(){
int H, W, D;
std::cin >> H >> W >> D;
int total = H * W;
std::vector< std::vector< int > > A_pos_H(D, std::vector< int >(total / D + (total % D != 0), 0));
std::vector< std::vector< int > > A_pos_W(D, std::vector< int >(total / D + (total % D != 0), 0));
for(... | #include<bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<char> vc;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
#de... | 0 | 8,129,311 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b; cin >> a >> b;
if (a <= 8 && b <= 8) cout << "Yay!" << "\n";
else cout << ":(" << "\n";
} | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define FOR0(i,n) for(int i=0, _##i=(n); i<_##i; ++i)
#define FOR(i,l,r) for(int i=(l), _##i=(r); i<_##i; ++i)
#define FORD(i,l,r) for(int i=(r), _##i=(l); --i>=_##i; )
#define repi(i,a)... | 0 | 78,681,311 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <memory.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef pair<int,int> pii;
typedef pa... | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <fstream>
#include <set>
#include <utility>
using namespace std;
int main() {
int n;
for (;;) {
cin >> n;
if (n == 0)break;
vector<pair<char, char>> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i].first >> v[i].second;
}
... | 0 | 87,628,950 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
string s;
int sum = 0;
int ans = 0;
for(int i=1; i<=n; i++) {
s = to_string(i);
for(int j=0; j<s.size(); j++) {
sum += s[j]-'0';
if(j==s.size()-1 && a<=sum && sum<=b) ans += i;
}
sum = 0;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
using ll = long long;
const int INF = (1<<30)-1;
const long long LINF = (1LL<<62)-1;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; retur... | 0 | 45,701,503 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define pii pair<int, int>
int main(){
int n; cin>>n;
vector<int> v;
for(int i = 1; i <= 2*n; i++){
int x; cin>>x;
v.push_back(x);
}
sort(v.begin(), v.end());
int res = 0;
for(int i = 0; i < (2*n)-1; i += 2){
... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <unordered_set>
#include <stack>
#include <queue>
#include <math.h>
#include <string>
#include <numeric>
#include <algorithm>
#include <utility>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ull gcd(ull a, ull b) {... | 0 | 21,580,795 |
#include<iostream>
using namespace std;
int main(void){
int n, x, count = 0;
cin >> n >> x;
while( n != 0 || x != 0 ){
for( int i = 1; i <= n-2; i++ ){
for( int j = i+1; j <= n-1; j++){
if( x-i-j > j && x-i-j <= n ){
count++;
}
}
}
cout << count << endl;
count = 0;
cin >> n >... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 1000000007
#define mod9 1000000009
#define fast ios_base :: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define mp make_pair
#define pb push_back
#define ct ll t;cin>>t;while(t-... | 0 | 52,183,765 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cmath>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
int main() {
int a, b, c, k;
cin >> a >> b >> c >> k;
int ans = 0;
if (a >= k) {
ans += k;
a -= k;
k... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n,j=0;
cin>>n;
float x[4],y[4];
for(int i=0;i<n;i++){
for(int j=0;j<4;j++)cin>>x[j]>>y[j];
if( ( (y[1]-y[0]) * (x[3]-x[2]) )==( (y[3]-y[2])*(x[1]-x[0]) ) ){
cout<<"YES"<<endl;
}else{
... | 0 | 55,760,462 |
#include <bits/stdc++.h>
#include <math.h>
#include <float.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; }
te... | #include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define rep1(i,n) REP(i,1,n+1)
using namespace std;
int main() {
... | 0 | 73,728,266 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<ll> A(N);
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<=(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define Eunique(v) v.erase(... | 0 | 53,853,335 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
typedef long long ll;
int main(){
string s;
cin >> s;
int w;
cin >> w;
string t;
int c = 0;
while(c < s.length()){
t += s[c];
c += w;
}
cout << t << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define sws \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl '\n'
#define ff first
#define ss second
#define pb push_back
#define vi vector<int>
#define vb vector<bool>
#define vs ve... | 0 | 10,336,574 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
string s,t;cin>>s>>t;
char x[4],y[4];
int count1 = 0;
strcpy(x,s.c_str());strcpy(y,t.c_str());
for(int i=0;i<3;i++){
if(x[i]==y[i])
count1+=1;
}
cout<<count1<<endl;
return 0;} | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using v1 = vector<int>;
using vl = vector<long long>;
using v2 = vector<vector<int>>;
using v3 = vector<vector<char>>;
int N = 0;
void maxHeap(vl& a, int x){
int l = x*2;
int r = x*2+1;
int largest = 0;
... | 0 | 89,859,703 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
printf("%d %d %f\n", a / b, a % b, (double)a/b);
return 0;
} | #include<stdio.h>
int main(){
long long int n,a=10,b=0;
scanf("%lld\n",&n);
if(n%2==0){
while(a<=n){
b=b+n/a;
a=a*5;
}
}
printf("%lld\n",b);
} | 0 | 30,429,746 |
#include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
constexpr int Mod = 998244353;
constexpr int mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;
template <typename T> constexpr bool c... | #include <stdio.h>
int main(){
float x1,y1,x2,y2,x3,y3,x4,y4;
float del1,del2;
int n;
scanf("%d",&n);
int i;
for(i = 0;i < n;i++){
scanf("%f %f %f %f %f %f %f %f",&x1,&y1,&x2,&y2,&x3,&y3,&x4,&y4);
if(x1-x2 == 0&&x3-x4 == 0){
printf("YES\n");
}else if(x1-x2 == 0||x3-x4 == 0){
printf("NO\n");
}else{
... | 0 | 84,862,948 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod... | #include<iostream>
#include<string>
#include<vector>
#include<numeric>
#include<math.h>
#include<algorithm>
#include<iomanip>
#include<list>
#include<bitset>
using namespace std;
int main() {
int N;
int K;
cin >> N >> K;
vector<int> A(N, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int ans = (N - 1) / (K -... | 0 | 19,007,871 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
int main()
{
int a,b,c;
cin>> a>>b>>c;
string ans="No";
if(a==b && b==c && c==a) ans="Yes";
cout << ans << endl;
return 0;
} | #include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iostream>
#include <iostream>
#include <fstream>
#include <numeric>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <cmath>
#include <set>
#include <map>
#include <functi... | 0 | 98,729,586 |
#include<iostream>
#include<string>
#include<cstring>
#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;
#def... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
uint N;
cin >> N;
vector<int> freq(1000000+1, 0);
for (size_t i=0; i<N; ++i) {
uint bin;
cin >> bin;
++bin;
++freq[bin-1];
++freq[bin];
++freq[bin+1];
}
... | 0 | 20,491,406 |
#include <iostream>
#include <stack>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
string s;
cin >> s;
int n = s.length();
stack<char> t;
int ans = 0;
for (int i = 0; i < n; ++i) {
if (t.empty()) {
t.push(s[i]);
continue;
}
... | #include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <string>
using namespace std;
int n, s, res = 0;
void dfs(int sum,int now, int cnt) {
if (now == 10) {
if (sum == s&&cnt == n) {
res++;
}
return;
}
dfs(sum, now + 1, cnt);
dfs(sum + now, now + 1, cnt + 1);
return;
}
int mai... | 0 | 83,217,055 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=100010;
struct node{
ll sum;int id;
bool operator<(const node n)const{
return sum>n.sum;
}
}p[maxn];
int n,sz[maxn],fa[maxn];
int to[maxn],nxt[maxn],head[maxn],el;
ll sum[maxn],tot;
inline void add(int u,int v){
to[++el]=v;nxt[el]=h... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll GCD(ll a, ll b){ return a ? GCD(b % a, a) : b; }
int main(){
string s;
cin>>s;
int ans = 0;
for(int i=s.size()-1; i>0; i--){
for(int j=1; j<=i/2; j++){
if(i%j || (i/j)%2) continue;
bool ok=true;
... | 0 | 88,829,255 |
#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 a, b, c;
cin >> a >> b >> c;
int mx = max(a, max(b, c));
mx *= 3;
int sum = a + b + c;
if ((mx - sum) % 2 == 0)
{
cout << (mx... | #include <iostream>
using namespace std;
bool grid[2000][2000];
int l[2000][2000];
int r[2000][2000];
int u[2000][2000];
int b[2000][2000];
int main() {
int H, W;
cin >> H >> W;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
char tmp; cin >> tmp;
grid[i][j] = tmp == '.';
if (!gr... | 0 | 27,950,841 |
#include<cstdio>
using namespace std;
typedef long long ll;
const int N=10000+10;
int n;
ll a[N];
int main() {
while(~scanf("%d",&n)){
ll x;
ll n1=0,n2=0;
for(int i=0;i<n;i++){
scanf("%lld",&a[i]);
}
for(int i=0;i<n;i++){
scanf("%lld",&x);
... | #include <stdio.h>
#include <string.h>
int main(){
int brpBanyak;
scanf("%d", &brpBanyak);
char arrKata[brpBanyak+1];
char kataPertama[100];
char kataKedua[100];
scanf("%s", arrKata);
if(brpBanyak%2==0){
int j=0;
int flag=0;
for(int i=(brpBanyak/2);i<brpBanyak;i++){
if(arrK... | 0 | 75,524,877 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int N=100005;
template<typename T>
void read(T &x){
x=0;int f=1; char ch=getchar();
while (ch<'0'||ch>'9'){if (ch=='-') f=-1; ch=getchar();}
while (ch>='0'&&ch<='9'){x=x*10+ch-'0'; ch=getchar();}
x*=f;
}
ll d[N];
... | #include <bits/stdc++.h>
#define PI 3.1415926535897932
#define _GLIBCXX_DEBUG
using namespace std;
long long GCD(long long A,long long B){
if(B==0){
return A;
}
else{
return GCD(B,A%B);
}
}
int main() {
int W,H,N;
cin>>W>>H>>N;
vector<vector<int>> vec(N,vector<int>(3));
for(int i=0;i<N;i++){
... | 0 | 85,924,097 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define mod 1000000007
#define FS fix... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define SP << " "
#define LLi long long int
using namespace std;
LLi gcd(LLi a, LLi b) {
if(a<0) a=b;
if(b<0) b=a;
if (b == 0) return a;
return gcd(b, a%b);
}
LLi lcm(LLi a, LLi b) {
return a/g... | 0 | 49,068,742 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
using namespace std;
struct monster {
long X;
long H;
};
int main(int argc, char** argv) {
int N;
long D, A;
std::vector<monster> monsters;
cin >> N >> D >> A;
for (int i = 0; i < N; ++i) {
monster m;
cin >> m.X >> m.H;
... | #include <iostream>
using namespace std;
int main(){
int n,m,p;
while(cin >> n >> m >> p && n){
int x[100];
int a=0,d,ans;
for(int i=0;i<n;i++){
cin >> x[i];
a+=x[i];
}
d=a*100*(100-p)/100;
if(x[m-1]==0)
ans = 0;
else
ans=d/x[m-1];
cout << ans << endl;
}
... | 0 | 41,538,066 |
#include <iostream>
using namespace std;
int main()
{
long long x, y;
cin >> x >> y;
if (abs(x - y) <= 1)
cout << "Brown" << endl;
else
cout << "Alice" << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define maxx 1000005
#define mod 998244353LL
using namespace std;
string s;
bool check = false;
long long a[1000005], ans, t, b[1000005], m, n, kk, T;
vector<ll> arr;
ll k;
void sol()
{
cin >> s;
n = s.length();
s = " " + s;
a[0] = 0;
a[n+1] = 0;
b[0]... | 0 | 53,630,579 |
#include<bits/stdc++.h>
using namespace std;
long long moder = 1000000007;
long long fac(long long n){
long long ret = 1;
for(long long i = 1; i<=n; i++){
ret*=i;
ret%=moder;
}
return ret;
}
long long multi(long long a,long long b){
if(b==0) return 1;
if(b==1) return a;
long long ret = multi(a,b/2);
ret*=re... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define space ' '
typedef long long ll;
typedef long double ld;
const long double PI = 3.14159265358979323846;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k, x, y;
cin >> n >> k >> x >> y;
ll ans = 0;
for (int i = 1; i <= k && i <=... | 0 | 57,218,315 |
#include <iostream>
#include <cmath>
using namespace std;
int main(void){
int n, a[1010]={0};
while(cin >> n){
int min=1000001;
if(n == 0) break;
for(int i=0; i< n; i++){
cin >> a[i];
}
for(int i=0; i<n; i++){
for(int j=i+1; j<n; j++){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
#define PR(x) cout << (x) << "\n"
#define PS(x) cout << (x) << " "
#define PRYES(x) PR((x) ? "Yes" : "No")
const lo... | 0 | 84,171,210 |
#include <iostream>
#include <math.h>
#include <iomanip>
using namespace std;
#define PI 3.14159265
int main(){
double a, b, x; cin >> a >> b >> x;
double s = a * a * b;
cout << fixed << setprecision(6);
if (x <= s / 2) cout << 90 - atan(x / (a * b * b) * 2) * 180.0 / PI << '\n';
else cout << atan((s - x)/(a * a *... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 0 | 10,454,227 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | #include <bits/stdc++.h>
using namespace std;
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
typedef long long LL;
int main(){
int h,w,d;
cin >> h >> w >> d;
if(d%2){
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if((i+j)%2){
cout << "R" << flush;
}else{
... | 0 | 2,731,258 |
#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 = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_st... | 0 | 38,152,481 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int N, M, X, Y;
cin >> N >> M >> X >> Y;
vector <int> x(N);
vector <int> y(M);
for (int i = 0; i < N; i++) cin >> x.at(i);
for (int i = 0; i < M; i++) cin >> y.at(i);
sort (x.begin(),x.end());
sort (y.begin(),y.end());
int y_min = y.at(0);
... | #include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) ((v).begin()),((v).end())
#define allr(v) ((v).rbegin()),((v).rend())
#define pb push_back
#define mp make_pair
#define clr(v,d) memset( v, d ,sizeof(v))
#define PI acos(-1)
typedef l... | 0 | 94,086,684 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.