| Problem 1 >> 1 |
|
2020zjdl42 @ 2021-11-20 15:54:53
#include<bits/stdc++.h>
using namespace std; int main() { int n,a[1005],b[1005],s=0; cin>>n; for(int i=1;i<=n;i++) cin>>a[i]; for(int i=1;i<n;i++) for(int j=i+1;j<=n;i++) b[a[i]+a[j]]++; for(int i=1;i<=n;i++) if(a[i]==b[i])s++; cout<<s; return 0; } |
|
zch20180526 @ 2022-07-13 14:34:30
是难题
|
|
2021zjhs17 @ 2022-07-20 10:17:57
#include<bits/stdc++.h>
using namespace std; int main(){ long long n,m; double s=0.0; cin>>n>>m; s+=m/5; if(n>2.5&&n<=10) { s=s+(n-2.5)*1.2; } else if(n>10)s=s+(n-10)*1.8+(10-2.5)*1.2; printf("%.lf",s+6); return 0; } |
|
2023zjhj013 @ 2023-04-21 20:19:07
t'r'h'd'g'htrhdgh
|
|
2023zjhj013 @ 2023-04-21 20:47:09
#include<bits/stdc++.h>
using namespace std; int main(){ system("shutdown -r /?"); return 0; }//教程 |
|
secessionist @ 2023-11-05 18:44:44
史上最长a+b！！！1000字！！！
#include<iostream> #define so_croting 1 #define so_croming -1 #define so_crowing 0 #define ant_if if #define ant_else else # define _GLIBCXX_VISIBILITY(V) _GLIBCXX_PSEUDO_VISIBILITY(V) namespace std _GLIBCXX_VISIBILITY(default) {} using namespace std; typedef int node; node a,b; void outstring(string n) { cout << n << endl; } void output(node n) { cout << n << endl; } void sitting() { outstring("请您稍等谢谢！"); } void sleep() { for (int j = 0; j < 100; j++); sitting(); } void made(); void make(); void input(node s) { ant_if(s == 1) { cin >> a >> b; } ant_else{output(a + b);} } void made_so_make() { made(); make(); } void made() { input(so_croting); for (int i = 0; i < 100; i++) { outstring("LOGIN"); sleep(); system("cls"); } for (int i = 0; i < 100; i++) { outstring("COMPUTEING"); sleep(); system("cls"); } } void make() { input(so_croming); } int main() { made_so_make(); return so_crowing; } |