content stringlengths 19 11k |
|---|
#define rep(i,n) fo(i,0,n)
#define fo(i,s,n) for((i)=(s);(i)<(n);(i)++)
#define scan(k) scanf("%d",&k)
#define PI 3.14159265359
#define INF (ll)(2e18+100)
#define MOD (int)(1e9+7)
#define MAX 10000
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef long long ll;
int comp( const void *c1, const void *c2... |
#include <stdio.h>
#include <stdlib.h>
#define SRVGCNT 100
#define SKWRCNT (2 * SRVGCNT)
int sv, sc, sl[SKWRCNT];
int ic;
void read(void)
{
int i;
if (scanf("%d", &sv) != 1)
exit(EXIT_FAILURE);
for (sc = 2 * sv, i = 0; i < sc; ++i)
if (scanf("%d", &sl[i]) != 1)
exit(EXIT_... |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int compare(const void *a, const void *b)
{
return *(int*)b - *(int*)a;
}
int main()
{
int num, size;
int *values;
scanf("%d", &num);
size = num * 10;
values = (int *)malloc(size * sizeof(int));
//memset(cnt, 0, num * sizeof(int));
// 読み込み
int i = 0... |
#include <stdio.h>
int get_min(int data[], int n);
int main(int argc, const char * argv[]) {
int N;
scanf("%d", &N);
int length[2 * N];
for(int i = 0; i < 2 * N; i++) {
scanf("%d", &length[i]);
}
int forSum[N];
for(int j = 0; j < N; j++) {
int kushi1 = get_min(len... |
#include <stdlib.h>
#include <string.h>
int size(const void *x,const void *y);
int main(){
int N;
int L[100];// 0 to 99
int i = 0;
char tmp[1024];
char *tp;
int sum = 0;
if(scanf("%d",&N)<0){
return 1;
}
// printf("%d\n",N);
if (scanf("%[0-9 ^\n]",tmp)<0){
return 1;
}
//fgets(tm... |
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int main(void){
int n,i,j,tmp;
scanf("%d", &n);
int l[2*n];
char str[1024];
char *adr;
while( getchar() != '\n');
if(fgets(str, 1024, stdin) == NULL){
printf("No String");
}
... |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void){
int N;
int i,j;
int count=0;
int stackcount=0;
int buf;
int piv=0;
int delnum=0;
char str[1000];
int *stack;
int *newstack;
int ans=0;
scanf("%d\n",&N);
stack=malloc(siz... |
long n,x,s,t;main(){for(scanf("%ld%ld",&n,&x),s=n,n-=x;x;t=x,x=n%x,n=t)s+=n/x*x*2;printf("%ld",s-t);} |
#define L long long
L F(L A,L B){return B?A/B*B*2+F(B,A%B):-A;}
main(){L N,X;scanf("%lld%lld",&N,&X);printf("%lld",N+F(N-X,X));} |
#include<stdio.h>
int main(){
long long n,x,g;
scanf("%lld%lld",&n,&x);
g = n;
while(x ^= g ^= x ^= g%=x);
printf("%lld\n",(n/g-1)*3*g);
return 0;
} |
#include<stdio.h>
int main()
{
long n, x, temp1, temp2;
scanf("%ld%ld", &n, &x);
temp1= n;
while(x)
{
temp2= n;
n= x;
x= temp2% x;
}
printf("%ld\n", (temp1- n)* 3);
return 0;
} |
#include <stdio.h>
int main(void) {
unsigned long long int n,x,a,b,r;
scanf("%llu%llu",&n,&x);
a=n;
b=x;
r=a%b;
while(r!=0){
a=b;
b=r;
r=a%b;
}
printf("%llu\n",((n/b)-1)*3*b);
return 0;
} |
#include<stdio.h>
long euclid(long a,long b) {
long r;
while(1){
r = a%b;
if(r==0)break;
a = b;
b = r;
}
return b;
}
int main(){
long n,x;
scanf("%ld %ld",&n,&x);
printf("%ld\n",3*(n-euclid(n,x)));
}
|
#include <stdio.h>
long long gcd(long long a, long long b){return (a<b?a:b)==0?(a>b?a:b):gcd((a<b?a:b),(a>b?a:b)%(a<b?a:b));}
int main(void){
long long n,x;
scanf("%lld%lld",&n,&x);
printf("%lld\n",3*(n-gcd(n,x)));
return 0;
} |
#include<stdio.h>
long gcd2(long a, long b){
long t;
if(a<b){
t = a;
a = b;
b = t;
}
t = a % b;
while(t!=0){
a = b;
b = t;
t = a % b;
}
return b;
}
long n, x;
int main(void){
scanf("%ld%ld", &n, &x);
printf("%ld\n", (n-gcd2(n,x))*3);
}
|
#include <stdio.h>
typedef long long ll;
int main() {
ll N,X;
scanf("%lld %lld",&N,&X);
ll ans = N;
N -= X;
while (N%X != 0) {
ans += (N / X)*X * 2;
ll t = X;
X = N%X;
N = t;
}
ans += X*(((N / X)* 2) - 1);
printf("%lld\n",ans);
return 0;
} |
#include<stdio.h>
long f(long L, long S) {
if (S == 0) return -L;
return 2L * S * (L / S) + f(S, L % S);
}
int main()
{
long N, X;
scanf("%ld %ld", &N, &X);
long L = X > N - X ? X : N - X;
long S = N - L;
printf("%ld\n",(f(L, S) + N));
return 0;
} |
#include <stdio.h>
int main(void){
long long N,X;
scanf("%lld%lld",&N,&X);
if(X > N/2){
X = N - X;
}
long long sum = 0;
long long k;
sum += X + N - X;
N = N - X;
while(X != 0){
sum += 2*X*(N/X);
k = N % X;
N = X;
X = k;
}
sum -= N;
printf("%lld",sum);
}
|
#include<stdio.h>
#include<stdlib.h>
#define ll long long
#define rep(i,l,r)for(ll i=(l);i<(r);i++)
ll ans;
void gcd(ll p,ll q){
if(p%q){
ll d=p/q;
ans+=2*q*d;
gcd(q,p%q);
}else{
ll d=p/q;
ans+=q*(2*d-1);
}
}
int main(){
ll n,x;
scanf("%lld%lld",&n,&x);
gcd(x,n-x);
printf("%lld\n",ans+n);
return 0;
... |
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int main() {
long long int n, x, result = 0,tmp;
scanf("%lld%lld", &n, &x);
result = n;
n = n - x;
while (n != 0) {
if (n%x != 0) { result += 2 * x*(n / x); }
else { result += (2 * x*(n / x)-x);printf("%lld",result); return 0; }
tmp = n%x;
n = x;
x... |
#include<stdio.h>
long long mod(long long a,long long b){
long long i,sum=0,syou;
while(1){
i=a%b;
syou=a/b;
sum+=syou*b;
a=b;
b=i;
if(i==0){
return sum;
}
}
}
int main(){
long long n,x,i;
scanf("%lld %lld",&n,&x);
if(2*x<n)
i=mod(n-x,x);
else
i=mod(x,n-x);
printf("%lld",i*3... |
#include <stdio.h>
#include <math.h>
long long int f(long long int a,long long int b){
long long int k;
if(b==0)return -a;
if(a>b){
k=a;
a=b;
b=k;
}
return 2*a*(b/a)+f(a,b%a);
}
int main(){
long long int N,X;
scanf("%lld %lld",&N,&X);
long long int ans;
ans=N+f(N-X,X);
printf("%lld\n",... |
#include<stdio.h>
#include<stdlib.h>
typedef long long int int64;
int64 gcd(int64 a,int64 b){
int64 r=a%b;
while(r>0){
a=b;b=r;r=a%b;
}
return b;
}
int64 calc(int64 n,int64 x){
int64 g=gcd(n,x);
return g*3*(n/g-1);
}
void run(void){
int64 n,x;
scanf("%lld%lld",&n,&x);
printf("%lld\n",calc(n,x)... |
#include<stdio.h>
#include<stdlib.h>
unsigned long long N, X, a, b, t, r, ans;
int main() {
scanf("%llu %llu", &N, &X);
ans += N;
a = X, b = N - X;
while (1) {
t = 2 * (a / b);
r = a%b;
ans += b*t;
if (r == 0) {
ans -= b;
break;
}
a ... |
#include<stdio.h>
long long int lgc(long long int a, long long int b){
long long int r, tmp;
r = a % b;
while(r!=0){
a = b;
b = r;
r = a % b;
}
return b;
}
int main(void){
long long int n, x;
scanf("%lld %lld",&n, &x);
long long int p, q;
p = lgc(n,x);
q = n / p;
long long i... |
#include<stdio.h>
#define MAX(x,y) (((x)>(y))?(x):(y))
#define MIN(x,y) (((x)<(y))?(x):(y))
int main(void){
long long N,X,sums;
long long low,high;
scanf("%lld%lld",&N,&X);
sums=N;
low=MIN(X,N-X);
high=MAX(X,N-X);
do{
sums+=low*((high/low)*2);
high%=low;
high^=low;
low^=high;
high... |
#include <stdio.h>
#include <stdlib.h>
typedef struct hoge{
long long int y;
long long int x;
long long int res;
} hoge;
int main(){
long long int n;
long long int len;
long long int swap;
hoge a;
scanf("%lld %lld",&n,&a.x);
a.y = n - a.x;
a.res = a.x + a.y;
while(a.x){
swap = a.y;
len = a.y / a.x;
... |
#include <stdio.h>
int main(void){
long long int x;
long long int n;
long long int a, a_max, a_min;
long long int b, b_max, b_min, tmp;
long long int sum = 0;
int vector = 0;
scanf("%lld %lld", &n, &x);
a = x;
b = x;
if(x > n - x){
x = n - x;
}
n = n - x;
sum += x + n;
while(!(x==0&&n==0)){
if... |
#include <stdio.h>
#include <stdlib.h>
//#define DEBUG
long long dist(long long M, long long N) {
long long D;
if (M<N) {
D = M;
M = N;
N = D;
}
if (N==0) return 0;
D = (M/N)*2*N;
if (M%N==0) D -= N;
return D+dist(N,M%N);
}
int main() {
long long L, N, P, X;
scanf("%lld%lld", &N, &X);
if (2*X == N) L... |
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#define INF 1000000000
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
long N;
long X;
long ans = 0;
void solve(long n, long x, int f) {
long d = n / x;
long m = n % x;
if(m > 0) {
ans += (d-f) * 2 * x;
solve... |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
long long getgcd(long long N,long long X);
int main(void){
long long N,X;
long long buf;
long long buf2;
long long cur;
scanf("%lld %lld",&N,&X);
buf=(long long)getgcd(N,X);
buf2=(long long)(N-buf);
printf("%l... |
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
int main(void)
{
//変数の宣言
long long int n,x;
long long int a,b;
//よく使う変数
int i,j,k,l;
int flag=0;
long long int ans=0;
int count=0;
int temp,temp1,temp2;
int min;
//データの読み込み
scanf("%lld %lld",&n,&x);
/*for(i=0;i<n;i++){
fo... |
#include <stdio.h>
#include <string.h>
#include <inttypes.h>
/*
答えはXに依存しないと予想できる -> はずれ
N=2 len=3
N=3 len=6
N=4 len=9 (X=2 -> len=6)
N=5 len=12
*/
#define KABE_MIGI 1
#define KABE_UE 2
#define KABE_SITA 4
char kabe[2000][2000];
uint64_t solve(uint64_t N, uint64_t X) {
memset(kabe, 0, sizeof(kabe));
if (N <= 100... |
#include <stdio.h>
#include <stdlib.h>
#define N 2001
typedef struct vertex{
short int next[N];
short int length;
} vertex;
vertex field[N];
int count(int i,int k,int r);
int main(){
int n,k;
int i,j;
int a,b;
int r;
scanf("%d %d",&n,&k);
for(i = 0;i < n-1;i++){
scanf("%d %d",&a,&b);
field[a].next[fie... |
#include <stdio.h>
#include <stdlib.h>
void swap(int a, int b, int *A){
int tmp = A[a];
A[a] = A[b];
A[b] = tmp;
}
int main(){
int N, M, i, odd_num = 0;
scanf("%d%d", &N, &M);
int *A = (int *)malloc(sizeof(int) * M);
for(i = 0; i < M; i++){
scanf("%d", &A[i]);
odd_num += A[i] % 2;
}
if(M == 1){
if(A[0]... |
#include <stdio.h>
int B[10000000];
int len;
void print(int x) {
if(x > 0) B[len++]=x;
}
void yaru(int a, int islast) {
int i;
if (a%2==1) {
for(i=1;i<a;i+=2) {
print(2);
}
if(!islast) print(2); /* 最後以外で奇数が来るのは最初のみ */
} else {
if((a/2)%2==0) {
if(islast) {
print(1);
print(a-2);
} else {
... |
#include<stdio.h>
#include<stdlib.h>
int main(void){
struct{
int A,B;
}data[200000];
unsigned *board[2][4097];
unsigned **calc,*center[4097],ans=0;
int i,j,k,N;
const unsigned mod=(unsigned)1E9+7;
for(i=0;i<2;i++){
for(j=0;j<4097;j++){
board[i][j]=(unsigned *)calloc(4097,sizeof(unsigned)... |
#include <stdio.h>
#include <stdlib.h>
#define MOD 1000000007
#define AB 2000
#define AB2 4001
#define N 200005
typedef struct set {
int a;
int b;
} set;
int main(){
int i,j;
long long int ii,jj,rii,rjj;
int n;
int a,b;
long long int **dp;
long long int **root;
long long int res = 0;
set s[N];
dp = calloc... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.