mirror of
https://github.com/Kiritow/OJ-Problems-Source.git
synced 2024-03-22 13:11:29 +08:00
68 lines
1.0 KiB
C
68 lines
1.0 KiB
C
/*
|
||
* 说实话，这题什么意思我都不知道
|
||
* 读完题我还以为我get了它的意思
|
||
* 写完提交了几次，全部RE
|
||
* 现在不知所措
|
||
* 正确答案：
|
||
* */
|
||
#include<stdio.h>
|
||
int main() {
|
||
int p,e,i,d,j;
|
||
scanf("%d%d%d%d",&p,&e,&i,&d);
|
||
for(j=d+1;j<=21252;j++)
|
||
if((j-p)%23==0) break;
|
||
for(;j<=21252;j=j+23)
|
||
if((j-e)%28==0) break;
|
||
for(;j<=21252;j=j+23*28)
|
||
if((j-i)%33==0) break;
|
||
printf("%i",j-d);
|
||
return 0;
|
||
}
|
||
|
||
|
||
/*
|
||
* 我的代码：
|
||
#include <stdio.h>
|
||
|
||
int* min(int* a, int* b){
|
||
return *a > *b ? b : a;
|
||
}
|
||
|
||
int* max(int* a, int* b){
|
||
return *a < *b ? b : a;
|
||
}
|
||
|
||
int get( int p, int e, int i){
|
||
int t = 0;
|
||
int ___ = e * p;
|
||
do{
|
||
t = *max(&p, &e) % *min(&p, &e);
|
||
*max(&p, &e) = t;
|
||
}while(t);
|
||
e = ___ / *max(&p, &e);
|
||
___ = e * i;
|
||
do{
|
||
t = *max(&i, &e) % *min(&i, &e);
|
||
*max(&i, &e) = t;
|
||
}while(t);
|
||
e = ___ / *max(&i, &e);
|
||
return e;
|
||
}
|
||
|
||
int main(int argc, char** argv){
|
||
int m;
|
||
int p;
|
||
int e;
|
||
int i;
|
||
int s;
|
||
|
||
scanf("%i %i %i %i", &p, &e, &i, &m);
|
||
s = get(p, e, i);
|
||
while(m > 0){
|
||
m -= s;
|
||
}
|
||
printf("%i", -m);
|
||
return 0;
|
||
}
|
||
*/
|