code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<iostream>
using namespace std;
int main(void){
int n,a,min,max;
long long sum;
cin>>n;
cin>>a;
min=a;
max=a;
sum=a;
for(int i=1;i<=n-1;i++){
cin>>a;
if(min>a) min=a;
if(max<a) max=a;
sum=sum+a;
}
cout<<min<<" "<<max<<" "<<sum<<endl;
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int H;
int W;
int i;
int j;
while(1)
{
cin >> H >> W;
if(H==0 && W==0)
goto EXIT;
for(i=0;i<H;i++)
{
for(j=0;j<W;j++)
{
cout << "#";
}
cout <<"\n";
}
cout << "\n";
}
EXIT:;
} | 0 | 11,260,133 |
#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
class Point{
public:
double x,y;
Point(double xx,double yy){
x = xx;
y = yy;
}
};
double getDistance(Point p1, Point p2){
return sqrt(pow(p1.x - p2.x, 2) + pow(p1.y - p2.y, 2));
}
int main(){
Point p1(0,0), p2(0,0);
cin >... | #include <bits/stdc++.h>
using namespace std;
signed main(){
int n , p , a[55];
long long gu=0 , ki=0 , ans=0 , allgu=0 , GN=1 , GR=1 ,KN=1 , KR=1;
cin >> n >> p;
for(int i=0 ;i<n ;i++ ){
cin >> a[i];
if(a[i]%2 == 1){
ki++;
} else {
gu++;
}
}
... | 0 | 91,254,054 |
#include <iostream>
using namespace std;
int main()
{
long long int a,bi,ans;
double b;
cin>>a>>b;
bi=100*b+0.5;
ans=(a*bi)/100;
cout<<ans;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,ini,n) for(int i=ini;i<n;i++)
#define _rep(i,ini,n) for(int i=ini;i>=n;i--)
#define ToEnd(a) a.begin(),a.end()
uint64_t MOD=1000000007;
int main(){
int N,M; cin>>N>>M;
map<int,set<int>> adj;
rep(m,0,M){
int a,b; cin>>a>>b;
adj[a].in... | 0 | 79,934,349 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if(a<b) std::swap(a, b);
return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int f(int x) {
int res = 0;
while (x%2 == 0) {
x /= 2;
res++;
}
return re... | #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;
cin >> n;
vector<int> a(n),a2(n);
rep(i,n) cin >> a[i],a2[i]=a[i];
::sort(a2.rbegin(),a2.rend());
int first_max = a2[0];
int second_max = a2[1];
rep(i,n){
... | 0 | 72,468,148 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
#define all(ppp) ppp.begin(),ppp.end()
#define out(ppp) cout<<(ppp)<<endl
#define out1(ppp) cout<<(ppp)
#define MAX_CHAR 256
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=100005;
int n,cnt,last[N],sg[N];
struct edge{int to,next;}e[N*2];
int read()
{
int x=0,f=1;char ch=getchar();
while (ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while (ch>='0'&&ch<... | 0 | 91,061,593 |
#define _GLIBCXX_DEBUG
#include <iostream>
#include <string>
using namespace std;
int main(void){
string s, t;
cin >> s >> t;
int i=0;
for(char &c : s){
if(c == t[i]) i++;
else{
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
long long max = a * b;
long long res = 0;
int tmp = (a < b ? b : a);
for (long long i = tmp; i <= max; i += tmp) {
if (i % a == 0 && i % b == 0) {
res = i;
break;
}
... | 0 | 20,380,401 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int64_t MOD=1000000007;
const long long INF = 1LL<<60;
int main() {
int64_t N; cin>>N;
if(N%2==1) cout<<0;
else{
int64_t ans=0;
ans+=N/10;
N/=10;
while(N>=5){
N/=5;
ans+=N;
}
cout... | #include "bits/stdc++.h"
using namespace std;
int main() {
string S;
cin >> S;
int ans0 = 0;
for (int n = 0;n<S.size();++n) {
if (1 == n%2) {
if ('0' != S[n]) {
ans0++;
}
}
else {
if ('1' != S[n]) {
ans0++;
}
}
}
int ans1 = 0;
for (int n = 0; n < S.size(); ++n) {
if (1 == n % 2) {
... | 0 | 7,384,440 |
#include <iostream>
using namespace std;
int main() {
int N;
int t[110000], x[110000], y[110000];
cin >> N;
t[0] = x[0] = y[0] = 0;
for (int i = 0; i < N; ++i) cin >> t[i+1] >> x[i+1] >> y[i+1];
bool can = true;
for (int i = 0; i < N; ++i) {
int dt = t[i+1] - t[i];
int di... | #include <iostream>
#include <sstream>
#include <iomanip>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <stdexcept>
#include <algorithm>
#include <set>
#include <map>
#include <stdlib.h>
using namespace std;
int main(){
long int A,B,C,p,i;
p = 0;
cin >> A >> B >> C;
for(i = A;i <= A *... | 0 | 17,765,171 |
#include <iostream>
#include <vector>
#include <string>
struct SCard {
char suit;
int num;
};
void BubbleSort(std::vector<SCard> &v)
{
int size = v.size();
for (int i = 0; i < size; ++i) {
for (int j = size - 1; j >= 0; --j) {
if (v[j].num < v[j-1].num) {
SCard tmp = ... | #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() {
ll H, W; cin >> H >> W;
if (H%3 == 0 || W%3 == 0) {
cout << 0 << endl;
return 0;
}
ll a, b, c;
... | 0 | 13,540,588 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int n = N;
int O,Y,A,U,M,S,H,J,I;
O = N / 100000000;
N = N % 100000000;
Y = N / 10000000;
N = N % 10000000;
A = N / 1000000;
N = N % 1000000;
U = N / 100000;
N = N % 100000;
M = N / 10000;
N = N % 10000;
S = N / 1000... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifndef godfather
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
... | 0 | 50,713,394 |
#include <bits/stdc++.h>
#define F first
#define S second
#define maxn 200005
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define pi acos(-1)
#define bit(p,x) ((x>>p) & 1)
#define Task "CF"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int base = 100003;
const long lon... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include<cassert>
#include<numeric>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(i... | 0 | 90,300,577 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int a,b,c,d;
cin >> a >> b >> c >> d;
int ans1 = min(a,b);
int ans2 = min(c,d);
cout << (ans1 + ans2) << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
ll gcd(ll a, ll b) {
if (a%b == 0) {
return(b);
} else {
return(gcd(b, a%b));
}
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
int main() {
int n,m;
cin >... | 0 | 88,639,595 |
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
type... | #include <iostream>
using namespace std;
int main(){
int n; cin >> n;
for(int i = 0; i < 100; i++){
for(int j = 0; j < 100; j++){
if(4*i+7*j == n){
puts("Yes");
return 0;
}
}
}
puts("No");
return 0;
} | 0 | 85,479,741 |
#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define P(x) cout << (x) << "\n"
#define p(x) cout << (x)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i)... | #include<bits/stdc++.h>
typedef long long int LL;
typedef unsigned long long int ULL;
typedef long double dd;
#define endl "\n"
int dx[4]={1,-1,0,0};
int dy[4]={0,0,-1,1};
LL dp[2000001];
LL mod=1e9+7;
bool vis[100000],ok=1;
using namespace std;
bool isPrime(LL n) {
LL j;
for( j=2;j<=sqrt(n);j++){
if(n%j==0)... | 0 | 18,334,080 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for(int i=(s);i<(int)n;i++)
int INF=1e9+7;
int main() {
int64_t X, Y, r;
cin >> X >> Y;
r=Y/X;
int s=0;
while(r>0) {
r/=2;
s++;
}
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define FAST \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define rep(g, i, n) for (ll g = i; g < n; g++)
#define rev(g, n, i) for (ll g = n - 1; g >= i; g--)
#define all(v... | 0 | 37,010,587 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
int a, b, c, d... | #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <iomanip>
#include <cassert>
#include <random>
#include <tuple>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long l... | 0 | 8,852,204 |
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <cstdlib>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#i... | #include <cstdio>
#define SIZE 33554432
char Key[128];
int Hash;
char* c;
#define HASH(A) c = A; Hash = 1; while(*c){ Hash <<= 2; Hash += Key[*c]; ++c;}
int main()
{
Key['A'] = 0;
Key['C'] = 1;
Key['G'] = 2;
Key['T'] = 3;
bool* dic = new bool[SIZE];
int n;
std::scanf("%d\n", &n);
char st... | 0 | 48,774,422 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 123;
int N;
int freq[MAXN];
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
int d; scanf("%d", &d);
freq[d]++;
}
bool ans = true;
int diam = N-1;
while (freq[diam] == 0) diam--;
int mi = 0;
while (freq[mi] == 0) mi++;
ans &= (mi == ... | #include <iostream>
#include <string>
#include <map>
int main(){
int N;
std::cin >> N;
std::map<std::string, int> mp;
bool flag = true;
for (int i=0; i<N; i++){
char next;
std::string key;
std::cin >> key;
if (i == 0){
mp[key]++;
next = key.at(key.size()-1);
... | 0 | 48,852,322 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ll long long
static const int MAX = 10000;
static const ll INFTY = 1e12;
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,... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i = 0; i < n; ++i)
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,k; cin >> n >> k;
vector<ll> a(n); rep(i,n) cin >> a[i];
vector<ll> amaxh(n+1);
amaxh[0] = 0LL;
rep(i,n) amaxh[i+1] = max(... | 0 | 82,554,569 |
#include <iostream>
using namespace std;
int main()
{
int num1, num2, num3;
cin >> num1 >> num2 >> num3;
if(num3 >= num1 && num3 <= num2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.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 ch... | 0 | 90,377,048 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pii;
const int INF = 2e9;
const int MOD = 1e9+7;
const int MAX = 2e5+10;
const lint LNF = 2e18;
int n, A[MAX];
lint F[MAX], I[MAX];
int P[MAX], a, c;
lint pw(lint a, int e){
if(e==0) return 1;
lint t = pw(a, e/2); t = t*t%MOD... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vd = vector<doub... | 0 | 17,610,700 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
while(n--){
int y,m,d;
cin >> y >> m >> d;
int sum = 0;
for(int i=y;i<1000;i++){
if(i == y){
if(i%3 == 0){
sum += 21 - d;
sum += (10-m)*20;
}
else {
for(int j=m;j<=10;j++){
if(j == m) sum += 1 - d;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a... | 0 | 53,781,176 |
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#include <sstream>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll... | #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 cnt[105];
int dp[105][80];
int main(){
int n;
cin>>n;
rep(i,105)cnt[i]=1;
for(int i=1; i<=n; ++i){
int x=i;
for(int j=2; j*j<=x; ++j){
w... | 0 | 78,915,055 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int64_t out;
cin>>out;
for(int i=0;i<n-1;i++){
int64_t wk;
cin>>wk;
out = gcd(out,wk);
}
cout<<out<<endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
int A;
int B;
int sum = 0;
string n_str;
cin >> N >> A >> B;
for (int i = 1; i <= N; i++) {
n_str = to_string(i);
int tmp = 0;
for (int j = 0; j < n_str.size(); j++) {
tmp = tmp... | 0 | 43,678,897 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vect... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
#define REP(i,n) for (ll i = 0; i < n; ++i)
#define REPR(i,n) for (ll i = n-1; i >= 0; --i)
#define FOR(i,m,n) for (ll i = m; i < n; ++i)
#define FORR(i,m,n) for (ll i = n-1; i >= ... | 0 | 20,632,903 |
#include <stdio.h>
#include <iostream>
#include <ctype.h>
using namespace std;
int main(void)
{
char c;
int count[26] = {0};
while (cin >> c){
c = tolower(c);
if (c >= 'a' && c <= 'z') {
count[c-'a']++;
}
}
for (int i = 0; i < 26; i++) {
cout << (char)('a' + i) << " : " << count[i] << endl;
}
return ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 77,179,992 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const double PI = 3.1415926535897932384;
const int INF = 1000000000;
const ll LINF = 1000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijklmnopqrstuvwxyzabc";
const ll MOD = 1000000007;
struct UnionFind... | #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 ... | 0 | 82,274,595 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()
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)... | #include<stdio.h>
int main() {
char character1;
scanf("%c", &character1);
printf("%c", character1 + 1);
return 0;
} | 0 | 28,049,239 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
cin >> S;
for(int i = S.size() - 1; i > 0; --i) {
if (i % 2 != 0) {
continue;
} else {
string s_l, s_r;
s_l = S.substr(0, i / 2);
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int n;
string num;
int k;
int dp[202][2][10];
signed main() {
ios::sync_with_stdio(false);
cin >> num >> k;
n = num.length();
memset(dp, 0, sizeof dp);
dp[0][0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int op = 0; op ... | 0 | 79,228,630 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main(){
vector<int> nums(3);
rep(i,3) cin >> nums[i];
sort(RALL(nums));... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 90,012,962 |
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define P pair<int,int>
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int INF = 1001001001;
const int MOD = 1e9+7;
template<class T> inline bool chmax(T &a, const T &b){ if(a<b){ a=b; r... | #include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
int n, a, b;
cin >> n;
vector<vector<int>> red;
vector<vector<int>> blue... | 0 | 86,334,805 |
#include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define... | #include <bits/stdc++.h>
using namespace std;
int main() {
unordered_set<long long> s;
int h, w;
cin >> h >> w;
vector<int> cr(h), cc(w);
int m;
cin >> m;
for (int i = 0 ; i < m; ++i) {
int r, c;
cin >> r >> c;
--r; --c;
++cr[r]; ++cc[c];
s.insert(1LL ... | 0 | 12,759,625 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
typedef long long ll;
int main() {
int n,m;
cin >> n>>m;
if(n%2==1){
rep(i,m){
int a = n/2;
cout << (a-i) << " " << n-(a-i) << endl;
}
}else{
int a = n/2;
if(m<=... | #include<bits/stdc++.h>
using namespace std ;
const int N= 3e5;
int Mod = 1e9+7 ;
long long cum [N];
int main(){
string N;
cin >> N;
int ans = 0;
int tmp = 0;
for (int i = 0; i < N.length(); ++i) {
if (N[i] == 'R') {
tmp++;
ans = tmp;
} else {
if (... | 0 | 35,892,508 |
#define rep(i,n) for (int i=0;i<n;i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main(){
unsigned long long l,r;
cin >> l >> r;
unsigned long long mi=INT_MAX,i=0,j=0;
if(r/2019-l/2019!=0)
cout << 0 << endl;
else{
l%=2019;
r%=2019;
while(l+i!=r){
... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(int argc, const char * argv[]) {
int n, i, j, id, num, node;
scanf("%d", &n);
int A[n][n];
for(i = 0; i < n; i++){
for(j = 0; j < n; j++){
A[i][j] = 0;
}
}
for (i = 0; i < n; i++){
scanf("%d"... | 0 | 42,065,105 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <chrono>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <queue>
#include <ctime>
#include <stack... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <map>
#define rep(i,n) Rep(i,0,n)
#define Rep(i,k,n) for(int i=k ; i<n ; i++)
#define rep1(i,n) for(int i=1 ; i<=n ; i++)
#define vi vector<int>
#define vii vector<int,int>
#define Sort(v) sort(v.begin(),v.end())
#de... | 0 | 77,617,391 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <istream>
#include <sstream>
#include <iomanip>
#include <iterator>
#include <climits>
using namespace std;
typedef ... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_e... | 0 | 85,689,518 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#include <unordered_map>
typedef long long ll;
using namespace std;
const int mod=1e9+7;
const ll inf=(1e14);
ll solve(){
ll n,k,ans=0;
cin>>n>>k;
while(k<=n+1){
ans+=(k*(n-k+1)+1);
ans%=mod;
k++;
}
return ans;
}
i... | #include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
class Point
{
private:
double x;
double y;
public:
Point(double a, double b):
x(a), y(b)
{}
Point rotate()
{
double temp_x = x;
double temp_y = y;
temp_x = (1.0 / 2.0) * x - (s... | 0 | 70,606,249 |
#include<iostream>
#include<stack>
#include<vector>
using namespace std;
stack<int>S; int a; vector<int>t;
int main() {
cin >> a;
S.push(a);
while (cin >> a) {
if (a == 0) {
t.push_back(S.top());
S.pop();
}
else {
S.push(a);
}
}
for (int i = 0; i < t.size(); i++) {
cout << t[i] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
#define FOR(i, m, n) for(int i = m; i < n; i++)
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
int main(){
int H,W;
cin >> H >> W;
... | 0 | 51,132,884 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, u, k, v;
cin >> n;
vector<vector<bool>> am(n, vector<bool>(n));
for (int i = 0; i < n; ++i) {
cin >> u >> k;
for (int j = 0; j < k; ++j) {
cin >> v;
am[u - 1][v - 1] = true;
}
}
for (vector<bool>& i : am) {
cout << i[0];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (long unsigned int i=0; i<s.length()-2; i++){
if (s[i] == s[i+1]){
cout << i+1 << " " << i+2;
return 0;
}
if (s[i] == s[i+2]){
cout << i+1 << " " << i+3;
... | 0 | 96,470,685 |
#include <bits/stdc++.h>
using namespace std;
#define rapido ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define int long long
#define endl "\n"
void solve()
{
string s;string t;cin>>s>>t;
int ans=0;
for(int i=0;i<s.size();i++)
{
if(s[i]==t[i])
ans++;
}
cout<<ans<<... | #include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <array>
#include <unordered_map>
#include <complex>
#include <valarray>
#include <cassert>
#include <cmath>
#include <functional>
#in... | 0 | 42,914,341 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), i##_max = (b); i < i##_max; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
using namespace std;
constexpr int INF = 1 << 30;
constexpr int MOD = 1000000007;
struct Card {
char suit, val... | #include <cstdio>
#include <cstdint>
#include <vector>
#include <algorithm>
class UnionFind {
std::vector<intmax_t> tree;
public:
UnionFind(size_t n): tree(n, -1) {}
size_t find(size_t v) {
if (tree[v] < 0)
return v;
return (tree[v] = find(tree[v]));
}
bool unite(size_t u, size_t v) {
u = fi... | 0 | 16,796,326 |
#include <iostream>
using namespace std;
int w,h;
int count;
int dx[4]={1,0,-1,0};int dy[4]={0,1,0,-1};
char board[100][100];
void dfs(int x,int y){
count++;
board[y][x]='#';
for(int i=0;i<4;i++){
int nx=x+dx[i];int ny=y+dy[i];
if(nx>=0&&nx<w&&ny>=0&&ny<h&&board[ny][nx]=='.'){
d... | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); retur... | 0 | 26,264,220 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for(ll i = 2; i*i <= n; i++) {
if (n%i != 0) continue;
res.emplace_back(i,0);
while (n%i == 0) {
n/... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long k,a,b;
cin >> k >> a >> b;
if ( (a-1)+1+1>k||b<=a+2 ) {
cout << k+1 << '\n';
} else {
long long x=a;
long long kk=k;
kk-=(a-1);
x+=(long long)(b-a)*(kk/2);
if ( kk%2 ) {
x++;... | 0 | 68,277,093 |
#include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const int MAX = 100000;
static const int NIL = -1;
using namespace std;
int main() {
ll n,s,k; cin >> n >> k >> s;
ll p = 0;
ll c = s/k;
ll d = s-c*(k-1);
rep(i,n){
if(p < k){
... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n; i >= a;i--)
#define index_check(i,n) if(i > n-1 || i < 0) continue;
#define LINF 1e18
#define INF 1e9
using namespace std;
#define fs first
#define sc second
using P = pair<ll,ll>;
using Pll = pa... | 0 | 57,540,817 |
#include "bits/stdc++.h"
using namespace std;
#define ASC(vec) vec.begin(), vec.end()
#define DESC(vec) vec.rbegin(), vec.rend()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Rep(i, n) for (int i = 1; i < n; i++)
#define REP(i, vec) for (auto i = vec.begin(); i != vec.end(); ++i)
const int mod = 10... | #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
const long ... | 0 | 35,661,733 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
co... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int N = 2005;
const ll MOD = 1e9 + 7;
int n, m;
ll dp[N][N];
int main() {
cin.tie... | 0 | 45,494,254 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
constexpr int INF = 1e9+1;
int main(){
int n;
cin >> n;
vector<int> a(n);
set<int> odd;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#d... | 0 | 84,889,824 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
int N;
cin >> N;
vector<ll> A(N);
vector<ll> B(N);
vector<ll> diff;
ll a... | 0 | 34,804,328 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MS... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
using ll=long long;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ordered_set tree<pll, null_type,less<pll>, rb_tree_tag,tree_... | 0 | 97,473,937 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,s;cin >> N;
long long r = 0;
int max;
cin >> max;
for (int i = 0;i < N-1;i++){
cin >> s;
if (max < s){
max = s;
}
else{
r += max-s;
}
}
cout << r << endl;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define endl '\n'
#define pb push_back
#define fi first
#define se second
typedef long long ll;
#define double long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fr(a,b,c) for(int a=b; a<=c; a++)
#define rep(a,b,c)... | 0 | 49,071,057 |
#include <bits/stdc++.h>
using namespace std;
int main (void) {
int N, K;
string S;
cin >> N >> K >> S;
vector<int> nums;
int now = 1;
int cnt = 0;
for ( int i = 0; i < N; i++ ) {
if ( S.at(i) == now + '0' )
cnt++;
else {
nums.push_b... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define endl '\n'
#define pb push_back
#define fi first
#define se second
typedef long long ll;
#define double long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fr(a,b,c) for(int a=b; a<=c; a++)
#define rep(a,b,c)... | 0 | 49,414,318 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int N;
while (1) {
cin >> N;
if (!N) break;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int ans = 10000000;
for (int i = 0; i < N; i++) {
for (int j = ... | #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 ALL(v) (v.begin(),v.end())
#define COUT(x) cout<<(x)<<... | 0 | 27,179,970 |
#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 c... | #include <bits/stdc++.h>
#include <string.h>
#include <stdio.h>
using namespace std;
using std::cout;
#include <algorithm>
#include <map>
int main(){
long long n,m=0;
cin>>n;
map<string,long long>freq;
string x[n];
for(int i=0;i<n;i++)
{
cin>>x[i];
sort(x[i].begin(),x[i].end());
... | 0 | 62,236,353 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define f(a, b) for (ll i = a; i <= b; i++)
#define pb push_back
#define pf push_front
#define mp make_pair
using namespace std;
#define N 200005
const ll INF = 1000000000000000001;
const ll MOD = 1000000000;
void solve(){
string s; cin >> s;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
ll a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
sort(a, a + n);
ll sum[n];
sum[0] = a[0];
for(int i = 1; i < n; i++){
sum[i] = sum[i - 1] + a[i];
}
int ans = 0;... | 0 | 71,566,865 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define Sort(Array) sort(Array.begin(), Arra... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v)... | 0 | 64,155,705 |
#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 = 1e16;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
#define eb emplace_bac... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
bool seen[200010];
int dist[200010... | 0 | 58,252,123 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#include <u... | #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=(int)(s);i<(int)(n);i++)
typedef long long ll;
const int INF = 1e+9+7;
using ipair= pair<int,int>;
bool operator>(const ipair a,const ipair b){return a.first > b.first;};
int main(){
int N,M;
... | 0 | 7,121,290 |
#include <iostream>
using namespace std;
int main(){
int debt = 100000, n;
cin >> n;
for(int i = 0; i < n; ++i){
debt = ((int)(debt * 1.05) + 999) / 1000 * 1000;
}
cout << debt << endl;
return 0;
} | #include<stdio.h>
#include<string.h>
const int L = 14;
const int M = 1046527;
char H[M][L];
int getChar(char ch){
if ( ch == 'A') return 1;
else if ( ch == 'C') return 2;
else if ( ch == 'G') return 3;
else if ( ch == 'T') return 4;
}
long long getKey(char str[]){
long long sum = 0, p = 1, i;
for ( i = 0; ... | 0 | 86,182,949 |
#include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
string S;
cin>>S;
vector<char> vec(S.size());
for(int i=0;i<S.size();i++){
vec[i]=S[i];
}
sort(vec.begin(),vec.end());
bool check=true;
for(int i=0;i<S.size();i++){
if(vec[i]==vec[i+1]){
che... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = (0); i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define limit(x,l,r) ma... | 0 | 55,436,064 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define ld long double
#define pb push_back
#define pll pair<ll, ll>
#define vl vector<ll>
#define vvl vector< vector<ll> >
#define vlp vector< pair<ll, ll> >
#define vllp vector<pair<pll,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int INT_INF = 2147483646;
const ll LL_INF = 9223372036854775807;
const double PI=3.1415926535897932;
bool SecondCompare(const pair<int,int> &a,const pair<int,int> &b)
{
return a.second<b.s... | 0 | 41,379,148 |
#include <iostream>
using namespace std;
const int N = 102;
int dp[N][N], r[N], c[N];
int main()
{
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d %d", &r[i], &c[i]);
}
for (int k = 2; k <= n; k++)
{
for (int i = 0; i <= n - k; i++)
{
int m... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define per(i,a,b) for(int i=(b)-1;i>=a;i--)
#define sz(x) (int)... | 0 | 42,806,215 |
#include <iostream>
using namespace std;
int main(void){
int m, f, r;
while(true){
cin >> m >> f >> r;
if (m + f + r == -3){
break;
}
else if (m == -1 || f == -1){
cout << 'F' << endl;
}
else if (m + f >= 80){
cout << 'A' << endl;
}
else if (65 <= m+f && m+f < 80){
cout << 'B' << endl;
}... | #include<stdio.h>
int main(){
int n, a;
int y=0;
int l, m, k;
scanf("%d", &n);
int data[n];
char c[12];
int i;
for(i=0;i<n;i++){
scanf("%s %d",c,&a);
if(c[0]=='i'){
data[i]=a;
}
else if(c[6]=='F'){
i-=2;
n-=2;
}
else if(c[6]=='L'){
i--;
n--;
y++;
}
else{
... | 0 | 46,723,576 |
#include<stdio.h>
#include<string.h>
int main(){
char s1[1001];
int sum=0,i;
while(1){
scanf("%s",s1);
if(s1[0]=='0') break;
int len=strlen(s1);
for(i=0;i<len;i++){
sum+=s1[i]-'0';
}
printf("%d\n",sum);
sum=0;
}
return(0);
} | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define uint unsigned long long
#define int long long
#define double long double
#define pb push_back
#... | 0 | 67,060,240 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
int64_t A=2, B=1;
for(int i=0;i<N-1;i++){
int64_t C=B;
B+=A;
A=C;
}
cout<<B;
} | #include <bits/stdc++.h>
using namespace std;
vector<vector<int>> dist;
int levenshtein_distance(string a, string b) {
for (auto i = 0; i <= (int)a.size(); i++) dist[i][0] = i;
for (auto i = 0; i <= (int)b.size(); i++) dist[0][i] = i;
for (auto i = 1; i <= (int)a.size(); i++) {
for (auto j = 1; j <=... | 0 | 33,617,048 |
#include <stdio.h>
#include <string.h>
int main(){
char str[25];
scanf("%s", &str);
str[5] = ' ';
str[13] = ' ';
printf("%s", str);
return 0;
} | #include<iostream>
#include<cmath>
#include<limits.h>
using namespace std;
long long int getmaxdigit(long long int a,long long int b){
long long int count1=0,count2=0;
while(a!=0){
a/=10;
count1++;
}
while(b!=0){
b/=10;
count2++;
}
return max(count2,count1);
}
int... | 0 | 92,155,727 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int mxN = 1e5+20;
int n;
int64_t v[mxN+1][3];
int64_t dp[mxN+1][4];
int64_t go(int idx, int last) {
if(idx == n) {
if(last == 1) {
return max(v[idx][1... | #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)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | 0 | 42,377,971 |
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int a[5]={0};
int i;
for(i=0; i<5; i++){
scanf("%d", &a[i]);
}
sort(a,a+5);
for(i=4; i>=0; i--){
printf("%d",a[i]);
if(i!=0)printf(" ");
}
puts("");
} | #include <bits/stdc++.h>
using namespace std;
int n,K;
long long ans;
int mod = 1e9 + 7;
int main(){
scanf("%d%d",&n,&K);
for(int i=K;i<=n+1;i++){
long long mi = (long long)(i-1)*i/2LL;
long long ma = (long long)(n-i+1 + n)*i/2LL;
ans += ma-mi+1;
ans %= mod;
}
cout<<ans<<endl;
return 0;
} | 0 | 63,362,130 |
#include <iostream>
using namespace std;
void show(int nums[], int n) {
for (int k = 0; k < n; ++k) {
if( k == n - 1) {
cout << nums[k];
} else {
cout << nums[k] << " ";
}
}
cout << endl;
}
void select_sort(int nums[], int n) {
int count = 0;
for (int ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int x,n;
cin>>x>>n;
vector<int> p(n,0);
for(int i=0;i<n;i++){
cin>>p[i];
}
int min=51;
int ans=0;
for(int i=0;i<=101;i++){
if(min>abs(x-i)){
bool flag=true;
for(int j=0;j<n;j++){
... | 0 | 8,607,278 |
#include <iostream>
using namespace std;
int main(){
int a,i=0,b;
while(1){
i=0;
cin>>a;
if(a==0)break;
b=1000-a;
i=b/500;
b=b%500;
i+=b/100;
b=b%100;
i+=b/50;
b=b%50;
i+=b/10;
b=b%10;
i+=b/5;
b=b%5;
i+=b/1;
cout<<i<<endl;
}
r... | #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>
#include <cctype>
#in... | 0 | 87,682,007 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;++i)
#define SET(a,c) memset(a,c,sizeof(a))
const int MAX_N = 100;
const int INF = 0x3F3F3F3F;
int n, d[MAX_N], G[MAX_N][MAX_N] = {0};
void bfs(int s) {
int u;
queue<int> q;
q.push(s);
SET(d, INF);
d[s] = 0;
while (!q.empty()) {
... | #include<bits/stdc++.h>
#define ll long long
#define d double
#define ld long double
#define vi vector<int>
#define vul vector<ull>
#define vl vector<ll>
#define pb push_back
#define si set<int>
#define sl set<ll>
#define yes cout<<"YES\n"<<endl
#define no cout<<"NO\n"<<endl
#define ys cout<<"Yes\n"<<endl
#define n cou... | 0 | 74,662,139 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double L;
cin >> L;
cout << fixed << setprecision(7) << (L/3.0)*(L/3.0)*(L/3.0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i = 0; i < n; i++)
#define FOR(i,l,r) for(int i = l; i <= r; i++)
#define TR(e,x) for(auto e = x.begin(); e != x.end(); e++)
#define DEBUG(x) cout << #x << "=" << x << endl;
#define SHOW1(A,n) { REP(i,n-1) printf("%d ", A[i]); printf("%d\n", A[n-1])... | 0 | 44,450,400 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) a.size()
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e8)
#define INF... | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << endl
#define debugArray(x, n) \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << #x << "[" << hoge << "]: " << x[hoge] << endl
using namespace std;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
... | 0 | 96,662,446 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <numeric>
#include <algorit... | #include "bits/stdc++.h"
using namespace std;
const int INF = 1000000000;
void Main() {
int N, M;
cin >> N >> M;
vector<vector<int>> graph(N, vector<int>(N, INF));
vector<pair<pair<int, int>, int>> edges;
for (int i = 0; i < M; ++i) {
int a, b, c;
cin >> a >> b >> c;
--a;
... | 0 | 49,728,621 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<string> s(N);
REP(i, N) cin >> s[i];
int ans = 0, ... | #include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v)... | 0 | 46,642,783 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define coutv(v) for (int i = 0; i < (v).size(); ++i) cout << v[i] << ' '; cout << endl;
#define coutvv(v) for (int i = 0; i < (v).size(); ++i) {for (int j = 0; j < (v[i]).size(); ++j) cout << v[i][j] << ' '; cout << endl;}
#define debugv(v) {for (int i = 0... | 0 | 51,209,958 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, flag = 0;
cin >> a >> b;
if(a % 3 == 0 && (a != 1 || a != 0)){
flag = 1;
}
else if(b % 3 == 0 && (b != 1 || b != 0)){
flag = 1;
}
else if((a + b) % 3 == 0 && (a+b != 1 || a+b != 0)){
flag = 1;
}
... | #include <bits/stdc++.h>
#define ll long long int
#define mp make_pair
#define pb push_back
#define ld long double
#define pii pair<int,int>
#define sz(x) (int)x.size()
#define piii pair<pii,pii>
#define precise cout<<fixed<<setprecision(10)
#define st first
#define nd second
#define ins insert
#define vi vector<int>
#... | 0 | 37,771,817 |
#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 k;
int x[2];
cin >> x[0] >> x[1] >> k;
rep(i,k) {
if (x[i%2] % 2 == 1) x[i%2]--;
x[i%2] /= 2;
x[(i%2)^1] += x[i%2];
}
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <random>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll H, W, N;
vector<P> st;
int main(){
cin >> H >> W >> N;
ll res[10];
for(int i = 0; i < 10; i++) res[i] = 0;
for(int i = 0; i < N; i++){
int a, b; c... | 0 | 14,501,512 |
#include <stdio.h>
#include <ctype.h>
#define MAX 1202
#define alphaNum 26
int main(void){
int i;
char str[MAX];
int count[alphaNum] = {0};
while(fgets(str, MAX, stdin) != NULL){
for(i = 0; str[i] != '\n'; i++){
if(isalpha(str[i])){
if(isupper(str[i])){
... | #include<iostream>
using namespace std;
typedef struct{
int A[1000];
}node;
node T[105];
int main(){
int n;
int num;
int son;
int z;
cin>>n;
for(int i=0;i<n;i++){
cin>>num;
cin>>son;
for(int j=0;j<son;j++){
cin>>z;
T[num].A[z]=1;
}
}
for(int i=1;i<=n;i++){
for(int j=1... | 0 | 41,521,415 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1000000007;
int64_t H, W, N;
map<unsigned int, map<unsigned int, int>>box;
vector<int64_t>cnt(10, 0);
void printAnswer(vector<int64_t> &v);
void incDec(int decNum);
void changeCnt(unsigned i... | #include <bits/stdc++.h>
#define H ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define ld long double
using namespace std;
const ll mod = 998244353;
int main()
{
H
int x, y ,z , k;
cin >> x >> y >> z >> k;
ll a[x], b[y], c[z];
vector<ll> v, ans;
for (int i = 0; i <... | 0 | 41,991,473 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n,m;
cin >> n >> m;
vector<pair<int,int>> work;
for(int i=0; i<n; i++){
int a,b;
cin >> a >> b;
pair<int, int> p = make_pair(a,b);
work.push_back(p);
}
sort(work.begin(), work.end()... | #include <bits/stdc++.h>
using namespace std;
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
typedef long long ll;
typedef vector<int> vi;
ll mod = 1e9+7;
ll solve() {
int N, a; cin >> N;
vi nums;
rep(i, N) {
cin >> a;
nums.push_back(a);
}
int r... | 0 | 64,048,914 |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(),... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1010000000000000017LL;
const ll MOD = 1000000007LL;
#define REP(i, n) for(ll i = 0 ; i < n; i++)
#define DEBUG(fmt, ...) fprintf(stderr, fmt "\n", ##__VA_ARGS__)
int main(){
std::cout<<std::fixed<<std::setprecision(10);
string L;... | 0 | 33,971,161 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
cout << (s == "AAA" || s == "BBB" ? "No" : "Yes") << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N,M;
cin >> N >> M;
vector<string> A(N),B(M);
for(int i=0;i<N;i++){
cin >> A[i];
}
for(int i=0;i<M;i++){
cin >> B[i];
}
for(int i=0;i<=N-M;i++){
for(int j=0;j<=N-M;j++){
bool flag=true;
for(int k... | 0 | 79,623,608 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Map = map<string,ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
ll INF=1LL<<60;
ll MOD=1000000007;
int main(){
ll N;
cin >> N;
vector<ll> H(N+1,0);
ll ans=0;
for(ll i=0;i<N;i++){
cin>... | 0 | 40,786,609 |
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Graph= vector<vector<ll>>;
struct edge{ll to ; ll cost ;} ;
using graph =vector<vector<edge>> ;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#de... | 0 | 46,580,494 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[2*n];
for(int i = 0; i < 2*n; ++i){
cin >> a[i];
}
sort(a,a+2*n);
int res = 0;
for(int i = 0; i < 2*n; i += 2){
res += a[i];
}
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | 0 | 97,965,549 |
#include <bits/stdc++.h>
using namespace std;
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 (b<a) { a=b; return 1; } return 0; }
using ll = long long;
using P = pair<ll,ll>;
using graph = vector<vector<int>>;
const int dx[4] = ... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)((x).size()))
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long long int64;
typedef unsigned int uint;
typedef unsigned long... | 0 | 39,695,708 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<N;i++)
#define rep2(i,N) for(int i=1;i<=N;i++)
using namespace std;
long long INF=1e18;
long long mod=1e9+7;
long long edge[110][110];
long long dist[105][105];
int main(){
int V,E;
cin>>V>>E;
rep(i,V)rep(k,V)edge[i][k]=INF;
rep(i,E){
int s... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | 0 | 38,098,520 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define PI acos(-1)
typedef long long ll;
ll gcd(ll x,ll y){
if(y==0) return x;
else return gcd(y,x%y);
}
ll lcm(ll x,ll y){
return x/gcd(x,y)*y;
}
int main(){
int n,m;
cin>>n>>m;
if(n==1 && m==1) cout<<1;
else if... | #include<bits/stdc++.h>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cmath>
#include<map>
#include<string>
#include<vector>
#define mx(ans, cnt) ans = max(ans, cnt)
#define fauto(a) for(auto i : a) cout << i << " "; cout << endl;
#define sp(n) fixed << setprecision(n)
#define all(v) v.begin(), v.en... | 0 | 99,867,951 |
#include <bits/stdc++.h>
using namespace std;
int be = 1900, af = 100;
int main(){
int n, m,sum = 0;
scanf("%d %d", &n, &m);
sum += be * m + af * (n-m);
for(int i = 0; i < m; i++) sum *= 2;
printf("%d", sum);
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define ll long long
#define pb push_back
#define fi first
#define se second
#define MAXN 200064
#define mod 1000000007
#define... | 0 | 2,137,222 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i=0;i<n;i++)
#define repb(i, a, b) for(int i=a;i<b;i++)
using namespace std;
typedef pair<int, long> P;
typedef long long int ll;
const int INF = 1<<30;
int main(){
int n;cin>>n;
vector<int> t(n+1), v(n);t[0]=0;
rep(i, n)cin>>t[i+1];
rep(i, n){
t[i+1]+=t[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | 0 | 7,716,937 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 100000000... | #include <iostream>
#include <vector>
using namespace std;
typedef struct NodeData * Node;
typedef struct NodeData {
int rank;
int val;
Node parent;
}* Node;
Node make_set(int val)
{
Node node = new NodeData();
node->rank = 0;
node->val = val;
node->parent = node;
return node;
}
Node fin... | 0 | 75,830,514 |
#include<iostream>
#include <bits/stdc++.h>
const int N = 1e6 + 7 ;
using namespace std;
int n,m;
int u,v;
int ans[N] = {0};
vector<int> s[N];
void bfs(){
queue<int> q;
q.push(1);
ans[1] = 1;
while(!q.empty()){
int tmp = q.front();
q.pop();
for(auto w : s[tmp]){
if(ans[w] == 0){
ans[w] = tmp;
q.pus... | #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 | 18,288,908 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<unordered_set>
#define lol(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
#define N 100010
int n;
bool t[N];
unordered_set<int> v[N];
unordered_set<int>::iterator it;
queue<int> Q;
void BFS(int ... | 0 | 55,285,576 |
#include<bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define pb push_back
#define mp make_pair
#define Unique(x) x.erase(unique(all(x)),x.end());
using namespace std;
const int dx[]={-1,0,1,0};
const int dy[]={0,-1,0,1};
const int Days[]={-1,31,28,31,30,31,30,31,31,30,31,30,31};
inline int read()
{
#define gc getc... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
#define rep(i, n) for(int i=0;i<(int)n;i++)
#define PI acos(-1)
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
ll mod=1e9+7;
int main(){
int n;
cin>>n;
vector<... | 0 | 27,177,671 |
#include <iostream>
#include <vector>
#include <cmath>
#include <limits.h>
#include <utility>
#include <map>
#include <algorithm>
#include <set>
using namespace std;
using P = pair<int,int>;
using ll = long long;
const int MOD=1e9+7;
int main(){
int n,m;
c... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a[3][3];
for(int i=0;i<3;i++){
for(int j=0;j<3;j++)cin >> a[i][j];
}
int n;
cin >> n;
vector<int>b(n);
for(int i=0;i<n;i++)cin >> b[i];
vector<vector<bool>>ccc(3,vector<bool>(3,false));
for(int i=0;i<n;i++){
... | 0 | 71,420,516 |
#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... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define rep2(i, s, n) for(long long i=(s);i<(long long)(n);i++)
#define repi(i, n) for(int i=0;i<(int)(n);i++)
#define rep2i(i, s, n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define deg2rad(de... | 0 | 18,069,142 |
#pragma GCC optimize("Ofast,inline,unroll-loops,fast-math")
#include <cstdio>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <bitset>
#include <memory>
#include <string>
#include <vector>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <unordered_map>
#includ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | 0 | 58,549,711 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
ll T[1005];
ll gcd(ll a, ll b) {
if (a < b)
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n;cin>>n;
ll a[n];
ll s=0,t=0;
for(ll i=0;i<n;i++){
cin>>a[i];
s+=a[i];
t+=i+1;
}
if(s%t!=0){
cout<<"NO"<<endl;
return 0;
}
s/=t;
ll cnt=0;
for(ll i=0;i<n-1;i++){
if(a[i]<a[i+1]){
if(a[i+1... | 0 | 32,496,166 |
#include<iostream>
using namespace std;
int main(){
int x[3000], y[3000], i=0;
while(1){
cin >> x[i] >> y[i];
if(x[i]==0 && y[i]==0) break;
else i++;
}
for(int j = 0; j < i; j++){
if(x[j] < y[j] || x[j] == y[j]){
cout << x[j] << " " << y[j] << endl;
}
else{
cout << y[j] << " ... | #include <bits/stdc++.h>
#define rp(i,n) for(int i=0; i<n; i++)
using namespace std;
using ll=long long;
using P=pair<int,int>;
using G=vector<vector<int>>;
int main(){
int n;
cin >> n;
double ans=0.0;
vector<double> x(n);
vector<string> u(n);
rp(i,n) cin >> x.at(i) >> u.at(i);
rp(i,n){
... | 0 | 65,011,123 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
vecto... | #include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 998244353
#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 | 80,745,349 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.