code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#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 all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) {rep(i,x.size()) cout << x[i] << " "; cout << endl;}
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define BitRep(i, n) for (int i = 0; i < (int)(1 << n); i++)
#define All(vec) vec.begin(), vec.end()
#define Sum(vec) accumulate(vec.begin(), vec.end(), 0)
#define Sort(vec) sort(vec.begin(), vec.end... | 0 | 60,110,807 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll N;
ll A[200000];
int main(){
cin >> N;
for(int i=0;i<N;i++) cin >> A[i];
for(int i=1;i<N;i++) A[i] += A[i-1];
unordered_map<ll,ll> um;
um[0]++;
for(int i=0;i<N;i++) um[A[i]]++;
ll ans = 0;
for(a... | #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 | 31,388,929 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
ll INF = LLONG_MAX;
using vc = vector<char>;
using vi = vector<int>;
int main() {
ios::... | #include <cstdio>
#include <cstring>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <map>
#include <string>
#include <iostream>
#include <iomanip>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define pb push_back
#d... | 0 | 37,099,713 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include <bits/stdc++.h>
using namespace std;
char remain(char x,char y){
if(x!='R'&&y!='R') return 'R';
if(x!='G'&&y!='G') return 'G';
if(x!='B'&&y!='B') return 'B';
}
int main() {
int n;
cin>>n;
string s;
cin>>s;
vector<long long> r(n+1,0),g(n+1,0),b(n+1,0);
r[0]=0,g[0]=0,b[0]=0;
for(int... | 0 | 83,026,410 |
#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 repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define each(x, y) f... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | 0 | 40,161,971 |
#include<iostream>
using namespace std;
int main()
{
int n,a,b,c,x,i;
int y[100];
int flame;
for(;;)
{
cin >> n >> a >> b >> c >> x ;
if(n==0 && a==0 && b==0 && c==0 && x==0)
break;
for(i=0;i<n;i++)
{
cin >> y[i] ;
}
flame=0;
int flag=1;
for(i=0;;)
{
if(flame==10001)
{
flag=0;
... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <cmath>
#include <iomanip>
#include <set>
#include <sstream>
#include <queue>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
if ((s[0] - '0') + (s[1] - '0') + (s[2] - '0') + (s[3] - '0... | 0 | 71,290,164 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define ARRAY_LENGTH(array) sizeof(array)/sizeof(*array)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; ... | #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 | 68,671,222 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF (long long)(10e9+7)
#define REP(i,n) for(ll i = 0; i < n; i++)
#define REP1(i,n) for(ll i = 1; i <= n; i++)
int main(void)
{
int n, a, b;
cin >> n >> a >> b;
cout << (((b - a)%2==0)?"Alice":"Borys") << endl;
} | #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 | 43,491,891 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
bool a1[n+1]={};
bool an[n+1]={};
for(int i=0;i<m;i++){
int x,y;
cin>>x>>y;
if(x==1)a1[y]=true;
if(y==n)an[x]=true;
}
bool flag=fa... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
#include <bits/stdc++.h>
using namespace s... | 0 | 84,106,825 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t[5];
for (int i = 0; i < 5; i++)
cin >> t[i];
sort(t, t+5);
int ans = INT_MAX;
do {
int time = 0;
for (int i = 0; i < 5; i++){
if (t[i]%10 == 0 || i == 4)
time += t[i];
els... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#includ... | 0 | 97,491,020 |
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
using ll = long long;
int main(){
int n, m;
cin >> n >> m;
vector<pair<ll,ll>>s(n),p(m);
for(int i=0; i<n; i++){
ll a,b;
cin >> a >> b;
s[i] = make_pair(a,b);
}
for(int i=0; i<m; i++){
ll... | #include <string>
#include <iostream>
using namespace std;
string ring(string s,int no,int l){
string r;
for (int i=0;i<l;i++){
r+=s[(no+i)%s.size()];
}
return r;
}
int main(){
string s,p;
cin>>s>>p;
int i;
for (i=0;i<s.size();i++){
if (p==ring(s,i,p.size())) break;
}... | 0 | 41,738,642 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
int flag = 0;
for(int i = 0; ;i++){
if(4*i > N){
break;
}
for(int j = 0; ; j++){
int sum = 4*i + 7*j;
if( sum == N ){
flag = 1;
break;
}else if(sum > N){
break;
}
}
... | #include<iostream>
#include<math.h>
#include<iomanip>
#include<vector>
#include<algorithm>
#include<queue>
#include<string>
#include<stdlib.h>
using namespace std;
#define PI 3.14159265358979
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#include<set>
int main (void)
{
ll n,c,k;
cin>>n>>c>>k;
... | 0 | 72,401,823 |
#include <bits/stdc++.h>
using namespace std;
#define INF 2000000000
typedef long long ll;
typedef pair<ll,ll> ii;
typedef pair<ii,ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
#define getbit(n,i) (((n)&(1LL<<(i)))!=0)
#define setbit0(n,i) ((n)&(~(1LL<<(i))))
#define setbit1(n,i) ((n)|(1LL<<(i)))
#define togg... | #include<iostream>
#include<cstdio>
using namespace std;
int a[10001];
int main()
{
int n,m,i,j,k,p,l=1,s=0;
for(i=0;i<=9;i++)
{
for(k=0;k<=9;k++)
{
for(j=0;j<=9;j++)
{
for(p=0;p<=9;p++)
{
a[l]=i+k+j+p;
l++;
}
}
}
... | 0 | 66,656,187 |
#include<cstdio>
#include<iostream>
using namespace std;
#define INF 100000
int road, max_t = 0, time_[100][100] = { 0 }, sum, root[100] = { 0 };
void dijkstra(int a) {
int i,j,k=INF,used[100],minroot;
for (i = 0; i <= max_t; i++) {
used[i] = 0;
root[i] = INF;
}
root[a] = 0;
while (1) {
minroot = INF;
for... | #include <bits/stdc++.h>
using namespace std;
typedef long long lol;
#define REP(i,n) for(lol i=0;i<lol(n);i++)
#define REPD(i,n) for(lol i=n-1;i>=0;i--)
#define FOR(i,a,b) for(lol i=a;i<=lol(b);i++)
#define FORD(i,a,b) for(lol i=a;i>=lol(b);i--)
#define VL vector<lol>
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ... | 0 | 30,451,673 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <string>
#include <cmath>
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
int v[n];
for(int i=0;i<n;i++) cin >> v[i];
int b4 = v[0];
int ans = 0;
int t = 0;
for(int i=1;i<... | #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() {
int n;
string s;
cin >> n >> s;
vector<int> a(n);
rep(i, n) {
if(s[i] == 'R')
a[i] = 0;
if(s[i] == 'G')
a[i] = 1;
if(s[i] == 'B')
a[i] = 2;
}
v... | 0 | 40,573,522 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int n;
cin >> n;
cout << (n<1200?"ABC":((n<2800)?"ARC":"AGC"));
return 0;
} | #include<stdio.h>
int main()
{
int x, y;
while (1)
{
scanf("%d %d", &x, &y);
if (x == 0 && y == 0) break;
if (x <= y) printf("%d %d\n", x, y);
else printf("%d %d\n", y, x);
}
return 0;
} | 0 | 1,304,396 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
ll pub_count[60];
ll patty_count[60];
void init_count(ll N) {
for (int i = 0; i <= N; ++i) {
pub_count[i] = -3 + 4 * pow(2, i);
patty_count[i + 1] = patty_count[i] * 2 + 1;
}
}
ll solve(ll N, ll X) {
... | #include<iostream>
using namespace std;
int main(void){
int N,i,max,count=0;
int mount[21]={0};
cin >> N;
for(i=1;i<=N;i++){
cin >> mount[i];
}
for(i=1;i<=N;i++){
if(i==1){
count++;
max = mount[1];
}else if(mount[i]>=max){
count++;
... | 0 | 19,055,906 |
#include <bits/stdc++.h>
using namespace std;
#define pb(s) push_back(s)
#define ALL(v) v.begin(), v.end()
#define ALLA(arr, sz) arr, arr + sz
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr, sz) sort(ALLA(arr, sz))
#define REVERSEA(arr, sz) reverse(ALLA(arr, sz))
typedef long long ll;... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
#define ll long long
#define rep(i, a, b) for(int i = a; i <= (int)b; i++)
void read(int &x) {
x = 0; int flag = 1; char ch = ' ';
while(ch < '0' || ch > '9') { if(ch == '-') flag = -1; ch = ... | 0 | 84,904,334 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n;
while(1){
cin >> n;
vector<int> data;
if(n == 0) break;
for(int i=0; i<n; i++){
int x;
cin >> x;
data.push_back(x);
}
sort(data.begin(), data.end());
long long sum = 0;
for(int i=1; i<n-1; i++){
sum += data[i];
}
sum ... | #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,239,631 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define loop(i, a, n) for(int i = (a); i < (n); i++)
using namespace std;
using ll = int64_t;
int main(){
ll n, a, b; cin >> n >> a >> b;
if(a > b) {
cout << 0 << endl;
return 0;
} else if(a < b && n == 1) {
cout... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <string>
#include <set>
#include <bitset>
#include <unordered_map>
#include <cmath>
#include <functional>
#include <map>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>... | 0 | 1,079,176 |
#include "bits/stdc++.h"
using namespace std;
const int INF = 1001001001;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> dist(N, vector<int>(N, INF));
for (int n = 0; n < N; ++n) {
dist[n][n] = 0;
}
vector<int>X(M);
vector<int>Y(M);
vector<int>Z(M);
for (int n = 0; n < M; ++n) {
int a, b, c;
... | #include <bits/stdc++.h>
#include <string>
#include <algorithm>
using namespace std;
using ll = long long;
int main()
{
string s;
cin >> s;
string word[4] = {"dream","dreamer","erase","eraser"};
int pos = s.size();
int size;
bool judge = false;
while(pos > 0){
judge = false;
for(int i=0; i<4; i++... | 0 | 15,687,758 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <math.h>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <climits>
#include <bitset>
#include <list>
using namespace std;
typedef unsigned long long ull;
typedef lon... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
int main(){
int n;
cin>>n;
map<ll,ll> m;
vector<ll> a(n);
rep(i,n){
cin>>a[i];
m[a[i]]++... | 0 | 14,727,033 |
#include <bits/stdc++.h>
#define rep2(i, n, m) for (int i = m; i < (int)(n); i++)
#define rep(i, n) rep2(i, n, 0)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
using ll = long long;
template <typename T>
T sq(T x) {
return x * x;
}
signed main() {
int a, b, c;
cin >>... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_p... | 0 | 25,573,229 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
using namespace std;
const int maxn = 200005;
const int mod = 998244353;
vecto... | #include <bits/stdc++.h>
#ifdef ONLINE_JUDGE
#define freopen \
if (0) freopen
#define cerr \
if (0) cerr
#endif
#define fi first
#define se second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)... | 0 | 83,158,186 |
#include<bits/stdc++.h>
using namespace std;
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
int H, W;
vector<string> maze;
bool check () {
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (maze[i][j] == '.') return false;
}
}
return true;
}
void ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int>A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int X = A.at(0);
int Y = A.at(1);
int Z = X % Y;
int count;
for (int i = 1; i < N; i++) {
count = 0;
while (count == 0)... | 0 | 54,733,422 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define inf 9999999999
#define N 6666
int arr[N];int f[N];
int e[N][N];
int a[N];
struct str{
int x,y,z;
}st[666666];
signed main(){
int n,m,k;
cin>>n>>m>>k;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(i==j)
e[i][j]=0;
else
e[i... | #include<bits/stdc++.h>
#define INFTY 1<<20
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const int MOD=1000000007;
int main() {
int n;cin>>n;
int a[n];rep(i,n)cin>>a[i];
int r=0,sum=0;
ll ans=0;
for(int l=0;l<n;l++){
while(r<n && (sum^a[r])==(... | 0 | 5,735,298 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout <... | #include <iostream>
using namespace std;
int main(){
int dice[6];
int n;
int x,y;
for(int i=0;i<6;i++){
cin>>dice[i];
}
cin>>n;
for(int i=0;i<n;i++){
cin>>x>>y;
if((x==dice[3] && y==dice[1]) || (x==dice[4] && y==dice[3]) || (x==dice[2] && y==dice[4]) ||(x==dice[1] && ... | 0 | 74,623,282 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
using namespace std;
int check(vector<string> a, vector<string> b, int x, int y){
int flag = 0, m = b.size(); int cnt = 0;
for (int i=0; i<m; i++){
for (int j=0; j<m; j++){
if (a[x+i][y+j]!=b[i][j]){
flag = 1;
break;
}
... | 0 | 35,149,711 |
#include "bits/stdc++.h"
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define len(x) ((int)(x).size())
#define fastio ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef long long ll;
const ll LINF = 1e18;
const int INF = 1e9;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 78,403,449 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()... | #include <bits/stdc++.h>
#include <cmath>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 1e15;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define r... | 0 | 23,349,455 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
bool ans = (s[0] == s[1] && s[1] == s[2]);
if (ans) puts("No");
else puts("Yes");
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
template<typename T1,typename T2> inline void chmin(T1 &a, T2 b){ if(a > b) a = b; }
template<typename T1,typename T2> inline void chmax(T1 &a, T2 b){ if(a < b) a = b; }
#define REP(i,n) for(int i=0;i<n;++i)
#define SORT(name) sort(name.... | 0 | 93,497,518 |
#include <bits/stdc++.h>
using namespace std;
template<typename T> inline T gcd(T a, T b) {
return __gcd(a, b);
}
template<typename T> inline T lcm(T a, T b) {
return a / gcd(a, b) * b;
}
template<typename T> inline T floor(T a, T b) {
return a - a % b;
}
template<typename T> inline T ceil(T a, T b) {
return fl... | #include <iostream>
#include <string>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
int ans = 0, i = 0;
string str;
bool bCheck = true;
while (bCheck) {
if (A + i > B)
{
bCheck = false;
}
str = to_string(A + i);
if (str[0] == str[4] && str[1] == str[3])
{
break;
}
i++;
}
while... | 0 | 97,011,657 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
char a,b,c;
char x,y,z;
cin >>a>>b>>c>>x>>y>>z;
cout <<(a==x)+(b==y)+(c==z)<<endl;
} | #include<iostream>
using namespace std;
int main(){
double a[2],b[2],c[2],m[2][2],inv[2][2],det,ans[2],s,t;
while(cin >>a[0]>>a[1]>>b[0]>>b[1]>>c[0]>>c[1]>>ans[0]>>ans[1]){
b[0]-=a[0];
b[1]-=a[1];
c[0]-=a[0];
c[1]-=a[1];
ans[0]-=a[0];
ans[1]-=a[1];
m[0][0] = b[0];
m[1][0] = c[0];
... | 0 | 11,083,351 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <string.h>
#include <cmath>
using namespace std;
int main()
{
string A, B;
cin >> A >> B;
int a = A.length(); int b = B.length();
if (a > b) {
cout << "GREATER\n";
return 0;
}
else if (a < b) {
... | #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 | 84,626,539 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
int main() {
int r;
cin >> r;
cout << r*r << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 0 | 79,915,756 |
#include<bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define ll long long
#define sl set<ll>
#define vs vector<string>
#define pb push_back
#define vl vector<ll>
#define vi vector<int>
#define PI 3.14159265
#define mod 998244353
int main()
{
int n;
cin>>n;
double a[n];
for(int i=0;i<n;i+... | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include<unordered_map>
#include <stack>
#incl... | 0 | 66,633,656 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char s[3];
cin >> s;
if(s[0]=='S' && s[1]=='S' && s[2]=='S'){
cout << "0" ;
}
else if(s[0]=='R' && s[1]=='R' && s[2]=='R'){
cout << "3";
}
else if(s[0]=='R' && s[1]=='R' && s[2]=='S' || s[0]=='S' && s[1]=='R' && s[2]=='... | #include <iostream>
using namespace std;
int main() {
int pos = -1;
int input;
int senro[100];
while (cin >> input) {
if (input != 0) {
pos++;
senro[pos] = input;
} else if (input == 0) {
if (pos >= 0) {
cout << senro[pos] << "\n";
... | 0 | 69,736,961 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
char a;
cin >> a;
if(isupper(a)) cout << 'A';
else if(islower(a)) cout << 'a';
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define COUT(x) cout<<(x)<<"\n"
int main(){
cin.tie(0);
... | 0 | 67,996,831 |
# include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int a[N], sum[N];
map < int, int > f;
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, k;
long long ans = 0, cur = 0;
cin >> n >> k;
f[0] = 1;
for(int i = 1; i <= n; i++){
cin >> a[i];
sum[i] = (sum[i - 1] + a[i] - ... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define inf 0x3f3f3f3f
#define met(a, x) memset(a,x,sizeof(a))
#define mp make_pair;
using namespace std;
const int mod = 19e+7;
const int N = 1e5 + 10;
const int M = 1e6 + 10;
int x[N],w[N],n,l,t;
ll c;
int main() {
ios::sync_with_stdio(f... | 0 | 47,859,687 |
#include <bits/stdc++.h>
using namespace std;
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "["; for (int i = 0; i < v.size(); ++i) { os << v[i]; if (i != v.size() - 1) os << ", "; } os << "]"; return os; }
template <typename T> void print(T v, string s = "\n") { cout << ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define _LL long long
_LL* mallocint(int si)
{
return (_LL*) malloc(si * sizeof(_LL));
}
_LL* inputint(int n)
{
_LL *ans = mallocint(n);
for( int i = 0; i < n; i++ ) cin >> ans[i];
return ans;
}
int main()
{
int x, y, a, b, c;
cin... | 0 | 91,619,446 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >>H>> W;
vector<vector<char>> vec(H,vector<char>(W));
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
cin>>vec.at(i).at(j);
}
}
bool a=false;
int x=0;
int z=0;
vector<vector<char>> ans(H);
vector<vector<char>> lo(... | 0 | 125,944 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <list>
#include <iomanip>
#include <queue>
#include <cmath>
#include <numeric>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define sz(x) ((in... | 0 | 97,306,514 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | #include <bits/stdc++.h>
#define int long long
#define double long double
#define INF 1e18
using namespace std;
int a[20][20];
int H, W;
void dfs(int x, int y) {
int moveX[4] = { 1, 0, -1, 0 };
int moveY[4] = { 0, 1, 0, -1 };
a[y][x] = 1;
for (int i = 0; i < 4; i++) {
int nx = moveX[i]+x;
int ny = moveY... | 0 | 37,616,099 |
#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 =... | #include<bits/stdc++.h>
#include <deque>
#include<iomanip>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include<stdlib.h>
#include<stdio.h>
using namespace __gnu_pbds;
#define ll long long
#define ull unsigned ll
#define ld long double
#define pb push_back
#define mp make_pair
#defi... | 0 | 54,454,044 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fasino ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define input(A) for(auto &i:A) cin>>i;
signed main()
{
fasino
double n;
cin>>n;
long double k = n/3;
cout<<fixed<<setprecision(7)<<k*k*k;
return 0;
} | #include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
string s;
cin >> s;
string t;
vector<int64_t> nx;
int64_t m = 0;
for (auto c : s) {
if (c == 'x') {
... | 0 | 2,488,563 |
#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, k;
... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite)... | 0 | 96,581,682 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define PI 3.14159265358979
#define MOD 1000000007
using namespace std;
using ll = long long;
void solve()
{
int n;
cin >> n;
vector<ll> a(n);
for(int i = 0; i < n; ++i)
{
cin >> a[i];
}
ll... | #include<iostream>
#include<cctype>
#include<string>
using namespace std;
int main(int argc, char const *argv[])
{
string astr,bstr;
int n,a=0,b=0;
cin >> n;
for (int i = 0; i < n; ++i)
{
cin >> astr >> bstr;
if(astr<bstr) b += 3;
else if(astr==bstr) {
a += 1; b +... | 0 | 37,027,494 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
int main () {
int a, b, m;
cin >> a >> b >> m;
vector<int> va(a), vb(b), x(m), y(m), c(m);
rep(i, a) cin >> va[i];
rep(i, b) cin >> vb[i];
rep(i, m) cin >> x[i] >> y[i] >> c[i];
int minPrice = va[x[0] - 1] + vb[y[0]... | #include <stdio.h>
#include <ctype.h>
#define N (26)
int main(void)
{
int a[N] = { 0 };
int ch, i;
while ((ch = getchar()) != EOF) {
if (islower(ch)) {
a[ch - 'a']++;
}
if (isupper(ch)) {
a[ch - 'A']++;
}
}
for (i = 0; i < N; i++) {
... | 0 | 85,907,776 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
char a[105][105];
int r[105][105], c[105][105];
void solve() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
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,... | 0 | 11,552 |
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod 100000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
int lcm(ll a, ll b)
{
return a * b / __gcd(a, ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define big 1000000007
#define all(a) sort((a).begin(),(a).end())
#define Re(a) reverse((a).begin(),(a).end())
#define YN(a) if(a){cout<<"Yes"<<endl;}else cout<<"No"<<endl;
int main(){
int a,b... | 0 | 41,654,042 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int a, b = 0;
cin >> a >> b;
int iResult1 = a / b;
int iResult2 = a % b;
double dResult3 = (double)a / (double)b;
printf("%d %d %.8lf\n", iResult1, iResult2, dResult3);
return 0;
} | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | 0 | 30,435,899 |
#include <bits/stdc++.h>
using namespace std;
void solve () {
int n;
cin >> n;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].first;
a[i].second = i;
}
sort (a.rbegin(), a.rend());
for (int i = 0; i < n; i++) {
int j = 0;
while (a[j].se... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin >> n;
char c[n][n];
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin >> c[i][j];
}
}
int ans=0;
char d[n][n];
for(int i=0;i<n;i++){
bool f=true;
for(int j=0;j<n;j++){
for(int k=0;k<n;k++){
d[j][k]=c[(j+i)... | 0 | 84,013,084 |
#include <numeric>
#include <iostream>
#include <array>
#include <string>
#include <vector>
#include <cassert>
#include <algorithm>
#include <math.h>
#include <set>
#include <map>
#include <utility>
#include <deque>
#include <queue>
using namespace std;
#define ll long long int
#define rep(i, n) for(ll i = 0; i < n; i... | #include <bits/stdc++.h>
#define REP( i, n) for( int i = 0; i < (n); ++i)
#define FOR( i, a, b) for( int i = (a); i < (b); ++i)
using namespace std;
int n;
int s;
int ans;
int a[10] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
int dfs( int x, int i, int sum){
if( x == n && sum == s){
++ans;
}else{
if( i < 10){
... | 0 | 56,267,389 |
#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 ALL(v) v.begin(), v.end()
#define MOD 1000000007
typedef long long ll;
using namespace std;
const int AMAX = 100000;
ll cnt[AMAX + 1];
int main() {... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i,n) for(ll i=0; i<(n); i++)
#define REP2(i,x,n) for(ll i=x; i<(n); i++)
const long long INF = numeric_limits<long long>::max();
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
... | 0 | 57,987,113 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string S;cin>>S;
priority_queue<int> ans;
int l=S.size();
for(int i=2;i<l;i+=2){
int j=i/2;
string T1=S.substr(0,j);
string T2=S.substr(j,j);
if(T1==T2) ans.push(i);
}
cout<<ans.top()<<endl;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_map>
#include <set>
#include <deque>
#include <map>
#define INF 1000000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
using P... | 0 | 59,897,485 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,f,n) for(int i=f; i<(n); i++)
int main()
{
int ans = 0;
int n, m;
cin >> n >> m;
int k[m];
vector<vector<int>> s(m);
vector<int> p(m);
REP(i,0,m){
cin >> k[i];
s[i].resize(k[i]);
REP(j,0,k[i]){
cin >> s[i][... | #include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
rep(i, N) cin >> A[i];
set<long long> B;
ve... | 0 | 9,068,239 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
cout << ((K == 1) ? 0 : N - K) << "\n";
} | #include<bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for(int (i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
#define Cout(s) cout << s << endl
string Yes(bool b) {if(b){return "Yes";} else {return "No";}}
string YES(bool b) {if(b){return "YES"... | 0 | 19,836,548 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef vector<int> vi;;
typedef vector<ll> vll;
#define l() length()
#define sz() size()
#define b() begin()
#define e() end()
#define all(x) x.begin(), x.... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (int i = 0; i < (int)N; i++)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 62)
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
constexpr int MOD = 1000000007;... | 0 | 26,653,319 |
#include <iostream>
#include <math.h>
#include <algorithm>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main(){
int w,h;
vector<string> f(30);
vector< vector<int> > g(30,vector<int>(30,0));
int count = 0;
int count2 = 0;
while(1){
cin >> w >> h;
... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long
#define li long
#define pb push_back
#define mem(arr,x) memset(arr,x,sizeof(arr))
ll n;
vector<ll>adj[100001];
ll dp[100001][2];
ll totalWays(ll node,ll parent,ll color)
{
if(dp[node][color]!=-1) return dp[node][color];
ll total... | 0 | 46,472,349 |
#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 <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 0 | 76,303,563 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector <ll> vi;
typedef vector <pi> vpi;
#define f first
#define s second
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll nature(ll a){
return max(a,-1*a);
}
int main(){
ll N,sumprice;
cin>>N;
vector<ll> A(N);
for(ll i=0;i<N;i++){
cin>>A.at(i);
if(i==0){sumprice=nature(A.at(0));}
if(i>0){sumprice+=nature(A.at(i)-A.at(i-1));}
if(i==N-1){sumprice... | 0 | 52,041,635 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
ll ans = 0, N, M;
vector<vector<ll>> G;
void dfs(ll now, vector<ll> seen){
seen[now] = 1;
for(ll i=1; i<=N; i++){
if (seen[i] == 0)
break;
if (i == N){
ans++;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef map<int,int> mii;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
typedef unsigned long long int ulli;
#define int ll
#define F first
#define S second
#define endl "\n"
#define MP make_pa... | 0 | 62,495,586 |
#include<iostream>
#include<list>
#include<cstring>
#include<algorithm>
#include <utility>
#include<stdio.h>
#include<climits>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
int main(){
int n,x,y;
int i,j,k,l;
string str;
cin >> n;
for(i = 0;i < n;i++){
cin >> str;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){i... | 0 | 8,932,799 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE" ) << endl
#define Possible(n) ... | #include <bits/stdc++.h>
using namespace std;
class P
{
public:
int x,y;
P(int X,int Y)
{
x=X;
y=Y;
}
};
int main()
{
stack<P>st;
int n,m;
int numX[4]={0,1,0,-1};
int numY[4]={1,0,-1,0};
while(cin>>n>>m && n)
{
int flag[500][500]={};
int count=0;
string in;
char set[500][500]={};
for(int i=1;i<=... | 0 | 67,620,884 |
#include <iostream>
using namespace std;
int memo[45] = {0};
int Fibonacci(int n) {
if(n == 0 || n == 1) return memo[n] = 1;
if(memo[n] != 0) {
return memo[n];
}
return memo[n] = Fibonacci(n - 2) + Fibonacci(n - 1);
}
int main() {
int n;
cin >> n;
cout << Fibonacci(n) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int m;
int nmin;
int nmax;
int ps[1000000];
int main() {
while (1) {
scanf("%d%d%d", &m, &nmin, &nmax);
if ((m|nmin|nmax) == 0) return 0;
for (int i=0; i<m; i++) {
scanf("%d", &ps[i]);
}
int ans;
int md = -1;
for (int i=nmax; i>=nmin; i--... | 0 | 68,855,451 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
int _cnt = 0;
for (int i = 0; i < S.size(); ++i) {
if (S[i] == '0') {
++cnt;
} else {
++_cnt;
}
}
printf("%d\n", min(cnt, _cnt) * 2);
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.14... | 0 | 97,126,719 |
#include<iostream>
using namespace std;
int main()
{
long long n,k;
cin>>n>>k;
if((n*500)>=k)
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long num, Yen, Bis;
long long cnt = 1;
long long hYen = 0;
cin >> num >> Yen >> Bis;
if(Yen+1 >= Bis){
cnt += num;
}else{
for(int i = 0; i < num; i++){
if(i == 0 && num % 2 == 1){
cnt++;
continue;
}
if(... | 0 | 82,625,945 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
int n,m;cin>>n>>m;
map<int,int> mp;
mp[0]=1;
int sm=0;
ll ans=0;
for (int i=0;i<n;i++) {
int a;cin>>a;
sm=(sm+a)%m;
ans+=mp[sm];
mp[sm]++;
}
cout<<ans<<endl;
return 0;
} | #define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#inclu... | 0 | 76,291,340 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1001001001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
int main()
{
ll h, n;
cin >> ... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<cmath>
using namespace std;
#define REP(i, limit) for(int i=0; i< limit; ++i)
#define FOR(i, j, limit) for(int i=j; i< limit; ++i)
#define DUMP(a) REP(d,a.size()){cout<<a[d];if(d!=a.size()-1)cou... | 0 | 81,653,107 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long long s;
cin >> s;
if(s == 1e18){
long long a = 1e9;
printf("0 0 %lld 1 0 %lld\n", a, a);
return 0;
}
long long x0 = 0, y0 = 0, x1, y1 = 0, x2 = ... | #include <bits/stdc++.h>
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;
int main() {
int h;
cin >> h;
vector<int> a(h+1);
for (int i=1; i<=h; i++)
cin >> a[i];
for (int i=1; i<=h; i++) {
cout << "node " << i << ": ";
cout << "key = " << a[i] << ", ";
if... | 0 | 65,593,662 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n... | #define _USE_MATH_DEFINES
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ar array
#define pb push_back
ll power(ll a,ll b){ll r=1;for(;b;b>>=1){if(b&1)r=r*a%mod;a=a*a%mod;}return r;}
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int a,b;
cin>>a>>b;
... | 0 | 48,987,679 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cstring>
#include <functional>
using namespace std;
typedef long long ll;
typedef ... | #include <bits/stdc++.h>
#define up(i,a,b) for(int (i) = (a);(i)<=(b);++(i))
#define down(i,b,a) for(int (i) = (b);i>=(a);--i)
#define debug(x) cerr << (x) << '\n';
#define bits(x,i) ((x >> i) & 1)
#define mid ((l+r)/2)
#define pr pair<int,int>
using namespace std;
const int N = 600005;
pair<int,int> b[N];
int n, a[N];... | 0 | 29,656,185 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
int q;
cin >> str;
cin >> q;
for (int i = 0; i < q; i++) {
string s;
cin >> s;
if (s == "print") {
int a, b;
cin >> a >> b;
cout << str.substr(a, b - a + 1) << endl;
} else if (s == "reverse") {
int ... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define REP(i,a) for (int i = 0;i < (a);++i)
#define FOR(i,a,b) for (int i = (a);i < (b); ++i)
#define FORR(i,a,b) for (int i = (a);i >= (b); --i)
#define ALL(obj) (obj).begin(),(obj).end... | 0 | 13,592,851 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
vector<int> a(3);
cin >> a[0] >> a[1] >> a[2];
sort(a.begin(), a.end());
int substract = 2 * a[2] - a[1] - a[0];
if (substract % 2 == 0)
{
cout << substract / 2 << endl;
}
else
{
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
#include <cstdlib>
using namespace std;
using vl = vector <long long>;
using vs = vector <string>;
using vc = vector <char>;
using ll= long long;
u... | 0 | 3,581,098 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define call(x) (x).cbegin(), (x).cend()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define sz(x) ((x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end... | #include<bits/stdc++.h>
using namespace std;
#define Q int t; scanf("%d", &t); for(int q=1; q<=t; q++)
typedef long long int lli;
typedef pair<int, int> pi;
typedef pair<lli, int> pii;
int main()
{
lli n, m, v, p;
cin >> n >> m >> v >> p;
vector<lli> a(n);
for(auto &x: a) cin >> x;
sort(a.begin(), a... | 0 | 52,805,578 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string>A(N);
for(int i=0; i<N; i++)cin >> A.at(i);
string ans="Yes";
for(int i=0; i<N-1; i++){
if(A.at(i).at(A.at(i).size()-1)!=A.at(i+1).at(0))ans="No";
}
sort(A.begin(), A.end());
for(int i=0; i<N-1; i++){
if(... | #include <iostream>
#include <string>
using namespace std;
int main()
{
int a = 0;
string S;
cin >> S;
if (S.size() == 2) {
if (S.at(0) == S.at(1))
cout << "1 2" << endl;
else cout << "-1 -1" << endl;
return 0;
}
for (int i = 2; i < S.size(); i++) {
if (S.at(i - 2) == S.at(i - 1)) {
cout << i - 1 <<... | 0 | 27,741,293 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int k; cin >> k;
vector<ll> a(k); for (int i = 0; i < k; i++) cin >> a[i];
ll min = 2, max = 2;
for (int i = k-1; i >= 0; i--) {
ll n = (min + a[i] - 1) / a[i] * a[i];
ll nn = max / a[i] * a[i] + a[i] - 1;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MAX 10000
using namespace std;
typedef long long ll;
string devide[4] = {"dream", "dreamer","erase","eraser"};
int main(){
string s;
cin>>s;
reverse(s.begin(),s.end());
for(int i=0;i<4;i++){
reverse(devide[i].begin(),devide[i].e... | 0 | 90,309,733 |
#include<map>
#include<set>
#include<list>
#include<ctime>
#include<cmath>
#include<deque>
#include<queue>
#include<stack>
#include<string>
#include<vector>
#include<bitset>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<complex>
#include<iostream>
#include<algorithm>
#define rep(i,s,t) for(register int ... | #include<cstdio>
#include<iostream>
using namespace std;
int main(){
int N,u,k,v;
cin>>N;
int graph[N][N];
for(int i=0;i<N;i++)
for(int j=0;j<N;j++)
graph[i][j]=0;
for(int i=0;i<N;i++){
cin>>u>>k;
for(int j=0;j<k;j++){
cin>>v;
graph[u-1][v-1]=1;
}
}
for(int i=0;i<N;i++){
... | 0 | 98,576,437 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define REP(i, a, b) for(int i = (a); i < (b); ++i)
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define ina(x, n) rep(x_i,n) cin>>x[x_i]
#define outa(x, n) rep(x_i,n) cout<<x[x_i]<<" \n"[x_i==n-1]
typedef long long ll;
typedef vector<ll> vl;
int main... | #include <bits/stdc++.h>
#include <string>
#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(){
int n;
cin >> n;
vector<string> s(n);
vector<int> cnt(4);
rep(i,n) {
string s;
cin >> s;
... | 0 | 45,830,664 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for(int (i)=0; (i) < (n); (i)++)
int main()
{
string S; cin >> S;
ll a, b, c, d;
a = S[0] - '0';
b = S[1] - '0';
c = S[2] - '0';
d = S[3] - '0';
ll index = 0;
string ans = "";
rep(i, (1<<3)) {
ll tmp ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MAX 10000
using namespace std;
typedef long long ll;
string devide[4] = {"dream", "dreamer","erase","eraser"};
int main(){
string s;
cin>>s;
reverse(s.begin(),s.end());
for(int i=0;i<4;i++){
reverse(devide[i].begin(),devide[i].e... | 0 | 13,393,758 |
#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <cmath>
#include <map>
#include <iomanip>
#include <unordered_map>
using namespace std;
typedef long long ll;
int main()
{
ll N;
cin >> N;
vector<ll> a(N);
for (ll i = 0; i < N; i++)
{
cin >> a[i];
}
sort(a.begin(), a.end());... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int n;
cin>>n;
int A,B,C,D;
int sum=0;
A=n/100... | 0 | 39,005,405 |
#include<iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cmath>
#include <set>
#include <functional>
using namespace std;
int d[102];
int main()
{
int n,a,b,c,x;
while(true){
cin>>n>>a>>b>>c>>x;
int tot=0;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<P> r(n), b(n);
rep(i, n)cin >> r[i].fir... | 0 | 45,066,995 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
char table[110][110];
const int inf = 1010;
void chmin(int &a, int b){
if( a > b ){ swap(a,b);}
return ;
}
signed main(void){
int h,w; cin >> h >> w;
vector<vector<int>> dp(h,vector<int>(w,inf));
dp[0][0] = 0;
for(int i = 0; i < h; i++){ ... | 0 | 46,259,344 |
#include <iostream>
using namespace std;
int main()
{
for(int a=1;a<=9;a++)
{
for(int b=1;b<=9;b++)
cout << a << "x" << b << "=" << a*b <<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll = vector<ll>;... | 0 | 24,415,712 |
#include <iostream>
#include <string>
using namespace std;
int main(void){
string str,tmp,command;
int q,a,b;
cin>>str>>q;
for(int i=1;i<=q;i++){
cin>>command>>a>>b;
if(command=="print"){
cout<<str.substr(a,b-a+1)<<endl;
}else if(command=="reverse"){
tmp=s... | #include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const int MOD = 998244353;
const ll INF = 1000000000000000000;
i... | 0 | 64,817,100 |
#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
#define ll long long
#define ull unsigned long long
#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ff first
#define ss second
#define vt vector
#define vll vt... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using vb=vector<bool>;
using vvb=vector<vb>;
using pii = pair<int,int>;
using pli = pair<ll,int>;
using pll = pair<ll,ll>;
using vpii = vector<pii>;
using vpli = vec... | 0 | 16,064,692 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
double ans = 0;
for(int i = 0; i < n; i++){
double a; string s; cin >> a >> s;
if(s == "BTC") ans += a * 380000.0;
else ans += a;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1000000007;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
typedef pair<ll,Pll> Pl... | 0 | 88,495,112 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N,P;
cin>>N>>P;
cout<<N-P+1;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int W, H, N;
cin >> W >> H >> N;
int x[N], y[N], a[N];
for(int i=0; i<N; i++){
cin >> x[i] >> y[i] >> a[i];
}
int xl=0, yd=0;
int xr=W, yu=H;
for(int i=0; i<N; i++){
if(a[i]==1){
xl=max(xl, x[i]);
... | 0 | 21,995,668 |
#include "bits/stdc++.h"
using namespace std;
int main() {
string A, B;
cin >> A >> B;
reverse(B.begin(),B.end());
if (A == B) {
cout << "YES"<<endl;
}
else {
cout << "NO"<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#ifdef hacks
#include <boost/multiprecision/cpp_int.hpp>
#endif
#define p std::pair
#define ll... | 0 | 16,561,832 |
#include <iostream>
using namespace std;
int main() {
long N, M, x[100010], y[100010], mod=1000000007; cin >> N >> M;
for(int i=0; i<N; ++i) cin >> x[i];
for(int i=0; i<M; ++i) cin >> y[i];
long XSUM=0, YSUM=0, mul, Int;
for(int i=1; i<N; ++i){
mul=(i*(N-i))%mod, Int=(x[i]-x[i-1])%mod;
XSUM=(XSUM+Int*mul... | #include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
void solve(long long N, long long D, long long X, std::vector<long long> A){
int ans = 0;
REP(i, N) {
int count = 0;
while (true) {
if (A[i] * count + 1 <= D) count++;
... | 0 | 93,503,770 |
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
int n,k,a,max;
int set[100001];
while(1){
scanf("%d %d",&n,&k);
if(n==0 && k==0)break;
max=0;
for(int i=0;i<n;i++){
scanf("%d",&set[i]);
}
for(int i=0,sum=0;i<n-k+1;i++,sum=0){
if(set[i-1]<set[i+k-1] || i==0){
for(int ... | #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 | 89,546,754 |
#include<iostream>
int main()
{
int appear[100];
for (int i = 0; i < 100; i++)
{
appear[i] = 0;
}
int max = 0;
for (int num; std::cin >> num;)
{
appear[num - 1]++;
if (max < appear[num - 1])
{
max = appear[num - 1];
}
}
for (int i = 0; i < 100; i++)
{
if (appear[i] == max)
{
std::cout << i... | #include<iostream>
#include<vector>
using namespace std;
class Disjoint{
private:
vector<int> S;
vector<int> rank;
int find(int x){
if (x == S[x]) {
return x;
}
return x = find(S[x]);
}
public:
Disjoint(int n) {
for (int i = 0; i < n; i++) {
S.... | 0 | 14,364,368 |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
mt... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
using P = pair<int,int>;
int main(){
int n;
while(cin>>n,n){
vector<P> V;
V.clear();
for(int i=0;i<n;i++){
int hh,mm,ss;
cin>>hh;
cin.ignore();
cin>>mm;
... | 0 | 17,982,202 |
#include <iostream>
#include <set>
using namespace std;
int main() {
string S; cin >> S;
set<char> C;
for (int i = 0; i < 4; i++) C.insert(S[i]);
if (C.size() == 2) printf("%s\n", "Yes");
else printf("%s\n", "No");
} | #include <bits/stdc++.h>
typedef long long int int64;
struct vertex {
int i;
int64 val;
int size;
int parent;
int next,child;
int depth;
} v[100003];
void dfs(int i)
{
for(int j = v[i].child;j != -1;j = v[j].next) {
v[j].depth = v[i].depth + 1;
dfs(j);
}
}
int n;
bool cmp1(const vertex &a,const vertex &b) {... | 0 | 74,341,529 |
#include <iostream>
using namespace std;
void swap(int &i, int &j) {
if (i == j) {
} else if (i < j) {
} else {
int tmp;
tmp = i;
i = j;
j = tmp;
}
}
int main() {
int i, j, k;
cin >> i >> j >> k;
int a, b, c;
swap(i, j);
swap(i, k);
swap(j, k);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
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,... | 0 | 94,082,907 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD (1000000007)
#define MOD2 (998244353)
#define MOD3 (1000000009)
#define PI acos(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3000 + 50;
const int mod = 1e9 + 7;
int n,k;
int h[N];
ll dp[N][N];
int main()
{
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i)
scanf("%d", h + i);
if (n == k)
{
puts("0");
return 0;
}
... | 0 | 57,253,905 |
#include<iostream>
#include<cstdlib>
#include<cstdio>
template<int BUFSIZE>
struct ans_buf {
char buf[BUFSIZE];
int i;
ans_buf(): i(0) {}
void putZ(unsigned int v, char delim='\n') {
unsigned int k = 1;
while(k <= v/10) k*=10;
for(; k>0; v%=k, k/=10) buf[i++] = (v/k)+'0';
buf[i++] = delim;
}
... | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_... | 0 | 38,244,447 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n-1; i >= 0; i--)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
const int mod = 1e9+7;
const int INF = 1e9;
const int MAX = 1e6;
int m... | #include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <list>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <fstream>
#include <sstream>
#include <unordered_map>
#include <ctime>
using namespace std;
const unsigned long long BASE = (unsigned long long)(1e9 + ... | 0 | 66,690,809 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#include<tuple>
#define DIV 1000000007
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
ll N; cin >> N;
vector<ll> a(N);
f... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1000000007;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
typedef pair<ll,Pll> Pl... | 0 | 88,398,391 |
#include<iostream>
using namespace std;
int main(){
long long int n,m;
cin>>n>>m;
if(n>m)
{
long long int temp=n;
n=m;
m=temp;
}
if(n==1&&m==1){
cout<<"1";
return 0;
}
if(n==1)
{
cout<<(m-2);
}
else
cout<<(n-2)*(m-2);
} | #include <iostream>
using namespace std;
int table_r[10]={0,5,3,3,3,3,3,4,3,4};
char t[10][5] = {{0,0,0,0,0},{'.', ',', '!', '?', ' '},};
int main(){
char abc='a';
for(int i=2; i<=9; i++){
for(int j=0; j<table_r[i]; j++){
t[i][j]=abc++;
}
}
int n;
cin >> n;
char buf[1... | 0 | 10,229,124 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.