code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#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++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using Pint = pair<int,int>;
const ll mod = 1e9+7;
ll g1(ll n, ll p){
if(n==0) retu... | #include <iostream>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <cmath>
#include <cstdarg>
#include <cstdlib>
#include <string>
#include <tuple>
#include <queue>
#include <algorithm>
using namespace std;
typedef pair<int, int> P;
int main(int argc, char const *argv[])
{
int h, w;
cin >> h >>... | 0 | 70,615,417 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0 ; i < n ; i++)
class Dice{
private:
int tmp;
public:
int d[6];
void rollN(){
tmp = d[0];
d[0] = d[1];
d[1] = d[5];
d[5] = d[4];
d[4] = tmp;
}
void rollE(){
tmp = d[0];
d[0] = d[3];
d[3] = d[5];
d[... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <cmath>
#include <string>
using namespace std;
using Int = long long;
int main()
{
int a, b;
cin >> a >> b;
a--, b--;
vector<string> vs;
if (a == 0) {
string s;
for (int i = 0; i < 100; i++) s += "... | 0 | 27,876,211 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000
#define base10_5 100000
#define base10_6 1000000
#define base10_7 ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#defi... | 0 | 23,442,219 |
#include <iostream>
#include <bitset>
using namespace std;
int main() {
char c;
cin >> c;
if(c == 'a' || c == 'i' || c == 'u' || c == 'e' || c == 'o'){
cout << "vowel" << endl;
}else{
cout << "consonant" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,A;
cin >> N >> A;
vector<int>x(N);
for (int i = 0; i < N; i++) {
cin >> x.at(i);
x.at(i) = abs(x.at(i)-A);
}
if (N == 1){
cout << x.at(0) << endl;
return 0;
}
int X = x.at(0);
int Y = x.a... | 0 | 37,959,449 |
#include <iostream>
using namespace std;
int dp[50];
int fib(int n){
if(n<2)
return 1;
if(dp[n]!=-1)return dp[n];
return dp[n]=fib(n-1)+fib(n-2);
}
int main(){
int N;
for(int i=0 ; i<50 ; i++ )
dp[i]=-1;
cin >> N;
cout << fib(N) << ... | #include <iostream>
class CStack
{
public:
CStack()
{
topIndex = 0;
}
~CStack(){;}
void push(char charactor)
{
if(topIndex < 100)
{
stack[topIndex] = charactor;
++topIndex;
}
}
char pop(void)
{
if(topIndex > 0)
... | 0 | 41,000,268 |
#include<iostream>
#include<queue>
#include<string>
#include<vector>
#include<math.h>
#include<algorithm>
#include<cstdio>
#include<stdio.h>
#include<stack>
#include<sstream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<list>
#include<numeric>
typedef long long ll;
#define pi 3.141592653589793238462... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> v_odd(n / 2), v_even(n / 2);
for(int i = 0; i < n; ++i) {
if(i % 2 == 0) {
cin >> v_odd.at(i / 2);
}
else {
cin >> v_even.at(i / 2);
}
}
sort(v_odd... | 0 | 85,921,211 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n{0};
cin>>n;
ll arr[n];
for(ll i=0;i<n;i++)
cin>>arr[i];
ll money=1000;
ll start{0};
for(ll i=0;i<n-1;i++){
if(arr[i+1]>ar... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define pii pair <ll, ll>
#define piii pair <ll, pii>
#define F first
#define S ... | 0 | 56,307,797 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,Q;
cin >> N >> Q;
vector<int> data(N);
for(int i=0; i<N; i++){
cin >> data.at(i);
}
vector<int> cumsumL(N+1);
vector<int> cumsumR(N+1);
for(int i=1; i <= N; i++){
cumsumL.at(i)= cumsumL.at(i-1)+ data.at(i-1);
cumsumR.at(i)= cums... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n, c, k;
cin >> n >> c >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int t = a[0];
int ans = 1;
int c_ = 1;
for (int i = 1; i < n; i++) {
if (t + k >= a[i]) {
... | 0 | 76,596,818 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000
#define base10_5 100000
#define base10_6 1000000
#define base10_7 ... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
const int INF = 1<<10;
int H, W, N;
char field[1010][1010];
int dx[4] = {0,0,1,-1}, dy[4] = {1,-1,0,0};
int vt[1010][1010];
int sx, sy;
int cnt = 0;
int bfs() {
for (int i = 1; i <= N; i++) {
queue<P> q;
for (int y = 0; y < H; y++)
... | 0 | 54,849,105 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, z, w;
cin >> n >> z >> w;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
if (n == 1) cout << abs(a[0] - w);
else cout << max(abs(a[n - 2] - a[n - 1]), abs(w - a[n - 1]));
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | 0 | 17,469,190 |
#include<iostream>
#include<vector>
#include<queue>
#include<string>
#include<algorithm>
#include<map>
#include<cmath>
#include<cstring>
#include<iomanip>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define INF 1000000100
#define rep(i,n) for (int i=0;i<n;i++)
int main(){
int N... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <set>
#include <map>
#include <list>
#include <cstdlib>
#include <queue>
#include <stack>
using namespace std;
#define mod (1e9 + 7)
#define PI 3.141592653589793... | 0 | 98,671,045 |
#include<iostream>
using namespace std;
int main(){
int a,b;
while(cin>>a>>b,a+b){
if(a<b) cout<<a<<' '<<b<<endl;
else cout<<b<<' '<<a<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using Graph=vector<vector<int>>;
#define MAX 1000000
#define MOD 1000000007
#define INF 100000000000000
int main(){
int H,W,A,B;
cin>>H>>W>>A>>B;
for(int i=0;i<B;i++){
for(int j=0;j<A;j++){
cout<<1;
}
for(int j=A;j<W;j++){
c... | 0 | 42,697,519 |
#include<bits/stdc++.h>
using namespace std;
const int maxn = 600 + 10;
int n;
char s[maxn][maxn];
int main() {
scanf("%d", &n);
for(int i = 1;i <= n;i ++) scanf("%s", s[i] + 1);
for(int i = 1;i <= n;i ++) {
for(int j = 1;j <= n;j ++) {
s[i][j + n] = s[i][j];
s[i + n][j] = s[i][j];
s[i + n][j + n] = s[i]... | #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR... | 0 | 94,423,154 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, x, check[105] = {0};
cin >> x >> n;
rep(i, n) {
int tmp;
cin >> tmp;
check[tmp] = 1;
}
int ans, tmp = 1000;
for(i... | #include <bits/stdc++.h>
using namespace std;
#define for_(i, s, e) for (int i = s; i < e; i++)
#define for__(i, s, e) for (ull i = s; i < e; i++)
#define SSTR(x) static_cast<std::ostringstream&>((std::ostringstream() << std::dec << x)).str()
typedef unsigned long long ull;
typedef long long ll;
typedef vector<int> v... | 0 | 67,621,966 |
#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... | #include <iostream>
#include <string>
using namespace std;
bool judge (char c)
{
if (c=='y' || c=='u' || c=='i' || c=='o' || c=='p' || c=='h' || c=='j' || c=='k' || c=='l' || c=='n' || c=='m') return true;
else return false;
}
int main()
{
while (1)
{
int ans=0; bool hand;
string s; char... | 0 | 37,573,652 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
using namespace std;
#define MAX_V 11
#define INF (INT_MAX/2)
void floydwarshall(int V, vector< vector<int> > &dist){
for(int k = 0; k < V; k++){
for(int i = 0; i < V; i++){
for(int j = 0; j < V; j++) dist[i][j] = min(dist[i][j], ... | 0 | 81,556,220 |
#include <iostream>
#include <vector>
#include <limits.h>
using namespace std;
int main()
{
int i = 0, maxV = INT_MIN, A[30] = {};
for (int k; cin >> k; ) {
A[i++] = k;
if (maxV < k)
maxV = k;
}
int s = maxV + 1;
vector<long> vP(s, 0);
int c = 0, j;
for (int k = 2; k < s; ++k){
if (vP[k] == 0){
vP[k]... | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<double, double> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() ret... | 0 | 17,204,844 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<string >blue(n);
for(int i=0;i<n;i++)cin>>blue[i];
int m;cin>>m;
vector<string >red(m);
for(int i=0;i<m;i++)cin>>red[i];
int maxi=0;
for(int i=0;i<n;i++){
string s = blue[i];
int curr=0;
for(int j=0;j<n;j++)if(blue[j... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int i = s.size();
bool tag = true;
while (i != 0)
{
if(i > 4 && s.substr(i-5,5) == "dream"){
i -= 5;
}
else if(i > 6 && s.substr(i-7,7) == "dreamer"){
i -= 7;
}
... | 0 | 16,040,821 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
int H, W; cin >> H >> W;
int i = 0; int j = 0;
string s;
while (i < H){
while(j < W){
cin >> s;
if (s =... | #include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 1000000007
#define inf 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n;... | 0 | 35,472,078 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,K;
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
int C;
if (i % 2 == 0){
if (A % 2 == 1){
A--;
}
A = A/2;
B += A;
}
else {
if (B % 2 == 1){
B--;
}
B = B/2;
A += B;... | 0 | 55,025,309 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int v[2]={};
for(int i=0; i<2; i++){
for(int j=0; j<4; j++){
int n;
cin >> n;
v[i] += n;
}
}
cout << max(v[0], v[1]) << endl;
} | #include<iostream>
using namespace std;
int main (){
int a,b;
for(a=1;a<=9;a++){
for(b=1;b<=9;b++)
cout<<a<<"x"<<b<<"="<<a*b<<endl;
}
return 0;
} | 0 | 54,507,014 |
#include <bits/stdc++.h>
using namespace std;
const int64_t INF=999999999;
int main() {
int A,B,C;
cin>>A>>B>>C;
vector<int>K={A,B,C};
sort(K.begin(),K.end());
cout<<10*K[2]+K[1]+K[0]<<endl;
return 0;} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll modl = 1e9 + 7;
void fast() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef tmr
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main() {
ll n , m;
cin >> n >> m;
char grid[n][m];
for... | 0 | 8,362,650 |
#include <iostream>
using namespace std;
int main()
{
int iN, Temp;
int iNum[3], iTrueFlag[1000];
cin >> iN;
for( int i=0; i<iN; i++ ){
cin >> iNum[0] >> iNum[1] >> iNum[2];
for( int j = 0; j < 3; j++ ){
for( int k = j + 1; k < 3; k++ ){
if( iNum[j] > iNum[k] ){
Temp = iNum[j];
iNum[j] = iNu... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
string s,t;cin>>s>>t;
int n = s.size();
rep(i,n){
int tmp=0;
rep(j,n){
if(s[j]!=t[(i+j)%n])tmp=1;
}
if(tmp==0){
cout<<"Yes"<<endl;
... | 0 | 55,266,099 |
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main(void) {
int N,M;
cin >> N >> M;
vector<int>a(M + 5);
vector<int>b(M + 5);
int k = 0, j = 0;
if (N%2==1) {
for (int i = 1; i <= M; i++) {
a[i] = i;
b[i] = N - i + 1;
cout << a[i] << ' ' << b[i] << endl;
... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <sstream>
#include <vector>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <algorithm>
#include <functional>
using namespace std;
#define rep(i,n) for((i)=0;(i)<(int)(n);(i)++)
#define foreac... | 0 | 100,860,930 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <random>
#include <chrono>
#include <tuple>
#include <random>
#include <cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fastInp cin.tie(0); cout.tie(0); ... | #pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 +... | 0 | 13,150,405 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n,count = 0,ans = -1,flag;
cin>>n;
for(int i = 1;i<=n;i++)
{
count = 0;
int temp = i;
while(temp%2 == 0 && temp != 0)
{
count++;
temp = temp/2;
}
if(count ... | #include<bits/stdc++.h>
#define INF (int)1e9
#define EPS 1e-9
#define MOD 1000000007ll
#define PI 3.14159
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define REP(i, a, b) \
for (int i = int(a); i <= int(b); i++)
#define TRvi(c, it) \
for (vi::iterator it = (c).begin(); it != (c).end();... | 0 | 71,139,727 |
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <memory.h>
#include <vector>
#include <queue>
using namespace std;
typedef long long LL;
typedef unsigned int u32;
#define pb push_back
int o[100];char str[5];
void Print(LL num,int tag=1)
{
int l=0;printf("? ");
while (num) o[++l]=num%10,num/=10;
... | #include<bits/stdc++.h>
typedef long long int ll;
#define ull unsigned long long int
#define lld long double
#define endl "\n"
#define fi first
#define sec second
#define sp setprecision
#define lb lower_bound
#define ub upper_bound
#define For(i, a, b) for(long long int i = (a); i <= (b); i++)
#define Forr(i, a, b)... | 0 | 69,243,734 |
#include <iostream>
#include <cmath>
#include <iomanip>
#include <limits>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <map>
#include <list>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(n);i++)
int main(){
ll a[6],n1=0,n2=0,n3=0,n4=... | #include <cstdio>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <cmath>
using namespace std;
typedef long long ll;
long long a[200100],b[200100];
int main ()
{
int n;
while(~scanf("%d",&n))
{
long long ma=1e17,dd,bb=0;
long long sum... | 0 | 64,088,707 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define R... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a),end(a)
#define FOR(x,val,to) for(int x=(val);x<int((to));++x)
#define FORE(x,val,to) for(auto x=(val);x<=(to);++x)
#define FORR(x,arr) for(auto &x: arr... | 0 | 4,785,026 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll mod= 1e9 + 7;
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
using namespace std;
usi... | 0 | 40,514,522 |
#include <algorithm>
#include <iostream>
int main() {
long long n, a, b;
std::cin >> n >> a >> b;
long long const s = a + b;
std::cout << ((n/s) * a + std::min(n % s, a) ) << std::endl;
} | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
typedef long double lb;
typedef pair<int,int> P;
const int MOD = 1000000007;
const ll INF = 1e16;
const double EPS = 1e-10;
const double PI = 3.141592653589793;
template<class T... | 0 | 27,841,297 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main(){
int n, m;
scanf("%d %d", &n, &m);
vector<int> a(m);
for(int i = 0; i < m; i++){
scanf("%d", &a[i]);
}
sort(a.begin(), a.end(), greater<int>());
vector<int> data = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
vector<ll> dp(n + 1, -100000);
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array)/sizeof(array[0]))
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<vector<int>>;
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;... | 0 | 58,048,080 |
#include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll > pi;
typedef pair<pair<ll, ll >, ll > pii;
vector<ll > vec;
vector<vector<ll > > vec2;
ll MOD = 1000000007;
ll INF = 1145141919454519;
int main(){
ll K, A, B;
cin >> K >> A >> B;
ll ans = 0;
if(A >= B || B -... | #include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<stack>
#include<climits>
#include<cstring>
#include<queue>
#include<complex>
using namespace std;
void grading(int m, int f, int r){
if(m == -1 || f == -1) {cout << "F" <<endl;return;}
if(m+f >= 80... | 0 | 75,522,875 |
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
#define INF 1LL<<60
#define fs first
#define sc second
#define pb push_back
#define int long long
#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(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#d... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
int main() {
string s;
cin >> s;
rep(i, 3) {
if (s[i] == '1')
cout << 9;
else if (s[i] == '9')
cout << 1;
... | 0 | 21,566,757 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | #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 = 0; i < (n); i++)
#define Rep(i, n) for(ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.... | 0 | 73,589,346 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, ans;
vector<string> vo ={"a","i","u","e","o"};
ans = "consonant";
cin >> s;
for (int i=0;i<5;i++){
if (vo.at(i) == s){
ans = "vowel";
}
}
cout << ans << endl;
} | #include<iostream>
using namespace std;
int main(void)
{
int noth,easu,n,i2,x,y,j1;
int road[18][18];
while(1){
cin>>easu>>noth;
if(easu==0&¬h==0)break;
j1=0;
cin>>n;
for(int i=1;i<=easu;i++){
for(int j=1;j<=noth;j++){
road[i][j]=-1;
... | 0 | 65,745,815 |
#include <iostream>
using std::cout;
using std::cin;
using std::endl;
int main()
{
while (1) {
int h, w;
cin >> h >> w;
if (h == 0 && w == 0) {
break;
}
for (int j = 0; j < w; j++) {
cout << "#";
}
cout << endl;
for (int i = 1; ... | #include<iostream>
using namespace std;
int main(){
int n,num=0;
cin >> n;
if(n/100==n%10 && (n/10)%10==n%10){
cout << n << endl;
}
else{
if(n/100<(n/10)%10){
num=n/100;
num++;
cout << num*100+num*10+num << endl;
}
else if(n/100==(n/10)%10 && n/100<n%10){
num=n/100;
... | 0 | 35,675,372 |
#include<stdio.h>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#inc... | #include<bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL)
#define int long long
#define pb push_back
#define pp pop_back
#define mp make_pair
#define pi 2*acos(0.0)
#define scan(i) scanf("%lld",&i)
#def... | 0 | 43,652,280 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double R,G,X=0;
cin >> R;
cin >> G;
cout << 2*G-R;
return 0;
} | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#include<cmath>
#include<cstdint>
#define INF 1e9
#define rep(... | 0 | 21,452,884 |
#include <bits/stdc++.h>
using namespace std;
int main(){
double a, b;
int c;
cin >> a >> b;
c = (a+b)/2;
if((a+b)/2-c==0)
cout << c << endl;
else
cout << c + 1 <<endl;
} | #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 | 1,278,423 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long long h, n;
cin >> h >> n;
vector<pair<long long, long long> > ab(n);
for(long long i = 0; i < n; i++) cin >> ab[i].first >> ab[i].second;
vector<long long> dp(h+1, 1e9);
dp[0] = 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
int N;
cin >> N;
vector<string> S(N);
rep(i,N) cin >> S[i];
map<char,int> M;
for(int i=0;i<N;i++){
map<char,int> m;
... | 0 | 57,945,275 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <climits>
using namespace std;
int N;
vector<int> A;
vector<vector<int>> G;
vector<int> B;
vector<bool> isVisited;
int maxpair(vector<int> &v){
if(v.size() <= 1) return 0;
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
int x = a[1];
for (int i = 1; i <= n; i++)
{
if (x == 2)
{
cout << i << endl;
return 0;
}
... | 0 | 12,126,889 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0;i < (int)(n);i++)
int main() {
int n, sa = 0, sb = 0, m;
cin >> n;
vector<int> v(n);
rep(i, n) {
cin >> v[i];
sb += v[i];
}
m = sb;
rep(i, n-1) {
sa += v[i];
sb -= v[i];
m = min(m, abs(sa-sb));
}
cout << ... | #include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 1;
const int MOD = 1e9 + 7;
int dp[MAX];
void add_self(int &a, int b)
{
a += b;
if(a >= MOD)
a %= MOD;
}
void sub_self(int &a, int b)
{
a -= b;
if(a < 0)
a += MOD;
}
int main()
{
int n, k;
cin >> n >> k;
dp[0... | 0 | 42,545,463 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
void Yes() {printf(... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define reps(i,n) for(int i=1;i<=(n);++i)
#define all(x) (x).begin(),(x).end()
#define int long long
#define mk_p(a,b) make_pair((a),(b))
... | 0 | 76,249,507 |
#include <iostream>
using namespace std;
int main() {
int a,b;
cin>>a>>b;
int p[b],s=0;
for(int i=0;i<b;i++)
{
cin>>p[i];
s+=p[i];
}
if(s>=a) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
long long H,W,M;
cin>>H>>W>>M;
long long h[M],w[M];
set<pair<long long,long long>>m;
vector<long long> a(H,0);
vector<long long> b(W,0);
for(int i=0;i<M;i++){
cin>>h[i]>>w[i];
m.insert({h[i],w[i]});
a[h[i]-1]++... | 0 | 49,134,229 |
#include <iostream>
using namespace std;
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <vector>
#define INF 10 << 10
int a[100001];
int main() {
int n, k;
while (cin >> n >> k && n != 0 && k != 0) {
mems... | #include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef long long ll;
using namespace std;
ll n, a[100500], b[100500];
int main(){
cin >> n; ll sum = 0;
for(int i=1;i<=n;i++){
cin >> a[i];
sum += a[i];
}
ll k = n * (n + 1) / 2;
if(sum % k != 0){
cout << "... | 0 | 48,434,210 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(int)(n); i++)
using namespace std;
typedef long long LL;
int main(){
int N;
cin >> N;
cout << N/3 << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
long long int mod = (long long int)1000000007;
using namespace std;
void solve()
{
ll i,j,k,n;
std::cout.precision(10);
string s;
cin>>s;
n=s.size();
int yes=1;
int l=0,r=n-1;
while(l<r)
{
if(s[l]!=s[r])
{
yes=0;
... | 0 | 74,740,552 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int numStones;
cin >> numStones;
vector<int> heights(numStones);
for(int& height : heights) {
cin >> height;
}
int costTwoBefore = 0;
int costOneBefore = abs(heights[1] - heights[0]);
for(int i = 2; i < numStones; i++) {
... | #include <bits/stdc++.h>
#include <cstdlib>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
const int MOD = 1000000007;
long long mod(long long val, long long m) {
long long res = val % m;
if (res < 0) res += m;
return res;
}
bool is_prime(long long N) {
if (N == 1) return f... | 0 | 60,483,016 |
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define rep(i, f, n) for (int i = (f); i < (int)(n); i++)
#define repe(i, f, n) for (int i = (f); i <= (int)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int, int>;
int maxtime(int x) { ret... | #include <iostream>
#include <vector>
using namespace std;
vector<long long> LISLDS(long long N, long long A, long long B) {
vector<long long> res;
for (long long i = B-1; i >= 0; --i) res.push_back(i);
if (A == 1) return res;
long long rem = N - B;
long long p = rem / (A-1);
long long r = r... | 0 | 8,643,893 |
#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... | #include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>
#de... | 0 | 2,628,364 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, m; cin >> n >> m;
vector<vector<int>> graph(n+1);
for(int i = 0; i < m; i++){
int a, b; cin >> a >> b;
graph[a].push_back(b);
graph[b].push_back(a);
}
queue<int> que;
que.push(1);
vector<int> seen(n+1, -1);
seen[1] = 1;
vector<in... | #include <iostream>
#include<bits/stdc++.h>
#define int long long
using namespace std;
int32_t main() {
int n;
cin >> n;
int ans = 0;
for(int i=1; i<n; i++){
ans += ((min(n-1, i*i)/i)*2);
if(i*i < n){
ans -= 1;
}
}
cout << ans;
return 0;
} | 0 | 45,315,105 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define ins insert
#define vi vector<int>
const int mxN=2e5;
int main()
{
int k,x;
cin >> k >> x;
if(k*500>=x)
cout << "Yes";
else
cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using ii=pair<ll,ll>;
using vi=vector<ll>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (ll)1e18
#define all(x) (x).begin(),(x).end()
#define print(a); for(auto x:a)cout<<x<<" "; cout<<"\n... | 0 | 90,363,512 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin>>N>>M;
vector<int> a(N);
for (int i = 0; i<N; i++) cin >> a[i];
int sum = 0;
for(int i= 0; i< N; i++)sum += a[i];
int count=0;
for(int i=0;i<N;i++){
if (a[i]*4*M>=sum){
count++;
}
}
if(count>=M) cout<<"Yes"<<endl;... | #include <iostream>
#include <string>
#include <vector>
int main() {
int h, w;
std::cin >> h >> w;
std::vector<std::string> s(h);
for (int i = 0; i < h; i++) {
std::cin >> s[i];
}
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (s[i][j] == '#') {
if (i == 0) {
... | 0 | 6,561,598 |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define fi first
#define se second
#define lz length()
#define all(x) (x).begi... | 0 | 83,709,951 |
#pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include... | #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 INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
... | 0 | 53,067,493 |
#include<iostream>
using namespace std;
int main(){
int x, y;
while(1){
cin >> x >> y;
if(x==0&&y==0)
break;
if(x>=y)
cout << y << ' ' << x << endl;
else
cout << x << ' ' << y << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=(ll)1e9+7;
const ll INF=(ll)1e18+10;
const double PI = 2.0*acos(0);
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return ... | 0 | 25,931,304 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int num[100],n;
int a=0;
for(int i=0;i<100;i++)
num[i] = 0;
while(cin >> n)
num[n]++;
for(int i=0;i<100;i++)
a = max(a,num[i]);
for(int i=0;i<100;i++)
if(a==num[i])
cout << i << endl;
return 0... | #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 = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S>... | 0 | 94,917,277 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_N = (int)(1e5 + 5);
int n;
int p[MAX_N];
int idx[MAX_N];
int main(void) {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &(p[i]));
p[i] -= 1;
i... | #include <iostream>
#include <iomanip>
typedef long long ll;
using namespace std;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main()
{
int a, b;
cin >> a >> b;
if (a == b)
{
puts("Draw");
}
else if (a == 1)
{
puts(... | 0 | 38,443,190 |
#include<bits/stdc++.h>
#include<climits>
using namespace std;
#define debug(x,y) cout<<(#x)<<" " <<(#y)<<" is " << (x) <<" "<< (y) << endl
#define watch(x) cout<<(#x)<<" is " << (x) << endl
#define fast ios_base::sync_with_stdio(false)
#define fie(i,a,b) for(i=a;i<b;i++)
#define MOD 1000000007
#define mod 998244353
#d... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REP1(i, n) for(int i = 1; i <= (n); i++)
#define REPD(i,a,b) for (int i=(a);i<(b);i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> v... | 0 | 37,800,566 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x1,y1,x2,y2,x3,y3,x4,y4;
cin>>x1>>y1>>x2>>y2;
x3=x2+y1-y2;
y3=y2-x1+x2;
x4=x1+y1-y2;
y4=y1-x1+x2;
cout<<x3;
cout<<' ';
cout<<y3;
cout<<' ';
cout<<x4;
cout<<' ';
cout<<y4<<endl;
} | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define PB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define MAX(a,b) (a>b)?a:b
#define MIN(a,b) (a>b)?b:a
#define REP(n) for(int i=0; i<n; i++)
#define REPj(n) for(int j=0; j<n; j++)
#define REPS(... | 0 | 76,415,508 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef pair<int,int> P;
int main(){
ll N;
cin >> N;
ll ans = 0;
vector<ll> v;
for(ll i = 1;i*i<N;i++){
if(N%i != 0) continue;
v.push_back(i);
v... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
const ll MOD = 1e9 + 7;
const ll INF = 1e14;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
#define eb emplace_bac... | 0 | 36,362,403 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
using namespace std;
typedef long long ll;
typedef l... | #include<bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define READ freopen("in.txt","r",stdin)
#define WRITE freopen("out.txt","w",stdout);
#define pb push_back
#define mem(arr,val) memset(arr,val,sizeof(arr))
#define sf(x) scanf("%d",&x)
#define sf2(x,y) scanf(... | 0 | 81,305,295 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
int n,k;
cin >>n >>k;
ll cnt = 1;
rep(i,n){
cnt*=k;
if(i==0) k--;
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(j, m) for (int j = 0; j < (int)(m); j++)
#define rep2(i, l, n) for (int i = l; i < (int)(n); i++)
int main() {
string S;
cin >> S;
vector<int> V(26,0);
rep(i,S.size()) {
V[S[i] - 'a']++;
}... | 0 | 29,676,627 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int64_t, int64_t>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N, K, R, S, P;
cin >> N >> K >> R >> S >> P;
string T;
cin >> T;
const int64_t L = static_cast<int64_t>(T.length());
int64_t result = 0;
... | #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lld long double
#define w(x) ll x;cin>>x;while(x--)
#define mod 1000000007
#define speed ios_base::sync_with_stdio(false);cin.tie(0);
using namespace std;
int main(){
speed;
ll n; cin>>n;
vector<ll> a(n); for(auto &i:a)... | 0 | 89,924,705 |
#include <bits/stdc++.h>
#define ri register
#define int long long
#define E (n+1)
using namespace std; const int N=200010, Mod=1e9+7;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip... | 0 | 68,714,125 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <deque>
#include <queue>
#include <string.h>
#include <stack>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef long long ll;
typedef pair<int,int> P;
int main() {
int R,G,B,N;
cin >> R... | #include <bits/stdc++.h>
#define int long long
#define db(x) cerr<<#x<<" = "<<x<<'\n'
using namespace std;
const int MAX=1e5+5,MOD=1e9+7;
int n,mark[MAX],fact[MAX],inv[MAX];
int mul(int x,int k) {
if(k==0)
return 1;
int tmp=mul(x,k/2);
if(k%2==0)
return tmp*tmp%MOD;
return tmp*tmp%MOD*x%MOD;
}
int C(int n,int k... | 0 | 50,781,057 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << ((a % b) ? 1 : 0) << "\n";
} | #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> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
int m... | 0 | 4,713,848 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll m;
cin>>m;
ll N;
ll c=0;
cin>>N;
vector<ll>tr(N);
for(ll i=0;i<N;i++){
cin>>tr.at(i);
c+=tr.at(i);
}
ll b=m-c;
if(b<0){
b=-1;
}
cout<<b<<endl;
} | #include <iostream>
using namespace std;
int fx(int x){
return x*x;
};
int main() {
int d;
while( cin >> d)
{
int l = d;
int s = 0;
while(l <= 600 - d)
{
s += fx(l) * d;
l += d;
}
cout << s <<endl;
}
return 0;
} | 0 | 32,204,570 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (2e9)
#define INFL (2e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
using vint=vect... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
int N;
signed main() {
cin.tie(0); ios::sync_with_stdio(false);
cin >> N;
int pt = 0, px = 0, py = 0;
bool flag = true;
rep(i, N) {
int t, x, y; cin >> t >> x >>... | 0 | 3,522,706 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int n,h,w; scanf("%d%d%d",&n,&h,&w);
int ans=0;
rep(i,n){
int a,b; scanf("%d%d",&a,&b);
if(a>=h && b>=w) ans++;
}
printf("%d\n",ans);
return 0;
} | #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... | 0 | 62,814,750 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int counter = 0;
int n = s.size();
for(int i = 0; i < n; i++) {
if(s[i] == 'o') {
counter++;
}
}
int rest = 15- n;
counter += rest;
if(counter >= 8) {
puts("YES");
}... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
#define rep(i, n) for(int i = 0; i < n; i++... | 0 | 69,581,796 |
#include<iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
cout << "a" <<" ";
if(a>b){
cout << ">" ;
}else if(a<b){
cout << "<" ;
}else{
cout << "==";
}
cout << " "<<"b"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using ll = long long;
int main(){
int x, y, z;
cin >> x >> y >> z;
vector<int> a(x);
vector<int> b(y);
vector<tuple <int, int, int>> M(z);
int minA = 5000000;
rep(i, x){
cin >> a.at(i);
... | 0 | 69,890,902 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | #include <bits/stdc++.h>
using namespace std;
int main(){
int h, w;
cin >> h >> w;
vector<string> grid(h);
for(int i = 0; i < h; i++) cin >> grid.at(i);
vector<vector<int>> dp(h, vector<int> (w, 100000));
if(grid.at(0).at(0) == '#') dp.at(0).at(0) = 1;
else dp.at(0).at(0) = 0;
for(int i = 0; i < h; i++)... | 0 | 55,325,254 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main() {
string s; cin >> s;
auto s1 = s.substr(0, (s.size() - 1) / 2);
auto s2 = s.substr((s.size() + 3) / 2 - 1);
reverse(s2.begin(), s2.end());
auto s11 = s1.substr(0, (s1.size() + 1) / 2);
auto s12 = s1.subst... | #include <iostream>
#include <algorithm>
#include <vector>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
using namespace std;
int main()
{
int n,k;
cin >> n >> k;
if((n-1)*(n-2)/2<k){ cout << -1 << "\n";return 0;}
vector<int> a,b;
rep1(i,n-1){
a.push_back(1);b.push_back(1+i... | 0 | 74,405,153 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll LIM =1e9+7;
template<typename T>
void fin (T a){
cout<<a<<endl;
exit(0);
}
template<typename S>
void print(S a){
cout<<a<<endl;
}
int main(){
cin.t... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll (i)=0;(i)<(ll)(n);(i)++)
#define rept(i,n) for(ll (i)=0;(i)<=(ll)(n);(i)++)
#define reps(i,s,n) for(ll (i)=(s);(i)<(ll)(n);(i)++)
#define repst(i,s,n) for(ll (i)=(s);(i)<=(ll)(n);(i)++)
#define repr(i,n) for(ll (i)=(n);(i)>=0;(i)--)
#define each(itr,... | 0 | 5,379,582 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long LL;
#define maxn 101000
int main()
{
int n,i;
scanf("%d%d",&n,&i);
printf("%d\n",n-i+1);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | 0 | 66,838,618 |
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i,... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, a, b) for(int i = a, i##_len = (b); i < i##_len; ++i)
int graph[4][4];
bool visited[4];
bool all_vis(int cur) {
visited[cur] = true;
for(int i = 0; i < 4; ++i) if(graph[cur][i]) {
if(visited[i]) continue;
if(all_vi... | 0 | 26,498,002 |
#include <stdio.h>
int main()
{
int A,B,hasil;
scanf("%d %d", &A, &B);
if (A<10){
hasil = B + 100 * (10 - A);
}
else{
hasil = B;
}
printf("%d",hasil);
return 0;
} | #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 = 100005;
const int mod = 1e9 + 7;
ll a[ma... | 0 | 65,106,289 |
#pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <cstdlib>
using namespace std;
typedef ... | #include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <math.h>
#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 long long
#define ull unsigned long long
#define ... | 0 | 50,291,942 |
#include <bits/stdc++.h>
#define REP(i, m, n) for(int (i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class... | #include <bits/stdc++.h>
#define ll long long int
#define dbg(x) cout<<"( "<<#x<<" -> "<<x<<" )"<<endl;
using namespace std;
int main()
{
int n;
scanf("%d",&n);
int a[n];
int b[n];
for (int i=0;i<n;i++)
scanf("%d",&a[i]);
for (int j=0;j<n;j++)
scanf("%d",&b[j]);
int fac[9];
fac[0... | 0 | 73,466,078 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define pb push_back
#define all(_obj) _obj.begin(),_obj.end()
#define F first
#define S second
#define INF 1e18
#define pll pair<ll, ll>
#define vll vector<ll>
ll n,m,a,b,c,k,temp,x,y;
const int MAXN=1e6+11,mod=1e9+7;
inline ll max(ll a,ll b) {return ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
const int last_days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31,... | 0 | 26,915,526 |
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <set>
#define ll long long
using namespace std;
long long MOD = 1000000007;
int main(){
ll N, K;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
#define _for(i,j,N) for(int i = (j); i < (N);i++)
#define _rep(i,j,N) for(int i = (j); i <= (N);i++)
#define _dec(i,j,N) for(int i = (N-1);i >= 0;i--)
#define _dep(i,j,N) for(int i = (N); i>= 0;i--)
#define ALL(x) x.begin(),x.end()
#define LL long long
#define ULL unsigned ... | 0 | 37,109,539 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string s;
int q;
cin >> s;
cin >> q;
for(int i=0; i<q; ++i){
string od, p;
int a, b;
cin >> od >> a >> b;
if(od=="replace"){
cin >> p;
s = s.replace(a, b-a+1, p);
}
else if(od=="print"){
cout << s.subst... | #include <iostream>
#include <cstdlib>
#include <string>
#include <algorithm>
#include <stdio.h>
using namespace std;
int main(){
char s;
while(1){
scanf("%c", &s);
if(islower(s) != 0){
s = toupper(s);
}else if(isupper(s) != 0){
s = tolower(s);
}
printf("%c", s);
if(s == '\n')break;
}
return 0;
} | 0 | 46,392,034 |
#include<stdio.h>
int main(){
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a > b){
if (a > c){
if (b > c)
printf("%d %d %d\n", c, b, a);
else
printf("%d %d %d\n", b, c, a);
}
else
printf("%d %d %d\n", b, a, c);
}
else if (a > c)
printf("%d %d %d\n", c, a, b);
else if (b > c)
printf("... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmi... | 0 | 77,974,978 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
if (n==1)
{
cout<<"1";
}
if (n==2)
{
cout<<"1";
}
if (n==3)
{
cout<<"1";
}
if (n==4)
{
cout<<"2";
}
if (n==5)
{
cout<<"1";
}
if (n==6)
{
cout<<"2";
}
if (n==7)
... | #include <iostream>
using namespace std;
int main() {
int n,part,story,num,resi;
cin >> n;
int info[5][4][11];
for(int s = 1; s <= 4; s++){
for(int k = 1; k <= 3; k++){
for(int t = 1; t <= 10; t++){
info[s][k][t] = 0;
}
}
}
for(int i = 0; i < n; i++){
cin >> part >> story >> num >> resi;
info[part... | 0 | 50,089,027 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <cmath>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int>... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p;
#define ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define RREP(i, x) for (... | 0 | 42,242,780 |
#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 +... | # include <bits/stdc++.h>
# define rep(i, n) for(ll i = 0; i < (n); ++i)
# define reps(i, n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(ll i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(ll i=((int)(n)); i>0; --i)
# define ll long long
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((i... | 0 | 84,867,565 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string str;
getline(cin , str);
for(int i = str.size() - 1 ; i >= 0; i--)
cout << str[i];
cout << endl ;
} | #include <bits/stdc++.h>
using namespace std;
using ll= long long;
#define double long double
#define sz(x) (int)x.size()
#define all(x) (x).begin(),(x).end()
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define _set(x) __builtin_popcount(x)
#define PI 3.14159265358979323846264338327950L
... | 0 | 60,440,735 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
long long int n, k, a[3000];
int main(){
cin >> n >> k;
rep(i, n){
cin >> a[i];
}
long long int b[n][2];
rep(i, n){b[i][1] = b[i][0] = 0;}
rep(i, n){
rep(j, n){
if(a[j... | 0 | 96,607,228 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;scanf("%d%d",&n,&m);
int l=n/2,r=l+1;
if(n&1)for(int i=0;i<m;i++)printf("%d %d\n",l--,r++);
else{
for(int i=0;i<(m+1)/2;i++)printf("%d %d\n",l--,r++);
l=2,r=n;
for(int i=(m+1)/2;i<m;i++)printf("%d %d\n",l++,r--);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
bool count_black(vector<vector<char>> &array,int k){
int black = 0;
for(int i=0;i<array.size();i++){
for(int j=0;j<array.at(0).size();j++){
if(array.at(i).at(j) == '#') black++;
}
}
return black == k;
}
void show(vector<vector<cha... | 0 | 72,432,462 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
int main() {
int n;string s;
cin >> n >> s;
int x=0;
int d=0,a;
for(int i = 0; i < n; i++) {
if(s[i]=='(') d++;
else d--;
x=min(x,d);
}
for(int i = 0; i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
const long long INF = 1LL << 60;
ll mod = 1e9 + 7;
long long modinv(long long a, long long m)
{
long long b = m, u = 1, v = 0;
while (b)
{
long long t = a / b;
a -= t * b;
... | 0 | 46,364,494 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool ch... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | 0 | 99,474,211 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;... | #include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <string.h>
#include <vector>
#include <functional>
#include <queue>
#include <unordered_set>
#include <climits>
using namespace std;
typedef long long ll;
int main()
{
int N;
cin >> N;
ll A[10... | 0 | 50,787,885 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--... | #include<cstdio>
#define min(a,b) a<b?a:b
typedef long long LL;
int main()
{
LL a,b,T,ans=0;
bool flag=0;
LL mi=1111111111;
scanf("%lld",&T);
while(T--) {
scanf("%lld%lld",&a,&b);
if(a!=b) flag=1;
ans+=a;
if(a>b)
mi=min(b,mi);
}
if(!flag)
ans=mi;
printf("%lld",ans-mi);
} | 0 | 53,062,550 |
#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <queue>
#include <map>
#include <fstream>
#include <array>
#include <utility>
#include <functional>
using namespace std;
typedef long long Int;
#define REP(i , x) for(int i = 0 ; i < x ; ++i)
typedef pair<int, int> P;
Int a = 100000;... | #include<stdio.h>
#define MAX 100001
int main(){
int H, i;
int A[MAX];
scanf("%d",&H);
for(i=1;i<=H;i++){
scanf("%d",&A[i]);
}
for(i=1;i<=H;i++){
printf("node %d: key = %d, ",i,A[i]);
if(i/2 >= 1)printf("parent key = %d, ",A[i/2]);
if(i*2 <= H)printf("left key = %d, ",A[i*2]);
if(i*2+1 <... | 0 | 84,831,119 |
#include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define P pair<ll,ll>
#define INF 1000000000000000000
using namespace std;
int main(void){
char c; cin >> c;
if ('A' <= c && c <= 'Z')
cout << "A" << endl;
else
cout << "a" << endl;
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int H, W;
for (int k = 0; k<10000; k++)
{
cin >> H >> W;
if (H != 0 && W != 0)
{
for (int i=1; i<=H; i++)
{
for (int j=1; j<=W; j++)
{
cout << "#";
... | 0 | 43,065,038 |
#include <bits/stdc++.h>
using namespace std ;
#define int long long
int32_t main(){
int n;
cin >> n;
int a[n] ;
for(int i = 0 ; i < n ; i++) cin >> a[i] ;
int ans = 0 ;
int mx = 0 ;
for(int i = 0 ; i < n ; i++){
mx = max(mx , a[i]) ;
ans += mx - a[i] ;
}
cout << ans ;
return 0 ;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
int a, b;
int main(... | 0 | 40,390,423 |
#include <bits/stdc++.h>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep1(i,n) for (int i = 1; i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using ull= unsigned long long;
const ll K_MAX=1e5+5;
const ll Lmax=ll(1e18);
const ll Nmax=1e9;
const ll INF=1e9;... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<math.h>
#define pi 3.1415926
using namespace std;
struct point
{
double x, y;
};
int n;
double th = pi * 60 / 180;
void koch(int n, point a, point b)
{
if (n == 0) return;
point s, t, u;
s.x = (b.x + 2 * a.x) / 3;
s.y = (b.y + 2 * a.y) / 3;
t.x = (2... | 0 | 18,661,173 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namesp... | #include <bits/stdc++.h>
using namespace std;
#define INF 100000000
#define YJ 1145141919
#define INF_INT_MAX 2147483647
#define INF_LL_MAX 9223372036854775807
#define EPS 1e-10
#define Pi acos(-1)
#define LL long long
#define ULL unsigned long long
#define LD long double
const int MAX_N = 200005;
string S;
int SBit[MA... | 0 | 25,037,996 |
#include<bits/stdc++.h>
using namespace std;
#define MAX_A 100010
int cnt[MAX_A];
int main(void){
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
cnt[++a]++;
}
int ans = 0;
for (int i = 0; i < MAX_A; i++) {
int cu... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
#define ll long long
const int inf = 1000000000;
int main(){
string s;
cin >> s;
string ans= "yes";
rep(i,s.size()){
for(int j=i+1;j<s.size();j++){
if(s[i]==s[j]){
ans ="no";
... | 0 | 48,621,454 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.