- 星星历
heelp
-
贾小目 LV 6 (1418/1418) @ 2024-7-27 23:58:39
using namespace std;
int main()
{
int a;
cin>>a;
cout<<a/360+1<<" ";
a%=360;
cout<<a/120+1<<" ";
a%=120;
cout<<a;
return 0;
}
8 条评论
-
wuyuhang2012 阿玩MC LV 9 (4131/9131) @ 2024-8-28 16:49:36 -
@ 2024-8-28 16:49:16
666
-
@ 2024-8-20 17:14:38#include <bits/stdc++.h> using namespace std; int n,y,r,xx; int main() { ios::sync_with_stdio(false); cin.tie(0); cin>>n; y=r=1; for(int i=1;i<=n;i++) { xx++; if(xx>120) { xx=1; r++; } if(r>3) { r=1; y++; } } cout<<y<<" "<<r<<" "<<xx; return 0; } -
@ 2024-8-16 11:40:47我记得语法周赛T2是循环结构，你是不是没写循环
-
@ 2024-8-15 21:41:09你jie出来了吗？
-
@ 2024-8-6 15:35:29using namespace std; int main() { int n; cin>>n; int cnt=1; while(n>360) { cnt++; n-=360; } int xx=1; while(n>120) { xx++; n-=120; } int m=n; cout<<cnt<<" "<<xx<<" "<<m; return 0; } -
@ 2024-7-29 8:45:55是help不是heelp
-
@ 2024-8-23 22:31:46
说得对
-
-
@ 2024-7-28 11:31:47
#include <bits/stdc++.h> using namespace std; int main () { int n, k; cin >> n; if (n % 360 <= 120) { k = 1; } else { if (n % 360 <= 240) { k = 2; } else { k = 3; } } if (n % 360 == 0) { k = 3; } cout << (n + 359) / 360 << " " << k << " " << ((n % 120 == 0) ? 120 : n % 120) << endl; }
-
@ 2024-7-28 17:14:22
#include <bits/stdc++.h> using namespace std; int main () { int n, k; cin >> n; if (n % 360 <= 120) { k = 1; } else { if (n % 360 <= 240) { k = 2; } else { k = 3; } } if (n % 360 == 0) { k = 3; } cout << (n + 359) / 360 << " " << k << " " << ((n % 120 == 0) ? 120 : n % 120) << endl; }
-
- 1