QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #573231 | #1. I/O Test | 7_divided_by_3 | 0 | 0ms | 0kb | C++20 | 947b | 2024-09-18 17:50:10 | 2024-09-18 17:50:11 |
config.txt
10000000 10000000
input_test
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve()
{
}
void solve1()
{
int n;scanf("%d",&n);
ll ans=0;
for(int i=0,x=0;i<n;scanf("%d",&x),i++,ans+=x);
printf("%lld",ans);
}
void solve2()
{
int n;scanf("%d",&n);
for(int i=0;i<n;i++,printf("100000000 ");
}
int main()
{
ios::sync_with_stdio(false);cin.tie(nullptr);
//int T;cin>>T;while(T--)
solve1();
return 0;
}
output_test
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve()
{
}
void solve1()
{
int n;scanf("%d",&n);
ll ans=0;
for(int i=0,x=0;i<n;scanf("%d",&x),i++,ans+=x);
printf("%lld",ans);
}
void solve2()
{
int n;scanf("%d",&n);
for(int i=0;i<n;i++,printf("100000000 ");
}
int main()
{
ios::sync_with_stdio(false);cin.tie(nullptr);
//int T;cin>>T;while(T--)
solve2();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
input_test Judgement Failed
Test #1:
score: 0
input_test Judgement Failed
input:
10000000 398240703 931480988 581501675 859833545 824040454 693452826 908754790 858058275 874797822 533410758 567305727 974956984 919431489 267290629 586483683 204643518 571097808 927186832 423662789 718389992 257761925 436921857 381947481 197459160 683423003 986561325 534495812 355572712 873566280 1...
output:
result:
Subtask #2:
score: 0
output_test Judgement Failed
Test #2:
score: 0
output_test Judgement Failed
input:
10000000