code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <vector>
#include <iostream>
#include <map>
using namespace std;
template<typename T, typename S> vector<T>& operator<<(vector<T>& a, S b) { a.push_back(b); return a; }
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
map<char,int> t;
t['I']=1, t['X']=10, t['V'] = 5;
t['L'] = 50 , t['C'] = 100 , t['M'] = 1... | #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
while(getline(cin, str)) {
int before = 0;
int now;
int ans = 0;
for(int i = 0; i < str.length(); i++) {
switch(str[i]) {
case 'I': now = 1; break;
case 'V': now = 5; break;
case 'X': now = 1... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
#define poly vector<ll>
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l) for(int i=(int)(r... | #include <iostream>
#include <unordered_set>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll a;
unordered_set<ll> sheet;
for (ll i = 0; i < n; i++) {
cin >> a;
if (sheet.find(a) == sheet.end()) {
//not present, insert
sheet.insert(a);
}
else {
s... | 0 |
#include <iostream>
int main(int argc, char** argv)
{
int n;
std::cin >> n;
int min = 1000000;
int max = -1000000;
long long sum = 0;
for (int i = 0; i < n; ++i)
{
int a;
std::cin >> a;
if (min > a)
{
min = a;
}
if (max < a)
{
max = a;
}
sum += a;
}
std::cout << min << " " << max... | #include <iostream>
#include <array>
#include <vector>
#include <algorithm>
template<class T>
T input()
{
T val;
std::cin >> val;
return val;
}
int main()
{
long long n, sum = 0;
std::cin >> n;
std::vector<long long> b;
for (int i = 0; i < n; ++i)
b.push_back(input<long long>()), sum += b[i];
std::sort(b.... | 1 |
#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>;
int main() {
int n;
cin >> n;
int MAX = -1;
int ans = MAX;
for(int i = 1; i*i <= n; i++) {
ans = max(ans, i*i);
}
cout << ans << endl;
return 0;
} | #include <stdio.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <numeric>
#include <algorithm>
#include <sstream>
#include <string>
#include <map>
#include <set>
using namespace std;
#define rep(i, n) for (int i=0; i<int(n); i++)
int main() {
int64_t N;
cin ... | 1 |
#include<bits/stdc++.h>
using namespace std;
const int N=200005;
int a[N],b[N],c[N*3],d[N*3],n;
int main()
{
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
for(int i=0;i<n;i++)
scanf("%d",&b[i]);
for(int i=0;i<n;i++)
c[i]=a[i]^a[(i+1)%n],c[i+n*2]=c[i+n]=b[i]^b[(i+1)%n];
int j;d[0]=c[n]=j=-1;
for(in... | #include <bits/stdc++.h>
//#include <unistd.h>
//#include <iostream>
using namespace std;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
int n, k;
cin >> n >> k;
vector<double> mean(n);
rep(i,n) {
double p; cin >>... | //Darker and Darker
#include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
vector<int> dy = {1, 0, -1, 0};
vector<int> dx = {0, 1, 0, -1};
typedef pair<int, int> PII;
int main() {
int h, w;
cin >> h >> w;
vector<string> grah(h);
rep(i, h) cin >> grah.at(i);
queue<PII... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
vector<int> num(3);
rep(i, 3) cin >> num.at(i);
for(int i = 1; i < 3; i++) {
int tmp = 0;
tmp = num.at(0);
num.at(0) = num.at(i);
... | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
#define endl "\n"
template<class T>bool chmin(T &a, const T ... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD = 1000000007;
const ll INF = 10000000000000;
#define all(v) v.begin(), v.end()
int main(){
ll N;
cin >> N;
vector<ll> A(N);
multiset<ll> B;
rep(i,N){
... | #include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
int arr[n];
for(int i=0; i<n ; i++)
cin >> arr[i];
for(int j=n-1;j>=0;j--){
if( j!=0)
cout <<arr[j]<<' ';
else
cout <<arr[j];
}
cout << endl;
} | 0 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cassert>
#include <cstdio>
#include <cstdlib>
using namespace std;
using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
int const nmax = 100000;
int query(int pos){
cout << pos << '\n';
c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int r;
cin >> r;
if(r<1200)
cout << "ABC";
else if(r>=1200 && r<2800)
cout << "ARC";
else
{
cout << "AGC";
}
}
| 0 |
#include <bits/stdc++.h>
#define pb push_back
#define cmin(a,b) (a>b?a=b:a)
#define cmax(a,b) (a<b?a=b:a)
#define lop(i,s,t) for(int i=s;i<(t);++i)
#define rep(i,s,t) for(int i=s;i<=(t);++i)
#define dec(i,s,t) for(int i=s;i>=(t);--i)
#define fore(i,v) for(int i=g[v],d=es[i].d;i;i=es[i].nxt,d=es[i].d)
using namespace st... | #include <bits/stdc++.h>
#define pb push_back
#define all(v) v.begin(), v.end()
#define sz(v) int(v.size())
#define pii pair<int, int>
#define mp make_pair
#define f first
#define ll long long
#define ld long double
#define s second
#define vec vector<int>
using namespace std;
const int N = (int) 300 + 10;
const int... | 1 |
//g++ -std=gnu++14 a.cpp
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <random>
#inclu... | #include<iostream>
int main()
{
int a = 0;
int Calc=0;
std::cin >> a;
Calc=a+(a*a)+(a*a*a);
std::cout << Calc;
return 0;
} | 0 |
//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std:... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N = 2005;
int f[N][N];
int tot[N][N];
int up[N][N];
int lef[N][N];
int tqr(int il, int... | 0 |
#include<cstdio>
#include<algorithm>
using namespace std;
typedef __int128 LL;
char buf[1<<21],*p1=buf,*p2=buf;
#define getchar() (p1==p2 && (p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
LL read()
{
LL x=0,f=1;
char c=getchar();
while(c<'0' || c>'9')
{
if(c=='-') f=-1;
c=getchar();
}
while(c>='0' &... | #include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <set>
#include <string>
#include <functional>
#include <cassert>
#include <cmath>
#define SIZE 200005
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;... | 0 |
#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define LL long long
#define MAXN 310
#define mod 998244353
using namespace std;
int n, f[2][MAXN * MAXN / 2], sum, a[MAXN], ans;
template <typename T> void chkmin(T &x, T y){x = min(x, y);}
template <typename T> void chkmax(T &x, T y){x = max(x, y);}
template <typename T... | #include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <queue>
#include <bitset>
#pragma GCC optimize(2)
#define INF 0x3f3f3f3f
using namespace std;
typ... | 0 |
#include <bits/stdc++.h>
using namespace std;
inline int gi(){
char ch=getchar();int x=0,q=0;
while(ch<'0' || ch>'9') ch=='-'?q=1:0,ch=getchar();
while(ch>='0' && ch<='9') x=x*10+ch-'0',ch=getchar();
return q?(-x):x;
}
int f[35000][17],w[35000],c[17][17];
void dp(int &x,int y){
if (x<y) x=y;
return;
}
int m... | // besmellah
#include <bits/stdc++.h>
using namespace std;
typedef long long int64;
typedef pair<int,int> pii;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
const int maxn = 1e4+10;
const int64 MO = 1000000007;
const in... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll INF = 1e12;
const ll MOD = 1000000000 + 7;
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>... | #include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int A[100010];
int cnt[1000... | 0 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tree<ll,null_type,less<ll>,rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define int ll
#define endl "\n"
#define all( x ) x.begin(),... | #include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++ )
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
int main(){
int x, y, z;
cin >> x >> y >> z;
int an... | 1 |
#define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const double EPS = 1e-10;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
int bfs(int sx, int sy, i... | #include<iostream>
#include<queue>
using namespace std;
int main() {
int H, W; cin >> H >> W;
int N = H*W;
int A[N]; string str;
int white_num = 0;
for (int i = 0; i < H; i++) {
cin >> str;
for (int j = 0; j < W; j++) {
white_num += A[i*W+j] = (str[j] == '.');
}
}
queue<pair<int, int>> ... | 1 |
#include<bits/stdc++.h>
using namespace std;
const int N=305;
#define fi first
#define se second
typedef pair<int,int>P;
priority_queue<P>que;
int n,m,b[N],vi[N],cnt[N],a[N][N];
bool check(int mid){
while(!que.empty()) que.pop();
for(int i=1;i<=m;i++) b[i]=0;
for(int i=1;i<=n;i++) ++b[a[i][cnt[i]=1]];
for(int i=1;i... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const st... | 1 |
#include<cstdio>
bool include3(int x){
if(x % 10 == 3){
return true;
}else{
x /= 10;
if(x){
return include3(x);
}
return false;
}
}
bool judge(int x){
if(!(x % 3)){
return true;
}else{
return include3(x);
}
}
int main(){
int n;
scanf("%d", &n);
for(int i = 1; i <= n; i++){
if(judge(i)){
... | #include <vector>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int m = 1e9;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
m = min(__builtin_ctz(a), m);
}
cout << m << endl;
} | 0 |
#include <iostream>
using namespace std;
typedef long long int LLI;
int main()
{
LLI n, a, b, save;
cin >> n >> a >> b;
LLI first, second, ans = 0;
cin >> first >> second;
save = ( second - first ) * a;
if( save > b )
ans += b;
else
ans += save;
first = second;
for(int i = 2; i < n; i++)
{
cin... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define MOD 1000000007
#define MOD2 998244353
#define pb emplace_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define sz(x) (ll)x.size()
#def... | 1 |
///Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
#define ll long long
#define int ll
#define fi first
#define si ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_bac... | 0 |
/// IN THE NAME OF GUITAR
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define sz(x) (ll) x.size()
#define all(x) (x).begin(),(x).end()
#define F first
#define S secon... | #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
te... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;... | #include <bits/stdc++.h>
#define fi first
#define sc second
#define mp make_pair
#define pb push_back
#define all(x) x.begin(),x.end()
#define cmin(a,b) (a>b?a=b:a)
#define cmax(a,b) (a<b?a=b:a)
#define mem(a,k) memset(a,k,sizeof(a))
#define lop(i,s,t) for(int i=s;i<(t);++i)
#define rep(i,s,t) for(int i=s;i<=(t);++i)
#... | 1 |
#include <stdio.h>
#include <math.h>
#define MAXINPUT 100
int main(void){
int h[MAXINPUT],w[MAXINPUT];
int ansh[MAXINPUT]={},answ[MAXINPUT]={};
int i=0,j=0;
int ans=0;
int num=0;
int k;
while(i<MAXINPUT){
scanf("%d %d",&h[i],&w[i]);
if(h[i]==0 && w[i]==0)break;
i++;
num++;
}
for(i=0;i<num;i++,ans=0){... | #include <bits/stdc++.h>
using namespace std;
pair<int, int> nxt[256][256];
int main()
{
int h, w;
vector<pair<int, pair<int, int> > > v;
for (int i = 1; i <= 150; i++){
for (int j = i + 1; j <= 150; j++){
v.push_back(make_pair(i * i + j * j, make_pair(i, j)));
}
}
... | 1 |
#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
int N = 0, M = 0;
int points[1001];
int scores[1002001];
bool check(int a, int c){
if(a >= (N + 2) * (N + 1) / 2 - 1){
return true;
}
return (scores[a] <= c && scores[a + 1] > c);
}
int search2(int a, int b, int c){
... | #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
using namespace std;
typedef long l... | 1 |
#include<stdio.h>
#include<math.h>
int main(){
double x1, x2;
double y1, y2;
double L, l;
scanf("%lf %lf %lf %lf", &x1, &y1, &x2, &y2);
L = (x2-x1)*(x2-x1) + (y2-y1)*(y2-y1);
l = sqrt(L);
printf("%f", l);
return 0;
} | #include <iostream>
#include <iomanip>
#include <math.h>
using namespace std;
int main()
{
double x, y, x1, x2, y1, y2;
cin >> x1 >> y1 >> x2 >> y2;
x = fabs(x2 - x1);
y = fabs(y2 - y1);
if( x == 0 ) {
cout << fixed << setprecision(5) << y << "\n";
return 0;
} else if( y == 0 ) {
cout << fixed << setprecisi... | 1 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#define all(x) (x).begin(),(x).end()
typedef long long ll;
using namespace std;
int main()
{
int K, T, s, ans; cin >> K >> T;
vector<int> v(T);
s = 0;
for(int i=0; i<T; i++){
cin >> v[i];
s += v[... | #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 INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)pr... | 1 |
#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <iterator>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(... | #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
#define DEBUG 0
#if DEBUG
#define DLOG(...) fprintf(stderr, __VA_ARGS__)
#else
#define DLOG(...)
#endif
void debug(auto f) {
#if DEBUG
f();
#endif
}
ll mPrime = int(1e9) + 7;
ll bN, bX;
vector<ll> bS;
vector<ll> facts;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
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; }
const int NIL = -1;
const int INF = (1<<21);
const l... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n,m;
cin>>n>>m;
vector<int>pf(n+2);
for(int i=0; i<m; i++){
int a,b;
cin>>a>>b;
pf[a]++;
pf[b+1]--;
}
for(int i=1; i<=n; i++){
pf[i]+=pf[i-1];
}
int cnt=0;
for(int i=1; i<=n; i++){
if(pf[i]==m)
cnt++;
}
cout<<c... | 1 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int> >;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define irep(i, n) for(int i = n-1; i >= (int)0; i--)
#define reprep(i,j,h,w) rep(i,h)rep(j,w)
#define rrep(i,m,n) for(int i = m; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
... | /*#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<string.h>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FO... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a), i##end = (b); i <= i##end; ++i)
#define per(i, a, b) for (int i = (a), i##end = (b); i >= i##end; --i)
namespace IO {
#define gc getchar()
template <typename T>
inline void read(T& x) {
x = 0; bool f = 1; char ch;... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
using namespace std;
using namespace __gnu_pbds;
typedef
tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update> ordered... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int n,m;
cin >> n >> m;
int l1 = 1;
int r1 = m+1;
int l2 = m+2;
int r2 = 2*m+1;
for(int i=0;i<m;i++)
{
if(l1 < r1)
{
cout << l1 << ' ' << r1 << '\n';
l1++;
r1--;
}
else if(l2 < r2)
{... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t N, M;
vector<pair<int, int>> ans;
cin >> N >> M;
if (N % 2)
{
for (int l = 0, r = N - 1; l < r; l++, r--)
{
ans.emplace_back(l, r);
}
}
else
{
bool flag = true;
for (int l = 0, r = N - 1; l < r; l++, r--)
{... | 1 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
typedef pair<double,string> pa;
vector<pa> vec;
bool my (pa i,pa j) { return (i.first==j.first?i.second>j.second:i.first<j.first); }
int main(){
int n;
while(cin >> n && n){
while(n--){
string na;... | #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
bool is_prime[10001];
int prime[10001];
int main() {
memset(is_prime, 1, sizeof(is_prime));
is_prime[0] = is_prime[1] = false;
int p = 0;
for (int i = 2; i <= 10000; i++) {
if (is_prime[i]) {
prime[p++] = i... | 0 |
#include<iostream>
#include<vector>
using namespace std;
using ll = long long;
int main(){
int n;
cin>>n;
vector<ll> c(100005);
for(int i=0;i<n;i++){
int d;
cin>>d;
c[d]++;
if(i==0&&d!=0){
cout<<0<<endl;
return 0;
}
}
ll ans=0;
... | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (int i = 0; i < (int)N; i++)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 62)
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
constexpr int MOD = 10000000... | #include <bits/stdc++.h>
using namespace std;
inline void prep ()
{
cin.tie (0);
cin.sync_with_stdio (0);
};
const double pi = acos(-1.);
//printf(%.12lf\n,mid);
// __builtin_popcount(int) count 1's in binary
// get decimal part of number
/*
double intpart;
double thiss = modf((double)(n*m)/(double)k, &intpart);
... | 0 |
///Bismillahir Rahmanir Rahim
#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma warning(disable:4786)
#pragma warning(disable:4996)
#define ll ... | #include <bits/stdc++.h>
#include <iostream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = 0, ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O0")
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
const ll mod = 1e9+7;
const ll INF = 1e18;
#define All(a) (a).begin(),(a).end()
#define Pi acos(-1)
int main() {
cin.tie(0);
ios_base::sync_with_s... | #include <bits/stdc++.h>
using namespace std;
int n, base(-2);
string s;
int main(){
cin >> n;
if (n == 0) cout << "0";
while (n != 0){
int r = n % base;
r += (r < 0? 2 : 0);
s += (n % base == 0 ? "0" : "1");
n = (n - r) / base;
}
reverse(s.begin(), s.end());
cout << s << endl;
}
| 1 |
#include<bits/stdc++.h>
#define pir pair<int,int>
#define qmin(x,y) (x=min(x,y))
#define qmax(x,y) (x=max(x,y))
#define rsort(x,y) sort(x,y),reverse(x,y)
#define fr first
#define se second
using namespace std;
typedef long long ll;
const int Maxn=4100000;
const int inf=0x3f3f3f3f;
int n,x[Maxn],y[Maxn],dir[Maxn],bj[Ma... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e16;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << end... | 1 |
#include<stdio.h>
#include<stdlib.h>
int Partition(int a[],int p,int r) {
int x = a[r];
int i = p - 1;
for (int j = p; j < r; j++) {
if (a[j] <= x) {
i++;
int temp = a[j];
a[j] = a[i];
a[i] = temp;
}
}
a[r] = a[i + 1];
a[i + 1] = x;
return i + 1;
}
int main() {
int n = 0;
int A[100005];
scanf(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#defi... | 0 |
#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 numOf1s(ll bit){
int cnt = 0;
while(bit){
if(bit & 1 == 1) ++cnt;
bit = bit >> 1;
}
return cnt;
}
int main(){
int N; cin >> N;
vect... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cctype>
#include<utility>
#include<string>
#include<cstdio>
#define REP(n) for(int i = 0;i < n;i++)
#define LLREP(n) for(long long int i = 0;i < n;i++)
typedef long long int ll;
using namespace std;
#define MAX_A 1000000007
int main(){
string s;
... | 0 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
long long INF = (1LL<<62);
string X;
int m... | #include<iostream>
#include<string>
#include<numeric>
#include<set>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
typedef long long li;
#define minimize(a,b) (a>(b)?a=(b),1:0)
#define maximize(a,b) (a<(b)?a=(b),1:0)
#define ceil(a,b) (((a)+(b)-1)/(b))
#define yn(i) ((i)?"Yes":"No")
#define chm... | 1 |
#include <bits/stdc++.h>
using namespace std;
string hands( const vector<int>& c ) {
int n = (int)c.size();
int p1 = 0;
int c3 = 0;
for( int i = 0; i < n; ++i ) {
if( c[i] == 4 ) {
return "four card";
}
else if( c[i] == 3 ) { c3 += 1; }
else if( c[i] == 2 ) { p1 += 1; }
}
if( c3 > 0 && p1 > 0 ) {
... | #include <stdio.h>
int main(){
int x[5],i,j;
while(scanf("%d,%d,%d,%d,%d",&x[0],&x[1],&x[2],&x[3],&x[4])!=EOF){
for(j=0;j<5;j++){
for(i=0;i<4;i++){
if(x[i]>x[i+1]){
int g=x[i+1];
x[i+1]=x[i];
x[i]=g;
}}}
if(x[0]==x[1] && x[1]==x[2] && x[2]==x[3]){
printf("four card\n");
continue;
}
if(x[1]==x[2] &&x[2]==x[3]&&x[3]==x[4... | 1 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
//定数
//円周率
const double pi = 3.141592653589793238462643383279;
//天井
const int INF = 1000000000; // = 10^9
const ll LINF = 100000000000000000; // = 10^17
//ABC文字列
const string ABC = "ABCDEFGHIJKLMNOPQRS... | #include <iostream>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
int main(void){
int N;
cin >> N;
int A[N];
rep(i, N)
cin >> A[i];
// 入力終了
// A[]中の負の数の数
int negative_num = 0;
rep(i, N)
if(A[i] < 0)
negative_num++;
long long ans = 0;
// 負の数が偶数個なら，操作の繰り返しで全て正にできる
... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct Edge {
int src, dst;
Edge() : src(0), dst(0) {}
Edge(int s, int d) : src(s), dst(d) {}
};
using Edges = std::vector<Edge>;
using Graph = std::vector<Edges>;
vector<int> kosaraju(const Graph &g) {
int n = g.size(), sz = 0; Graph rg(n);
vec... | #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> G[1000000];
vector<pair<int, int> > bridge;
vector<int> articulation;
int ord[1000000], low[1000000];
bool vis[1000000];
void dfs(int v, int p, int &k)
{
vis[v] = true;
ord[v] = k++;
low[v] = ord[v];
bool isArticulation... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 4e6 + 10, M = 2e3 + 10, MOD = 1e9 + 7;
int fac[N], inv[N], dp[M][M], ps[M][M];
int sum(int a, int b) {return (a + b) % MOD;}
int mul(int a, int b) {return (a * b) % MOD;}
int Pow(int a, int b)
{
int res = 1;
for (; b; b>>=1, a =... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
template<typename T>
void read(T &x)
{
x=0;char c=getchar();bool p=0;
for(;c<'0'||c>'9';c=getchar())if(c=='-')p=1;
for(;c>='0'&&c<='9';c=getchar())x=(x<<3)+(x<<1)+(c^48);
if(p)x=-x;
}
const ll MOD=1000000000+7;
ll f[2005][2005];
ll fac[40... | 1 |
#include <iostream>
#include <iomanip>
#include <string>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for(ll i=init;i<(n);i++)
int main() {
string s;
cin >> s;
if (s == "zyxwvutsrqponmlkjihgfedcba") {
cout << -1 << endl;
r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
int alp[27];
for (int i = 0; i < 26; i++) {
alp[i] = 0;
}
alp[26] = 1;
cin >> s;
if (s == "zyxwvutsrqponmlkjihgfedcba") {
puts("-1");
} else {
string ans = "";
for (int i = 0; i < (int)s.size(); ... | 1 |
#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define m_k make_pair
#define int long long
using namespace std;
const int N=1e5+100;
int n,m,k,a[N],b[N],f[N],c[N];
int fa[N][64],sum[N];
signed main()
{
scanf("%lld",&n);
for (int i=1;i<=n;i++) scanf("%lld",&f[i]);
scanf("%lld%lld",&m,&k);
for (int i=1;i<=m;i++) sca... | #include <bits/stdc++.h>
#define fi first
#define se second
#define ii pair<int, int>
#define int long long
using namespace std;
const int INF = 1e9;
int n, m;
int ans = INF;
int a[85][85], b[85][85];
bool f[85][85][52000];
void attempt(int i, int j, int diff)
{
if (i == n && j == m)
{
ans = min(ans,... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int a_01 = A / 10000;
int a_02 = A / 1000 - a_01 * 10;
int a_03 = A / 100 - a_01 * 100 - a_02 * 10;
int b_01 = B / 10000;
int b_02 = B / 1000 - b_01 * 10;
int b_03 = B / 100 - b_01 * 100 - b_02 * 10;
int head... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int cnt = 0;
for (int i = a; i <= b; i++) {
if (i%10==i/10000 && i/10%10==i/1000%10) {
cnt += 1;
}
}
cout << cnt << endl;
} | 1 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
namespace IO {
template <typename _T>
inline bool read(_T& x) {
x = 0;
_T y = 1;
char c = getchar();
while ((c < '0' || '9' < c) && c != EOF) {
if (c == '-... | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
void read(int&a) {
a = 0; char k = getchar(); int f = 1;
for(;!isdigit(k); k = getchar()) if (k == '-') f = -1;
for(; isdigit(k); k = getchar()) a = a * 10 + k - '0';
a *= f;
}
const int N = 1e6 + 5;
int n, a[N], b[N], fla... | 1 |
#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
int h,w,n;
template<typename int_t>
void readx(int_t &x)
{
x=0; int_t k=1; char ch=0;
while (ch<'0' || ch>'9') { ch=getchar(); if (... | #include<stdio.h>
int main(){
int h, w, n, ans;
scanf("%d", &h);
scanf("%d", &w);
scanf("%d", &n);
if(w>=h){
if(n%w == 0){
ans = n/w;
}else if(n%w != 0){
ans = n/w+1;
}
}else if(w<=h){
if(n%h == 0){
ans = n/h;
}else if(n%h != 0){
ans = n/h+1;
}
}
printf("%d", ans);
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int getDivCount(int);
int main()
{
int N, A, tmp = 0;
int res = 1;
cin >> N;
for (int i = 0; i < N; ++i)
{
cin >> A;
tmp = getDivCount(A);
if (tmp == 0)
{
cout << tmp << endl;
return 0;
}
... | #include <iostream>
#include <cstdio>
using namespace std;
int main(void){
int copy,n;
cin >>n;
for(int i=1;i<=n;i++){
if(i%3==0){
cout << " " << i;
continue;
}
copy=i;
while(1){
if (copy%10==3){
cout << " " << i;
break;
}
copy/=10;
if(copy!=0)
continue;
else
... | 0 |
#include<bits/stdc++.h>
#define mo 1000000007
#define ny 499122177
#define maxn 1000000000000000000LL
#define pi 3.1415926535898
#define eps 1e-9
using namespace std;
long long read(){
long long xx=0,flagg=1;
char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-')
ch=getchar();
if(ch=='-'){
... | #include <iostream>
#include <fstream>
using namespace std;
const int nmax=100005;
int p[nmax],viz[nmax],cyc[nmax],newp[nmax];
long long x[nmax],dif[nmax];
long long k,nr;
int n,i,j,xx,m;
int main()
{
//freopen("data.in","r",stdin);
ios_base::sync_with_stdio(false);
cin>>n;
for(i=1;i<=n;i++)
{
... | 0 |
#include<bits/stdc++.h>
using namespace std;
struct edge{
int y,nxt,v;
}e[2000010];
set<int>c[2000010];
int n,m,head[2000010],dis[2000010],vis[2000010],tot;
void add(int x,int y,int v){
e[++tot]=edge{y,head[x],v};
head[x]=tot;
}
void dijkstra(){
priority_queue<pair<int,int> >q;
memset(dis,0x3f3f3f3f,sizeof(dis));
... | #include <bits/stdc++.h>
using namespace std;
int main() {
// 入力
int N, Q;
cin >> N >> Q;
vector<int> S(N), T(N), X(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i) >> T.at(i) >> X.at(i);
}
vector<int> D(Q);
for (int i = 0; i < Q; i++) {
cin >> D.at(i);
D[i] = D[... | 0 |
#include "bits/stdc++.h"
#include <cstdio>
#include <cmath>
using namespace std;
int main(){
int d=0;
while(cin>>d){
int sum=0;
for (int i = 0; i < 600; i=i+d) {
sum+=i*i*d;
}
cout<<sum<<endl;
}
} | #include <bits/stdc++.h>
//const static double de_PI = 3.14159265358979323846;
//const static int de_MOD = 1000000007;
//const static int de_MAX = 999999999;
//const static int de_MIN = -999999999;
int main(void) {
//std::ifstream in("123.txt"); std::cin.rdbuf(in.rdbuf());
double n = 0;
std::vector<double> ans;
... | 1 |
#include <bits/stdc++.h>
// statics
using namespace std;
using int64 = long long;
using PAIR = pair<int, int>;
constexpr int INF = 1 << 30;
constexpr int64 LINF = 1LL << 60;
constexpr int MOD = 1e9 + 7;
constexpr int MAX_N = 1e5 + 1;
// init/input
#define int int64
#define INIT ios::sync_with_stdio(false);cin.tie(0);
... | #include<bits/stdc++.h>
#define PI 3.141592653589
using namespace std;
using ll = long long;
template<typename T_char>
T_char ToUpper(T_char cX){return toupper(cX);}
int main(){
int n;
cin >> n;
while(1){
if(n%111 == 0) break;
n++;
}
cout << n;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for(int (i)=(s);(i)<(int)(e);(i)++)
#define REP(i,e) FOR(i,0,e)
#define RFOR(i,e,s) for(int (i)=(e)-1;(i)>=(int)(s);(i)--)
#define RREP(i,e) RFOR(i,e,0)
#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define mp(x,y) make_pair((x),(y)... | #include <stdio.h>
int main(){
int n;
scanf("%d",&n);
while(n){
int a=0,b=0,aa,bb;
for(int i=n;i>0;i--){
scanf("%d %d",&aa,&bb);
if(aa>bb){
a+=aa+bb;
}else if(aa<bb){
b+=aa+bb;
}else{
a+=aa;
b+=bb;
}
}
printf("%d %d\n",a,b);
scanf("%d",&n);
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(), x.end(), y) - x.begin... | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int,int>;
const ll INF = 1000100100100100100;
/* 大文字を小文字に変換 */
char tolower(char c) {return (c + 0x20);}
/* 小文字を大文字に変換 */
char toupr(char c) {return (c - 0x20);}
// if('A'<=s[i] ... | 0 |
#include <algorithm>
#include <cstdio>
static const size_t n_max = 200000;
static int S[n_max], L[n_max], R[n_max];
static long long c = 0;
void merge_sort(size_t i, size_t j) {
switch (j - i) {
case 0:
case 1:
break;
case 2:
if (S[i+1] < S[i]) {
c++;
std::swap(S[i], S[i+1]);... | /*************************************
* @contest: AGC041.
* @user_name: hkxadpall.
* @time: 2019-12-28.
* @language: C++.
* @upload_place: AtCoder.
*************************************/
#include <bits/stdc++.h>
using namespace std;
typedef signed char int8;
typedef unsigned char ... | 0 |
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
int N, K; cin >> N >> K;
if (N % K == 0) cout << 0 << endl;
else cout << 1 << endl;
}
| /*
* Project: AtCoder Beginners Contest 105 A - AtCoder Crackers
* Author: toms74209200 <https://github.com/toms74209200>
*
* Created on 2020/06/16
* Copyright (c) 2020 toms74209200
*
* This software is released under the MIT License.
* http://opensource.org/licenses/mit-license.php
*/
#include <cstdio>
usin... | 1 |
#include<stdio.h>
#include<string.h>
int main(){
int l[10],v1,v2,i;
double sure;
while(0<=scanf("%d",&l[0])){
for(i=1;i<10;i++){
scanf(",%d",&l[i]);
l[i]+=l[i-1];
}
scanf(",%d,%d",&v1,&v2);
sure=(double)v1/(double)(v1+v2)*(double)(l[9]);
for(i=0;i<10;i++){
if(sure<=l[i]){
printf("%d\n... | #include<iostream>
using namespace std;
int main(void)
{
int L[10];
int V[2];
char C[11];
while(cin >> L[0] >> C[0])
{
for(int i=1; i<10; i++)
cin >> L[i] >> C[i];
cin >> V[0] >> C[10] >> V[1];
int sum = 0;
for(int i=0; i<10; i++)
sum += L[i];
double col_point = 0;
col_point = ((double)sum)/(... | 1 |
#include <iostream>
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#inc... | #include <iostream>
#include <string>
#include <stack>
#include <math.h>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <vector>
using namespace std;
int main()
{
string s,t;
cin >> s;
t = s;
for (int i = 0; i < s.size(); i++) {
t[i] = s[s.size() - i-1];
}
cout << t << endl;
} | 0 |
#include<bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define M 1000000007
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define f first
#define s second
#define b begin
#define e end
#define pb push_back
#define mp make_pair
#define FOR(i,a,b) for(i=a;i<b;i++)
#define RFOR(i,a,b) for(i=a;i>=b;i--)
#de... | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
#define MAX_V 100
#define INF LONG_MAX / 4
using namespace std;
typedef struct {
int to, cost;
} edge;
vector<edge> G[MAX_V];
long long d[MAX_V][MAX_V];
bool find_negative_cycle(int v) {
for (int i = 0; i < v; i++) {
if (d[i][i] < ... | 0 |
#include<algorithm>
#include<cstdio>
using namespace std ;
int sports[ 1000 + 1 ] ;
int cnt[ 1000 + 1 ] ;
int CNT[ 1000 + 1 ] ;
int cmp ;
int N ,M ;
int ans()
{
sort( cnt + 1 ,cnt + N + 1 ) ;
return ( find_if( CNT ,CNT + N + 1 ,[]( int cmpair ){ return cmpair == cnt[ N ] ; } ) - CNT ) ;
}
int main( void ... | #include<iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cmath>
#include <set>
#include <string.h>
#include <functional>
using namespace std;
int a[1010];
int b[1010];
int c[1010];
int main()
{
int n,m;
cin>>n>>m;
for(int i... | 1 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <time.h>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; i--)
const... | 1 |
#include <bits/stdc++.h>
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();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
type... | #include<bits/stdc++.h>
#ifdef _PRINTDEBUG
#include "lib/printdebug.hpp"
#else
#define printdebug(...) 1
#endif
#define MOD_1_000_000_007 (1000000007)
#define IINF (1<<28)
#define LINF (1LL<<60)
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, M, Q;
cin >> N >> M >> Q;
vector<vector<int>> cnt_vec(N + 1, vector<int>(N + 1, 0));
int L, R;
for (int i = 0; i < M; ++i) {
cin >> L >> R;
cnt_vec.at(L).at(R) += 1;
}
vector<vector<int>> cumsum(N + 1, vector<int>(N + 1, 0));
for (int i = N;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define ld long double
#define ff first
#... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<long long> > vvll;
typedef vector<pair<int, int> > vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
#define INF 1000000000
#define MOD 1000000007
#define EPSILON 0.00001
#define f first
#define s... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
const int MAXN = 2e5 + 21, LG = 61;
int n, m;
long long k;
long long a[MAXN], d[MAXN], p[MAXN][LG];
vector <long long> res;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n;
for ... | 0 |
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
double pi = 3.1415926535897932384646433;
typedef long long ll;
typedef pair<ll, ll>pii;
ll ccw(pii a, pii b, pii c)
{
return (b.first - a.first)*(c.second - b.second) - (b.second - a.second)*(... | #include <bits/stdc++.h>
using namespace std;
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) _overload(__VA_ARGS__, repi, _rep)(__VA_ARGS__)
double res, PI = acos(-1);
int n;
main(){
cin >> n;
int x[n], ... | 1 |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | #include<bits/stdc++.h>
#define ll long long
#define dl double
#define mp make_pair
#define pb push_back
using namespace std;
//***********************************************************************
// hash struct for unordered_map
struct hash_pair {
template <class T1, class T2>
size_t operator()(const pa... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int cntD(ll i){
int cnt = 0;
if( i == 0) return 1;
while(i>0){
i /= 10;
++cnt;
}
return cnt;
}
ll f (ll i, ll j){
return max(cntD(i), cntD(j));
}
int main(){
ll n;
cin >> n;
ll d = cntD(n);
for(ll a = 1; a*a<=n; ++a){
if(n%a != 0) c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end... | 0 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mk make_pair
#define MAX 1000001
ll prime[MAX];
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
#define gcd __gcd
// ll rec(vector<vector<ll>... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n],b[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int i=0;i<n;i++)
{
cin>>b[n-i-1];
}
int val=-1;
for(int i=0;i<n;i++)
{
if(a[i]==b[i])
{
val=a[i];
break;
}
}
if(val==-1)
{
cout<<"Yes"<<endl;
f... | 1 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<ll> A(N);... | #include <bits/stdc++.h>
using namespace std;
int A[100050];
int n,l,q;
int dp[100050][20];
int main(){
//freopen("input.in","r",stdin);
cin >> n;
for(int i=1; i<=n; ++i) cin >> A[i];
cin >> l;
for(int i=1; i<=n; ++i) dp[i][0] = upper_bound(A+1,A+n+1,A[i]+l)-A-1;
for(int k=1; k<=18; ++k){
for(int i=1; i<=n; +... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<LL,LL> P;
const LL mod=998244353;
const LL LINF=1LL<<60;
const int INF... | #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<ctime>
#include<map>
#include<bitset>
#include<set>
#define LL long long
#define mp(x,y) make_pair(x,y)
#define pll pair<long long,long long>
#define pii pair<int,int>
using namespace std;
... | 1 |
//終局から考える。
//S[i] = '1'なるiについて、A[i]が{A[j], i+1≦j≦N-1, S[j] = '0'}と独立ならx≠0.
//全て従属とする。iが大きい方から考えると、最終的にx=0(従属)にできる。
//独立性の判定:
//・各数を2進数ベクトルと考えて {A[j], i+1≦j≦N-1, S[j] = '0'}について掃き出し法をおこない、
// 表現できるベクトル集合が同一のより単純な表現に直す
//・その表現では'1'の立つ最上位ビットの場所がdistinctだから、A[i]を作れるかを貪欲に判定できる
//計算量はO(TN^3). 厳しい？ -> 定数倍が軽いので大丈夫そう.
//0ベクトル... | #include <iostream>
#include<bits/stdc++.h>
#define base 950527
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
vector<P> res;
ll lh,ns,nt,LH,tmp=1,n,s[200005],t[200005],K[200005],S[200005],T[200005];
int main(void){
cin>>n;
for(int i=0;i<n;i++){
cin>>S[i];
}
for(int i=0;i<n;i+... | 0 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, 0, ... | #include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N,x;
cin>>N>>x;
vector<int> A(N);
for(int &i:A)cin>>i;
sort(A.begin(),A.end());
int ans=0;
for(int i=0;i<N;i++){
x-=A[i];
if(x<0)break;
ans++;
}
if(ans==N && x!=0)cout<<N-1<<endl;
else cout<<ans<<endl;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
template<typename T, typename E> struct LazySegmentTree {
using F = function<T(T, T)>;
using G = function<T(T, E)>;
using H = function<E(E, E)>;
using P = function<E(E, int)>;
int n;
T ti;
E ei;
F f;
G g;
H h;
P p;
vector<T> data;
vector<E> lazy;... | #include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <iomanip>
#include <cstdlib>
using namespace std;
int main () {
int n,m,i,j,t=0;
int a,b,c,d,f,g,a11,b1,c1,d1,f1,g1;
string s="EEEESEEEESEEEESEEEESESEEEESSEEE";
n=s.size();
int a1[n+1],a2[n+1],a3[n+1],a4[n+1],a... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
vector<int> a(n + 2, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int sum = 0;
for (int i = 1; i <= n + 1; i++) {
sum +=abs(a[i] - a[i - 1]);
}
for (int i = 1; i <= n; i++) {
int tmp = sum;
tmp -= ... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define reg register
#define ll long long
#define maxn 100005
inline ll read()
{
ll x=0,w=0;char ch=getchar();
while(!isdigit(ch))w|=ch=='-',ch=getchar();
while(isdigit(ch))x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
return w?-x:x;
}
int n,m;ll k;
int b[maxn],to[70][maxn],c[ma... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define all(v) v.begin(),v.end()
#define inf (int)(3e18)
#define P pair<int,int>
#define mod (int)(1e9+7)
#define mod2 998244353
template<class T> inline void chmin(T &a, T b) ... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(... | #include <stdio.h>
int main() {
int h,w,n;
scanf("%d", &h);
scanf("%d", &w);
scanf("%d", &n);
int ctr = 0;
int total = 0;
while (n > total){
if(w >= h){
total += w;
ctr++;
}else if(h > w){
total += h;
ctr++;
}
}
printf("%d\n",ctr);
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int n,a[200100],b[200100],cnt[200100],res[200100],f[400100],g[200100],nxt[200100];
void kmp(){
for(int i=2,j=0;i<=n;i++){
while(j&&g[j+1]!=g[i])j=nxt[j];
if(g[j+1]==g[i])j++;
nxt[i]=j;
}
for(int i=1,j=0;i<2*n;i++){
while(j&&g[j+1]!=f[i])j=nxt[j];
if(g[j+1]==f[i]... | #include <iostream>
#include <utility>
using namespace std;
int main(void) {
int n,a[100];
cin >> n;
for(int i = 0;i < n;i++) cin >> a[i];
bool flag = true;
int cnt = 0;
while(flag) {
flag = false;
for(int j = n-1;j > 0;j--) {
if(a[j]<a[j-1]) {
swap(a[j],a[j-1]);
flag = true;
cnt++;
}
}
... | 0 |
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
ll mod=1e9+7;
ll fac[210];
void modfac(ll n){
fac[0]=1;
for(ll i=1;i<n;i++){
fac[i]=(fac[i-1]*i)%mod;
}
}
ll modinv(ll a){
ll b=mod,u=1,v=0;
while(b){
ll t=a/b;
a-=t*b; swap(a,b);
u... | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <numeric>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=l... | 0 |
#include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[M... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
vector<int> t1,t2;
int input = 0;
for(int i = 0;i < 6;i++){
if(i < 4){
cin >> input;
t1.push_back(input);
}else{
cin >> input;
t2.push_back(i... | 0 |
#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 repx(i, x, n) for (int i = int(x); i < int(n); ++i)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(n) begin(n), end(n)
#define IN(a, x, b) ((... | #include <iostream>
#include <vector>
#include <string.h>
#include <algorithm>
#include <cstring>
#include <queue>
#include <assert.h>
#include <cmath>
#include <stack>
#include <deque>
#include <set>
#include <unordered_map>
#include <complex>
#include <fstream>
#include <map>
#include <numeric>
#include <functional>
... | 0 |
// https://atcoder.jp/contests/aising2019/tasks/aising2019_c
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for(ll i = 0;i < n;i++)
#define all(i) i.begin(), i.end()
template<class T, class U> bool cmax(T& ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
ll dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
ll counterb=0,counterw=0;
void dfs(ll x,ll y,ll H, ll W,vector<vector<bool>> &field,vector<vector<bool>> &check){
check[x][y]=1;
if(field[x][y]==1){counterb++;}
if(field[x][y]=... | 1 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <unordered_map>
#include <queue>
#include <deque>
using namespace std;
using ll = long long;
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head;... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1000000007;
signed main(){
int n,m,x1,y1;
cin>>n>>m>>x1;
int ans1=0,ans2=0;
for(int i=0;i<n-1;i++){
int x2;
cin>>x2;
ans1=(ans1+(x2-x1)*(i+1)%mod*(n-1-i)%mod)%mod;
x1=x2;
}
cin>>y1;
for(int i=0;i<m-1;i++){
... | 0 |
#include<bits/stdc++.h>
/* #define int long long */
/* #define double long double */
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
#define MOD 1000000007
using namespace std;
using ll = long long;
typedef vector<int> vi;
typedef pair<int, int> P;
#define rrep(i,... | #include <iostream>
#include <vector>
using namespace std;
void abc_150a();
void abc_151a();
void abc_152a();
void abc_154a();
void abc_156a();
int main()
{
//abc_150a();
//abc_151a();
//abc_152a();
//abc_154a();
abc_156a();
}
void abc_150a()
{
int K, X;
cin >> K >> X;
if (500 * K >= X) cout <... | 1 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long
using namespace std;
const int N=1000100,P=1e9+7;
inline int read(){
int x=0,f=0,c=getchar();
for(;c>'9'||c<'0';f=c=='-',c=getchar());
for(;c>='0'&&c<='9';c=getchar())
x=(x<<1)+(x<<3)+c-'0';return f?-x:x;
}
inline void write(ll x){
if(x<0)... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define MAX 510000
#define Rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep(i, n) for(ll i = 1; i <= (ll)(n); i++)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
//cout << fixed << setprecision(10);//
//最... | 1 |
#include <bits/stdc++.h>
#define maxn 100010
#define ll long long
using namespace std;
int n,m,vis[maxn];
ll ans[maxn],a[maxn],k,cnt,q[maxn],pos[maxn];
template <class T>
void read(T &x){
char s=getchar();int f=0;x=0;
while(s<'0'||s>'9'){if(s=='-') f=1;s=getchar();}
while(s>='0'&&s<='9') x=(x<<3)+(x<<1)+s-'0',s=g... | #include <bits/stdc++.h>
using namespace std;
int main () {
int d, g;
cin >> d >> g;
vector<pair<int,int>> p(d);
for (int i = 0; i < d; i++)
cin >> p[i].first >> p[i].second;
vector<int> v(d);
iota (v.begin(), v.end(), 0);
int ans = 1000;
do {
int sum = 0, c = 0;
for (int i = 0; i < d; i... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int N=1001000;
int fa[N],n,m,q[N],d[N],a[N],bl[N];
vector<int>g[N];
vector<pair<int,int> >vec[N];
int find(int x){return fa[x]==x?x:fa[x]=find(fa[x]);}
void add(int x,int y){g[x].push_back(y);g[y].push_back(x);}
int bfs(int S,int T){
for(int i=1;i<=n;++i)d[i]=-2;
d... | #include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 233;
typedef long long ll;
int a[maxn],l[maxn],r[maxn],ord[maxn];
ll val[maxn],sum[maxn],tot = 0;
int n,x;
bool cmp(int i,int j){
return val[i]>val[j];
}
inline ll cal(int i,int v){
if(v<=a[i])return 1LL*v*l[i];
return 1LL*a[i]*l[i]+1LL*(v-a[i])*r[i... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,x,t;
cin>>n>>x>>t;
ll k=n/x,r=n%x;
if(r>0)r=1;
cout<<k*t+r*t;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
ll a,b,c; cin>>a>>b>>c;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = (int)(j);i <= (int)(k);i ++)
#define debug(x) cerr<<#x<<":"<<x<<endl
#define fix cout<<fixed<<setprecision(20);
const int maxn=(int)2e6+5;
vector<int> E[maxn];
int vis[maxn],ind[maxn],dis[maxn];
int reach[maxn];//longest can reach
inline int i... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 1 |
#include<bits/stdc++.h>
using namespace std;
long long int Min(long long int x,long long int y)
{
if(x<y)
return x;
return y;
}
int main()
{
long long int n,k,i,j,x;
long long int ans;
cin>>n>>k;
long long int ara[n];
for(i=0; i<n; i++)
cin>>ara[i];
if(ara[0]<0&&ara[n-1]... | #include<iostream>
#include<queue>
#include<cmath>
#include<algorithm>
using namespace std;
int n,m,ans=0x3f3f3f3f;
int a[100000+5];
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n-m+1;i++){
int j=m+i-1;
ans=min(ans,min(abs(a[i])+abs(a[j]-a[i]),abs(a[j])+abs(a[j]-a[i])));
}
if(an... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | #include <bits/stdc++.h>
#include <numeric>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } retu... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
vector<int> time(3);
vector<int> subsc = {0, 1, 2};
rep(i, 3) cin >> time[i];
int cmp = 100000000;
do {
int sum = 0;
rep(i, 2)... | #include<iostream>
using namespace std;
int main(){
int d,a,b,s,sum;
while(cin>>d){
sum=0;
a=600/d;
for(int i=0;i<a;i++){
b=d*d*i*i;
s=b*d;
sum+=s;
}
cout << sum << endl;
}
return 0;
} | 0 |
#include <stdio.h>
int main() {
int H;
int W;
int N;
scanf("%d", &H);
scanf("%d", &W);
scanf("%d", &N);
int ctr = 0;
int total = 0;
while (N > total){
if(W >= H){
total += W;
ctr++;
}else if(H > W){
total += H;
ctr++;
... | #include <stdio.h>
int main() {
int rows, columns, n, tempR = 1, tempC = 1;
scanf("%d %d %d", &rows, &columns, &n);
int i = 1, j = 1;
while(tempR < n && i <= rows) {
tempR = i * columns;
i++;
}
while(tempC < n && j <= columns) {
tempC = j * rows;
j++;
}
if(i == 1 && j == 1) printf ("1... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=4005,mod=998244353;
int k,n,c[N][N];
ll C(int n,int m)
{
if(m==0||n==m) return 1;
if(m==1) return n;
if(c[n][m]) return c[n][m];
return c[n][m]=(C(n-1,m-1)+C(n-1,m))%mod;
}
ll solve(int x)
{
ll ans=0;
int up=0;
fo... | #include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define fileio freopen("in.in", "r", stdin),freopen("out.out", "w", stdout);
#define ll long long int
#define FF first
#define SS second
#define mp make_pair
#define pb push_back
#define pii pair<int,int... | 1 |
#include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#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>,i... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define FAST_IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
#define endl "\n"
#define PI 3.14159265358979323846264338327950288
using namespace std ;
using bigint = long long int ;
using... | 0 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using name... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,count=0,i,temp,sum;
cin>>a>>b;
for(i=a;i<=b;i++)
{
sum=0;
temp = i;
while(temp)
{
sum*=10;
sum+=(temp%10);
temp/=10;
}
if(sum==i)
count++;
}
cout<<count<<endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using P = pair<int, int>;
#define roop(i, n) for(int i = 0;i < n;i++)
int main(void){
string str;
cin >> str;
int al[26] = {0};
roop(i, str.length()) al[str[i]-'a']++;
roop(i, 26){
if(al[i] == 0){
str +... | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
string s;
cin >> s;
bool flag = false;
for(int i = 0; i < s.size()-1; ++i)
{
if(s[i] == s[i+1])
{
cout << i+1 << " " << i+2 << endl;
return 0;
}
if(i+2 < s.size() && s[i] == s[i... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.