OJ Board

#include <iostream> #include <cmath> using namespace std; long long fib(int n){ return 0.447213595 * pow(1.61803399, (double)n) - 0.447213595 * pow(-0.618033989, (double)n); } int main(){ int t; cin >> t; for (int tt = 1; tt <= t; tt++){ int n; cin >> n; cout << "Scenario #" << tt << &quo...

Thank you very much Brian.

error C2064: term does not evaluate to a function taking 2 arguments xutility

I got this error with this code:

procedure Shift(var s: ansistring; ind: Integer); var i: Integer; begin for i := ind to length(s) do s[i] := s[i + 1]; setlength(s, length(s) - 1); end; var i, j, t, tt, n: Integer; s: ansistring; begin Readln(t); for tt := 1 to t do begin Readln(n); Writeln('Case ', tt, ':'); for i := 1 to n do be...

How to find two smallest?

#include <iostream> #include <algorithm> #include <queue> using namespace std; int main(){ int n; cin >> n; while (!n == 0){ priority_queue<int> a; int b; int cost = 0; int sum = 0; if (n == 2){ int c; cin >> b >> c; cout << b + c; } else{ for (int i = 1; i <= n; i++){ cin >> b; a.push(b); } while ...

Input: 1 1 012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567...

#include <iostream> #include <algorithm> #include <queue> using namespace std; int main(){ int n; cin >> n; while (!n == 0){ priority_queue<int> a; int b; int cost = 0; int sum = 0; if (n == 2){ int c; cin >> b >> c; cout << b + c; } else{ for (int i = 1; i <= n; i++){ cin >> b; a.push(b); } for (i...

thnx

procedure Shift(var s: string; ind: Integer); var i: Integer; begin for i := ind to length(s) do s[i] := s[i + 1]; setlength(s, length(s) - 1); end; var i, j, t, tt, n: Integer; s: string; begin Readln(t); for tt := 1 to t do begin Readln(n); Writeln('Case ', tt, ':'); for i := 1 to n do begin Read...

got AC

brianfry713 wrote:Use a priority_queue.

I don't know what is this?

AC

procedure Shift(var s: string; ind: Integer); var i: Integer; begin for i := ind to length(s) do s[i] := s[i + 1]; setlength(s, length(s) - 1); end; var i, j, t, tt, n: Integer; s: string; begin Readln(t); for tt := 1 to t do begin Readln(n); Writeln('Case ', tt, ':'); for i := 1 to n do begin Read...

Doesn't it take time as much as Seyedparsa's algorithm?